./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/queue.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:33:28,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:33:28,327 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:33:28,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:33:28,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:33:28,363 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:33:28,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:33:28,365 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:33:28,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:33:28,366 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:33:28,366 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:33:28,366 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:33:28,367 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:33:28,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:33:28,367 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:33:28,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:33:28,368 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:33:28,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:33:28,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:33:28,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:33:28,369 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:33:28,369 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:33:28,369 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:33:28,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:33:28,369 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:33:28,369 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:33:28,369 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:33:28,370 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:33:28,370 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:33:28,370 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:33:28,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:33:28,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:33:28,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:33:28,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:33:28,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:33:28,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:33:28,370 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:33:28,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:33:28,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:33:28,371 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:33:28,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:33:28,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:33:28,371 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2025-02-06 12:33:28,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:33:28,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:33:28,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:33:28,671 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:33:28,671 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:33:28,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue.i [2025-02-06 12:33:29,988 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/921e21141/47b2f4f53cc549f18c5ffe03f7073344/FLAGb0d17af27 [2025-02-06 12:33:30,383 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:33:30,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue.i [2025-02-06 12:33:30,407 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/921e21141/47b2f4f53cc549f18c5ffe03f7073344/FLAGb0d17af27 [2025-02-06 12:33:30,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/921e21141/47b2f4f53cc549f18c5ffe03f7073344 [2025-02-06 12:33:30,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:33:30,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:33:30,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:33:30,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:33:30,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:33:30,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:33:30" (1/1) ... [2025-02-06 12:33:30,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a133c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:30, skipping insertion in model container [2025-02-06 12:33:30,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:33:30" (1/1) ... [2025-02-06 12:33:30,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:33:30,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:33:30,855 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:33:30,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:33:30,977 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:33:30,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:30 WrapperNode [2025-02-06 12:33:30,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:33:30,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:33:30,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:33:30,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:33:30,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:30" (1/1) ... [2025-02-06 12:33:30,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:30" (1/1) ... [2025-02-06 12:33:31,017 INFO L138 Inliner]: procedures = 274, calls = 107, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 289 [2025-02-06 12:33:31,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:33:31,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:33:31,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:33:31,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:33:31,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:30" (1/1) ... [2025-02-06 12:33:31,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:30" (1/1) ... [2025-02-06 12:33:31,034 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:30" (1/1) ... [2025-02-06 12:33:31,049 INFO L175 MemorySlicer]: Split 92 memory accesses to 5 slices as follows [54, 2, 8, 5, 23]. 59 percent of accesses are in the largest equivalence class. The 58 initializations are split as follows [23, 2, 8, 5, 20]. The 16 writes are split as follows [14, 0, 0, 0, 2]. [2025-02-06 12:33:31,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:30" (1/1) ... [2025-02-06 12:33:31,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:30" (1/1) ... [2025-02-06 12:33:31,071 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:30" (1/1) ... [2025-02-06 12:33:31,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:30" (1/1) ... [2025-02-06 12:33:31,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:30" (1/1) ... [2025-02-06 12:33:31,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:30" (1/1) ... [2025-02-06 12:33:31,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:33:31,079 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:33:31,079 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:33:31,079 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:33:31,080 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:30" (1/1) ... [2025-02-06 12:33:31,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:33:31,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:33:31,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:33:31,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:33:31,128 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-06 12:33:31,129 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-06 12:33:31,129 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-06 12:33:31,129 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-06 12:33:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:33:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:33:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:33:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:33:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 12:33:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 12:33:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:33:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:33:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:33:31,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 12:33:31,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 12:33:31,131 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:33:31,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:33:31,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:33:31,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:33:31,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:33:31,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 12:33:31,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 12:33:31,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:33:31,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:33:31,133 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:33:31,264 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:33:31,266 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:33:31,783 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:33:31,784 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:33:32,026 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:33:32,026 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:33:32,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:33:32 BoogieIcfgContainer [2025-02-06 12:33:32,026 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:33:32,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:33:32,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:33:32,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:33:32,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:33:30" (1/3) ... [2025-02-06 12:33:32,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102352b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:33:32, skipping insertion in model container [2025-02-06 12:33:32,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:33:30" (2/3) ... [2025-02-06 12:33:32,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102352b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:33:32, skipping insertion in model container [2025-02-06 12:33:32,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:33:32" (3/3) ... [2025-02-06 12:33:32,035 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i [2025-02-06 12:33:32,050 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:33:32,051 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue.i that has 3 procedures, 159 locations, 1 initial locations, 2 loop locations, and 72 error locations. [2025-02-06 12:33:32,051 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:33:32,178 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 12:33:32,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 172 transitions, 358 flow [2025-02-06 12:33:32,276 INFO L124 PetriNetUnfolderBase]: 14/170 cut-off events. [2025-02-06 12:33:32,278 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:33:32,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 14/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 521 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 142. Up to 2 conditions per place. [2025-02-06 12:33:32,282 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 172 transitions, 358 flow [2025-02-06 12:33:32,287 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 169 transitions, 350 flow [2025-02-06 12:33:32,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:33:32,310 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;@6a859f66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:33:32,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 134 error locations. [2025-02-06 12:33:32,317 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:33:32,317 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-02-06 12:33:32,317 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:33:32,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:32,318 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-06 12:33:32,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:32,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:32,323 INFO L85 PathProgramCache]: Analyzing trace with hash 26578, now seen corresponding path program 1 times [2025-02-06 12:33:32,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:32,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996527832] [2025-02-06 12:33:32,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:32,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:32,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 12:33:32,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 12:33:32,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:32,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:32,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:32,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:32,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996527832] [2025-02-06 12:33:32,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996527832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:32,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:32,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:33:32,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31354234] [2025-02-06 12:33:32,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:32,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:32,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:32,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:32,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:33:32,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-02-06 12:33:32,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 169 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:32,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:32,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-02-06 12:33:32,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:33,533 INFO L124 PetriNetUnfolderBase]: 1744/4652 cut-off events. [2025-02-06 12:33:33,533 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-02-06 12:33:33,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7477 conditions, 4652 events. 1744/4652 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 36989 event pairs, 1393 based on Foata normal form. 182/3586 useless extension candidates. Maximal degree in co-relation 7362. Up to 2744 conditions per place. [2025-02-06 12:33:33,568 INFO L140 encePairwiseOnDemand]: 162/172 looper letters, 57 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2025-02-06 12:33:33,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 153 transitions, 436 flow [2025-02-06 12:33:33,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:33,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2025-02-06 12:33:33,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7054263565891473 [2025-02-06 12:33:33,586 INFO L175 Difference]: Start difference. First operand has 162 places, 169 transitions, 350 flow. Second operand 3 states and 364 transitions. [2025-02-06 12:33:33,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 153 transitions, 436 flow [2025-02-06 12:33:33,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 153 transitions, 428 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:33:33,598 INFO L231 Difference]: Finished difference. Result has 150 places, 153 transitions, 314 flow [2025-02-06 12:33:33,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=150, PETRI_TRANSITIONS=153} [2025-02-06 12:33:33,603 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -12 predicate places. [2025-02-06 12:33:33,603 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 153 transitions, 314 flow [2025-02-06 12:33:33,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:33,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:33,604 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-06 12:33:33,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:33:33,604 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:33,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:33,605 INFO L85 PathProgramCache]: Analyzing trace with hash 26579, now seen corresponding path program 1 times [2025-02-06 12:33:33,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:33,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223625761] [2025-02-06 12:33:33,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:33,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:33,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 12:33:33,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 12:33:33,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:33,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:33,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:33,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223625761] [2025-02-06 12:33:33,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223625761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:33,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:33,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:33:33,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97194876] [2025-02-06 12:33:33,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:33,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:33,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:33,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:33,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:33:33,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-02-06 12:33:33,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 153 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:33,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:33,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-02-06 12:33:33,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:34,535 INFO L124 PetriNetUnfolderBase]: 1744/4649 cut-off events. [2025-02-06 12:33:34,535 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-06 12:33:34,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7428 conditions, 4649 events. 1744/4649 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37003 event pairs, 1393 based on Foata normal form. 3/3406 useless extension candidates. Maximal degree in co-relation 7417. Up to 2744 conditions per place. [2025-02-06 12:33:34,560 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 57 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2025-02-06 12:33:34,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 150 transitions, 426 flow [2025-02-06 12:33:34,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:34,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:34,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2025-02-06 12:33:34,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6957364341085271 [2025-02-06 12:33:34,566 INFO L175 Difference]: Start difference. First operand has 150 places, 153 transitions, 314 flow. Second operand 3 states and 359 transitions. [2025-02-06 12:33:34,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 150 transitions, 426 flow [2025-02-06 12:33:34,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 150 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:33:34,570 INFO L231 Difference]: Finished difference. Result has 147 places, 150 transitions, 308 flow [2025-02-06 12:33:34,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=147, PETRI_TRANSITIONS=150} [2025-02-06 12:33:34,572 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -15 predicate places. [2025-02-06 12:33:34,572 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 150 transitions, 308 flow [2025-02-06 12:33:34,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:34,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:34,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:33:34,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:33:34,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:34,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:34,574 INFO L85 PathProgramCache]: Analyzing trace with hash 792471235, now seen corresponding path program 1 times [2025-02-06 12:33:34,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:34,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830346783] [2025-02-06 12:33:34,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:34,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:34,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:33:34,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:33:34,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:34,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:34,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:34,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:34,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830346783] [2025-02-06 12:33:34,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830346783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:34,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:34,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:33:34,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219451063] [2025-02-06 12:33:34,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:34,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:33:34,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:34,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:33:34,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:33:34,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 172 [2025-02-06 12:33:34,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 150 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:34,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:34,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 172 [2025-02-06 12:33:34,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:35,403 INFO L124 PetriNetUnfolderBase]: 1744/4647 cut-off events. [2025-02-06 12:33:35,403 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 12:33:35,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7429 conditions, 4647 events. 1744/4647 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 36962 event pairs, 1393 based on Foata normal form. 0/3404 useless extension candidates. Maximal degree in co-relation 7416. Up to 2743 conditions per place. [2025-02-06 12:33:35,437 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 59 selfloop transitions, 3 changer transitions 0/148 dead transitions. [2025-02-06 12:33:35,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 148 transitions, 428 flow [2025-02-06 12:33:35,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:33:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:33:35,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2025-02-06 12:33:35,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6395348837209303 [2025-02-06 12:33:35,440 INFO L175 Difference]: Start difference. First operand has 147 places, 150 transitions, 308 flow. Second operand 4 states and 440 transitions. [2025-02-06 12:33:35,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 148 transitions, 428 flow [2025-02-06 12:33:35,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 148 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:33:35,446 INFO L231 Difference]: Finished difference. Result has 146 places, 148 transitions, 306 flow [2025-02-06 12:33:35,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=306, PETRI_PLACES=146, PETRI_TRANSITIONS=148} [2025-02-06 12:33:35,447 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -16 predicate places. [2025-02-06 12:33:35,447 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 148 transitions, 306 flow [2025-02-06 12:33:35,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:35,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:35,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 12:33:35,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:33:35,450 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:35,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:35,451 INFO L85 PathProgramCache]: Analyzing trace with hash 792471236, now seen corresponding path program 1 times [2025-02-06 12:33:35,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:35,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791962506] [2025-02-06 12:33:35,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:35,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:35,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 12:33:35,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 12:33:35,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:35,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:35,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:35,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:35,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791962506] [2025-02-06 12:33:35,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791962506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:35,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:35,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:33:35,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405930202] [2025-02-06 12:33:35,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:35,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:33:35,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:35,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:33:35,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:33:35,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-02-06 12:33:35,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 148 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:35,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:35,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-02-06 12:33:35,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:36,275 INFO L124 PetriNetUnfolderBase]: 1744/4645 cut-off events. [2025-02-06 12:33:36,276 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-06 12:33:36,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7425 conditions, 4645 events. 1744/4645 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 37010 event pairs, 1393 based on Foata normal form. 2/3404 useless extension candidates. Maximal degree in co-relation 7410. Up to 2743 conditions per place. [2025-02-06 12:33:36,299 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 56 selfloop transitions, 3 changer transitions 0/146 dead transitions. [2025-02-06 12:33:36,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 146 transitions, 420 flow [2025-02-06 12:33:36,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:33:36,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:33:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2025-02-06 12:33:36,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6700581395348837 [2025-02-06 12:33:36,301 INFO L175 Difference]: Start difference. First operand has 146 places, 148 transitions, 306 flow. Second operand 4 states and 461 transitions. [2025-02-06 12:33:36,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 146 transitions, 420 flow [2025-02-06 12:33:36,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 146 transitions, 414 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:33:36,304 INFO L231 Difference]: Finished difference. Result has 144 places, 146 transitions, 302 flow [2025-02-06 12:33:36,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=144, PETRI_TRANSITIONS=146} [2025-02-06 12:33:36,305 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -18 predicate places. [2025-02-06 12:33:36,305 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 146 transitions, 302 flow [2025-02-06 12:33:36,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:36,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:36,306 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:36,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:33:36,306 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:36,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:36,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1141137535, now seen corresponding path program 1 times [2025-02-06 12:33:36,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:36,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194423297] [2025-02-06 12:33:36,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:36,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:36,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:33:36,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:33:36,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:36,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:36,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:36,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:36,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194423297] [2025-02-06 12:33:36,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194423297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:36,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:36,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:33:36,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957045853] [2025-02-06 12:33:36,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:36,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:33:36,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:36,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:33:36,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:33:36,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 172 [2025-02-06 12:33:36,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 146 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:36,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:36,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 172 [2025-02-06 12:33:36,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:37,239 INFO L124 PetriNetUnfolderBase]: 2019/4462 cut-off events. [2025-02-06 12:33:37,239 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-06 12:33:37,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7725 conditions, 4462 events. 2019/4462 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 31654 event pairs, 705 based on Foata normal form. 0/3898 useless extension candidates. Maximal degree in co-relation 7708. Up to 1807 conditions per place. [2025-02-06 12:33:37,264 INFO L140 encePairwiseOnDemand]: 150/172 looper letters, 80 selfloop transitions, 6 changer transitions 0/149 dead transitions. [2025-02-06 12:33:37,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 149 transitions, 481 flow [2025-02-06 12:33:37,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:33:37,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:33:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2025-02-06 12:33:37,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5546511627906977 [2025-02-06 12:33:37,267 INFO L175 Difference]: Start difference. First operand has 144 places, 146 transitions, 302 flow. Second operand 5 states and 477 transitions. [2025-02-06 12:33:37,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 149 transitions, 481 flow [2025-02-06 12:33:37,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 149 transitions, 475 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 12:33:37,270 INFO L231 Difference]: Finished difference. Result has 129 places, 130 transitions, 276 flow [2025-02-06 12:33:37,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=129, PETRI_TRANSITIONS=130} [2025-02-06 12:33:37,271 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -33 predicate places. [2025-02-06 12:33:37,271 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 130 transitions, 276 flow [2025-02-06 12:33:37,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:37,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:37,271 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:37,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:33:37,271 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:37,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:37,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1141137534, now seen corresponding path program 1 times [2025-02-06 12:33:37,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:37,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612849972] [2025-02-06 12:33:37,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:37,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:37,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:33:37,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:33:37,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:37,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:37,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:37,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612849972] [2025-02-06 12:33:37,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612849972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:37,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:37,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:33:37,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095756300] [2025-02-06 12:33:37,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:37,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:33:37,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:37,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:33:37,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:33:37,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 172 [2025-02-06 12:33:37,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 130 transitions, 276 flow. Second operand has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:37,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:37,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 172 [2025-02-06 12:33:37,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:38,285 INFO L124 PetriNetUnfolderBase]: 1703/3675 cut-off events. [2025-02-06 12:33:38,285 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2025-02-06 12:33:38,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6546 conditions, 3675 events. 1703/3675 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 24460 event pairs, 702 based on Foata normal form. 204/3340 useless extension candidates. Maximal degree in co-relation 2518. Up to 1412 conditions per place. [2025-02-06 12:33:38,303 INFO L140 encePairwiseOnDemand]: 152/172 looper letters, 72 selfloop transitions, 6 changer transitions 0/135 dead transitions. [2025-02-06 12:33:38,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 135 transitions, 443 flow [2025-02-06 12:33:38,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:33:38,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:33:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2025-02-06 12:33:38,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6186046511627907 [2025-02-06 12:33:38,306 INFO L175 Difference]: Start difference. First operand has 129 places, 130 transitions, 276 flow. Second operand 5 states and 532 transitions. [2025-02-06 12:33:38,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 135 transitions, 443 flow [2025-02-06 12:33:38,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 135 transitions, 431 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:33:38,309 INFO L231 Difference]: Finished difference. Result has 115 places, 116 transitions, 248 flow [2025-02-06 12:33:38,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=248, PETRI_PLACES=115, PETRI_TRANSITIONS=116} [2025-02-06 12:33:38,310 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -47 predicate places. [2025-02-06 12:33:38,310 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 116 transitions, 248 flow [2025-02-06 12:33:38,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:38,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:38,311 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:38,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:33:38,311 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:38,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:38,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1015524418, now seen corresponding path program 1 times [2025-02-06 12:33:38,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:38,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038758725] [2025-02-06 12:33:38,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:38,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:38,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:33:38,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:33:38,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:38,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:38,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:38,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038758725] [2025-02-06 12:33:38,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038758725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:38,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:38,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:33:38,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58916981] [2025-02-06 12:33:38,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:38,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:33:38,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:38,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:33:38,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:33:39,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 172 [2025-02-06 12:33:39,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 116 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:39,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:39,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 172 [2025-02-06 12:33:39,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:39,857 INFO L124 PetriNetUnfolderBase]: 2502/5391 cut-off events. [2025-02-06 12:33:39,858 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-02-06 12:33:39,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9548 conditions, 5391 events. 2502/5391 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 38743 event pairs, 536 based on Foata normal form. 0/4393 useless extension candidates. Maximal degree in co-relation 3717. Up to 3436 conditions per place. [2025-02-06 12:33:39,883 INFO L140 encePairwiseOnDemand]: 163/172 looper letters, 124 selfloop transitions, 11 changer transitions 0/183 dead transitions. [2025-02-06 12:33:39,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 183 transitions, 657 flow [2025-02-06 12:33:39,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:33:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:33:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 669 transitions. [2025-02-06 12:33:39,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5556478405315615 [2025-02-06 12:33:39,887 INFO L175 Difference]: Start difference. First operand has 115 places, 116 transitions, 248 flow. Second operand 7 states and 669 transitions. [2025-02-06 12:33:39,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 183 transitions, 657 flow [2025-02-06 12:33:39,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 183 transitions, 643 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:33:39,893 INFO L231 Difference]: Finished difference. Result has 121 places, 126 transitions, 310 flow [2025-02-06 12:33:39,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=310, PETRI_PLACES=121, PETRI_TRANSITIONS=126} [2025-02-06 12:33:39,894 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -41 predicate places. [2025-02-06 12:33:39,895 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 126 transitions, 310 flow [2025-02-06 12:33:39,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:39,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:39,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:39,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:33:39,895 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:39,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:39,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1492806931, now seen corresponding path program 1 times [2025-02-06 12:33:39,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:39,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421386622] [2025-02-06 12:33:39,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:39,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:39,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 12:33:39,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 12:33:39,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:39,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:40,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:40,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421386622] [2025-02-06 12:33:40,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421386622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:40,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:40,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:33:40,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646821618] [2025-02-06 12:33:40,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:40,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:40,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:40,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:40,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:33:40,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2025-02-06 12:33:40,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 126 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:40,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:40,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2025-02-06 12:33:40,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:40,320 INFO L124 PetriNetUnfolderBase]: 1382/3218 cut-off events. [2025-02-06 12:33:40,321 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-02-06 12:33:40,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5612 conditions, 3218 events. 1382/3218 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 19610 event pairs, 703 based on Foata normal form. 55/2726 useless extension candidates. Maximal degree in co-relation 5605. Up to 1211 conditions per place. [2025-02-06 12:33:40,336 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 80 selfloop transitions, 3 changer transitions 0/139 dead transitions. [2025-02-06 12:33:40,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 139 transitions, 476 flow [2025-02-06 12:33:40,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:40,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2025-02-06 12:33:40,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7558139534883721 [2025-02-06 12:33:40,339 INFO L175 Difference]: Start difference. First operand has 121 places, 126 transitions, 310 flow. Second operand 3 states and 390 transitions. [2025-02-06 12:33:40,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 139 transitions, 476 flow [2025-02-06 12:33:40,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 139 transitions, 451 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-02-06 12:33:40,344 INFO L231 Difference]: Finished difference. Result has 114 places, 116 transitions, 249 flow [2025-02-06 12:33:40,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=249, PETRI_PLACES=114, PETRI_TRANSITIONS=116} [2025-02-06 12:33:40,347 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -48 predicate places. [2025-02-06 12:33:40,348 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 116 transitions, 249 flow [2025-02-06 12:33:40,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:40,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:40,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:40,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:33:40,349 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:40,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:40,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1062440787, now seen corresponding path program 1 times [2025-02-06 12:33:40,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:40,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535509868] [2025-02-06 12:33:40,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:40,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:40,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:33:40,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:33:40,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:40,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:40,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:40,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:40,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535509868] [2025-02-06 12:33:40,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535509868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:40,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:40,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:33:40,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120607100] [2025-02-06 12:33:40,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:40,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:40,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:40,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:40,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:33:40,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 172 [2025-02-06 12:33:40,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 116 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:40,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:40,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 172 [2025-02-06 12:33:40,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:40,766 INFO L124 PetriNetUnfolderBase]: 1392/3289 cut-off events. [2025-02-06 12:33:40,767 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-02-06 12:33:40,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5671 conditions, 3289 events. 1392/3289 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 20477 event pairs, 1089 based on Foata normal form. 77/2806 useless extension candidates. Maximal degree in co-relation 5666. Up to 2215 conditions per place. [2025-02-06 12:33:40,781 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 59 selfloop transitions, 1 changer transitions 0/113 dead transitions. [2025-02-06 12:33:40,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 113 transitions, 363 flow [2025-02-06 12:33:40,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:40,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:40,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2025-02-06 12:33:40,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6957364341085271 [2025-02-06 12:33:40,783 INFO L175 Difference]: Start difference. First operand has 114 places, 116 transitions, 249 flow. Second operand 3 states and 359 transitions. [2025-02-06 12:33:40,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 113 transitions, 363 flow [2025-02-06 12:33:40,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 360 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:33:40,785 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 242 flow [2025-02-06 12:33:40,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2025-02-06 12:33:40,786 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -50 predicate places. [2025-02-06 12:33:40,786 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 242 flow [2025-02-06 12:33:40,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:40,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:40,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:40,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:33:40,787 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:40,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:40,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1062440786, now seen corresponding path program 1 times [2025-02-06 12:33:40,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:40,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530352221] [2025-02-06 12:33:40,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:40,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:40,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:33:40,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:33:40,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:40,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:40,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:40,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530352221] [2025-02-06 12:33:40,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530352221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:40,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:40,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:33:40,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134141131] [2025-02-06 12:33:40,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:40,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:40,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:40,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:40,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:33:40,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-02-06 12:33:40,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 113 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:40,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:40,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-02-06 12:33:40,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:41,225 INFO L124 PetriNetUnfolderBase]: 1392/3277 cut-off events. [2025-02-06 12:33:41,225 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-02-06 12:33:41,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5646 conditions, 3277 events. 1392/3277 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 20349 event pairs, 1089 based on Foata normal form. 0/2717 useless extension candidates. Maximal degree in co-relation 5641. Up to 2215 conditions per place. [2025-02-06 12:33:41,238 INFO L140 encePairwiseOnDemand]: 170/172 looper letters, 59 selfloop transitions, 1 changer transitions 0/112 dead transitions. [2025-02-06 12:33:41,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 112 transitions, 360 flow [2025-02-06 12:33:41,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2025-02-06 12:33:41,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7034883720930233 [2025-02-06 12:33:41,240 INFO L175 Difference]: Start difference. First operand has 112 places, 113 transitions, 242 flow. Second operand 3 states and 363 transitions. [2025-02-06 12:33:41,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 112 transitions, 360 flow [2025-02-06 12:33:41,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 112 transitions, 359 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:33:41,243 INFO L231 Difference]: Finished difference. Result has 112 places, 112 transitions, 241 flow [2025-02-06 12:33:41,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=241, PETRI_PLACES=112, PETRI_TRANSITIONS=112} [2025-02-06 12:33:41,243 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -50 predicate places. [2025-02-06 12:33:41,244 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 112 transitions, 241 flow [2025-02-06 12:33:41,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:41,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:41,244 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:41,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:33:41,244 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:41,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:41,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1424074895, now seen corresponding path program 1 times [2025-02-06 12:33:41,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:41,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697042783] [2025-02-06 12:33:41,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:41,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:41,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:33:41,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:33:41,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:41,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:41,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:41,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697042783] [2025-02-06 12:33:41,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697042783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:41,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:41,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:33:41,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834159146] [2025-02-06 12:33:41,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:41,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:33:41,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:41,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:33:41,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:33:41,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 172 [2025-02-06 12:33:41,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 112 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:41,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:41,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 172 [2025-02-06 12:33:41,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:41,903 INFO L124 PetriNetUnfolderBase]: 1409/3270 cut-off events. [2025-02-06 12:33:41,904 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-02-06 12:33:41,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5672 conditions, 3270 events. 1409/3270 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 20092 event pairs, 1074 based on Foata normal form. 0/2746 useless extension candidates. Maximal degree in co-relation 5667. Up to 2185 conditions per place. [2025-02-06 12:33:41,916 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 67 selfloop transitions, 4 changer transitions 0/118 dead transitions. [2025-02-06 12:33:41,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 118 transitions, 396 flow [2025-02-06 12:33:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:33:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:33:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2025-02-06 12:33:41,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6302325581395349 [2025-02-06 12:33:41,920 INFO L175 Difference]: Start difference. First operand has 112 places, 112 transitions, 241 flow. Second operand 5 states and 542 transitions. [2025-02-06 12:33:41,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 118 transitions, 396 flow [2025-02-06 12:33:41,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 118 transitions, 395 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:33:41,922 INFO L231 Difference]: Finished difference. Result has 113 places, 110 transitions, 244 flow [2025-02-06 12:33:41,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=113, PETRI_TRANSITIONS=110} [2025-02-06 12:33:41,923 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -49 predicate places. [2025-02-06 12:33:41,923 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 110 transitions, 244 flow [2025-02-06 12:33:41,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:41,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:41,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:41,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:33:41,924 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:41,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:41,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1424074896, now seen corresponding path program 1 times [2025-02-06 12:33:41,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:41,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822716619] [2025-02-06 12:33:41,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:41,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:41,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 12:33:41,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 12:33:41,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:41,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:42,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:42,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822716619] [2025-02-06 12:33:42,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822716619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:42,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:42,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:33:42,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921534078] [2025-02-06 12:33:42,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:42,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:33:42,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:42,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:33:42,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:33:42,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-02-06 12:33:42,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 110 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:42,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:42,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-02-06 12:33:42,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:42,762 INFO L124 PetriNetUnfolderBase]: 1392/3229 cut-off events. [2025-02-06 12:33:42,762 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-02-06 12:33:42,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5625 conditions, 3229 events. 1392/3229 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 19822 event pairs, 1074 based on Foata normal form. 24/2729 useless extension candidates. Maximal degree in co-relation 5620. Up to 2185 conditions per place. [2025-02-06 12:33:42,779 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 64 selfloop transitions, 4 changer transitions 0/116 dead transitions. [2025-02-06 12:33:42,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 116 transitions, 393 flow [2025-02-06 12:33:42,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:33:42,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:33:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2025-02-06 12:33:42,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6616279069767442 [2025-02-06 12:33:42,781 INFO L175 Difference]: Start difference. First operand has 113 places, 110 transitions, 244 flow. Second operand 5 states and 569 transitions. [2025-02-06 12:33:42,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 116 transitions, 393 flow [2025-02-06 12:33:42,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 116 transitions, 385 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:33:42,783 INFO L231 Difference]: Finished difference. Result has 111 places, 108 transitions, 240 flow [2025-02-06 12:33:42,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=111, PETRI_TRANSITIONS=108} [2025-02-06 12:33:42,785 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -51 predicate places. [2025-02-06 12:33:42,786 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 108 transitions, 240 flow [2025-02-06 12:33:42,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:42,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:42,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:42,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:33:42,787 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:42,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:42,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1196616915, now seen corresponding path program 1 times [2025-02-06 12:33:42,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:42,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449007503] [2025-02-06 12:33:42,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:42,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:42,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:33:42,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:33:42,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:42,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:42,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:42,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:42,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449007503] [2025-02-06 12:33:42,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449007503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:42,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:42,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:33:42,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511911462] [2025-02-06 12:33:42,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:42,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:42,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:42,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:42,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:33:42,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2025-02-06 12:33:42,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 108 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:42,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:42,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2025-02-06 12:33:42,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:43,165 INFO L124 PetriNetUnfolderBase]: 1380/3217 cut-off events. [2025-02-06 12:33:43,166 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-02-06 12:33:43,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5601 conditions, 3217 events. 1380/3217 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 19757 event pairs, 1074 based on Foata normal form. 0/2705 useless extension candidates. Maximal degree in co-relation 5596. Up to 2175 conditions per place. [2025-02-06 12:33:43,176 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 65 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2025-02-06 12:33:43,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 115 transitions, 389 flow [2025-02-06 12:33:43,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:43,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2025-02-06 12:33:43,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7228682170542635 [2025-02-06 12:33:43,177 INFO L175 Difference]: Start difference. First operand has 111 places, 108 transitions, 240 flow. Second operand 3 states and 373 transitions. [2025-02-06 12:33:43,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 115 transitions, 389 flow [2025-02-06 12:33:43,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 115 transitions, 381 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:33:43,179 INFO L231 Difference]: Finished difference. Result has 109 places, 107 transitions, 234 flow [2025-02-06 12:33:43,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=109, PETRI_TRANSITIONS=107} [2025-02-06 12:33:43,180 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -53 predicate places. [2025-02-06 12:33:43,180 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 107 transitions, 234 flow [2025-02-06 12:33:43,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:43,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:43,181 INFO L206 CegarLoopForPetriNet]: trace histogram [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-02-06 12:33:43,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:33:43,181 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:43,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:43,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1638280557, now seen corresponding path program 1 times [2025-02-06 12:33:43,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:43,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012762257] [2025-02-06 12:33:43,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:43,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:43,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 12:33:43,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 12:33:43,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:43,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:43,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:43,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012762257] [2025-02-06 12:33:43,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012762257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:43,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:43,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:33:43,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366101623] [2025-02-06 12:33:43,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:43,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:33:43,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:43,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:33:43,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:33:44,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 172 [2025-02-06 12:33:44,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 107 transitions, 234 flow. Second operand has 9 states, 9 states have (on average 95.44444444444444) internal successors, (859), 9 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:44,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:44,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 172 [2025-02-06 12:33:44,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:44,757 INFO L124 PetriNetUnfolderBase]: 1640/3617 cut-off events. [2025-02-06 12:33:44,757 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-02-06 12:33:44,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6488 conditions, 3617 events. 1640/3617 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 21869 event pairs, 406 based on Foata normal form. 0/3119 useless extension candidates. Maximal degree in co-relation 6483. Up to 2360 conditions per place. [2025-02-06 12:33:44,770 INFO L140 encePairwiseOnDemand]: 163/172 looper letters, 90 selfloop transitions, 8 changer transitions 0/137 dead transitions. [2025-02-06 12:33:44,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 137 transitions, 494 flow [2025-02-06 12:33:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:33:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:33:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 749 transitions. [2025-02-06 12:33:44,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.622093023255814 [2025-02-06 12:33:44,773 INFO L175 Difference]: Start difference. First operand has 109 places, 107 transitions, 234 flow. Second operand 7 states and 749 transitions. [2025-02-06 12:33:44,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 137 transitions, 494 flow [2025-02-06 12:33:44,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 137 transitions, 490 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:33:44,776 INFO L231 Difference]: Finished difference. Result has 112 places, 105 transitions, 242 flow [2025-02-06 12:33:44,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=242, PETRI_PLACES=112, PETRI_TRANSITIONS=105} [2025-02-06 12:33:44,777 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -50 predicate places. [2025-02-06 12:33:44,777 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 105 transitions, 242 flow [2025-02-06 12:33:44,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 95.44444444444444) internal successors, (859), 9 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:44,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:44,778 INFO L206 CegarLoopForPetriNet]: trace histogram [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-02-06 12:33:44,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:33:44,778 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:44,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:44,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1859889225, now seen corresponding path program 1 times [2025-02-06 12:33:44,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:44,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694432211] [2025-02-06 12:33:44,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:44,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:44,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 12:33:44,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 12:33:44,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:44,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:45,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:45,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694432211] [2025-02-06 12:33:45,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694432211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:45,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:45,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 12:33:45,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902124272] [2025-02-06 12:33:45,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:45,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 12:33:45,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:45,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 12:33:45,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-06 12:33:47,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 172 [2025-02-06 12:33:47,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 105 transitions, 242 flow. Second operand has 15 states, 15 states have (on average 93.6) internal successors, (1404), 15 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:47,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:47,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 172 [2025-02-06 12:33:47,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:47,784 INFO L124 PetriNetUnfolderBase]: 1634/3474 cut-off events. [2025-02-06 12:33:47,784 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-02-06 12:33:47,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6368 conditions, 3474 events. 1634/3474 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 20453 event pairs, 434 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 6363. Up to 1938 conditions per place. [2025-02-06 12:33:47,796 INFO L140 encePairwiseOnDemand]: 157/172 looper letters, 125 selfloop transitions, 14 changer transitions 0/174 dead transitions. [2025-02-06 12:33:47,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 174 transitions, 668 flow [2025-02-06 12:33:47,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:33:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 12:33:47,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1335 transitions. [2025-02-06 12:33:47,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5970483005366727 [2025-02-06 12:33:47,800 INFO L175 Difference]: Start difference. First operand has 112 places, 105 transitions, 242 flow. Second operand 13 states and 1335 transitions. [2025-02-06 12:33:47,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 174 transitions, 668 flow [2025-02-06 12:33:47,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 174 transitions, 652 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 12:33:47,803 INFO L231 Difference]: Finished difference. Result has 115 places, 102 transitions, 254 flow [2025-02-06 12:33:47,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=254, PETRI_PLACES=115, PETRI_TRANSITIONS=102} [2025-02-06 12:33:47,804 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -47 predicate places. [2025-02-06 12:33:47,804 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 102 transitions, 254 flow [2025-02-06 12:33:47,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 93.6) internal successors, (1404), 15 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:47,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:47,805 INFO L206 CegarLoopForPetriNet]: trace histogram [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-02-06 12:33:47,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:33:47,805 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:47,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:47,806 INFO L85 PathProgramCache]: Analyzing trace with hash -726759521, now seen corresponding path program 1 times [2025-02-06 12:33:47,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:47,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990598294] [2025-02-06 12:33:47,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:47,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:47,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 12:33:47,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 12:33:47,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:47,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:33:49,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:49,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990598294] [2025-02-06 12:33:49,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990598294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:49,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:49,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 12:33:49,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411794257] [2025-02-06 12:33:49,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:49,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:33:49,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:49,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:33:49,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:33:50,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 172 [2025-02-06 12:33:50,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 102 transitions, 254 flow. Second operand has 14 states, 14 states have (on average 74.07142857142857) internal successors, (1037), 14 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:50,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:50,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 172 [2025-02-06 12:33:50,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:51,150 INFO L124 PetriNetUnfolderBase]: 2303/4773 cut-off events. [2025-02-06 12:33:51,151 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2025-02-06 12:33:51,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8968 conditions, 4773 events. 2303/4773 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 30237 event pairs, 196 based on Foata normal form. 56/4342 useless extension candidates. Maximal degree in co-relation 8962. Up to 2057 conditions per place. [2025-02-06 12:33:51,164 INFO L140 encePairwiseOnDemand]: 155/172 looper letters, 149 selfloop transitions, 20 changer transitions 0/204 dead transitions. [2025-02-06 12:33:51,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 204 transitions, 821 flow [2025-02-06 12:33:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:33:51,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 12:33:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1104 transitions. [2025-02-06 12:33:51,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4937388193202147 [2025-02-06 12:33:51,168 INFO L175 Difference]: Start difference. First operand has 115 places, 102 transitions, 254 flow. Second operand 13 states and 1104 transitions. [2025-02-06 12:33:51,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 204 transitions, 821 flow [2025-02-06 12:33:51,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 204 transitions, 797 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-02-06 12:33:51,171 INFO L231 Difference]: Finished difference. Result has 120 places, 111 transitions, 327 flow [2025-02-06 12:33:51,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=327, PETRI_PLACES=120, PETRI_TRANSITIONS=111} [2025-02-06 12:33:51,172 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -42 predicate places. [2025-02-06 12:33:51,173 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 111 transitions, 327 flow [2025-02-06 12:33:51,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 74.07142857142857) internal successors, (1037), 14 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:51,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:51,174 INFO L206 CegarLoopForPetriNet]: trace histogram [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-02-06 12:33:51,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 12:33:51,174 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:51,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:51,174 INFO L85 PathProgramCache]: Analyzing trace with hash -908741947, now seen corresponding path program 1 times [2025-02-06 12:33:51,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:51,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651352653] [2025-02-06 12:33:51,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:51,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:51,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 12:33:51,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 12:33:51,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:51,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 12:33:51,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:51,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651352653] [2025-02-06 12:33:51,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651352653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:51,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:51,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:33:51,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255825232] [2025-02-06 12:33:51,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:51,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:51,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:51,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:51,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:33:51,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2025-02-06 12:33:51,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 111 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:51,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:51,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2025-02-06 12:33:51,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:51,814 INFO L124 PetriNetUnfolderBase]: 3297/7972 cut-off events. [2025-02-06 12:33:51,815 INFO L125 PetriNetUnfolderBase]: For 1356/1356 co-relation queries the response was YES. [2025-02-06 12:33:51,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14976 conditions, 7972 events. 3297/7972 cut-off events. For 1356/1356 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 65146 event pairs, 1498 based on Foata normal form. 117/6774 useless extension candidates. Maximal degree in co-relation 14966. Up to 3186 conditions per place. [2025-02-06 12:33:51,836 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 120 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2025-02-06 12:33:51,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 167 transitions, 761 flow [2025-02-06 12:33:51,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:51,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2025-02-06 12:33:51,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7926356589147286 [2025-02-06 12:33:51,838 INFO L175 Difference]: Start difference. First operand has 120 places, 111 transitions, 327 flow. Second operand 3 states and 409 transitions. [2025-02-06 12:33:51,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 167 transitions, 761 flow [2025-02-06 12:33:51,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 167 transitions, 730 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-02-06 12:33:51,844 INFO L231 Difference]: Finished difference. Result has 116 places, 112 transitions, 319 flow [2025-02-06 12:33:51,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=319, PETRI_PLACES=116, PETRI_TRANSITIONS=112} [2025-02-06 12:33:51,845 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -46 predicate places. [2025-02-06 12:33:51,845 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 112 transitions, 319 flow [2025-02-06 12:33:51,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:51,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:51,845 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1] [2025-02-06 12:33:51,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:33:51,846 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:51,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:51,846 INFO L85 PathProgramCache]: Analyzing trace with hash 482238435, now seen corresponding path program 1 times [2025-02-06 12:33:51,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:51,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000611284] [2025-02-06 12:33:51,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:51,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:51,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 12:33:51,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 12:33:51,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:51,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:51,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 12:33:51,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:51,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000611284] [2025-02-06 12:33:51,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000611284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:51,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:51,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:33:51,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714943977] [2025-02-06 12:33:51,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:51,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:33:51,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:51,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:33:51,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:33:52,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 172 [2025-02-06 12:33:52,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 112 transitions, 319 flow. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:52,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:52,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 172 [2025-02-06 12:33:52,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:52,802 INFO L124 PetriNetUnfolderBase]: 4169/8583 cut-off events. [2025-02-06 12:33:52,803 INFO L125 PetriNetUnfolderBase]: For 2046/2046 co-relation queries the response was YES. [2025-02-06 12:33:52,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18138 conditions, 8583 events. 4169/8583 cut-off events. For 2046/2046 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 62624 event pairs, 2275 based on Foata normal form. 54/7839 useless extension candidates. Maximal degree in co-relation 18126. Up to 5580 conditions per place. [2025-02-06 12:33:52,835 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 100 selfloop transitions, 3 changer transitions 0/147 dead transitions. [2025-02-06 12:33:52,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 147 transitions, 636 flow [2025-02-06 12:33:52,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:33:52,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:33:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2025-02-06 12:33:52,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7136627906976745 [2025-02-06 12:33:52,837 INFO L175 Difference]: Start difference. First operand has 116 places, 112 transitions, 319 flow. Second operand 4 states and 491 transitions. [2025-02-06 12:33:52,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 147 transitions, 636 flow [2025-02-06 12:33:52,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 147 transitions, 632 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:33:52,846 INFO L231 Difference]: Finished difference. Result has 119 places, 113 transitions, 333 flow [2025-02-06 12:33:52,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=333, PETRI_PLACES=119, PETRI_TRANSITIONS=113} [2025-02-06 12:33:52,846 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -43 predicate places. [2025-02-06 12:33:52,846 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 113 transitions, 333 flow [2025-02-06 12:33:52,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:52,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:52,847 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1] [2025-02-06 12:33:52,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:33:52,847 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:52,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:52,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1574549436, now seen corresponding path program 1 times [2025-02-06 12:33:52,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:52,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799479777] [2025-02-06 12:33:52,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:52,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:52,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 12:33:52,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 12:33:52,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:52,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 12:33:52,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:52,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799479777] [2025-02-06 12:33:52,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799479777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:52,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:52,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:33:52,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693811583] [2025-02-06 12:33:52,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:52,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:52,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:52,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:52,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:33:52,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-02-06 12:33:52,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 113 transitions, 333 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:52,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:52,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-02-06 12:33:52,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:53,363 INFO L124 PetriNetUnfolderBase]: 2462/5576 cut-off events. [2025-02-06 12:33:53,364 INFO L125 PetriNetUnfolderBase]: For 1201/1201 co-relation queries the response was YES. [2025-02-06 12:33:53,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11413 conditions, 5576 events. 2462/5576 cut-off events. For 1201/1201 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 39098 event pairs, 1201 based on Foata normal form. 124/5062 useless extension candidates. Maximal degree in co-relation 11400. Up to 2282 conditions per place. [2025-02-06 12:33:53,391 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 78 selfloop transitions, 3 changer transitions 0/125 dead transitions. [2025-02-06 12:33:53,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 125 transitions, 519 flow [2025-02-06 12:33:53,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2025-02-06 12:33:53,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7286821705426356 [2025-02-06 12:33:53,393 INFO L175 Difference]: Start difference. First operand has 119 places, 113 transitions, 333 flow. Second operand 3 states and 376 transitions. [2025-02-06 12:33:53,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 125 transitions, 519 flow [2025-02-06 12:33:53,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 125 transitions, 501 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-02-06 12:33:53,400 INFO L231 Difference]: Finished difference. Result has 116 places, 109 transitions, 308 flow [2025-02-06 12:33:53,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=116, PETRI_TRANSITIONS=109} [2025-02-06 12:33:53,400 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -46 predicate places. [2025-02-06 12:33:53,400 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 109 transitions, 308 flow [2025-02-06 12:33:53,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:53,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:53,401 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:53,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 12:33:53,401 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:53,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:53,402 INFO L85 PathProgramCache]: Analyzing trace with hash 865527802, now seen corresponding path program 1 times [2025-02-06 12:33:53,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:53,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238123722] [2025-02-06 12:33:53,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:53,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:53,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 12:33:53,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 12:33:53,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:53,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:53,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 12:33:53,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:53,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238123722] [2025-02-06 12:33:53,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238123722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:53,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:53,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:33:53,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570680788] [2025-02-06 12:33:53,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:53,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:53,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:53,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:53,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:33:53,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 172 [2025-02-06 12:33:53,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 109 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:53,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:53,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 172 [2025-02-06 12:33:53,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:53,807 INFO L124 PetriNetUnfolderBase]: 1502/3799 cut-off events. [2025-02-06 12:33:53,807 INFO L125 PetriNetUnfolderBase]: For 1069/1069 co-relation queries the response was YES. [2025-02-06 12:33:53,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7945 conditions, 3799 events. 1502/3799 cut-off events. For 1069/1069 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 24512 event pairs, 368 based on Foata normal form. 216/3633 useless extension candidates. Maximal degree in co-relation 7933. Up to 1831 conditions per place. [2025-02-06 12:33:53,823 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 70 selfloop transitions, 6 changer transitions 0/122 dead transitions. [2025-02-06 12:33:53,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 122 transitions, 504 flow [2025-02-06 12:33:53,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:53,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2025-02-06 12:33:53,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7286821705426356 [2025-02-06 12:33:53,825 INFO L175 Difference]: Start difference. First operand has 116 places, 109 transitions, 308 flow. Second operand 3 states and 376 transitions. [2025-02-06 12:33:53,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 122 transitions, 504 flow [2025-02-06 12:33:53,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 122 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:33:53,830 INFO L231 Difference]: Finished difference. Result has 116 places, 109 transitions, 314 flow [2025-02-06 12:33:53,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=116, PETRI_TRANSITIONS=109} [2025-02-06 12:33:53,830 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -46 predicate places. [2025-02-06 12:33:53,830 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 109 transitions, 314 flow [2025-02-06 12:33:53,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:53,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:53,831 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:53,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 12:33:53,831 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:53,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:53,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1634559807, now seen corresponding path program 1 times [2025-02-06 12:33:53,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:53,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680063250] [2025-02-06 12:33:53,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:53,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:53,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 12:33:53,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 12:33:53,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:53,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 12:33:53,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:53,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680063250] [2025-02-06 12:33:53,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680063250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:53,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:53,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:33:53,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675977607] [2025-02-06 12:33:53,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:53,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:33:53,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:53,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:33:53,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:33:54,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 172 [2025-02-06 12:33:54,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 109 transitions, 314 flow. Second operand has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:54,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:54,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 172 [2025-02-06 12:33:54,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:54,654 INFO L124 PetriNetUnfolderBase]: 1590/3602 cut-off events. [2025-02-06 12:33:54,654 INFO L125 PetriNetUnfolderBase]: For 1278/1278 co-relation queries the response was YES. [2025-02-06 12:33:54,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8273 conditions, 3602 events. 1590/3602 cut-off events. For 1278/1278 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 21201 event pairs, 1013 based on Foata normal form. 36/3550 useless extension candidates. Maximal degree in co-relation 8261. Up to 2187 conditions per place. [2025-02-06 12:33:54,680 INFO L140 encePairwiseOnDemand]: 160/172 looper letters, 70 selfloop transitions, 4 changer transitions 0/106 dead transitions. [2025-02-06 12:33:54,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 106 transitions, 463 flow [2025-02-06 12:33:54,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:33:54,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:33:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2025-02-06 12:33:54,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5802325581395349 [2025-02-06 12:33:54,683 INFO L175 Difference]: Start difference. First operand has 116 places, 109 transitions, 314 flow. Second operand 5 states and 499 transitions. [2025-02-06 12:33:54,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 106 transitions, 463 flow [2025-02-06 12:33:54,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 106 transitions, 457 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:33:54,688 INFO L231 Difference]: Finished difference. Result has 111 places, 101 transitions, 300 flow [2025-02-06 12:33:54,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=300, PETRI_PLACES=111, PETRI_TRANSITIONS=101} [2025-02-06 12:33:54,689 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -51 predicate places. [2025-02-06 12:33:54,689 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 101 transitions, 300 flow [2025-02-06 12:33:54,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:54,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:54,689 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:54,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 12:33:54,690 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:54,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:54,690 INFO L85 PathProgramCache]: Analyzing trace with hash 379392588, now seen corresponding path program 1 times [2025-02-06 12:33:54,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:54,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959658647] [2025-02-06 12:33:54,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:54,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:54,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 12:33:54,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 12:33:54,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:54,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 12:33:55,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:55,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959658647] [2025-02-06 12:33:55,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959658647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:55,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:33:55,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:33:55,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50270091] [2025-02-06 12:33:55,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:55,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:33:55,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:55,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:33:55,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:33:55,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 172 [2025-02-06 12:33:55,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 101 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:55,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:55,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 172 [2025-02-06 12:33:55,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:55,618 INFO L124 PetriNetUnfolderBase]: 1502/3334 cut-off events. [2025-02-06 12:33:55,618 INFO L125 PetriNetUnfolderBase]: For 1172/1172 co-relation queries the response was YES. [2025-02-06 12:33:55,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7663 conditions, 3334 events. 1502/3334 cut-off events. For 1172/1172 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 18721 event pairs, 1013 based on Foata normal form. 126/3372 useless extension candidates. Maximal degree in co-relation 7650. Up to 2187 conditions per place. [2025-02-06 12:33:55,628 INFO L140 encePairwiseOnDemand]: 161/172 looper letters, 65 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2025-02-06 12:33:55,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 99 transitions, 441 flow [2025-02-06 12:33:55,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:33:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:33:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2025-02-06 12:33:55,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6255813953488372 [2025-02-06 12:33:55,630 INFO L175 Difference]: Start difference. First operand has 111 places, 101 transitions, 300 flow. Second operand 5 states and 538 transitions. [2025-02-06 12:33:55,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 99 transitions, 441 flow [2025-02-06 12:33:55,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 99 transitions, 433 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:33:55,632 INFO L231 Difference]: Finished difference. Result has 104 places, 94 transitions, 286 flow [2025-02-06 12:33:55,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=104, PETRI_TRANSITIONS=94} [2025-02-06 12:33:55,632 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -58 predicate places. [2025-02-06 12:33:55,633 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 94 transitions, 286 flow [2025-02-06 12:33:55,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.16666666666667) internal successors, (601), 6 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:55,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:55,633 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:55,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 12:33:55,633 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:55,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:55,634 INFO L85 PathProgramCache]: Analyzing trace with hash 730671163, now seen corresponding path program 1 times [2025-02-06 12:33:55,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:55,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674863778] [2025-02-06 12:33:55,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:55,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:55,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 12:33:55,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:33:55,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:55,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:55,688 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 12:33:55,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:55,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674863778] [2025-02-06 12:33:55,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674863778] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:33:55,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444537074] [2025-02-06 12:33:55,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:55,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:33:55,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:33:55,692 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:33:55,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:33:55,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 12:33:55,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:33:55,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:55,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:55,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:33:55,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:33:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 12:33:55,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:33:55,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444537074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:33:55,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 12:33:55,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-02-06 12:33:55,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600762399] [2025-02-06 12:33:55,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:33:55,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:33:55,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:55,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:33:55,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:33:56,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 172 [2025-02-06 12:33:56,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 94 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:56,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:33:56,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 172 [2025-02-06 12:33:56,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:33:56,278 INFO L124 PetriNetUnfolderBase]: 1502/3337 cut-off events. [2025-02-06 12:33:56,278 INFO L125 PetriNetUnfolderBase]: For 1148/1148 co-relation queries the response was YES. [2025-02-06 12:33:56,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7665 conditions, 3337 events. 1502/3337 cut-off events. For 1148/1148 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 18773 event pairs, 1193 based on Foata normal form. 5/3240 useless extension candidates. Maximal degree in co-relation 7652. Up to 2606 conditions per place. [2025-02-06 12:33:56,286 INFO L140 encePairwiseOnDemand]: 170/172 looper letters, 61 selfloop transitions, 1 changer transitions 2/93 dead transitions. [2025-02-06 12:33:56,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 93 transitions, 410 flow [2025-02-06 12:33:56,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:33:56,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:33:56,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2025-02-06 12:33:56,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2025-02-06 12:33:56,287 INFO L175 Difference]: Start difference. First operand has 104 places, 94 transitions, 286 flow. Second operand 3 states and 360 transitions. [2025-02-06 12:33:56,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 93 transitions, 410 flow [2025-02-06 12:33:56,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 93 transitions, 402 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:33:56,291 INFO L231 Difference]: Finished difference. Result has 101 places, 91 transitions, 273 flow [2025-02-06 12:33:56,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=273, PETRI_PLACES=101, PETRI_TRANSITIONS=91} [2025-02-06 12:33:56,292 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -61 predicate places. [2025-02-06 12:33:56,292 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 91 transitions, 273 flow [2025-02-06 12:33:56,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:33:56,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:33:56,292 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:33:56,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:33:56,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-06 12:33:56,496 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:33:56,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:33:56,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1123730796, now seen corresponding path program 1 times [2025-02-06 12:33:56,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:33:56,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493830887] [2025-02-06 12:33:56,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:56,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:33:56,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 12:33:56,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:33:56,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:56,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 12:33:57,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:33:57,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493830887] [2025-02-06 12:33:57,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493830887] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:33:57,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105196203] [2025-02-06 12:33:57,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:33:57,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:33:57,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:33:57,358 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:33:57,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:33:57,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 12:33:57,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 12:33:57,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:33:57,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:33:57,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-06 12:33:57,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:33:57,587 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 13 treesize of output 9 [2025-02-06 12:33:57,624 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 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 12:33:57,751 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 12:33:57,766 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2025-02-06 12:33:57,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2025-02-06 12:33:57,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:33:57,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 12:33:57,858 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 0 case distinctions, treesize of input 23 treesize of output 13 [2025-02-06 12:33:57,966 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 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 12:33:57,980 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 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 12:33:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 12:33:58,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:33:59,790 INFO L349 Elim1Store]: treesize reduction 56, result has 43.4 percent of original size [2025-02-06 12:33:59,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 188 treesize of output 179 [2025-02-06 12:33:59,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:33:59,808 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 144 treesize of output 140 [2025-02-06 12:33:59,878 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 8 treesize of output 4 [2025-02-06 12:33:59,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:33:59,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 106 [2025-02-06 12:33:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 12:33:59,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105196203] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:33:59,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:33:59,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 35 [2025-02-06 12:33:59,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580147791] [2025-02-06 12:33:59,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:33:59,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 12:33:59,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:33:59,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 12:33:59,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1076, Unknown=1, NotChecked=0, Total=1260 [2025-02-06 12:34:01,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 12:34:08,078 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 [1] [2025-02-06 12:34:11,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 12:34:15,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 12:34:20,162 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 [1] [2025-02-06 12:34:24,920 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 [1] [2025-02-06 12:34:27,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 12:34:30,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 12:34:30,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 172 [2025-02-06 12:34:30,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 91 transitions, 273 flow. Second operand has 36 states, 36 states have (on average 88.19444444444444) internal successors, (3175), 36 states have internal predecessors, (3175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:30,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:34:30,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 172 [2025-02-06 12:34:30,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:34:32,467 INFO L124 PetriNetUnfolderBase]: 1495/3148 cut-off events. [2025-02-06 12:34:32,467 INFO L125 PetriNetUnfolderBase]: For 1037/1037 co-relation queries the response was YES. [2025-02-06 12:34:32,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7308 conditions, 3148 events. 1495/3148 cut-off events. For 1037/1037 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 15357 event pairs, 231 based on Foata normal form. 0/3080 useless extension candidates. Maximal degree in co-relation 7295. Up to 1017 conditions per place. [2025-02-06 12:34:32,481 INFO L140 encePairwiseOnDemand]: 151/172 looper letters, 150 selfloop transitions, 21 changer transitions 17/205 dead transitions. [2025-02-06 12:34:32,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 205 transitions, 1016 flow [2025-02-06 12:34:32,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 12:34:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-02-06 12:34:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1532 transitions. [2025-02-06 12:34:32,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5566860465116279 [2025-02-06 12:34:32,483 INFO L175 Difference]: Start difference. First operand has 101 places, 91 transitions, 273 flow. Second operand 16 states and 1532 transitions. [2025-02-06 12:34:32,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 205 transitions, 1016 flow [2025-02-06 12:34:32,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 205 transitions, 1005 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-02-06 12:34:32,487 INFO L231 Difference]: Finished difference. Result has 116 places, 95 transitions, 335 flow [2025-02-06 12:34:32,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=335, PETRI_PLACES=116, PETRI_TRANSITIONS=95} [2025-02-06 12:34:32,487 INFO L279 CegarLoopForPetriNet]: 162 programPoint places, -46 predicate places. [2025-02-06 12:34:32,487 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 95 transitions, 335 flow [2025-02-06 12:34:32,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 88.19444444444444) internal successors, (3175), 36 states have internal predecessors, (3175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:34:32,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:34:32,489 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:34:32,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 12:34:32,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:34:32,690 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 131 more)] === [2025-02-06 12:34:32,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:34:32,691 INFO L85 PathProgramCache]: Analyzing trace with hash -164951541, now seen corresponding path program 1 times [2025-02-06 12:34:32,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:34:32,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573882540] [2025-02-06 12:34:32,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:32,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:34:32,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 12:34:32,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 12:34:32,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:32,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:34,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:34:34,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:34:34,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573882540] [2025-02-06 12:34:34,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573882540] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:34:34,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526398964] [2025-02-06 12:34:34,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:34:34,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:34:34,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:34:34,401 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:34:34,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:34:34,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 12:34:34,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 12:34:34,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:34:34,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:34:34,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-02-06 12:34:34,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:34:34,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 12:34:34,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-06 12:34:34,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-02-06 12:34:34,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:34:34,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:34:34,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2025-02-06 12:34:34,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-02-06 12:34:35,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-02-06 12:34:35,274 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2025-02-06 12:34:35,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2025-02-06 12:34:35,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-02-06 12:34:35,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-02-06 12:34:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 12:34:35,460 INFO L312 TraceCheckSpWp]: Computing backward predicates...