./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/stack-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/stack-1.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 a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:43:09,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:43:09,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:43:09,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:43:09,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:43:09,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:43:09,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:43:09,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:43:09,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:43:09,652 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:43:09,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:43:09,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:43:09,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:43:09,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:43:09,653 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:43:09,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:43:09,653 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:43:09,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:43:09,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:43:09,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:43:09,654 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:43:09,654 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:43:09,654 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:43:09,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:43:09,654 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:43:09,654 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:43:09,654 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:43:09,654 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:43:09,654 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:43:09,655 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:43:09,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:43:09,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:43:09,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:43:09,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:43:09,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:43:09,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:43:09,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:43:09,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:43:09,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:43:09,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:43:09,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:43:09,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:43:09,656 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 -> a5e93db72222dd521789305cbf7823ac91f269c62c97020d54f95f5ba14d3fd2 [2025-03-04 09:43:09,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:43:09,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:43:09,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:43:09,871 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:43:09,871 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:43:09,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack-1.i [2025-03-04 09:43:10,989 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e61cc821d/6fcb3da9f3084b059d7f8a01893755b7/FLAG89296a4ea [2025-03-04 09:43:11,243 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:43:11,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-1.i [2025-03-04 09:43:11,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e61cc821d/6fcb3da9f3084b059d7f8a01893755b7/FLAG89296a4ea [2025-03-04 09:43:11,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e61cc821d/6fcb3da9f3084b059d7f8a01893755b7 [2025-03-04 09:43:11,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:43:11,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:43:11,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:43:11,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:43:11,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:43:11,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:43:11" (1/1) ... [2025-03-04 09:43:11,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37686b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:11, skipping insertion in model container [2025-03-04 09:43:11,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:43:11" (1/1) ... [2025-03-04 09:43:11,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:43:11,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:43:11,840 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:43:11,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:43:11,921 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:43:11,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:11 WrapperNode [2025-03-04 09:43:11,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:43:11,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:43:11,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:43:11,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:43:11,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:11" (1/1) ... [2025-03-04 09:43:11,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:11" (1/1) ... [2025-03-04 09:43:11,955 INFO L138 Inliner]: procedures = 277, calls = 36, calls flagged for inlining = 12, calls inlined = 13, statements flattened = 148 [2025-03-04 09:43:11,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:43:11,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:43:11,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:43:11,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:43:11,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:11" (1/1) ... [2025-03-04 09:43:11,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:11" (1/1) ... [2025-03-04 09:43:11,964 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:11" (1/1) ... [2025-03-04 09:43:11,977 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 1 writes are split as follows [0, 0, 1]. [2025-03-04 09:43:11,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:11" (1/1) ... [2025-03-04 09:43:11,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:11" (1/1) ... [2025-03-04 09:43:11,982 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:11" (1/1) ... [2025-03-04 09:43:11,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:11" (1/1) ... [2025-03-04 09:43:11,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:11" (1/1) ... [2025-03-04 09:43:11,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:11" (1/1) ... [2025-03-04 09:43:11,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:43:11,986 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:43:11,986 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:43:11,986 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:43:11,988 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:11" (1/1) ... [2025-03-04 09:43:11,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:43:12,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:12,015 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:43:12,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:43:12,035 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 09:43:12,035 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 09:43:12,035 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 09:43:12,035 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 09:43:12,035 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 09:43:12,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 09:43:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 09:43:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 09:43:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 09:43:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 09:43:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 09:43:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 09:43:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:43:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:43:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:43:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:43:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:43:12,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:43:12,037 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:43:12,164 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:43:12,165 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:43:12,442 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-1: pop_#res#1 := 0; [2025-03-04 09:43:12,442 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L984: havoc pop_#t~mem37#1; [2025-03-04 09:43:12,443 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: havoc pop_#t~ret36#1; [2025-03-04 09:43:12,443 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:43:12,443 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:43:12,583 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:43:12,586 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:43:12,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:43:12 BoogieIcfgContainer [2025-03-04 09:43:12,586 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:43:12,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:43:12,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:43:12,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:43:12,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:43:11" (1/3) ... [2025-03-04 09:43:12,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551c7412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:43:12, skipping insertion in model container [2025-03-04 09:43:12,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:11" (2/3) ... [2025-03-04 09:43:12,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551c7412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:43:12, skipping insertion in model container [2025-03-04 09:43:12,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:43:12" (3/3) ... [2025-03-04 09:43:12,609 INFO L128 eAbstractionObserver]: Analyzing ICFG stack-1.i [2025-03-04 09:43:12,619 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:43:12,620 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack-1.i that has 3 procedures, 46 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-04 09:43:12,620 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:43:12,678 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 09:43:12,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 54 transitions, 122 flow [2025-03-04 09:43:12,737 INFO L124 PetriNetUnfolderBase]: 9/52 cut-off events. [2025-03-04 09:43:12,739 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 09:43:12,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 52 events. 9/52 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 134 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 47. Up to 3 conditions per place. [2025-03-04 09:43:12,742 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 54 transitions, 122 flow [2025-03-04 09:43:12,744 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 51 transitions, 114 flow [2025-03-04 09:43:12,750 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:43:12,760 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;@7c256b88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:43:12,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-04 09:43:12,767 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:43:12,768 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-03-04 09:43:12,768 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 09:43:12,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:12,769 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:12,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:12,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:12,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2098191304, now seen corresponding path program 1 times [2025-03-04 09:43:12,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:12,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314782674] [2025-03-04 09:43:12,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:12,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:12,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:43:12,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:43:12,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:12,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:13,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:13,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314782674] [2025-03-04 09:43:13,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314782674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:13,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:13,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:43:13,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055187199] [2025-03-04 09:43:13,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:13,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:43:13,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:13,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:43:13,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:43:13,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-03-04 09:43:13,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:13,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:13,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-03-04 09:43:13,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:13,404 INFO L124 PetriNetUnfolderBase]: 454/865 cut-off events. [2025-03-04 09:43:13,405 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 09:43:13,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1627 conditions, 865 events. 454/865 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4307 event pairs, 242 based on Foata normal form. 90/839 useless extension candidates. Maximal degree in co-relation 1552. Up to 512 conditions per place. [2025-03-04 09:43:13,413 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 43 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2025-03-04 09:43:13,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 225 flow [2025-03-04 09:43:13,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:43:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:43:13,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-03-04 09:43:13,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5231481481481481 [2025-03-04 09:43:13,425 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 114 flow. Second operand 4 states and 113 transitions. [2025-03-04 09:43:13,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 225 flow [2025-03-04 09:43:13,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 215 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:43:13,432 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 98 flow [2025-03-04 09:43:13,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2025-03-04 09:43:13,436 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2025-03-04 09:43:13,437 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 98 flow [2025-03-04 09:43:13,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:13,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:13,438 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:13,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:43:13,438 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:13,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:13,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2098191305, now seen corresponding path program 1 times [2025-03-04 09:43:13,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:13,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110276559] [2025-03-04 09:43:13,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:13,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:13,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 09:43:13,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 09:43:13,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:13,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:13,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:13,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110276559] [2025-03-04 09:43:13,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110276559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:13,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:13,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:43:13,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614800509] [2025-03-04 09:43:13,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:13,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:43:13,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:13,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:43:13,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:43:13,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-03-04 09:43:13,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:13,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:13,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-03-04 09:43:13,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:13,958 INFO L124 PetriNetUnfolderBase]: 574/1077 cut-off events. [2025-03-04 09:43:13,958 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-04 09:43:13,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2088 conditions, 1077 events. 574/1077 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5144 event pairs, 179 based on Foata normal form. 12/951 useless extension candidates. Maximal degree in co-relation 695. Up to 755 conditions per place. [2025-03-04 09:43:13,967 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 59 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2025-03-04 09:43:13,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 293 flow [2025-03-04 09:43:13,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:43:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:43:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2025-03-04 09:43:13,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5296296296296297 [2025-03-04 09:43:13,969 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 98 flow. Second operand 5 states and 143 transitions. [2025-03-04 09:43:13,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 293 flow [2025-03-04 09:43:13,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 75 transitions, 285 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:43:13,971 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 128 flow [2025-03-04 09:43:13,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2025-03-04 09:43:13,972 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2025-03-04 09:43:13,972 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 128 flow [2025-03-04 09:43:13,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:13,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:13,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:13,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:43:13,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:13,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:13,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2004607567, now seen corresponding path program 1 times [2025-03-04 09:43:13,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:13,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032672029] [2025-03-04 09:43:13,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:13,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:13,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 09:43:13,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 09:43:13,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:13,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:14,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:14,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032672029] [2025-03-04 09:43:14,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032672029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:14,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:14,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:43:14,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856265248] [2025-03-04 09:43:14,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:14,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:43:14,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:14,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:43:14,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:43:14,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-03-04 09:43:14,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:14,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:14,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-03-04 09:43:14,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:14,278 INFO L124 PetriNetUnfolderBase]: 823/1524 cut-off events. [2025-03-04 09:43:14,279 INFO L125 PetriNetUnfolderBase]: For 258/262 co-relation queries the response was YES. [2025-03-04 09:43:14,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3219 conditions, 1524 events. 823/1524 cut-off events. For 258/262 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 7805 event pairs, 363 based on Foata normal form. 2/1388 useless extension candidates. Maximal degree in co-relation 1126. Up to 857 conditions per place. [2025-03-04 09:43:14,287 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 68 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2025-03-04 09:43:14,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 86 transitions, 370 flow [2025-03-04 09:43:14,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:43:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:43:14,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-03-04 09:43:14,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-04 09:43:14,290 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 128 flow. Second operand 4 states and 135 transitions. [2025-03-04 09:43:14,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 86 transitions, 370 flow [2025-03-04 09:43:14,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 86 transitions, 368 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:43:14,294 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 159 flow [2025-03-04 09:43:14,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-03-04 09:43:14,295 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2025-03-04 09:43:14,295 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 159 flow [2025-03-04 09:43:14,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:14,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:14,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:14,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:43:14,296 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:14,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:14,297 INFO L85 PathProgramCache]: Analyzing trace with hash -911260999, now seen corresponding path program 1 times [2025-03-04 09:43:14,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:14,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854512072] [2025-03-04 09:43:14,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:14,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:14,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:43:14,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:43:14,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:14,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:14,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:14,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:14,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854512072] [2025-03-04 09:43:14,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854512072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:14,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:14,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:43:14,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311799744] [2025-03-04 09:43:14,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:14,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:43:14,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:14,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:43:14,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:43:14,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-03-04 09:43:14,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:14,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:14,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-03-04 09:43:14,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:14,504 INFO L124 PetriNetUnfolderBase]: 957/1724 cut-off events. [2025-03-04 09:43:14,505 INFO L125 PetriNetUnfolderBase]: For 504/508 co-relation queries the response was YES. [2025-03-04 09:43:14,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4020 conditions, 1724 events. 957/1724 cut-off events. For 504/508 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8892 event pairs, 395 based on Foata normal form. 14/1589 useless extension candidates. Maximal degree in co-relation 1265. Up to 1191 conditions per place. [2025-03-04 09:43:14,514 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 55 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-03-04 09:43:14,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 328 flow [2025-03-04 09:43:14,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:43:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:43:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2025-03-04 09:43:14,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2025-03-04 09:43:14,515 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 159 flow. Second operand 3 states and 103 transitions. [2025-03-04 09:43:14,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 328 flow [2025-03-04 09:43:14,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:43:14,520 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 168 flow [2025-03-04 09:43:14,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=52, 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=168, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2025-03-04 09:43:14,521 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2025-03-04 09:43:14,521 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 168 flow [2025-03-04 09:43:14,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:14,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:14,521 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:14,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:43:14,522 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:14,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:14,522 INFO L85 PathProgramCache]: Analyzing trace with hash -429655756, now seen corresponding path program 1 times [2025-03-04 09:43:14,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:14,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547409570] [2025-03-04 09:43:14,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:14,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:14,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:43:14,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:43:14,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:14,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:14,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:14,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:14,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547409570] [2025-03-04 09:43:14,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547409570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:14,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:14,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:43:14,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139779326] [2025-03-04 09:43:14,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:14,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:43:14,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:14,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:43:14,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:43:14,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-03-04 09:43:14,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:14,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:14,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-03-04 09:43:14,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:14,717 INFO L124 PetriNetUnfolderBase]: 499/1036 cut-off events. [2025-03-04 09:43:14,717 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2025-03-04 09:43:14,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2395 conditions, 1036 events. 499/1036 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4801 event pairs, 105 based on Foata normal form. 60/1027 useless extension candidates. Maximal degree in co-relation 919. Up to 634 conditions per place. [2025-03-04 09:43:14,723 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 45 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2025-03-04 09:43:14,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 300 flow [2025-03-04 09:43:14,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:43:14,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:43:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-03-04 09:43:14,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5617283950617284 [2025-03-04 09:43:14,724 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 168 flow. Second operand 3 states and 91 transitions. [2025-03-04 09:43:14,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 300 flow [2025-03-04 09:43:14,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 292 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 09:43:14,727 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 170 flow [2025-03-04 09:43:14,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2025-03-04 09:43:14,727 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2025-03-04 09:43:14,727 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 170 flow [2025-03-04 09:43:14,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:14,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:14,729 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:14,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:43:14,729 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:14,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash -552185656, now seen corresponding path program 1 times [2025-03-04 09:43:14,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:14,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996291562] [2025-03-04 09:43:14,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:14,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:14,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:43:14,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:43:14,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:14,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:15,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:15,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996291562] [2025-03-04 09:43:15,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996291562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:15,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009802400] [2025-03-04 09:43:15,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:15,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:15,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:15,016 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:15,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:43:15,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:43:15,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:43:15,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:15,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:15,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 09:43:15,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:15,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:15,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:15,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009802400] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:15,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:15,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-03-04 09:43:15,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956989494] [2025-03-04 09:43:15,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:15,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 09:43:15,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:15,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 09:43:15,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:43:15,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2025-03-04 09:43:15,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 170 flow. Second operand has 15 states, 15 states have (on average 17.0) internal successors, (255), 15 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:15,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:15,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2025-03-04 09:43:15,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:16,318 INFO L124 PetriNetUnfolderBase]: 1740/3513 cut-off events. [2025-03-04 09:43:16,318 INFO L125 PetriNetUnfolderBase]: For 796/796 co-relation queries the response was YES. [2025-03-04 09:43:16,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8224 conditions, 3513 events. 1740/3513 cut-off events. For 796/796 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 19771 event pairs, 262 based on Foata normal form. 54/3336 useless extension candidates. Maximal degree in co-relation 2561. Up to 699 conditions per place. [2025-03-04 09:43:16,365 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 194 selfloop transitions, 26 changer transitions 0/231 dead transitions. [2025-03-04 09:43:16,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 231 transitions, 1170 flow [2025-03-04 09:43:16,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:43:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 09:43:16,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 425 transitions. [2025-03-04 09:43:16,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5246913580246914 [2025-03-04 09:43:16,367 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 170 flow. Second operand 15 states and 425 transitions. [2025-03-04 09:43:16,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 231 transitions, 1170 flow [2025-03-04 09:43:16,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 231 transitions, 1148 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:43:16,374 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 417 flow [2025-03-04 09:43:16,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=417, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2025-03-04 09:43:16,376 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 32 predicate places. [2025-03-04 09:43:16,377 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 417 flow [2025-03-04 09:43:16,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 17.0) internal successors, (255), 15 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:16,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:16,377 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] [2025-03-04 09:43:16,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 09:43:16,578 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,SelfDestructingSolverStorable5 [2025-03-04 09:43:16,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:16,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:16,579 INFO L85 PathProgramCache]: Analyzing trace with hash 189390858, now seen corresponding path program 1 times [2025-03-04 09:43:16,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:16,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223312026] [2025-03-04 09:43:16,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:16,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:16,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 09:43:16,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 09:43:16,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:16,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:16,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:16,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:16,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223312026] [2025-03-04 09:43:16,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223312026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:16,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:16,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:43:16,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613749112] [2025-03-04 09:43:16,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:16,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:43:16,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:16,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:43:16,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:43:16,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-03-04 09:43:16,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 417 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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-04 09:43:16,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:16,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-03-04 09:43:16,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:16,916 INFO L124 PetriNetUnfolderBase]: 1695/3435 cut-off events. [2025-03-04 09:43:16,917 INFO L125 PetriNetUnfolderBase]: For 1907/1907 co-relation queries the response was YES. [2025-03-04 09:43:16,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8815 conditions, 3435 events. 1695/3435 cut-off events. For 1907/1907 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 19832 event pairs, 1170 based on Foata normal form. 0/3325 useless extension candidates. Maximal degree in co-relation 7337. Up to 2532 conditions per place. [2025-03-04 09:43:16,938 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 64 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2025-03-04 09:43:16,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 79 transitions, 566 flow [2025-03-04 09:43:16,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:43:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:43:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-03-04 09:43:16,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-03-04 09:43:16,941 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 417 flow. Second operand 4 states and 96 transitions. [2025-03-04 09:43:16,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 79 transitions, 566 flow [2025-03-04 09:43:16,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 79 transitions, 556 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-03-04 09:43:16,987 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 411 flow [2025-03-04 09:43:16,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=411, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2025-03-04 09:43:16,988 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 34 predicate places. [2025-03-04 09:43:16,988 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 411 flow [2025-03-04 09:43:16,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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-04 09:43:16,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:16,988 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] [2025-03-04 09:43:16,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:43:16,988 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:16,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:16,989 INFO L85 PathProgramCache]: Analyzing trace with hash 189390859, now seen corresponding path program 1 times [2025-03-04 09:43:16,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:16,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439288728] [2025-03-04 09:43:16,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:16,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:16,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 09:43:17,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 09:43:17,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:17,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:17,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:17,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:17,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439288728] [2025-03-04 09:43:17,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439288728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:17,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:17,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:43:17,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462005648] [2025-03-04 09:43:17,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:17,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:43:17,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:17,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:43:17,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:43:17,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-03-04 09:43:17,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 411 flow. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 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-04 09:43:17,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:17,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-03-04 09:43:17,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:17,660 INFO L124 PetriNetUnfolderBase]: 1780/3579 cut-off events. [2025-03-04 09:43:17,660 INFO L125 PetriNetUnfolderBase]: For 2164/2164 co-relation queries the response was YES. [2025-03-04 09:43:17,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9297 conditions, 3579 events. 1780/3579 cut-off events. For 2164/2164 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 20401 event pairs, 436 based on Foata normal form. 0/3438 useless extension candidates. Maximal degree in co-relation 7794. Up to 2729 conditions per place. [2025-03-04 09:43:17,678 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 100 selfloop transitions, 7 changer transitions 0/118 dead transitions. [2025-03-04 09:43:17,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 118 transitions, 776 flow [2025-03-04 09:43:17,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:43:17,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:43:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2025-03-04 09:43:17,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4894179894179894 [2025-03-04 09:43:17,680 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 411 flow. Second operand 7 states and 185 transitions. [2025-03-04 09:43:17,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 118 transitions, 776 flow [2025-03-04 09:43:17,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 118 transitions, 768 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:43:17,690 INFO L231 Difference]: Finished difference. Result has 89 places, 78 transitions, 458 flow [2025-03-04 09:43:17,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=458, PETRI_PLACES=89, PETRI_TRANSITIONS=78} [2025-03-04 09:43:17,691 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 40 predicate places. [2025-03-04 09:43:17,691 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 78 transitions, 458 flow [2025-03-04 09:43:17,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 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-04 09:43:17,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:17,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:17,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:43:17,691 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:17,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:17,692 INFO L85 PathProgramCache]: Analyzing trace with hash 248668744, now seen corresponding path program 1 times [2025-03-04 09:43:17,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:17,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350775657] [2025-03-04 09:43:17,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:17,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:17,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:43:17,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:43:17,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:17,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:17,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:17,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:17,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350775657] [2025-03-04 09:43:17,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350775657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:17,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:17,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:43:17,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461778090] [2025-03-04 09:43:17,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:17,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:43:17,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:17,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:43:17,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:43:17,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-03-04 09:43:17,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 78 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:17,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:17,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-03-04 09:43:17,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:18,191 INFO L124 PetriNetUnfolderBase]: 2658/5552 cut-off events. [2025-03-04 09:43:18,192 INFO L125 PetriNetUnfolderBase]: For 3896/3896 co-relation queries the response was YES. [2025-03-04 09:43:18,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14236 conditions, 5552 events. 2658/5552 cut-off events. For 3896/3896 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 36780 event pairs, 1282 based on Foata normal form. 137/5496 useless extension candidates. Maximal degree in co-relation 12414. Up to 3123 conditions per place. [2025-03-04 09:43:18,225 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 121 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2025-03-04 09:43:18,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 135 transitions, 1088 flow [2025-03-04 09:43:18,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:43:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:43:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-03-04 09:43:18,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6419753086419753 [2025-03-04 09:43:18,227 INFO L175 Difference]: Start difference. First operand has 89 places, 78 transitions, 458 flow. Second operand 3 states and 104 transitions. [2025-03-04 09:43:18,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 135 transitions, 1088 flow [2025-03-04 09:43:18,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 135 transitions, 1072 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 09:43:18,244 INFO L231 Difference]: Finished difference. Result has 89 places, 79 transitions, 461 flow [2025-03-04 09:43:18,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=89, PETRI_TRANSITIONS=79} [2025-03-04 09:43:18,245 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 40 predicate places. [2025-03-04 09:43:18,245 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 79 transitions, 461 flow [2025-03-04 09:43:18,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:18,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:18,245 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-04 09:43:18,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:43:18,245 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:18,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:18,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1852716599, now seen corresponding path program 1 times [2025-03-04 09:43:18,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:18,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527701832] [2025-03-04 09:43:18,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:18,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:18,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 09:43:18,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 09:43:18,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:18,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:18,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:18,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527701832] [2025-03-04 09:43:18,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527701832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:18,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:18,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 09:43:18,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646041053] [2025-03-04 09:43:18,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:18,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 09:43:18,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:18,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 09:43:18,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 09:43:18,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-03-04 09:43:18,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 79 transitions, 461 flow. Second operand has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:18,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:18,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-03-04 09:43:18,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:19,693 INFO L124 PetriNetUnfolderBase]: 3462/7034 cut-off events. [2025-03-04 09:43:19,693 INFO L125 PetriNetUnfolderBase]: For 5749/5749 co-relation queries the response was YES. [2025-03-04 09:43:19,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19712 conditions, 7034 events. 3462/7034 cut-off events. For 5749/5749 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 44981 event pairs, 786 based on Foata normal form. 0/6818 useless extension candidates. Maximal degree in co-relation 16137. Up to 3938 conditions per place. [2025-03-04 09:43:19,731 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 165 selfloop transitions, 12 changer transitions 0/189 dead transitions. [2025-03-04 09:43:19,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 189 transitions, 1335 flow [2025-03-04 09:43:19,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 09:43:19,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 09:43:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 319 transitions. [2025-03-04 09:43:19,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49228395061728397 [2025-03-04 09:43:19,734 INFO L175 Difference]: Start difference. First operand has 89 places, 79 transitions, 461 flow. Second operand 12 states and 319 transitions. [2025-03-04 09:43:19,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 189 transitions, 1335 flow [2025-03-04 09:43:19,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 189 transitions, 1323 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:43:19,758 INFO L231 Difference]: Finished difference. Result has 103 places, 83 transitions, 523 flow [2025-03-04 09:43:19,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=523, PETRI_PLACES=103, PETRI_TRANSITIONS=83} [2025-03-04 09:43:19,759 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 54 predicate places. [2025-03-04 09:43:19,759 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 83 transitions, 523 flow [2025-03-04 09:43:19,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:19,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:19,759 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-04 09:43:19,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:43:19,759 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:19,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:19,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1832368666, now seen corresponding path program 1 times [2025-03-04 09:43:19,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:19,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594511833] [2025-03-04 09:43:19,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:19,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:19,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 09:43:19,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 09:43:19,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:19,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:19,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:19,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594511833] [2025-03-04 09:43:19,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594511833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:19,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:19,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:43:19,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588523946] [2025-03-04 09:43:19,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:19,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:43:19,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:19,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:43:19,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:43:19,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-03-04 09:43:19,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 83 transitions, 523 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:19,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:19,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-03-04 09:43:19,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:20,649 INFO L124 PetriNetUnfolderBase]: 4935/10401 cut-off events. [2025-03-04 09:43:20,649 INFO L125 PetriNetUnfolderBase]: For 10239/10239 co-relation queries the response was YES. [2025-03-04 09:43:20,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29154 conditions, 10401 events. 4935/10401 cut-off events. For 10239/10239 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 76419 event pairs, 1723 based on Foata normal form. 307/10393 useless extension candidates. Maximal degree in co-relation 24233. Up to 4409 conditions per place. [2025-03-04 09:43:20,709 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 189 selfloop transitions, 3 changer transitions 0/204 dead transitions. [2025-03-04 09:43:20,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 204 transitions, 1774 flow [2025-03-04 09:43:20,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:43:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:43:20,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2025-03-04 09:43:20,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 09:43:20,711 INFO L175 Difference]: Start difference. First operand has 103 places, 83 transitions, 523 flow. Second operand 4 states and 144 transitions. [2025-03-04 09:43:20,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 204 transitions, 1774 flow [2025-03-04 09:43:20,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 204 transitions, 1721 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-03-04 09:43:20,755 INFO L231 Difference]: Finished difference. Result has 100 places, 84 transitions, 519 flow [2025-03-04 09:43:20,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=519, PETRI_PLACES=100, PETRI_TRANSITIONS=84} [2025-03-04 09:43:20,756 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 51 predicate places. [2025-03-04 09:43:20,756 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 84 transitions, 519 flow [2025-03-04 09:43:20,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:20,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:20,757 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:20,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:43:20,757 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:20,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:20,758 INFO L85 PathProgramCache]: Analyzing trace with hash -621460080, now seen corresponding path program 1 times [2025-03-04 09:43:20,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:20,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155522424] [2025-03-04 09:43:20,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:20,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:20,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 09:43:20,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 09:43:20,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:20,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:20,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:20,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155522424] [2025-03-04 09:43:20,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155522424] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:20,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256458200] [2025-03-04 09:43:20,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:20,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:20,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:20,984 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:20,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:43:21,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 09:43:21,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 09:43:21,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:21,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:21,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 09:43:21,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:21,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:21,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256458200] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:21,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:21,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-03-04 09:43:21,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586753225] [2025-03-04 09:43:21,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:21,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 09:43:21,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:21,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 09:43:21,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-04 09:43:21,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2025-03-04 09:43:21,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 84 transitions, 519 flow. Second operand has 18 states, 18 states have (on average 18.166666666666668) internal successors, (327), 18 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:21,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:21,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2025-03-04 09:43:21,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:24,273 INFO L124 PetriNetUnfolderBase]: 10387/20852 cut-off events. [2025-03-04 09:43:24,273 INFO L125 PetriNetUnfolderBase]: For 25655/25663 co-relation queries the response was YES. [2025-03-04 09:43:24,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62305 conditions, 20852 events. 10387/20852 cut-off events. For 25655/25663 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 160026 event pairs, 1474 based on Foata normal form. 225/20384 useless extension candidates. Maximal degree in co-relation 48226. Up to 3457 conditions per place. [2025-03-04 09:43:24,373 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 338 selfloop transitions, 60 changer transitions 0/408 dead transitions. [2025-03-04 09:43:24,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 408 transitions, 2917 flow [2025-03-04 09:43:24,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 09:43:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 09:43:24,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 610 transitions. [2025-03-04 09:43:24,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5379188712522046 [2025-03-04 09:43:24,378 INFO L175 Difference]: Start difference. First operand has 100 places, 84 transitions, 519 flow. Second operand 21 states and 610 transitions. [2025-03-04 09:43:24,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 408 transitions, 2917 flow [2025-03-04 09:43:24,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 408 transitions, 2856 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-03-04 09:43:24,450 INFO L231 Difference]: Finished difference. Result has 131 places, 128 transitions, 1047 flow [2025-03-04 09:43:24,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1047, PETRI_PLACES=131, PETRI_TRANSITIONS=128} [2025-03-04 09:43:24,451 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 82 predicate places. [2025-03-04 09:43:24,452 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 128 transitions, 1047 flow [2025-03-04 09:43:24,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 18.166666666666668) internal successors, (327), 18 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:24,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:24,452 INFO L206 CegarLoopForPetriNet]: trace histogram [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-04 09:43:24,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 09:43:24,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 09:43:24,653 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:24,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:24,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1343212634, now seen corresponding path program 1 times [2025-03-04 09:43:24,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:24,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078014420] [2025-03-04 09:43:24,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:24,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:24,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 09:43:24,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 09:43:24,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:24,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:25,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:25,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078014420] [2025-03-04 09:43:25,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078014420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:25,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827128496] [2025-03-04 09:43:25,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:25,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:25,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:25,107 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:25,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:43:25,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 09:43:25,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 09:43:25,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:25,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:25,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 09:43:25,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:25,306 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 25 treesize of output 1 [2025-03-04 09:43:25,413 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 80 treesize of output 32 [2025-03-04 09:43:25,504 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 09:43:25,504 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:43:25,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827128496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:25,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 09:43:25,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2025-03-04 09:43:25,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479687840] [2025-03-04 09:43:25,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:25,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 09:43:25,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:25,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 09:43:25,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-03-04 09:43:25,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-03-04 09:43:25,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 128 transitions, 1047 flow. Second operand has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:25,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:25,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-03-04 09:43:25,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:29,441 INFO L124 PetriNetUnfolderBase]: 14547/29205 cut-off events. [2025-03-04 09:43:29,441 INFO L125 PetriNetUnfolderBase]: For 54179/54179 co-relation queries the response was YES. [2025-03-04 09:43:29,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94427 conditions, 29205 events. 14547/29205 cut-off events. For 54179/54179 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 241555 event pairs, 2010 based on Foata normal form. 0/28356 useless extension candidates. Maximal degree in co-relation 87891. Up to 5948 conditions per place. [2025-03-04 09:43:29,728 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 164 selfloop transitions, 142 changer transitions 0/318 dead transitions. [2025-03-04 09:43:29,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 318 transitions, 2843 flow [2025-03-04 09:43:29,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 09:43:29,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 09:43:29,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 420 transitions. [2025-03-04 09:43:29,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45751633986928103 [2025-03-04 09:43:29,730 INFO L175 Difference]: Start difference. First operand has 131 places, 128 transitions, 1047 flow. Second operand 17 states and 420 transitions. [2025-03-04 09:43:29,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 318 transitions, 2843 flow [2025-03-04 09:43:29,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 318 transitions, 2686 flow, removed 72 selfloop flow, removed 3 redundant places. [2025-03-04 09:43:29,945 INFO L231 Difference]: Finished difference. Result has 148 places, 195 transitions, 1952 flow [2025-03-04 09:43:29,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1952, PETRI_PLACES=148, PETRI_TRANSITIONS=195} [2025-03-04 09:43:29,946 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 99 predicate places. [2025-03-04 09:43:29,946 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 195 transitions, 1952 flow [2025-03-04 09:43:29,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:29,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:29,947 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, 1, 1, 1] [2025-03-04 09:43:29,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 09:43:30,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:30,151 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:30,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:30,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2009288896, now seen corresponding path program 2 times [2025-03-04 09:43:30,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:30,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067666204] [2025-03-04 09:43:30,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:43:30,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:30,161 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-04 09:43:30,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 34 statements. [2025-03-04 09:43:30,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:43:30,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:30,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 09:43:30,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:30,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067666204] [2025-03-04 09:43:30,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067666204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:30,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:30,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:43:30,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720065951] [2025-03-04 09:43:30,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:30,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:43:30,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:30,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:43:30,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:43:30,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2025-03-04 09:43:30,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 195 transitions, 1952 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:30,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:30,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2025-03-04 09:43:30,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:33,647 INFO L124 PetriNetUnfolderBase]: 14513/29061 cut-off events. [2025-03-04 09:43:33,647 INFO L125 PetriNetUnfolderBase]: For 60081/60081 co-relation queries the response was YES. [2025-03-04 09:43:33,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98402 conditions, 29061 events. 14513/29061 cut-off events. For 60081/60081 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 240615 event pairs, 10650 based on Foata normal form. 70/28292 useless extension candidates. Maximal degree in co-relation 91463. Up to 23902 conditions per place. [2025-03-04 09:43:33,953 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 231 selfloop transitions, 3 changer transitions 0/246 dead transitions. [2025-03-04 09:43:33,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 246 transitions, 2807 flow [2025-03-04 09:43:33,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:43:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:43:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2025-03-04 09:43:33,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6435185185185185 [2025-03-04 09:43:33,954 INFO L175 Difference]: Start difference. First operand has 148 places, 195 transitions, 1952 flow. Second operand 4 states and 139 transitions. [2025-03-04 09:43:33,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 246 transitions, 2807 flow [2025-03-04 09:43:34,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 246 transitions, 2614 flow, removed 96 selfloop flow, removed 1 redundant places. [2025-03-04 09:43:34,291 INFO L231 Difference]: Finished difference. Result has 151 places, 196 transitions, 1811 flow [2025-03-04 09:43:34,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1811, PETRI_PLACES=151, PETRI_TRANSITIONS=196} [2025-03-04 09:43:34,292 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 102 predicate places. [2025-03-04 09:43:34,292 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 196 transitions, 1811 flow [2025-03-04 09:43:34,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:34,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:34,292 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:34,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 09:43:34,292 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:34,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:34,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1669476744, now seen corresponding path program 1 times [2025-03-04 09:43:34,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:34,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794528552] [2025-03-04 09:43:34,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:34,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:34,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 09:43:34,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 09:43:34,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:34,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:34,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:34,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794528552] [2025-03-04 09:43:34,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794528552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:34,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470113508] [2025-03-04 09:43:34,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:34,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:34,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:34,537 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:34,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:43:34,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 09:43:34,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 09:43:34,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:34,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:34,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 09:43:34,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:34,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:35,183 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:35,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470113508] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:35,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:35,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-03-04 09:43:35,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295364325] [2025-03-04 09:43:35,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:35,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 09:43:35,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:35,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 09:43:35,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-04 09:43:35,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2025-03-04 09:43:35,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 196 transitions, 1811 flow. Second operand has 18 states, 18 states have (on average 19.333333333333332) internal successors, (348), 18 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:35,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:35,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2025-03-04 09:43:35,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:39,773 INFO L124 PetriNetUnfolderBase]: 15081/29704 cut-off events. [2025-03-04 09:43:39,773 INFO L125 PetriNetUnfolderBase]: For 53245/53255 co-relation queries the response was YES. [2025-03-04 09:43:40,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100181 conditions, 29704 events. 15081/29704 cut-off events. For 53245/53255 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 239194 event pairs, 2852 based on Foata normal form. 196/29193 useless extension candidates. Maximal degree in co-relation 93545. Up to 5039 conditions per place. [2025-03-04 09:43:40,175 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 431 selfloop transitions, 149 changer transitions 0/590 dead transitions. [2025-03-04 09:43:40,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 590 transitions, 5200 flow [2025-03-04 09:43:40,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 09:43:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 09:43:40,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 694 transitions. [2025-03-04 09:43:40,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5140740740740741 [2025-03-04 09:43:40,178 INFO L175 Difference]: Start difference. First operand has 151 places, 196 transitions, 1811 flow. Second operand 25 states and 694 transitions. [2025-03-04 09:43:40,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 590 transitions, 5200 flow [2025-03-04 09:43:40,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 590 transitions, 5151 flow, removed 21 selfloop flow, removed 2 redundant places. [2025-03-04 09:43:40,686 INFO L231 Difference]: Finished difference. Result has 185 places, 273 transitions, 2964 flow [2025-03-04 09:43:40,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1769, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2964, PETRI_PLACES=185, PETRI_TRANSITIONS=273} [2025-03-04 09:43:40,687 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 136 predicate places. [2025-03-04 09:43:40,687 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 273 transitions, 2964 flow [2025-03-04 09:43:40,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.333333333333332) internal successors, (348), 18 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:40,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:40,687 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:40,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 09:43:40,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 09:43:40,892 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:40,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:40,892 INFO L85 PathProgramCache]: Analyzing trace with hash 938623865, now seen corresponding path program 1 times [2025-03-04 09:43:40,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:40,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033890464] [2025-03-04 09:43:40,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:40,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:40,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 09:43:40,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 09:43:40,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:40,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:40,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:40,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033890464] [2025-03-04 09:43:40,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033890464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:40,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737776670] [2025-03-04 09:43:40,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:40,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:40,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:40,955 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:40,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 09:43:41,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 09:43:41,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 09:43:41,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:41,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:41,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 09:43:41,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:41,073 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:41,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:41,118 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:41,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737776670] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:41,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:41,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 09:43:41,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720077460] [2025-03-04 09:43:41,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:41,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:43:41,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:41,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:43:41,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:43:41,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-03-04 09:43:41,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 273 transitions, 2964 flow. Second operand has 8 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:41,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:41,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-03-04 09:43:41,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:47,453 INFO L124 PetriNetUnfolderBase]: 22616/45125 cut-off events. [2025-03-04 09:43:47,454 INFO L125 PetriNetUnfolderBase]: For 129351/129363 co-relation queries the response was YES. [2025-03-04 09:43:47,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163017 conditions, 45125 events. 22616/45125 cut-off events. For 129351/129363 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 393557 event pairs, 6492 based on Foata normal form. 1308/45894 useless extension candidates. Maximal degree in co-relation 149956. Up to 8308 conditions per place. [2025-03-04 09:43:48,014 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 531 selfloop transitions, 146 changer transitions 0/688 dead transitions. [2025-03-04 09:43:48,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 688 transitions, 8153 flow [2025-03-04 09:43:48,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:43:48,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:43:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 300 transitions. [2025-03-04 09:43:48,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2025-03-04 09:43:48,016 INFO L175 Difference]: Start difference. First operand has 185 places, 273 transitions, 2964 flow. Second operand 8 states and 300 transitions. [2025-03-04 09:43:48,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 688 transitions, 8153 flow [2025-03-04 09:43:48,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 688 transitions, 7654 flow, removed 201 selfloop flow, removed 9 redundant places. [2025-03-04 09:43:48,845 INFO L231 Difference]: Finished difference. Result has 189 places, 352 transitions, 4361 flow [2025-03-04 09:43:48,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=2494, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4361, PETRI_PLACES=189, PETRI_TRANSITIONS=352} [2025-03-04 09:43:48,846 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 140 predicate places. [2025-03-04 09:43:48,846 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 352 transitions, 4361 flow [2025-03-04 09:43:48,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:48,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:48,846 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:48,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 09:43:49,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 09:43:49,047 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:49,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:49,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1130191449, now seen corresponding path program 1 times [2025-03-04 09:43:49,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:49,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561954710] [2025-03-04 09:43:49,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:49,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:49,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 09:43:49,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 09:43:49,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:49,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 09:43:49,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:49,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561954710] [2025-03-04 09:43:49,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561954710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:49,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:49,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:43:49,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338786726] [2025-03-04 09:43:49,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:49,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:43:49,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:49,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:43:49,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:43:49,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-03-04 09:43:49,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 352 transitions, 4361 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:49,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:49,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-03-04 09:43:49,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:54,834 INFO L124 PetriNetUnfolderBase]: 20198/40052 cut-off events. [2025-03-04 09:43:54,834 INFO L125 PetriNetUnfolderBase]: For 135210/135267 co-relation queries the response was YES. [2025-03-04 09:43:55,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152063 conditions, 40052 events. 20198/40052 cut-off events. For 135210/135267 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 340552 event pairs, 13325 based on Foata normal form. 728/40507 useless extension candidates. Maximal degree in co-relation 139419. Up to 28639 conditions per place. [2025-03-04 09:43:55,365 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 302 selfloop transitions, 72 changer transitions 0/385 dead transitions. [2025-03-04 09:43:55,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 385 transitions, 5297 flow [2025-03-04 09:43:55,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:43:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:43:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2025-03-04 09:43:55,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2025-03-04 09:43:55,366 INFO L175 Difference]: Start difference. First operand has 189 places, 352 transitions, 4361 flow. Second operand 3 states and 98 transitions. [2025-03-04 09:43:55,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 385 transitions, 5297 flow [2025-03-04 09:43:56,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 385 transitions, 5217 flow, removed 25 selfloop flow, removed 4 redundant places. [2025-03-04 09:43:56,086 INFO L231 Difference]: Finished difference. Result has 189 places, 334 transitions, 4338 flow [2025-03-04 09:43:56,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=3867, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4338, PETRI_PLACES=189, PETRI_TRANSITIONS=334} [2025-03-04 09:43:56,087 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 140 predicate places. [2025-03-04 09:43:56,087 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 334 transitions, 4338 flow [2025-03-04 09:43:56,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:56,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:56,087 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 09:43:56,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 09:43:56,087 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:43:56,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:56,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1300202563, now seen corresponding path program 3 times [2025-03-04 09:43:56,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:56,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117369520] [2025-03-04 09:43:56,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:43:56,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:56,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 2 equivalence classes. [2025-03-04 09:43:56,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 43 statements. [2025-03-04 09:43:56,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 09:43:56,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 09:43:56,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:56,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117369520] [2025-03-04 09:43:56,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117369520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:56,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:56,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:43:56,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723488624] [2025-03-04 09:43:56,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:56,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:43:56,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:56,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:43:56,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:43:56,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 54 [2025-03-04 09:43:56,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 334 transitions, 4338 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:56,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:56,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 54 [2025-03-04 09:43:56,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:01,891 INFO L124 PetriNetUnfolderBase]: 19468/38941 cut-off events. [2025-03-04 09:44:01,891 INFO L125 PetriNetUnfolderBase]: For 136669/136705 co-relation queries the response was YES. [2025-03-04 09:44:02,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149389 conditions, 38941 events. 19468/38941 cut-off events. For 136669/136705 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 334663 event pairs, 15728 based on Foata normal form. 139/38739 useless extension candidates. Maximal degree in co-relation 133396. Up to 34286 conditions per place. [2025-03-04 09:44:02,361 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 314 selfloop transitions, 1 changer transitions 2/333 dead transitions. [2025-03-04 09:44:02,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 333 transitions, 4968 flow [2025-03-04 09:44:02,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:44:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:44:02,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-03-04 09:44:02,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2025-03-04 09:44:02,363 INFO L175 Difference]: Start difference. First operand has 189 places, 334 transitions, 4338 flow. Second operand 3 states and 76 transitions. [2025-03-04 09:44:02,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 333 transitions, 4968 flow [2025-03-04 09:44:02,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 333 transitions, 4784 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-03-04 09:44:02,918 INFO L231 Difference]: Finished difference. Result has 188 places, 331 transitions, 4149 flow [2025-03-04 09:44:02,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=4152, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4149, PETRI_PLACES=188, PETRI_TRANSITIONS=331} [2025-03-04 09:44:02,918 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 139 predicate places. [2025-03-04 09:44:02,918 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 331 transitions, 4149 flow [2025-03-04 09:44:02,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:02,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:02,919 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 09:44:02,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 09:44:02,919 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 09:44:02,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:02,919 INFO L85 PathProgramCache]: Analyzing trace with hash -384721973, now seen corresponding path program 1 times [2025-03-04 09:44:02,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:02,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084646887] [2025-03-04 09:44:02,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:44:02,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:02,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 09:44:02,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 09:44:02,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:44:02,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat