./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:34:17,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:34:17,958 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:34:17,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:34:17,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:34:17,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:34:17,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:34:17,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:34:17,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:34:17,988 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:34:17,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:34:17,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:34:17,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:34:17,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:34:17,989 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:34:17,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:34:17,989 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:34:17,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:34:17,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:34:17,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:34:17,990 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:34:17,990 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:34:17,990 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:34:17,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:34:17,990 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:34:17,990 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:34:17,990 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:34:17,991 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:34:17,991 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:34:17,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:34:17,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:34:17,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:34:17,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:34:17,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:34:17,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:34:17,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:34:17,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:34:17,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:34:17,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:34:17,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:34:17,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:34:17,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:34:17,992 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 [2025-03-17 14:34:18,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:34:18,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:34:18,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:34:18,215 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:34:18,215 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:34:18,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2025-03-17 14:34:19,376 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c28d2dd3/ab7295dbc8fc40bf917e3e403f464ed0/FLAG192b88dfe [2025-03-17 14:34:19,628 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:34:19,628 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2025-03-17 14:34:19,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c28d2dd3/ab7295dbc8fc40bf917e3e403f464ed0/FLAG192b88dfe [2025-03-17 14:34:19,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c28d2dd3/ab7295dbc8fc40bf917e3e403f464ed0 [2025-03-17 14:34:19,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:34:19,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:34:19,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:34:19,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:34:19,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:34:19,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:34:19" (1/1) ... [2025-03-17 14:34:19,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6755a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:19, skipping insertion in model container [2025-03-17 14:34:19,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:34:19" (1/1) ... [2025-03-17 14:34:19,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:34:20,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:34:20,179 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:34:20,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:34:20,253 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:34:20,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:20 WrapperNode [2025-03-17 14:34:20,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:34:20,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:34:20,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:34:20,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:34:20,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:20" (1/1) ... [2025-03-17 14:34:20,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:20" (1/1) ... [2025-03-17 14:34:20,298 INFO L138 Inliner]: procedures = 168, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2025-03-17 14:34:20,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:34:20,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:34:20,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:34:20,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:34:20,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:20" (1/1) ... [2025-03-17 14:34:20,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:20" (1/1) ... [2025-03-17 14:34:20,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:20" (1/1) ... [2025-03-17 14:34:20,323 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 1, 12, 8]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 10, 8]. The 1 writes are split as follows [0, 0, 1, 0]. [2025-03-17 14:34:20,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:20" (1/1) ... [2025-03-17 14:34:20,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:20" (1/1) ... [2025-03-17 14:34:20,329 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:20" (1/1) ... [2025-03-17 14:34:20,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:20" (1/1) ... [2025-03-17 14:34:20,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:20" (1/1) ... [2025-03-17 14:34:20,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:20" (1/1) ... [2025-03-17 14:34:20,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:34:20,334 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:34:20,334 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:34:20,334 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:34:20,335 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:20" (1/1) ... [2025-03-17 14:34:20,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:34:20,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:20,361 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:34:20,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:34:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:34:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:34:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:34:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 14:34:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-17 14:34:20,378 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-17 14:34:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-17 14:34:20,379 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-17 14:34:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:34:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:34:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 14:34:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 14:34:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 14:34:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:34:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 14:34:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 14:34:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 14:34:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-17 14:34:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:34:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:34:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:34:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 14:34:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 14:34:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:34:20,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:34:20,380 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:34:20,495 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:34:20,497 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:34:20,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L699: havoc removeLogElement_#t~mem2#1; [2025-03-17 14:34:20,716 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:34:20,716 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:34:20,825 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:34:20,825 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:34:20,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:34:20 BoogieIcfgContainer [2025-03-17 14:34:20,825 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:34:20,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:34:20,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:34:20,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:34:20,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:34:19" (1/3) ... [2025-03-17 14:34:20,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5a0ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:34:20, skipping insertion in model container [2025-03-17 14:34:20,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:20" (2/3) ... [2025-03-17 14:34:20,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5a0ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:34:20, skipping insertion in model container [2025-03-17 14:34:20,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:34:20" (3/3) ... [2025-03-17 14:34:20,832 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2025-03-17 14:34:20,841 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:34:20,843 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_ok.i that has 3 procedures, 55 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-17 14:34:20,843 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:34:20,898 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 14:34:20,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 66 transitions, 146 flow [2025-03-17 14:34:20,940 INFO L124 PetriNetUnfolderBase]: 12/64 cut-off events. [2025-03-17 14:34:20,942 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:34:20,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 64 events. 12/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 184 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2025-03-17 14:34:20,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 66 transitions, 146 flow [2025-03-17 14:34:20,946 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 63 transitions, 138 flow [2025-03-17 14:34:20,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:34:20,961 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;@467a640e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:34:20,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-17 14:34:20,967 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:34:20,967 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-03-17 14:34:20,967 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:34:20,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:20,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:20,968 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-17 14:34:20,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:20,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1958852620, now seen corresponding path program 1 times [2025-03-17 14:34:20,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:20,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662980914] [2025-03-17 14:34:20,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:20,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:21,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:34:21,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:34:21,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:21,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:21,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:21,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662980914] [2025-03-17 14:34:21,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662980914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:21,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:21,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:34:21,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839479153] [2025-03-17 14:34:21,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:21,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:21,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:21,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:21,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:21,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2025-03-17 14:34:21,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:21,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:21,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2025-03-17 14:34:21,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:21,506 INFO L124 PetriNetUnfolderBase]: 571/1094 cut-off events. [2025-03-17 14:34:21,506 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-03-17 14:34:21,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2049 conditions, 1094 events. 571/1094 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6027 event pairs, 437 based on Foata normal form. 154/1136 useless extension candidates. Maximal degree in co-relation 1967. Up to 912 conditions per place. [2025-03-17 14:34:21,519 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 32 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2025-03-17 14:34:21,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 182 flow [2025-03-17 14:34:21,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:21,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-03-17 14:34:21,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5252525252525253 [2025-03-17 14:34:21,530 INFO L175 Difference]: Start difference. First operand has 58 places, 63 transitions, 138 flow. Second operand 3 states and 104 transitions. [2025-03-17 14:34:21,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 182 flow [2025-03-17 14:34:21,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 174 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:34:21,537 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 110 flow [2025-03-17 14:34:21,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2025-03-17 14:34:21,541 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2025-03-17 14:34:21,541 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 110 flow [2025-03-17 14:34:21,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:21,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:21,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:21,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:34:21,542 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-17 14:34:21,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:21,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1958852621, now seen corresponding path program 1 times [2025-03-17 14:34:21,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:21,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141247966] [2025-03-17 14:34:21,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:21,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:21,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:34:21,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:34:21,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:21,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:21,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:21,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141247966] [2025-03-17 14:34:21,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141247966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:21,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:21,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:34:21,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127219675] [2025-03-17 14:34:21,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:21,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:21,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:21,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:21,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:21,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-03-17 14:34:21,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:21,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:21,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-03-17 14:34:21,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:22,041 INFO L124 PetriNetUnfolderBase]: 1024/1958 cut-off events. [2025-03-17 14:34:22,041 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 14:34:22,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3583 conditions, 1958 events. 1024/1958 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 11129 event pairs, 370 based on Foata normal form. 0/1779 useless extension candidates. Maximal degree in co-relation 3577. Up to 901 conditions per place. [2025-03-17 14:34:22,052 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 59 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2025-03-17 14:34:22,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 289 flow [2025-03-17 14:34:22,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2025-03-17 14:34:22,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-03-17 14:34:22,054 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 110 flow. Second operand 3 states and 129 transitions. [2025-03-17 14:34:22,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 289 flow [2025-03-17 14:34:22,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:22,057 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 123 flow [2025-03-17 14:34:22,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2025-03-17 14:34:22,058 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2025-03-17 14:34:22,058 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 123 flow [2025-03-17 14:34:22,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:22,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:22,058 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:22,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:34:22,059 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-17 14:34:22,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:22,059 INFO L85 PathProgramCache]: Analyzing trace with hash 458189749, now seen corresponding path program 1 times [2025-03-17 14:34:22,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:22,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436671340] [2025-03-17 14:34:22,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:22,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:22,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:34:22,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:34:22,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:22,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:22,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:22,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436671340] [2025-03-17 14:34:22,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436671340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:22,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:22,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:22,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216807317] [2025-03-17 14:34:22,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:22,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:34:22,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:22,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:34:22,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:34:22,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-03-17 14:34:22,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:22,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:22,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-03-17 14:34:22,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:22,472 INFO L124 PetriNetUnfolderBase]: 704/1367 cut-off events. [2025-03-17 14:34:22,472 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-17 14:34:22,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2613 conditions, 1367 events. 704/1367 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7474 event pairs, 540 based on Foata normal form. 74/1344 useless extension candidates. Maximal degree in co-relation 2605. Up to 1102 conditions per place. [2025-03-17 14:34:22,481 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 31 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2025-03-17 14:34:22,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 179 flow [2025-03-17 14:34:22,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-03-17 14:34:22,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-03-17 14:34:22,483 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 123 flow. Second operand 3 states and 102 transitions. [2025-03-17 14:34:22,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 179 flow [2025-03-17 14:34:22,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 177 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:22,484 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 115 flow [2025-03-17 14:34:22,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2025-03-17 14:34:22,485 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2025-03-17 14:34:22,485 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 115 flow [2025-03-17 14:34:22,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:22,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:22,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:22,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:34:22,489 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-17 14:34:22,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:22,490 INFO L85 PathProgramCache]: Analyzing trace with hash 66616895, now seen corresponding path program 1 times [2025-03-17 14:34:22,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:22,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615566310] [2025-03-17 14:34:22,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:22,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:22,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:34:22,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:34:22,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:22,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:22,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:22,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615566310] [2025-03-17 14:34:22,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615566310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:22,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:22,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:22,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914603747] [2025-03-17 14:34:22,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:22,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:22,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:22,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:22,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:22,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-03-17 14:34:22,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:22,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:22,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-03-17 14:34:22,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:22,740 INFO L124 PetriNetUnfolderBase]: 1116/2167 cut-off events. [2025-03-17 14:34:22,740 INFO L125 PetriNetUnfolderBase]: For 106/124 co-relation queries the response was YES. [2025-03-17 14:34:22,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4105 conditions, 2167 events. 1116/2167 cut-off events. For 106/124 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 13210 event pairs, 534 based on Foata normal form. 24/2019 useless extension candidates. Maximal degree in co-relation 4096. Up to 1146 conditions per place. [2025-03-17 14:34:22,750 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 55 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2025-03-17 14:34:22,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 74 transitions, 284 flow [2025-03-17 14:34:22,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:22,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-03-17 14:34:22,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-03-17 14:34:22,751 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 115 flow. Second operand 3 states and 126 transitions. [2025-03-17 14:34:22,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 74 transitions, 284 flow [2025-03-17 14:34:22,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 74 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:22,753 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 126 flow [2025-03-17 14:34:22,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-03-17 14:34:22,753 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2025-03-17 14:34:22,754 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 126 flow [2025-03-17 14:34:22,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:22,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:22,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:22,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:34:22,755 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-17 14:34:22,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:22,756 INFO L85 PathProgramCache]: Analyzing trace with hash 181736238, now seen corresponding path program 1 times [2025-03-17 14:34:22,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:22,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496976975] [2025-03-17 14:34:22,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:22,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:22,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:34:22,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:34:22,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:22,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:22,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:22,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496976975] [2025-03-17 14:34:22,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496976975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:22,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:22,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:34:22,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903397104] [2025-03-17 14:34:22,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:22,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:22,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:22,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:22,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:22,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-03-17 14:34:22,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:22,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:22,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-03-17 14:34:22,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:22,968 INFO L124 PetriNetUnfolderBase]: 1002/2048 cut-off events. [2025-03-17 14:34:22,968 INFO L125 PetriNetUnfolderBase]: For 178/194 co-relation queries the response was YES. [2025-03-17 14:34:22,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4000 conditions, 2048 events. 1002/2048 cut-off events. For 178/194 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 11620 event pairs, 489 based on Foata normal form. 47/1987 useless extension candidates. Maximal degree in co-relation 3990. Up to 837 conditions per place. [2025-03-17 14:34:22,976 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 51 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2025-03-17 14:34:22,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 71 transitions, 288 flow [2025-03-17 14:34:22,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2025-03-17 14:34:22,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-03-17 14:34:22,978 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 126 flow. Second operand 3 states and 121 transitions. [2025-03-17 14:34:22,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 71 transitions, 288 flow [2025-03-17 14:34:22,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 71 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:22,980 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 139 flow [2025-03-17 14:34:22,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2025-03-17 14:34:22,980 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2025-03-17 14:34:22,980 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 139 flow [2025-03-17 14:34:22,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:22,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:22,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:22,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:34:22,981 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-17 14:34:22,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:22,981 INFO L85 PathProgramCache]: Analyzing trace with hash 494262812, now seen corresponding path program 1 times [2025-03-17 14:34:22,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:22,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144296052] [2025-03-17 14:34:22,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:22,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:22,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:34:22,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:34:22,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:22,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:23,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:23,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:23,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144296052] [2025-03-17 14:34:23,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144296052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:23,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:23,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:34:23,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692605998] [2025-03-17 14:34:23,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:23,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:34:23,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:23,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:34:23,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:34:23,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-03-17 14:34:23,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 139 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:23,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:23,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-03-17 14:34:23,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:23,371 INFO L124 PetriNetUnfolderBase]: 1034/1997 cut-off events. [2025-03-17 14:34:23,371 INFO L125 PetriNetUnfolderBase]: For 279/292 co-relation queries the response was YES. [2025-03-17 14:34:23,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4099 conditions, 1997 events. 1034/1997 cut-off events. For 279/292 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 11128 event pairs, 470 based on Foata normal form. 0/1846 useless extension candidates. Maximal degree in co-relation 4087. Up to 1299 conditions per place. [2025-03-17 14:34:23,379 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 86 selfloop transitions, 7 changer transitions 0/109 dead transitions. [2025-03-17 14:34:23,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 109 transitions, 460 flow [2025-03-17 14:34:23,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:34:23,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:34:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 246 transitions. [2025-03-17 14:34:23,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5324675324675324 [2025-03-17 14:34:23,380 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 139 flow. Second operand 7 states and 246 transitions. [2025-03-17 14:34:23,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 109 transitions, 460 flow [2025-03-17 14:34:23,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 109 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:23,382 INFO L231 Difference]: Finished difference. Result has 64 places, 56 transitions, 181 flow [2025-03-17 14:34:23,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=181, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2025-03-17 14:34:23,383 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2025-03-17 14:34:23,383 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 181 flow [2025-03-17 14:34:23,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:23,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:23,383 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:23,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:34:23,383 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-17 14:34:23,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:23,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1684316183, now seen corresponding path program 1 times [2025-03-17 14:34:23,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:23,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32538532] [2025-03-17 14:34:23,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:23,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:23,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:34:23,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:34:23,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:23,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:23,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:34:23,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:23,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32538532] [2025-03-17 14:34:23,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32538532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:23,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:23,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:23,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348439255] [2025-03-17 14:34:23,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:23,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:23,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:23,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:23,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:23,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-03-17 14:34:23,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:23,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:23,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-03-17 14:34:23,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:23,669 INFO L124 PetriNetUnfolderBase]: 1605/3210 cut-off events. [2025-03-17 14:34:23,669 INFO L125 PetriNetUnfolderBase]: For 869/912 co-relation queries the response was YES. [2025-03-17 14:34:23,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6948 conditions, 3210 events. 1605/3210 cut-off events. For 869/912 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 20392 event pairs, 759 based on Foata normal form. 73/3130 useless extension candidates. Maximal degree in co-relation 6932. Up to 1612 conditions per place. [2025-03-17 14:34:23,684 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 67 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2025-03-17 14:34:23,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 433 flow [2025-03-17 14:34:23,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:23,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2025-03-17 14:34:23,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6313131313131313 [2025-03-17 14:34:23,685 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 181 flow. Second operand 3 states and 125 transitions. [2025-03-17 14:34:23,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 433 flow [2025-03-17 14:34:23,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 87 transitions, 421 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:34:23,690 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 187 flow [2025-03-17 14:34:23,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2025-03-17 14:34:23,691 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2025-03-17 14:34:23,691 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 187 flow [2025-03-17 14:34:23,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:23,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:23,691 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:23,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:34:23,691 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-17 14:34:23,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:23,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1494557054, now seen corresponding path program 1 times [2025-03-17 14:34:23,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:23,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310845558] [2025-03-17 14:34:23,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:23,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:23,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:34:23,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:34:23,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:23,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:23,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:23,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310845558] [2025-03-17 14:34:23,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310845558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:23,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:23,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:23,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350260470] [2025-03-17 14:34:23,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:23,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:23,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:23,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:23,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:23,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-03-17 14:34:23,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:23,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:23,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-03-17 14:34:23,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:23,914 INFO L124 PetriNetUnfolderBase]: 1307/2520 cut-off events. [2025-03-17 14:34:23,914 INFO L125 PetriNetUnfolderBase]: For 742/761 co-relation queries the response was YES. [2025-03-17 14:34:23,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5684 conditions, 2520 events. 1307/2520 cut-off events. For 742/761 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 14186 event pairs, 472 based on Foata normal form. 91/2538 useless extension candidates. Maximal degree in co-relation 5667. Up to 1421 conditions per place. [2025-03-17 14:34:23,925 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 53 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2025-03-17 14:34:23,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 73 transitions, 348 flow [2025-03-17 14:34:23,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:23,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2025-03-17 14:34:23,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-03-17 14:34:23,926 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 187 flow. Second operand 3 states and 114 transitions. [2025-03-17 14:34:23,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 73 transitions, 348 flow [2025-03-17 14:34:23,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 73 transitions, 339 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 14:34:23,929 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 194 flow [2025-03-17 14:34:23,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2025-03-17 14:34:23,929 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2025-03-17 14:34:23,929 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 194 flow [2025-03-17 14:34:23,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:23,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:23,930 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-03-17 14:34:23,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:34:23,930 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-17 14:34:23,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:23,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1972788076, now seen corresponding path program 1 times [2025-03-17 14:34:23,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:23,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393761341] [2025-03-17 14:34:23,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:23,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:23,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:34:23,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:34:23,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:23,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:24,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:24,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:24,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393761341] [2025-03-17 14:34:24,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393761341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:24,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:24,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:24,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063262595] [2025-03-17 14:34:24,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:24,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:24,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:24,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:24,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:24,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-03-17 14:34:24,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:24,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:24,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-03-17 14:34:24,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:24,172 INFO L124 PetriNetUnfolderBase]: 786/1798 cut-off events. [2025-03-17 14:34:24,172 INFO L125 PetriNetUnfolderBase]: For 675/675 co-relation queries the response was YES. [2025-03-17 14:34:24,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4086 conditions, 1798 events. 786/1798 cut-off events. For 675/675 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 9778 event pairs, 255 based on Foata normal form. 90/1843 useless extension candidates. Maximal degree in co-relation 4069. Up to 803 conditions per place. [2025-03-17 14:34:24,179 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 47 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2025-03-17 14:34:24,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 70 transitions, 344 flow [2025-03-17 14:34:24,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:24,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:24,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-03-17 14:34:24,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656 [2025-03-17 14:34:24,180 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 194 flow. Second operand 3 states and 112 transitions. [2025-03-17 14:34:24,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 70 transitions, 344 flow [2025-03-17 14:34:24,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:34:24,183 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 196 flow [2025-03-17 14:34:24,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2025-03-17 14:34:24,184 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2025-03-17 14:34:24,184 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 196 flow [2025-03-17 14:34:24,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:24,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:24,184 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] [2025-03-17 14:34:24,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:34:24,184 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-17 14:34:24,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:24,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2078782982, now seen corresponding path program 1 times [2025-03-17 14:34:24,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:24,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347111961] [2025-03-17 14:34:24,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:24,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:24,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:34:24,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:34:24,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:24,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:24,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:24,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:24,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347111961] [2025-03-17 14:34:24,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347111961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:24,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:24,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:24,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80037049] [2025-03-17 14:34:24,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:24,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:34:24,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:24,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:34:24,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:34:24,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2025-03-17 14:34:24,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:24,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:24,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2025-03-17 14:34:24,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:24,732 INFO L124 PetriNetUnfolderBase]: 1459/3168 cut-off events. [2025-03-17 14:34:24,732 INFO L125 PetriNetUnfolderBase]: For 1379/1379 co-relation queries the response was YES. [2025-03-17 14:34:24,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7579 conditions, 3168 events. 1459/3168 cut-off events. For 1379/1379 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 17382 event pairs, 480 based on Foata normal form. 0/3013 useless extension candidates. Maximal degree in co-relation 7562. Up to 941 conditions per place. [2025-03-17 14:34:24,744 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 104 selfloop transitions, 4 changer transitions 0/125 dead transitions. [2025-03-17 14:34:24,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 125 transitions, 655 flow [2025-03-17 14:34:24,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:34:24,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:34:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 206 transitions. [2025-03-17 14:34:24,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6242424242424243 [2025-03-17 14:34:24,747 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 196 flow. Second operand 5 states and 206 transitions. [2025-03-17 14:34:24,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 125 transitions, 655 flow [2025-03-17 14:34:24,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 125 transitions, 639 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:24,751 INFO L231 Difference]: Finished difference. Result has 71 places, 59 transitions, 210 flow [2025-03-17 14:34:24,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=71, PETRI_TRANSITIONS=59} [2025-03-17 14:34:24,752 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 13 predicate places. [2025-03-17 14:34:24,752 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 59 transitions, 210 flow [2025-03-17 14:34:24,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:24,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:24,752 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] [2025-03-17 14:34:24,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:34:24,752 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-17 14:34:24,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:24,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1219347405, now seen corresponding path program 1 times [2025-03-17 14:34:24,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:24,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895168969] [2025-03-17 14:34:24,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:24,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:24,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:34:24,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:34:24,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:24,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:24,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:24,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895168969] [2025-03-17 14:34:24,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895168969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:24,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:24,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:34:24,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383933097] [2025-03-17 14:34:24,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:24,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:34:24,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:24,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:34:24,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:34:24,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-03-17 14:34:24,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 59 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:24,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:24,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-03-17 14:34:24,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:25,115 INFO L124 PetriNetUnfolderBase]: 1936/4379 cut-off events. [2025-03-17 14:34:25,115 INFO L125 PetriNetUnfolderBase]: For 1735/1735 co-relation queries the response was YES. [2025-03-17 14:34:25,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10147 conditions, 4379 events. 1936/4379 cut-off events. For 1735/1735 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 27871 event pairs, 827 based on Foata normal form. 104/4358 useless extension candidates. Maximal degree in co-relation 10127. Up to 2062 conditions per place. [2025-03-17 14:34:25,131 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 83 selfloop transitions, 4 changer transitions 0/106 dead transitions. [2025-03-17 14:34:25,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 106 transitions, 543 flow [2025-03-17 14:34:25,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:34:25,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:34:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2025-03-17 14:34:25,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6553030303030303 [2025-03-17 14:34:25,132 INFO L175 Difference]: Start difference. First operand has 71 places, 59 transitions, 210 flow. Second operand 4 states and 173 transitions. [2025-03-17 14:34:25,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 106 transitions, 543 flow [2025-03-17 14:34:25,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 106 transitions, 541 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:25,136 INFO L231 Difference]: Finished difference. Result has 74 places, 60 transitions, 227 flow [2025-03-17 14:34:25,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=74, PETRI_TRANSITIONS=60} [2025-03-17 14:34:25,137 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 16 predicate places. [2025-03-17 14:34:25,137 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 60 transitions, 227 flow [2025-03-17 14:34:25,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:25,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:25,137 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-03-17 14:34:25,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:34:25,137 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-17 14:34:25,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:25,138 INFO L85 PathProgramCache]: Analyzing trace with hash 68576528, now seen corresponding path program 1 times [2025-03-17 14:34:25,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:25,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502997662] [2025-03-17 14:34:25,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:25,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:25,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 14:34:25,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:34:25,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:25,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:34:25,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [623067568] [2025-03-17 14:34:25,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:25,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:25,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:25,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:34:25,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:34:25,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 14:34:25,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:34:25,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:25,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:25,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 14:34:25,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:25,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:25,446 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:34:25,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:25,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502997662] [2025-03-17 14:34:25,447 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:34:25,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623067568] [2025-03-17 14:34:25,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623067568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:25,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:25,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:25,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798562503] [2025-03-17 14:34:25,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:25,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:34:25,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:25,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:34:25,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:34:25,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-03-17 14:34:25,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 60 transitions, 227 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:25,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:25,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-03-17 14:34:25,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:25,699 INFO L124 PetriNetUnfolderBase]: 1474/3269 cut-off events. [2025-03-17 14:34:25,700 INFO L125 PetriNetUnfolderBase]: For 2183/2185 co-relation queries the response was YES. [2025-03-17 14:34:25,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8264 conditions, 3269 events. 1474/3269 cut-off events. For 2183/2185 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 18523 event pairs, 498 based on Foata normal form. 26/3200 useless extension candidates. Maximal degree in co-relation 8243. Up to 1527 conditions per place. [2025-03-17 14:34:25,714 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 70 selfloop transitions, 3 changer transitions 0/92 dead transitions. [2025-03-17 14:34:25,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 92 transitions, 500 flow [2025-03-17 14:34:25,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:34:25,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:34:25,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2025-03-17 14:34:25,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2025-03-17 14:34:25,715 INFO L175 Difference]: Start difference. First operand has 74 places, 60 transitions, 227 flow. Second operand 4 states and 156 transitions. [2025-03-17 14:34:25,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 92 transitions, 500 flow [2025-03-17 14:34:25,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 92 transitions, 486 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-17 14:34:25,720 INFO L231 Difference]: Finished difference. Result has 76 places, 60 transitions, 230 flow [2025-03-17 14:34:25,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=76, PETRI_TRANSITIONS=60} [2025-03-17 14:34:25,721 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 18 predicate places. [2025-03-17 14:34:25,721 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 60 transitions, 230 flow [2025-03-17 14:34:25,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:25,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:25,722 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-03-17 14:34:25,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:34:25,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 14:34:25,923 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-17 14:34:25,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:25,924 INFO L85 PathProgramCache]: Analyzing trace with hash 229695334, now seen corresponding path program 1 times [2025-03-17 14:34:25,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:25,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509785143] [2025-03-17 14:34:25,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:25,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:25,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 14:34:25,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 14:34:25,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:25,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:26,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:26,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509785143] [2025-03-17 14:34:26,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509785143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:26,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:26,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:34:26,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882171455] [2025-03-17 14:34:26,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:26,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:34:26,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:26,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:34:26,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:34:26,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-03-17 14:34:26,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 60 transitions, 230 flow. Second operand has 11 states, 11 states have (on average 24.818181818181817) internal successors, (273), 11 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:26,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:26,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-03-17 14:34:26,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:27,376 INFO L124 PetriNetUnfolderBase]: 1644/3616 cut-off events. [2025-03-17 14:34:27,377 INFO L125 PetriNetUnfolderBase]: For 2078/2082 co-relation queries the response was YES. [2025-03-17 14:34:27,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8990 conditions, 3616 events. 1644/3616 cut-off events. For 2078/2082 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 20582 event pairs, 430 based on Foata normal form. 0/3532 useless extension candidates. Maximal degree in co-relation 8967. Up to 1026 conditions per place. [2025-03-17 14:34:27,390 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 141 selfloop transitions, 15 changer transitions 0/175 dead transitions. [2025-03-17 14:34:27,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 175 transitions, 964 flow [2025-03-17 14:34:27,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 14:34:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-17 14:34:27,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 436 transitions. [2025-03-17 14:34:27,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5081585081585082 [2025-03-17 14:34:27,391 INFO L175 Difference]: Start difference. First operand has 76 places, 60 transitions, 230 flow. Second operand 13 states and 436 transitions. [2025-03-17 14:34:27,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 175 transitions, 964 flow [2025-03-17 14:34:27,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 175 transitions, 956 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:34:27,399 INFO L231 Difference]: Finished difference. Result has 89 places, 68 transitions, 312 flow [2025-03-17 14:34:27,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=312, PETRI_PLACES=89, PETRI_TRANSITIONS=68} [2025-03-17 14:34:27,399 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 31 predicate places. [2025-03-17 14:34:27,400 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 68 transitions, 312 flow [2025-03-17 14:34:27,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.818181818181817) internal successors, (273), 11 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:27,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:27,400 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:27,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:34:27,400 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-17 14:34:27,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:27,401 INFO L85 PathProgramCache]: Analyzing trace with hash 567011481, now seen corresponding path program 2 times [2025-03-17 14:34:27,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:27,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900250623] [2025-03-17 14:34:27,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:34:27,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:27,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-17 14:34:27,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 31 statements. [2025-03-17 14:34:27,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:34:27,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:34:27,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:27,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900250623] [2025-03-17 14:34:27,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900250623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:27,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:27,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:34:27,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790861972] [2025-03-17 14:34:27,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:27,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:27,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:27,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:27,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:27,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-03-17 14:34:27,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 68 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:27,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:27,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-03-17 14:34:27,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:27,670 INFO L124 PetriNetUnfolderBase]: 1630/3572 cut-off events. [2025-03-17 14:34:27,670 INFO L125 PetriNetUnfolderBase]: For 2587/2598 co-relation queries the response was YES. [2025-03-17 14:34:27,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9343 conditions, 3572 events. 1630/3572 cut-off events. For 2587/2598 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 20740 event pairs, 1282 based on Foata normal form. 13/3486 useless extension candidates. Maximal degree in co-relation 9316. Up to 2802 conditions per place. [2025-03-17 14:34:27,683 INFO L140 encePairwiseOnDemand]: 64/66 looper letters, 46 selfloop transitions, 1 changer transitions 3/67 dead transitions. [2025-03-17 14:34:27,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 67 transitions, 408 flow [2025-03-17 14:34:27,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2025-03-17 14:34:27,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2025-03-17 14:34:27,685 INFO L175 Difference]: Start difference. First operand has 89 places, 68 transitions, 312 flow. Second operand 3 states and 98 transitions. [2025-03-17 14:34:27,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 67 transitions, 408 flow [2025-03-17 14:34:27,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 67 transitions, 395 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 14:34:27,689 INFO L231 Difference]: Finished difference. Result has 85 places, 64 transitions, 287 flow [2025-03-17 14:34:27,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=85, PETRI_TRANSITIONS=64} [2025-03-17 14:34:27,690 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 27 predicate places. [2025-03-17 14:34:27,690 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 64 transitions, 287 flow [2025-03-17 14:34:27,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:27,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:27,691 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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] [2025-03-17 14:34:27,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:34:27,691 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-17 14:34:27,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:27,691 INFO L85 PathProgramCache]: Analyzing trace with hash 110975537, now seen corresponding path program 1 times [2025-03-17 14:34:27,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:27,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255069688] [2025-03-17 14:34:27,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:27,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:27,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 14:34:27,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 14:34:27,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:27,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:27,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:27,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255069688] [2025-03-17 14:34:27,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255069688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:27,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:27,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:34:27,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852646469] [2025-03-17 14:34:27,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:27,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:34:27,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:27,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:34:27,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:34:27,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 66 [2025-03-17 14:34:27,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 64 transitions, 287 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:27,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:27,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 66 [2025-03-17 14:34:27,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:28,250 INFO L124 PetriNetUnfolderBase]: 1702/3617 cut-off events. [2025-03-17 14:34:28,251 INFO L125 PetriNetUnfolderBase]: For 2338/2340 co-relation queries the response was YES. [2025-03-17 14:34:28,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9455 conditions, 3617 events. 1702/3617 cut-off events. For 2338/2340 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 19198 event pairs, 945 based on Foata normal form. 36/3556 useless extension candidates. Maximal degree in co-relation 9428. Up to 1824 conditions per place. [2025-03-17 14:34:28,266 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 65 selfloop transitions, 10 changer transitions 0/89 dead transitions. [2025-03-17 14:34:28,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 89 transitions, 532 flow [2025-03-17 14:34:28,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:34:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:34:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2025-03-17 14:34:28,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47575757575757577 [2025-03-17 14:34:28,267 INFO L175 Difference]: Start difference. First operand has 85 places, 64 transitions, 287 flow. Second operand 5 states and 157 transitions. [2025-03-17 14:34:28,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 89 transitions, 532 flow [2025-03-17 14:34:28,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 89 transitions, 529 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:28,272 INFO L231 Difference]: Finished difference. Result has 85 places, 64 transitions, 306 flow [2025-03-17 14:34:28,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=306, PETRI_PLACES=85, PETRI_TRANSITIONS=64} [2025-03-17 14:34:28,272 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 27 predicate places. [2025-03-17 14:34:28,272 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 64 transitions, 306 flow [2025-03-17 14:34:28,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:28,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:28,273 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2025-03-17 14:34:28,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:34:28,274 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-17 14:34:28,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:28,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1880947508, now seen corresponding path program 1 times [2025-03-17 14:34:28,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:28,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061365981] [2025-03-17 14:34:28,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:28,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:28,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 14:34:28,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 14:34:28,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:28,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:28,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:28,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061365981] [2025-03-17 14:34:28,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061365981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:28,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:28,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:34:28,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087659013] [2025-03-17 14:34:28,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:28,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:34:28,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:28,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:34:28,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:34:28,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-03-17 14:34:28,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 64 transitions, 306 flow. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:28,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:28,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-03-17 14:34:28,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:28,665 INFO L124 PetriNetUnfolderBase]: 1748/3653 cut-off events. [2025-03-17 14:34:28,666 INFO L125 PetriNetUnfolderBase]: For 2853/2853 co-relation queries the response was YES. [2025-03-17 14:34:28,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9845 conditions, 3653 events. 1748/3653 cut-off events. For 2853/2853 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 19185 event pairs, 871 based on Foata normal form. 0/3579 useless extension candidates. Maximal degree in co-relation 9817. Up to 2112 conditions per place. [2025-03-17 14:34:28,678 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 77 selfloop transitions, 12 changer transitions 5/106 dead transitions. [2025-03-17 14:34:28,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 106 transitions, 657 flow [2025-03-17 14:34:28,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:34:28,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:34:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2025-03-17 14:34:28,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5025252525252525 [2025-03-17 14:34:28,680 INFO L175 Difference]: Start difference. First operand has 85 places, 64 transitions, 306 flow. Second operand 6 states and 199 transitions. [2025-03-17 14:34:28,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 106 transitions, 657 flow [2025-03-17 14:34:28,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 106 transitions, 649 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 14:34:28,686 INFO L231 Difference]: Finished difference. Result has 86 places, 62 transitions, 330 flow [2025-03-17 14:34:28,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=86, PETRI_TRANSITIONS=62} [2025-03-17 14:34:28,688 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 28 predicate places. [2025-03-17 14:34:28,688 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 62 transitions, 330 flow [2025-03-17 14:34:28,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:28,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:28,689 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:28,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:34:28,689 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-17 14:34:28,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:28,689 INFO L85 PathProgramCache]: Analyzing trace with hash -549409780, now seen corresponding path program 1 times [2025-03-17 14:34:28,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:28,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425241284] [2025-03-17 14:34:28,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:28,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:28,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 14:34:28,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 14:34:28,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:28,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:28,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:28,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:28,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425241284] [2025-03-17 14:34:28,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425241284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:34:28,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810179112] [2025-03-17 14:34:28,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:28,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:28,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:28,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:34:28,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:34:29,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 14:34:29,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 14:34:29,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:29,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:29,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 14:34:29,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:34:29,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:34:29,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810179112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:29,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:34:29,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2025-03-17 14:34:29,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598167298] [2025-03-17 14:34:29,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:29,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:34:29,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:29,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:34:29,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:34:29,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-03-17 14:34:29,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 62 transitions, 330 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:29,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:29,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-03-17 14:34:29,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:29,776 INFO L124 PetriNetUnfolderBase]: 1787/3918 cut-off events. [2025-03-17 14:34:29,777 INFO L125 PetriNetUnfolderBase]: For 4428/4429 co-relation queries the response was YES. [2025-03-17 14:34:29,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11008 conditions, 3918 events. 1787/3918 cut-off events. For 4428/4429 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 19797 event pairs, 615 based on Foata normal form. 12/3851 useless extension candidates. Maximal degree in co-relation 10979. Up to 1125 conditions per place. [2025-03-17 14:34:29,795 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 100 selfloop transitions, 5 changer transitions 2/120 dead transitions. [2025-03-17 14:34:29,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 120 transitions, 823 flow [2025-03-17 14:34:29,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:34:29,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:34:29,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2025-03-17 14:34:29,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-03-17 14:34:29,796 INFO L175 Difference]: Start difference. First operand has 86 places, 62 transitions, 330 flow. Second operand 5 states and 200 transitions. [2025-03-17 14:34:29,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 120 transitions, 823 flow [2025-03-17 14:34:29,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 120 transitions, 792 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:34:29,803 INFO L231 Difference]: Finished difference. Result has 86 places, 63 transitions, 334 flow [2025-03-17 14:34:29,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=334, PETRI_PLACES=86, PETRI_TRANSITIONS=63} [2025-03-17 14:34:29,804 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 28 predicate places. [2025-03-17 14:34:29,804 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 63 transitions, 334 flow [2025-03-17 14:34:29,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:29,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:29,804 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:29,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:34:30,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 14:34:30,005 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-17 14:34:30,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:30,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1205222740, now seen corresponding path program 1 times [2025-03-17 14:34:30,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:30,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805396882] [2025-03-17 14:34:30,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:30,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:30,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 14:34:30,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 14:34:30,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:30,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:34:30,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1349348443] [2025-03-17 14:34:30,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:30,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:30,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:30,055 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:34:30,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:34:30,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 14:34:30,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 14:34:30,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:30,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:30,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:34:30,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:30,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:30,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:34:34,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:34,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:34,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805396882] [2025-03-17 14:34:34,040 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:34:34,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349348443] [2025-03-17 14:34:34,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349348443] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:34:34,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:34:34,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2025-03-17 14:34:34,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410652592] [2025-03-17 14:34:34,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 14:34:34,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:34:34,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:34,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:34:34,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:34:34,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2025-03-17 14:34:34,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 63 transitions, 334 flow. Second operand has 11 states, 11 states have (on average 27.90909090909091) internal successors, (307), 11 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:34,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:34,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2025-03-17 14:34:34,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:35,628 INFO L124 PetriNetUnfolderBase]: 1754/3782 cut-off events. [2025-03-17 14:34:35,629 INFO L125 PetriNetUnfolderBase]: For 4107/4107 co-relation queries the response was YES. [2025-03-17 14:34:35,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10513 conditions, 3782 events. 1754/3782 cut-off events. For 4107/4107 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 17159 event pairs, 314 based on Foata normal form. 29/3755 useless extension candidates. Maximal degree in co-relation 10482. Up to 652 conditions per place. [2025-03-17 14:34:35,644 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 156 selfloop transitions, 10 changer transitions 4/182 dead transitions. [2025-03-17 14:34:35,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 182 transitions, 1173 flow [2025-03-17 14:34:35,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:34:35,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:34:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 365 transitions. [2025-03-17 14:34:35,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.553030303030303 [2025-03-17 14:34:35,646 INFO L175 Difference]: Start difference. First operand has 86 places, 63 transitions, 334 flow. Second operand 10 states and 365 transitions. [2025-03-17 14:34:35,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 182 transitions, 1173 flow [2025-03-17 14:34:35,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 182 transitions, 1163 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-17 14:34:35,653 INFO L231 Difference]: Finished difference. Result has 95 places, 66 transitions, 378 flow [2025-03-17 14:34:35,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=378, PETRI_PLACES=95, PETRI_TRANSITIONS=66} [2025-03-17 14:34:35,654 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 37 predicate places. [2025-03-17 14:34:35,654 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 66 transitions, 378 flow [2025-03-17 14:34:35,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.90909090909091) internal successors, (307), 11 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:35,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:35,655 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:35,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:34:35,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 14:34:35,859 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-17 14:34:35,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:35,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1117832190, now seen corresponding path program 1 times [2025-03-17 14:34:35,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:35,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563824625] [2025-03-17 14:34:35,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:35,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:35,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 14:34:35,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 14:34:35,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:35,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 14:34:35,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [985156386] [2025-03-17 14:34:35,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:35,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:35,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:35,913 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:34:35,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:34:35,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 14:34:36,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 14:34:36,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:36,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:36,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 14:34:36,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:36,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 14:34:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:34:36,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:34:36,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 97 [2025-03-17 14:34:36,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:34:36,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 97 treesize of output 274 [2025-03-17 14:34:37,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:34:37,200 INFO L349 Elim1Store]: treesize reduction 202, result has 17.6 percent of original size [2025-03-17 14:34:37,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 263 treesize of output 301 [2025-03-17 14:34:37,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:34:37,514 INFO L349 Elim1Store]: treesize reduction 139, result has 27.2 percent of original size [2025-03-17 14:34:37,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 310 treesize of output 303 [2025-03-17 14:34:37,728 INFO L349 Elim1Store]: treesize reduction 26, result has 55.9 percent of original size [2025-03-17 14:34:37,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 115 [2025-03-17 14:34:37,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:34:37,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 79 [2025-03-17 14:34:41,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:34:41,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:41,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563824625] [2025-03-17 14:34:41,684 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 14:34:41,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985156386] [2025-03-17 14:34:41,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985156386] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:34:41,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:34:41,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2025-03-17 14:34:41,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147980103] [2025-03-17 14:34:41,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 14:34:41,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 14:34:41,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:41,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 14:34:41,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2025-03-17 14:34:42,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 66 [2025-03-17 14:34:42,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 66 transitions, 378 flow. Second operand has 28 states, 28 states have (on average 22.0) internal successors, (616), 28 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:42,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:42,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 66 [2025-03-17 14:34:42,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:35:29,978 WARN L286 SmtUtils]: Spent 46.17s on a formula simplification. DAG size of input: 115 DAG size of output: 113 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)