./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 e2fb8bed 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-?-e2fb8be-m [2025-03-09 01:31:21,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:31:21,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:31:21,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:31:21,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:31:21,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:31:21,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:31:21,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:31:21,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:31:21,285 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:31:21,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:31:21,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:31:21,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:31:21,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:31:21,285 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:31:21,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:31:21,285 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:31:21,285 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:31:21,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:31:21,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:31:21,285 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:31:21,285 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:31:21,286 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:31:21,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:31:21,286 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:31:21,286 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:31:21,286 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:31:21,286 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:31:21,286 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:31:21,286 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:31:21,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:31:21,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:31:21,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:31:21,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:31:21,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:31:21,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:31:21,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:31:21,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:31:21,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:31:21,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:31:21,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:31:21,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:31:21,287 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-09 01:31:21,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:31:21,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:31:21,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:31:21,539 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:31:21,539 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:31:21,541 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-09 01:31:22,655 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626275184/6453f8e1949a4164b6de27f715d7ea89/FLAG24bbcd26f [2025-03-09 01:31:22,895 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:31:22,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2025-03-09 01:31:22,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626275184/6453f8e1949a4164b6de27f715d7ea89/FLAG24bbcd26f [2025-03-09 01:31:22,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626275184/6453f8e1949a4164b6de27f715d7ea89 [2025-03-09 01:31:22,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:31:22,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:31:22,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:31:22,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:31:22,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:31:22,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:31:22" (1/1) ... [2025-03-09 01:31:22,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ef5295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:22, skipping insertion in model container [2025-03-09 01:31:22,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:31:22" (1/1) ... [2025-03-09 01:31:22,947 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:31:23,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:31:23,221 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:31:23,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:31:23,286 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:31:23,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:23 WrapperNode [2025-03-09 01:31:23,286 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:31:23,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:31:23,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:31:23,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:31:23,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:23" (1/1) ... [2025-03-09 01:31:23,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:23" (1/1) ... [2025-03-09 01:31:23,326 INFO L138 Inliner]: procedures = 168, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2025-03-09 01:31:23,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:31:23,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:31:23,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:31:23,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:31:23,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:23" (1/1) ... [2025-03-09 01:31:23,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:23" (1/1) ... [2025-03-09 01:31:23,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:23" (1/1) ... [2025-03-09 01:31:23,360 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-09 01:31:23,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:23" (1/1) ... [2025-03-09 01:31:23,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:23" (1/1) ... [2025-03-09 01:31:23,371 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:23" (1/1) ... [2025-03-09 01:31:23,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:23" (1/1) ... [2025-03-09 01:31:23,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:23" (1/1) ... [2025-03-09 01:31:23,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:23" (1/1) ... [2025-03-09 01:31:23,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:31:23,379 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:31:23,379 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:31:23,379 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:31:23,379 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:23" (1/1) ... [2025-03-09 01:31:23,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:31:23,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:23,404 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-09 01:31:23,407 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-09 01:31:23,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:31:23,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:31:23,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:31:23,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 01:31:23,426 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-09 01:31:23,426 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-09 01:31:23,426 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-09 01:31:23,426 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-09 01:31:23,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:31:23,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:31:23,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:31:23,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 01:31:23,426 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 01:31:23,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:31:23,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 01:31:23,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 01:31:23,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-09 01:31:23,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-09 01:31:23,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:31:23,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:31:23,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:31:23,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 01:31:23,427 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 01:31:23,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:31:23,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:31:23,428 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:31:23,522 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:31:23,524 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:31:23,750 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L699: havoc removeLogElement_#t~mem2#1; [2025-03-09 01:31:23,751 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:31:23,751 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:31:23,861 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:31:23,861 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:31:23,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:31:23 BoogieIcfgContainer [2025-03-09 01:31:23,861 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:31:23,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:31:23,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:31:23,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:31:23,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:31:22" (1/3) ... [2025-03-09 01:31:23,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30784740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:31:23, skipping insertion in model container [2025-03-09 01:31:23,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:31:23" (2/3) ... [2025-03-09 01:31:23,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30784740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:31:23, skipping insertion in model container [2025-03-09 01:31:23,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:31:23" (3/3) ... [2025-03-09 01:31:23,869 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2025-03-09 01:31:23,879 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:31:23,880 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-09 01:31:23,880 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:31:23,930 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:31:23,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 66 transitions, 146 flow [2025-03-09 01:31:23,981 INFO L124 PetriNetUnfolderBase]: 12/64 cut-off events. [2025-03-09 01:31:23,983 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:31:23,986 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 185 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-09 01:31:23,986 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 66 transitions, 146 flow [2025-03-09 01:31:23,988 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 63 transitions, 138 flow [2025-03-09 01:31:23,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:31:24,005 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;@5ffad669, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:31:24,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-09 01:31:24,011 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:31:24,011 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-03-09 01:31:24,012 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:31:24,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:24,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:24,013 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-09 01:31:24,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:24,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1483671667, now seen corresponding path program 1 times [2025-03-09 01:31:24,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:24,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563515533] [2025-03-09 01:31:24,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:24,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:24,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:31:24,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:31:24,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:24,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:24,293 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-09 01:31:24,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:24,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563515533] [2025-03-09 01:31:24,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563515533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:24,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:24,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:31:24,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461970021] [2025-03-09 01:31:24,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:24,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:31:24,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:24,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:31:24,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:31:24,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2025-03-09 01:31:24,334 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-09 01:31:24,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:24,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2025-03-09 01:31:24,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:24,528 INFO L124 PetriNetUnfolderBase]: 571/1094 cut-off events. [2025-03-09 01:31:24,529 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-03-09 01:31:24,533 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 5996 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-09 01:31:24,541 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 32 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2025-03-09 01:31:24,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 182 flow [2025-03-09 01:31:24,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:31:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:31:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-03-09 01:31:24,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5252525252525253 [2025-03-09 01:31:24,553 INFO L175 Difference]: Start difference. First operand has 58 places, 63 transitions, 138 flow. Second operand 3 states and 104 transitions. [2025-03-09 01:31:24,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 182 flow [2025-03-09 01:31:24,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 174 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:31:24,561 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 110 flow [2025-03-09 01:31:24,567 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-09 01:31:24,569 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2025-03-09 01:31:24,570 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 110 flow [2025-03-09 01:31:24,571 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-09 01:31:24,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:24,571 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:24,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:31:24,571 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-09 01:31:24,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:24,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1483671666, now seen corresponding path program 1 times [2025-03-09 01:31:24,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:24,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5381958] [2025-03-09 01:31:24,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:24,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:24,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:31:24,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:31:24,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:24,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:24,845 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-09 01:31:24,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:24,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5381958] [2025-03-09 01:31:24,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5381958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:24,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:24,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:31:24,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121991914] [2025-03-09 01:31:24,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:24,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:31:24,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:24,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:31:24,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:31:24,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-03-09 01:31:24,860 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-09 01:31:24,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:24,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-03-09 01:31:24,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:25,032 INFO L124 PetriNetUnfolderBase]: 1024/1958 cut-off events. [2025-03-09 01:31:25,033 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:31:25,035 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 11140 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-09 01:31:25,041 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 59 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2025-03-09 01:31:25,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 289 flow [2025-03-09 01:31:25,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:31:25,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:31:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2025-03-09 01:31:25,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-03-09 01:31:25,043 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 110 flow. Second operand 3 states and 129 transitions. [2025-03-09 01:31:25,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 289 flow [2025-03-09 01:31:25,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:31:25,045 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 123 flow [2025-03-09 01:31:25,045 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-09 01:31:25,045 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2025-03-09 01:31:25,045 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 123 flow [2025-03-09 01:31:25,046 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-09 01:31:25,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:25,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:25,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:31:25,046 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-09 01:31:25,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:25,046 INFO L85 PathProgramCache]: Analyzing trace with hash -553749387, now seen corresponding path program 1 times [2025-03-09 01:31:25,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:25,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795099545] [2025-03-09 01:31:25,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:25,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:25,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:31:25,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:31:25,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:25,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:25,222 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-09 01:31:25,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:25,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795099545] [2025-03-09 01:31:25,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795099545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:25,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:25,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:31:25,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760797816] [2025-03-09 01:31:25,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:25,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:31:25,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:25,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:31:25,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:31:25,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2025-03-09 01:31:25,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-09 01:31:25,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:25,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2025-03-09 01:31:25,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:25,359 INFO L124 PetriNetUnfolderBase]: 1068/1989 cut-off events. [2025-03-09 01:31:25,359 INFO L125 PetriNetUnfolderBase]: For 51/53 co-relation queries the response was YES. [2025-03-09 01:31:25,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3818 conditions, 1989 events. 1068/1989 cut-off events. For 51/53 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 11046 event pairs, 822 based on Foata normal form. 0/1808 useless extension candidates. Maximal degree in co-relation 3810. Up to 1678 conditions per place. [2025-03-09 01:31:25,368 INFO L140 encePairwiseOnDemand]: 64/66 looper letters, 34 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2025-03-09 01:31:25,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 187 flow [2025-03-09 01:31:25,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:31:25,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:31:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2025-03-09 01:31:25,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2025-03-09 01:31:25,369 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 123 flow. Second operand 3 states and 98 transitions. [2025-03-09 01:31:25,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 187 flow [2025-03-09 01:31:25,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 185 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:31:25,370 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 117 flow [2025-03-09 01:31:25,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2025-03-09 01:31:25,371 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2025-03-09 01:31:25,371 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 117 flow [2025-03-09 01:31:25,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-09 01:31:25,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:25,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:25,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:31:25,371 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-09 01:31:25,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:25,372 INFO L85 PathProgramCache]: Analyzing trace with hash -552794057, now seen corresponding path program 1 times [2025-03-09 01:31:25,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:25,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660636648] [2025-03-09 01:31:25,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:25,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:25,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:31:25,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:31:25,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:25,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:25,480 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-09 01:31:25,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:25,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660636648] [2025-03-09 01:31:25,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660636648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:25,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:25,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:31:25,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048245458] [2025-03-09 01:31:25,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:25,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:31:25,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:25,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:31:25,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:31:25,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-03-09 01:31:25,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-09 01:31:25,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:25,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-03-09 01:31:25,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:25,620 INFO L124 PetriNetUnfolderBase]: 739/1428 cut-off events. [2025-03-09 01:31:25,620 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-09 01:31:25,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2692 conditions, 1428 events. 739/1428 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7495 event pairs, 204 based on Foata normal form. 23/1363 useless extension candidates. Maximal degree in co-relation 2683. Up to 770 conditions per place. [2025-03-09 01:31:25,628 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 52 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2025-03-09 01:31:25,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 270 flow [2025-03-09 01:31:25,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:31:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:31:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2025-03-09 01:31:25,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6262626262626263 [2025-03-09 01:31:25,629 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 117 flow. Second operand 3 states and 124 transitions. [2025-03-09 01:31:25,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 270 flow [2025-03-09 01:31:25,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 269 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:31:25,630 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 124 flow [2025-03-09 01:31:25,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-03-09 01:31:25,631 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -5 predicate places. [2025-03-09 01:31:25,631 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 124 flow [2025-03-09 01:31:25,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-09 01:31:25,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:25,631 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:25,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:31:25,631 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-09 01:31:25,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:25,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1267354103, now seen corresponding path program 1 times [2025-03-09 01:31:25,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:25,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773066208] [2025-03-09 01:31:25,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:25,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:25,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:31:25,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:31:25,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:25,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:25,667 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-09 01:31:25,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:25,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773066208] [2025-03-09 01:31:25,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773066208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:25,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:25,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:31:25,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023473785] [2025-03-09 01:31:25,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:25,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:31:25,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:25,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:31:25,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:31:25,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-03-09 01:31:25,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 124 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-09 01:31:25,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:25,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-03-09 01:31:25,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:25,856 INFO L124 PetriNetUnfolderBase]: 1181/2256 cut-off events. [2025-03-09 01:31:25,856 INFO L125 PetriNetUnfolderBase]: For 224/242 co-relation queries the response was YES. [2025-03-09 01:31:25,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4406 conditions, 2256 events. 1181/2256 cut-off events. For 224/242 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 13577 event pairs, 565 based on Foata normal form. 24/2104 useless extension candidates. Maximal degree in co-relation 4395. Up to 1235 conditions per place. [2025-03-09 01:31:25,866 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 56 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-03-09 01:31:25,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 298 flow [2025-03-09 01:31:25,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:31:25,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:31:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-03-09 01:31:25,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6414141414141414 [2025-03-09 01:31:25,868 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 124 flow. Second operand 3 states and 127 transitions. [2025-03-09 01:31:25,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 298 flow [2025-03-09 01:31:25,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:31:25,870 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 132 flow [2025-03-09 01:31:25,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2025-03-09 01:31:25,871 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2025-03-09 01:31:25,871 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 132 flow [2025-03-09 01:31:25,871 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-09 01:31:25,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:25,871 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:25,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:31:25,872 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-09 01:31:25,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:25,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1629164530, now seen corresponding path program 1 times [2025-03-09 01:31:25,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:25,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470539098] [2025-03-09 01:31:25,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:25,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:25,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:31:25,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:31:25,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:25,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:25,928 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-09 01:31:25,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:25,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470539098] [2025-03-09 01:31:25,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470539098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:25,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:25,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:31:25,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632409701] [2025-03-09 01:31:25,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:25,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:31:25,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:25,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:31:25,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:31:25,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-03-09 01:31:25,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 132 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-09 01:31:25,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:25,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-03-09 01:31:25,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:26,115 INFO L124 PetriNetUnfolderBase]: 1071/2133 cut-off events. [2025-03-09 01:31:26,116 INFO L125 PetriNetUnfolderBase]: For 202/218 co-relation queries the response was YES. [2025-03-09 01:31:26,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4230 conditions, 2133 events. 1071/2133 cut-off events. For 202/218 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 12166 event pairs, 502 based on Foata normal form. 47/2072 useless extension candidates. Maximal degree in co-relation 4219. Up to 903 conditions per place. [2025-03-09 01:31:26,126 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 53 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2025-03-09 01:31:26,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 302 flow [2025-03-09 01:31:26,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:31:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:31:26,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-03-09 01:31:26,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2025-03-09 01:31:26,128 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 132 flow. Second operand 3 states and 123 transitions. [2025-03-09 01:31:26,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 302 flow [2025-03-09 01:31:26,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:31:26,131 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 145 flow [2025-03-09 01:31:26,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2025-03-09 01:31:26,131 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -2 predicate places. [2025-03-09 01:31:26,131 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 145 flow [2025-03-09 01:31:26,132 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-09 01:31:26,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:26,132 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:26,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:31:26,132 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-09 01:31:26,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:26,132 INFO L85 PathProgramCache]: Analyzing trace with hash 190913853, now seen corresponding path program 1 times [2025-03-09 01:31:26,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:26,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776999480] [2025-03-09 01:31:26,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:26,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:26,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:31:26,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:31:26,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:26,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:26,253 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-09 01:31:26,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:26,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776999480] [2025-03-09 01:31:26,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776999480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:26,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:26,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:31:26,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939639121] [2025-03-09 01:31:26,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:26,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:31:26,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:26,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:31:26,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:31:26,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-03-09 01:31:26,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 145 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-09 01:31:26,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:26,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-03-09 01:31:26,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:26,543 INFO L124 PetriNetUnfolderBase]: 1069/2029 cut-off events. [2025-03-09 01:31:26,543 INFO L125 PetriNetUnfolderBase]: For 304/317 co-relation queries the response was YES. [2025-03-09 01:31:26,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4226 conditions, 2029 events. 1069/2029 cut-off events. For 304/317 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 11268 event pairs, 470 based on Foata normal form. 0/1881 useless extension candidates. Maximal degree in co-relation 4213. Up to 1334 conditions per place. [2025-03-09 01:31:26,550 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 87 selfloop transitions, 7 changer transitions 0/110 dead transitions. [2025-03-09 01:31:26,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 110 transitions, 469 flow [2025-03-09 01:31:26,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:31:26,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:31:26,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 247 transitions. [2025-03-09 01:31:26,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5346320346320347 [2025-03-09 01:31:26,551 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 145 flow. Second operand 7 states and 247 transitions. [2025-03-09 01:31:26,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 110 transitions, 469 flow [2025-03-09 01:31:26,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 110 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:31:26,553 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 187 flow [2025-03-09 01:31:26,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=187, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2025-03-09 01:31:26,554 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2025-03-09 01:31:26,554 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 187 flow [2025-03-09 01:31:26,554 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-09 01:31:26,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:26,554 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-09 01:31:26,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:31:26,555 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-09 01:31:26,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:26,555 INFO L85 PathProgramCache]: Analyzing trace with hash 421030065, now seen corresponding path program 1 times [2025-03-09 01:31:26,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:26,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196961016] [2025-03-09 01:31:26,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:26,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:26,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:31:26,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:31:26,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:26,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:26,594 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-09 01:31:26,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:26,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196961016] [2025-03-09 01:31:26,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196961016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:26,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:26,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:31:26,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261019067] [2025-03-09 01:31:26,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:26,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:31:26,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:26,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:31:26,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:31:26,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-03-09 01:31:26,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 187 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-09 01:31:26,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:26,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-03-09 01:31:26,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:26,859 INFO L124 PetriNetUnfolderBase]: 1714/3375 cut-off events. [2025-03-09 01:31:26,859 INFO L125 PetriNetUnfolderBase]: For 899/942 co-relation queries the response was YES. [2025-03-09 01:31:26,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7374 conditions, 3375 events. 1714/3375 cut-off events. For 899/942 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 21396 event pairs, 797 based on Foata normal form. 75/3295 useless extension candidates. Maximal degree in co-relation 7357. Up to 1698 conditions per place. [2025-03-09 01:31:26,874 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 69 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2025-03-09 01:31:26,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 448 flow [2025-03-09 01:31:26,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:31:26,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:31:26,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-03-09 01:31:26,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6414141414141414 [2025-03-09 01:31:26,875 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 187 flow. Second operand 3 states and 127 transitions. [2025-03-09 01:31:26,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 448 flow [2025-03-09 01:31:26,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 89 transitions, 436 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:31:26,881 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 193 flow [2025-03-09 01:31:26,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2025-03-09 01:31:26,883 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2025-03-09 01:31:26,883 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 193 flow [2025-03-09 01:31:26,884 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-09 01:31:26,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:26,884 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-09 01:31:26,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:31:26,884 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-09 01:31:26,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:26,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1300819267, now seen corresponding path program 1 times [2025-03-09 01:31:26,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:26,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408012120] [2025-03-09 01:31:26,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:26,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:26,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:31:26,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:31:26,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:26,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:26,922 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-09 01:31:26,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:26,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408012120] [2025-03-09 01:31:26,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408012120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:26,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:26,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:31:26,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549824889] [2025-03-09 01:31:26,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:26,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:31:26,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:26,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:31:26,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:31:26,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-03-09 01:31:26,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 193 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-09 01:31:26,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:26,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-03-09 01:31:26,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:27,124 INFO L124 PetriNetUnfolderBase]: 1328/2547 cut-off events. [2025-03-09 01:31:27,124 INFO L125 PetriNetUnfolderBase]: For 740/759 co-relation queries the response was YES. [2025-03-09 01:31:27,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5785 conditions, 2547 events. 1328/2547 cut-off events. For 740/759 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 14460 event pairs, 487 based on Foata normal form. 91/2571 useless extension candidates. Maximal degree in co-relation 5767. Up to 1421 conditions per place. [2025-03-09 01:31:27,132 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 54 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2025-03-09 01:31:27,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 74 transitions, 356 flow [2025-03-09 01:31:27,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:31:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:31:27,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2025-03-09 01:31:27,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5808080808080808 [2025-03-09 01:31:27,134 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 193 flow. Second operand 3 states and 115 transitions. [2025-03-09 01:31:27,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 74 transitions, 356 flow [2025-03-09 01:31:27,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 74 transitions, 347 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:31:27,137 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 200 flow [2025-03-09 01:31:27,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2025-03-09 01:31:27,139 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2025-03-09 01:31:27,139 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 200 flow [2025-03-09 01:31:27,139 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-09 01:31:27,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:27,139 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-09 01:31:27,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:31:27,139 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-09 01:31:27,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:27,139 INFO L85 PathProgramCache]: Analyzing trace with hash -830414537, now seen corresponding path program 1 times [2025-03-09 01:31:27,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:27,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397244371] [2025-03-09 01:31:27,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:27,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:27,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:31:27,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:31:27,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:27,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:27,224 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-09 01:31:27,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:27,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397244371] [2025-03-09 01:31:27,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397244371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:27,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:27,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:31:27,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061235795] [2025-03-09 01:31:27,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:27,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:31:27,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:27,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:31:27,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:31:27,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-03-09 01:31:27,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 200 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-09 01:31:27,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:27,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-03-09 01:31:27,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:27,373 INFO L124 PetriNetUnfolderBase]: 804/1816 cut-off events. [2025-03-09 01:31:27,374 INFO L125 PetriNetUnfolderBase]: For 673/673 co-relation queries the response was YES. [2025-03-09 01:31:27,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4151 conditions, 1816 events. 804/1816 cut-off events. For 673/673 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9932 event pairs, 255 based on Foata normal form. 92/1863 useless extension candidates. Maximal degree in co-relation 4133. Up to 821 conditions per place. [2025-03-09 01:31:27,380 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 48 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2025-03-09 01:31:27,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 71 transitions, 352 flow [2025-03-09 01:31:27,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:31:27,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:31:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-03-09 01:31:27,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2025-03-09 01:31:27,382 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 200 flow. Second operand 3 states and 113 transitions. [2025-03-09 01:31:27,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 71 transitions, 352 flow [2025-03-09 01:31:27,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 71 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:31:27,385 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 202 flow [2025-03-09 01:31:27,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2025-03-09 01:31:27,388 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2025-03-09 01:31:27,388 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 202 flow [2025-03-09 01:31:27,388 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-09 01:31:27,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:27,388 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-09 01:31:27,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:31:27,388 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-09 01:31:27,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:27,389 INFO L85 PathProgramCache]: Analyzing trace with hash -143705222, now seen corresponding path program 1 times [2025-03-09 01:31:27,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:27,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766564805] [2025-03-09 01:31:27,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:27,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:27,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:31:27,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:31:27,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:27,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:27,651 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-09 01:31:27,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:27,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766564805] [2025-03-09 01:31:27,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766564805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:27,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:27,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:31:27,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942230304] [2025-03-09 01:31:27,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:27,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:31:27,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:27,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:31:27,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:31:27,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2025-03-09 01:31:27,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 202 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-09 01:31:27,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:27,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2025-03-09 01:31:27,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:27,985 INFO L124 PetriNetUnfolderBase]: 1502/3217 cut-off events. [2025-03-09 01:31:27,985 INFO L125 PetriNetUnfolderBase]: For 1373/1373 co-relation queries the response was YES. [2025-03-09 01:31:27,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7730 conditions, 3217 events. 1502/3217 cut-off events. For 1373/1373 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 18001 event pairs, 492 based on Foata normal form. 0/3068 useless extension candidates. Maximal degree in co-relation 7712. Up to 959 conditions per place. [2025-03-09 01:31:27,998 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 107 selfloop transitions, 4 changer transitions 0/128 dead transitions. [2025-03-09 01:31:27,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 128 transitions, 675 flow [2025-03-09 01:31:27,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:31:27,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:31:27,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 209 transitions. [2025-03-09 01:31:27,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-03-09 01:31:27,999 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 202 flow. Second operand 5 states and 209 transitions. [2025-03-09 01:31:27,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 128 transitions, 675 flow [2025-03-09 01:31:28,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 128 transitions, 659 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:31:28,003 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 216 flow [2025-03-09 01:31:28,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=72, PETRI_TRANSITIONS=60} [2025-03-09 01:31:28,003 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2025-03-09 01:31:28,003 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 216 flow [2025-03-09 01:31:28,004 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-09 01:31:28,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:28,004 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-09 01:31:28,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:31:28,004 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-09 01:31:28,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:28,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1425936795, now seen corresponding path program 1 times [2025-03-09 01:31:28,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:28,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485623599] [2025-03-09 01:31:28,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:28,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:28,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:31:28,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:31:28,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:28,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:28,039 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-09 01:31:28,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:28,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485623599] [2025-03-09 01:31:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485623599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:28,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:28,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:31:28,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226578946] [2025-03-09 01:31:28,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:28,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:31:28,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:28,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:31:28,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:31:28,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-03-09 01:31:28,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 216 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-09 01:31:28,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:28,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-03-09 01:31:28,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:28,369 INFO L124 PetriNetUnfolderBase]: 2031/4470 cut-off events. [2025-03-09 01:31:28,369 INFO L125 PetriNetUnfolderBase]: For 1733/1735 co-relation queries the response was YES. [2025-03-09 01:31:28,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10412 conditions, 4470 events. 2031/4470 cut-off events. For 1733/1735 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 28636 event pairs, 823 based on Foata normal form. 106/4437 useless extension candidates. Maximal degree in co-relation 10391. Up to 2125 conditions per place. [2025-03-09 01:31:28,382 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 85 selfloop transitions, 4 changer transitions 0/108 dead transitions. [2025-03-09 01:31:28,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 557 flow [2025-03-09 01:31:28,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:31:28,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:31:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2025-03-09 01:31:28,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6628787878787878 [2025-03-09 01:31:28,384 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 216 flow. Second operand 4 states and 175 transitions. [2025-03-09 01:31:28,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 108 transitions, 557 flow [2025-03-09 01:31:28,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 108 transitions, 555 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:31:28,389 INFO L231 Difference]: Finished difference. Result has 75 places, 61 transitions, 233 flow [2025-03-09 01:31:28,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2025-03-09 01:31:28,390 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2025-03-09 01:31:28,390 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 233 flow [2025-03-09 01:31:28,390 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-09 01:31:28,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:28,390 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-09 01:31:28,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:31:28,390 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-09 01:31:28,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:28,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1757070241, now seen corresponding path program 1 times [2025-03-09 01:31:28,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:28,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605116398] [2025-03-09 01:31:28,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:28,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:28,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:31:28,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:31:28,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:28,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:31:28,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53349036] [2025-03-09 01:31:28,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:28,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:28,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:28,422 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-09 01:31:28,424 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-09 01:31:28,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:31:28,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:31:28,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:28,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:28,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:31:28,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:28,672 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-09 01:31:28,673 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:31:28,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:28,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605116398] [2025-03-09 01:31:28,673 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:31:28,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53349036] [2025-03-09 01:31:28,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53349036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:28,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:28,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:31:28,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380313588] [2025-03-09 01:31:28,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:28,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:31:28,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:28,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:31:28,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:31:28,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-03-09 01:31:28,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 233 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-09 01:31:28,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:28,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-03-09 01:31:28,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:28,944 INFO L124 PetriNetUnfolderBase]: 1515/3320 cut-off events. [2025-03-09 01:31:28,944 INFO L125 PetriNetUnfolderBase]: For 2183/2185 co-relation queries the response was YES. [2025-03-09 01:31:28,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8417 conditions, 3320 events. 1515/3320 cut-off events. For 2183/2185 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 19131 event pairs, 510 based on Foata normal form. 26/3257 useless extension candidates. Maximal degree in co-relation 8395. Up to 1576 conditions per place. [2025-03-09 01:31:28,956 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 71 selfloop transitions, 3 changer transitions 0/93 dead transitions. [2025-03-09 01:31:28,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 93 transitions, 508 flow [2025-03-09 01:31:28,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:31:28,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:31:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 157 transitions. [2025-03-09 01:31:28,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5946969696969697 [2025-03-09 01:31:28,958 INFO L175 Difference]: Start difference. First operand has 75 places, 61 transitions, 233 flow. Second operand 4 states and 157 transitions. [2025-03-09 01:31:28,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 93 transitions, 508 flow [2025-03-09 01:31:28,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 93 transitions, 494 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-09 01:31:28,962 INFO L231 Difference]: Finished difference. Result has 77 places, 61 transitions, 236 flow [2025-03-09 01:31:28,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=77, PETRI_TRANSITIONS=61} [2025-03-09 01:31:28,963 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2025-03-09 01:31:28,963 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 236 flow [2025-03-09 01:31:28,963 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-09 01:31:28,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:28,963 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-09 01:31:28,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:31:29,164 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,SelfDestructingSolverStorable12 [2025-03-09 01:31:29,164 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-09 01:31:29,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:29,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1268443680, now seen corresponding path program 1 times [2025-03-09 01:31:29,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:29,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336122516] [2025-03-09 01:31:29,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:29,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:29,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:31:29,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:31:29,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:29,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:29,829 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-09 01:31:29,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:29,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336122516] [2025-03-09 01:31:29,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336122516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:29,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:29,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:31:29,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382706146] [2025-03-09 01:31:29,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:29,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:31:29,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:29,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:31:29,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:31:29,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 66 [2025-03-09 01:31:29,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 236 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-09 01:31:29,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:29,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 66 [2025-03-09 01:31:29,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:30,684 INFO L124 PetriNetUnfolderBase]: 1758/3830 cut-off events. [2025-03-09 01:31:30,684 INFO L125 PetriNetUnfolderBase]: For 2130/2134 co-relation queries the response was YES. [2025-03-09 01:31:30,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9569 conditions, 3830 events. 1758/3830 cut-off events. For 2130/2134 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 22522 event pairs, 470 based on Foata normal form. 0/3734 useless extension candidates. Maximal degree in co-relation 9545. Up to 1068 conditions per place. [2025-03-09 01:31:30,699 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 146 selfloop transitions, 16 changer transitions 0/181 dead transitions. [2025-03-09 01:31:30,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 181 transitions, 1003 flow [2025-03-09 01:31:30,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:31:30,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:31:30,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 442 transitions. [2025-03-09 01:31:30,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-03-09 01:31:30,701 INFO L175 Difference]: Start difference. First operand has 77 places, 61 transitions, 236 flow. Second operand 13 states and 442 transitions. [2025-03-09 01:31:30,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 181 transitions, 1003 flow [2025-03-09 01:31:30,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 181 transitions, 995 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:31:30,705 INFO L231 Difference]: Finished difference. Result has 90 places, 70 transitions, 326 flow [2025-03-09 01:31:30,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=326, PETRI_PLACES=90, PETRI_TRANSITIONS=70} [2025-03-09 01:31:30,706 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 32 predicate places. [2025-03-09 01:31:30,706 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 70 transitions, 326 flow [2025-03-09 01:31:30,706 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-09 01:31:30,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:30,706 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-09 01:31:30,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:31:30,706 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-09 01:31:30,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:30,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1608177319, now seen corresponding path program 2 times [2025-03-09 01:31:30,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:30,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63455274] [2025-03-09 01:31:30,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:31:30,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:30,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-09 01:31:30,717 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 31 statements. [2025-03-09 01:31:30,717 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:31:30,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:30,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:31:30,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:30,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63455274] [2025-03-09 01:31:30,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63455274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:30,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:30,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:31:30,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802935912] [2025-03-09 01:31:30,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:30,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:31:30,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:30,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:31:30,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:31:30,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-03-09 01:31:30,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 70 transitions, 326 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-09 01:31:30,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:30,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-03-09 01:31:30,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:30,968 INFO L124 PetriNetUnfolderBase]: 1744/3786 cut-off events. [2025-03-09 01:31:30,968 INFO L125 PetriNetUnfolderBase]: For 2667/2678 co-relation queries the response was YES. [2025-03-09 01:31:30,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9954 conditions, 3786 events. 1744/3786 cut-off events. For 2667/2678 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 22653 event pairs, 1360 based on Foata normal form. 13/3688 useless extension candidates. Maximal degree in co-relation 9926. Up to 2988 conditions per place. [2025-03-09 01:31:30,980 INFO L140 encePairwiseOnDemand]: 64/66 looper letters, 48 selfloop transitions, 1 changer transitions 3/69 dead transitions. [2025-03-09 01:31:30,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 69 transitions, 426 flow [2025-03-09 01:31:30,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:31:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:31:30,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-03-09 01:31:30,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-09 01:31:30,981 INFO L175 Difference]: Start difference. First operand has 90 places, 70 transitions, 326 flow. Second operand 3 states and 99 transitions. [2025-03-09 01:31:30,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 69 transitions, 426 flow [2025-03-09 01:31:30,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 69 transitions, 413 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 01:31:30,987 INFO L231 Difference]: Finished difference. Result has 86 places, 66 transitions, 301 flow [2025-03-09 01:31:30,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=301, PETRI_PLACES=86, PETRI_TRANSITIONS=66} [2025-03-09 01:31:30,988 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 28 predicate places. [2025-03-09 01:31:30,988 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 66 transitions, 301 flow [2025-03-09 01:31:30,989 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-09 01:31:30,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:30,989 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-09 01:31:30,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:31:30,989 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-09 01:31:30,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:30,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1689142016, now seen corresponding path program 1 times [2025-03-09 01:31:30,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:30,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051319024] [2025-03-09 01:31:30,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:30,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:30,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:31:31,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:31:31,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:31,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:31,236 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-09 01:31:31,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:31,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051319024] [2025-03-09 01:31:31,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051319024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:31,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:31,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:31:31,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214810063] [2025-03-09 01:31:31,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:31,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:31:31,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:31,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:31:31,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:31:31,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 66 [2025-03-09 01:31:31,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 66 transitions, 301 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-09 01:31:31,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:31,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 66 [2025-03-09 01:31:31,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:31,648 INFO L124 PetriNetUnfolderBase]: 2258/4737 cut-off events. [2025-03-09 01:31:31,649 INFO L125 PetriNetUnfolderBase]: For 2893/2895 co-relation queries the response was YES. [2025-03-09 01:31:31,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12349 conditions, 4737 events. 2258/4737 cut-off events. For 2893/2895 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 27579 event pairs, 1218 based on Foata normal form. 42/4638 useless extension candidates. Maximal degree in co-relation 12321. Up to 1880 conditions per place. [2025-03-09 01:31:31,667 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 76 selfloop transitions, 10 changer transitions 0/100 dead transitions. [2025-03-09 01:31:31,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 100 transitions, 608 flow [2025-03-09 01:31:31,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:31:31,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:31:31,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2025-03-09 01:31:31,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503030303030303 [2025-03-09 01:31:31,669 INFO L175 Difference]: Start difference. First operand has 86 places, 66 transitions, 301 flow. Second operand 5 states and 166 transitions. [2025-03-09 01:31:31,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 100 transitions, 608 flow [2025-03-09 01:31:31,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 100 transitions, 605 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:31:31,674 INFO L231 Difference]: Finished difference. Result has 87 places, 68 transitions, 341 flow [2025-03-09 01:31:31,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=341, PETRI_PLACES=87, PETRI_TRANSITIONS=68} [2025-03-09 01:31:31,675 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 29 predicate places. [2025-03-09 01:31:31,675 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 68 transitions, 341 flow [2025-03-09 01:31:31,675 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-09 01:31:31,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:31,675 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, 1, 1, 1] [2025-03-09 01:31:31,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:31:31,676 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-09 01:31:31,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:31,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2023382975, now seen corresponding path program 1 times [2025-03-09 01:31:31,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:31,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100600321] [2025-03-09 01:31:31,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:31,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:31,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 01:31:31,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:31:31,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:31,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:31,733 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-09 01:31:31,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:31,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100600321] [2025-03-09 01:31:31,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100600321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:31,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:31,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:31:31,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369726453] [2025-03-09 01:31:31,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:31,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:31:31,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:31,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:31:31,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:31:31,741 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2025-03-09 01:31:31,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 68 transitions, 341 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-09 01:31:31,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:31,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2025-03-09 01:31:31,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:31,958 INFO L124 PetriNetUnfolderBase]: 1700/3619 cut-off events. [2025-03-09 01:31:31,958 INFO L125 PetriNetUnfolderBase]: For 2567/2569 co-relation queries the response was YES. [2025-03-09 01:31:31,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9668 conditions, 3619 events. 1700/3619 cut-off events. For 2567/2569 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 19409 event pairs, 1354 based on Foata normal form. 36/3565 useless extension candidates. Maximal degree in co-relation 9638. Up to 2926 conditions per place. [2025-03-09 01:31:31,973 INFO L140 encePairwiseOnDemand]: 64/66 looper letters, 49 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2025-03-09 01:31:31,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 64 transitions, 416 flow [2025-03-09 01:31:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:31:31,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:31:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-03-09 01:31:31,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-03-09 01:31:31,974 INFO L175 Difference]: Start difference. First operand has 87 places, 68 transitions, 341 flow. Second operand 3 states and 96 transitions. [2025-03-09 01:31:31,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 64 transitions, 416 flow [2025-03-09 01:31:31,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 64 transitions, 398 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-09 01:31:31,980 INFO L231 Difference]: Finished difference. Result has 85 places, 64 transitions, 300 flow [2025-03-09 01:31:31,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=85, PETRI_TRANSITIONS=64} [2025-03-09 01:31:31,981 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 27 predicate places. [2025-03-09 01:31:31,981 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 64 transitions, 300 flow [2025-03-09 01:31:31,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-09 01:31:31,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:31,981 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-09 01:31:31,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:31:31,982 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-09 01:31:31,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:31,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1237635381, now seen corresponding path program 1 times [2025-03-09 01:31:31,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:31,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476999387] [2025-03-09 01:31:31,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:31,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:31,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 01:31:31,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 01:31:31,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:31,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:32,050 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-09 01:31:32,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:32,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476999387] [2025-03-09 01:31:32,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476999387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:32,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:32,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:31:32,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728427572] [2025-03-09 01:31:32,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:32,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:31:32,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:32,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:31:32,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:31:32,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-03-09 01:31:32,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 64 transitions, 300 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-09 01:31:32,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:32,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-03-09 01:31:32,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:32,401 INFO L124 PetriNetUnfolderBase]: 1748/3653 cut-off events. [2025-03-09 01:31:32,401 INFO L125 PetriNetUnfolderBase]: For 2835/2835 co-relation queries the response was YES. [2025-03-09 01:31:32,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9792 conditions, 3653 events. 1748/3653 cut-off events. For 2835/2835 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 19188 event pairs, 871 based on Foata normal form. 0/3579 useless extension candidates. Maximal degree in co-relation 9763. Up to 2112 conditions per place. [2025-03-09 01:31:32,415 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 77 selfloop transitions, 12 changer transitions 5/106 dead transitions. [2025-03-09 01:31:32,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 106 transitions, 651 flow [2025-03-09 01:31:32,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:31:32,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:31:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2025-03-09 01:31:32,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5025252525252525 [2025-03-09 01:31:32,416 INFO L175 Difference]: Start difference. First operand has 85 places, 64 transitions, 300 flow. Second operand 6 states and 199 transitions. [2025-03-09 01:31:32,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 106 transitions, 651 flow [2025-03-09 01:31:32,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 106 transitions, 650 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:31:32,423 INFO L231 Difference]: Finished difference. Result has 87 places, 62 transitions, 331 flow [2025-03-09 01:31:32,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=81, 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=331, PETRI_PLACES=87, PETRI_TRANSITIONS=62} [2025-03-09 01:31:32,423 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 29 predicate places. [2025-03-09 01:31:32,423 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 62 transitions, 331 flow [2025-03-09 01:31:32,423 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-09 01:31:32,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:32,423 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-09 01:31:32,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:31:32,423 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-09 01:31:32,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:32,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2098563028, now seen corresponding path program 1 times [2025-03-09 01:31:32,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:32,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835719370] [2025-03-09 01:31:32,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:32,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:32,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 01:31:32,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 01:31:32,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:32,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:32,672 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-09 01:31:32,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:32,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835719370] [2025-03-09 01:31:32,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835719370] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:32,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235770706] [2025-03-09 01:31:32,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:32,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:32,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:32,674 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-09 01:31:32,676 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-09 01:31:32,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 01:31:32,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 01:31:32,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:32,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:32,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:31:32,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:33,128 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-09 01:31:33,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:31:33,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235770706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:33,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:31:33,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2025-03-09 01:31:33,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830330882] [2025-03-09 01:31:33,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:33,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:31:33,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:33,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:31:33,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:31:33,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2025-03-09 01:31:33,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 62 transitions, 331 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-09 01:31:33,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:33,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2025-03-09 01:31:33,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:33,500 INFO L124 PetriNetUnfolderBase]: 1787/3918 cut-off events. [2025-03-09 01:31:33,500 INFO L125 PetriNetUnfolderBase]: For 4427/4428 co-relation queries the response was YES. [2025-03-09 01:31:33,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11009 conditions, 3918 events. 1787/3918 cut-off events. For 4427/4428 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 19852 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-09 01:31:33,517 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 100 selfloop transitions, 5 changer transitions 2/120 dead transitions. [2025-03-09 01:31:33,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 120 transitions, 824 flow [2025-03-09 01:31:33,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:31:33,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:31:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2025-03-09 01:31:33,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-03-09 01:31:33,518 INFO L175 Difference]: Start difference. First operand has 87 places, 62 transitions, 331 flow. Second operand 5 states and 200 transitions. [2025-03-09 01:31:33,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 120 transitions, 824 flow [2025-03-09 01:31:33,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 120 transitions, 793 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:31:33,526 INFO L231 Difference]: Finished difference. Result has 87 places, 63 transitions, 335 flow [2025-03-09 01:31:33,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=82, 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=335, PETRI_PLACES=87, PETRI_TRANSITIONS=63} [2025-03-09 01:31:33,526 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 29 predicate places. [2025-03-09 01:31:33,526 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 63 transitions, 335 flow [2025-03-09 01:31:33,526 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-09 01:31:33,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:33,526 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-09 01:31:33,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:31:33,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:33,727 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-09 01:31:33,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:33,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1723033863, now seen corresponding path program 1 times [2025-03-09 01:31:33,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:33,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450466913] [2025-03-09 01:31:33,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:33,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:33,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 01:31:33,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 01:31:33,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:33,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:31:33,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1158529118] [2025-03-09 01:31:33,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:33,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:33,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:33,772 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-09 01:31:33,774 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-09 01:31:33,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 01:31:33,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 01:31:33,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:33,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:33,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 01:31:33,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:34,237 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-09 01:31:34,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:37,710 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-09 01:31:37,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:37,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450466913] [2025-03-09 01:31:37,710 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 01:31:37,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158529118] [2025-03-09 01:31:37,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158529118] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:37,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:31:37,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 11 [2025-03-09 01:31:37,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097817719] [2025-03-09 01:31:37,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:37,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:31:37,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:37,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:31:37,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:31:38,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 66 [2025-03-09 01:31:38,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 63 transitions, 335 flow. Second operand has 12 states, 12 states have (on average 27.333333333333332) internal successors, (328), 12 states have internal predecessors, (328), 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-09 01:31:38,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:38,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 66 [2025-03-09 01:31:38,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:40,807 INFO L124 PetriNetUnfolderBase]: 1754/3782 cut-off events. [2025-03-09 01:31:40,807 INFO L125 PetriNetUnfolderBase]: For 4107/4107 co-relation queries the response was YES. [2025-03-09 01:31:40,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10514 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 17188 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-09 01:31:40,821 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 156 selfloop transitions, 10 changer transitions 4/182 dead transitions. [2025-03-09 01:31:40,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 182 transitions, 1174 flow [2025-03-09 01:31:40,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:31:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:31:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 365 transitions. [2025-03-09 01:31:40,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.553030303030303 [2025-03-09 01:31:40,823 INFO L175 Difference]: Start difference. First operand has 87 places, 63 transitions, 335 flow. Second operand 10 states and 365 transitions. [2025-03-09 01:31:40,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 182 transitions, 1174 flow [2025-03-09 01:31:40,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 182 transitions, 1164 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-09 01:31:40,830 INFO L231 Difference]: Finished difference. Result has 96 places, 66 transitions, 379 flow [2025-03-09 01:31:40,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=84, 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=379, PETRI_PLACES=96, PETRI_TRANSITIONS=66} [2025-03-09 01:31:40,830 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 38 predicate places. [2025-03-09 01:31:40,831 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 66 transitions, 379 flow [2025-03-09 01:31:40,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.333333333333332) internal successors, (328), 12 states have internal predecessors, (328), 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-09 01:31:40,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:40,831 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-09 01:31:40,839 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-09 01:31:41,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:41,032 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 14 more)] === [2025-03-09 01:31:41,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:41,033 INFO L85 PathProgramCache]: Analyzing trace with hash -531993780, now seen corresponding path program 1 times [2025-03-09 01:31:41,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:41,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277530405] [2025-03-09 01:31:41,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:41,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:41,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 01:31:41,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 01:31:41,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:41,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 01:31:41,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2055423426] [2025-03-09 01:31:41,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:41,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:41,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:41,093 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-09 01:31:41,095 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-09 01:31:41,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 01:31:41,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 01:31:41,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:41,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:41,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-09 01:31:41,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:41,716 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 17 treesize of output 13 [2025-03-09 01:31:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:31:41,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:42,392 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-09 01:31:42,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:31:42,413 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-09 01:31:42,767 INFO L349 Elim1Store]: treesize reduction 113, result has 27.6 percent of original size [2025-03-09 01:31:42,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 409 treesize of output 415 [2025-03-09 01:31:45,389 INFO L349 Elim1Store]: treesize reduction 1241, result has 26.7 percent of original size [2025-03-09 01:31:45,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 16 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 19 new quantified variables, introduced 81 case distinctions, treesize of input 696 treesize of output 4618 [2025-03-09 01:31:46,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:31:46,955 INFO L224 Elim1Store]: Index analysis took 286 ms [2025-03-09 01:31:46,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 14 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 464 treesize of output 2921 [2025-03-09 01:31:47,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:31:47,865 INFO L224 Elim1Store]: Index analysis took 213 ms [2025-03-09 01:31:47,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 14 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 464 treesize of output 2921 [2025-03-09 01:31:49,309 INFO L224 Elim1Store]: Index analysis took 567 ms [2025-03-09 01:31:49,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 14 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 464 treesize of output 2921 [2025-03-09 01:31:53,564 INFO L349 Elim1Store]: treesize reduction 160, result has 16.2 percent of original size [2025-03-09 01:31:53,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 199 treesize of output 177 [2025-03-09 01:31:53,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:31:53,649 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 135 treesize of output 127