./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.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-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.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 33fa46fe030c661ecf8ddae0fe7d2b7598ab4fcf90a09fe31211d00189cd239f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:58:18,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:58:18,996 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:58:19,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:58:19,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:58:19,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:58:19,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:58:19,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:58:19,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:58:19,031 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:58:19,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:58:19,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:58:19,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:58:19,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:58:19,031 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:58:19,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:58:19,032 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:58:19,032 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:58:19,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:58:19,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:58:19,032 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:58:19,032 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:58:19,032 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:58:19,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:58:19,032 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:58:19,032 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:58:19,032 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:58:19,032 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:58:19,032 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:58:19,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:58:19,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:58:19,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:58:19,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:58:19,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:58:19,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:58:19,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:58:19,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:58:19,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:58:19,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:58:19,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:58:19,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:58:19,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:58:19,033 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 -> 33fa46fe030c661ecf8ddae0fe7d2b7598ab4fcf90a09fe31211d00189cd239f [2025-03-04 09:58:19,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:58:19,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:58:19,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:58:19,279 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:58:19,280 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:58:19,281 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-03-04 09:58:20,461 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/237b8470b/8ef35cf471bc44b4a24f82d7c03a3f98/FLAGb0d6f9275 [2025-03-04 09:58:20,755 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:58:20,756 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-03-04 09:58:20,776 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/237b8470b/8ef35cf471bc44b4a24f82d7c03a3f98/FLAGb0d6f9275 [2025-03-04 09:58:20,793 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/237b8470b/8ef35cf471bc44b4a24f82d7c03a3f98 [2025-03-04 09:58:20,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:58:20,797 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:58:20,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:58:20,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:58:20,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:58:20,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:58:20" (1/1) ... [2025-03-04 09:58:20,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@242ba109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:20, skipping insertion in model container [2025-03-04 09:58:20,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:58:20" (1/1) ... [2025-03-04 09:58:20,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:58:21,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:58:21,074 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:58:21,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:58:21,144 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:58:21,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:21 WrapperNode [2025-03-04 09:58:21,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:58:21,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:58:21,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:58:21,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:58:21,150 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:58:21" (1/1) ... [2025-03-04 09:58:21,162 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:58:21" (1/1) ... [2025-03-04 09:58:21,179 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 70 [2025-03-04 09:58:21,179 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:58:21,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:58:21,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:58:21,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:58:21,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:21" (1/1) ... [2025-03-04 09:58:21,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:21" (1/1) ... [2025-03-04 09:58:21,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:21" (1/1) ... [2025-03-04 09:58:21,208 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 09:58:21,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:21" (1/1) ... [2025-03-04 09:58:21,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:21" (1/1) ... [2025-03-04 09:58:21,214 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:21" (1/1) ... [2025-03-04 09:58:21,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:21" (1/1) ... [2025-03-04 09:58:21,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:21" (1/1) ... [2025-03-04 09:58:21,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:21" (1/1) ... [2025-03-04 09:58:21,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:58:21,219 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:58:21,220 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:58:21,220 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:58:21,220 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:21" (1/1) ... [2025-03-04 09:58:21,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:58:21,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:58:21,254 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:58:21,257 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:58:21,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:58:21,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:58:21,276 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 09:58:21,276 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 09:58:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 09:58:21,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 09:58:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 09:58:21,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 09:58:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-03-04 09:58:21,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-03-04 09:58:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:58:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:58:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:58:21,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:58:21,279 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:58:21,386 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:58:21,387 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:58:21,548 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:58:21,550 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:58:21,624 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:58:21,625 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:58:21,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:58:21 BoogieIcfgContainer [2025-03-04 09:58:21,625 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:58:21,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:58:21,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:58:21,630 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:58:21,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:58:20" (1/3) ... [2025-03-04 09:58:21,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ecb3dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:58:21, skipping insertion in model container [2025-03-04 09:58:21,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:21" (2/3) ... [2025-03-04 09:58:21,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ecb3dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:58:21, skipping insertion in model container [2025-03-04 09:58:21,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:58:21" (3/3) ... [2025-03-04 09:58:21,632 INFO L128 eAbstractionObserver]: Analyzing ICFG thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-03-04 09:58:21,642 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:58:21,643 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i that has 5 procedures, 51 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-04 09:58:21,643 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:58:21,685 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:58:21,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 52 transitions, 120 flow [2025-03-04 09:58:21,733 INFO L124 PetriNetUnfolderBase]: 2/48 cut-off events. [2025-03-04 09:58:21,735 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:58:21,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 48 events. 2/48 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2025-03-04 09:58:21,737 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 52 transitions, 120 flow [2025-03-04 09:58:21,740 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 47 transitions, 106 flow [2025-03-04 09:58:21,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:58:21,752 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;@3fe68e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:58:21,753 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 09:58:21,765 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:58:21,765 INFO L124 PetriNetUnfolderBase]: 2/45 cut-off events. [2025-03-04 09:58:21,765 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:58:21,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:21,766 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:58:21,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 09:58:21,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:21,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1753886190, now seen corresponding path program 1 times [2025-03-04 09:58:21,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:21,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123897033] [2025-03-04 09:58:21,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:58:21,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:21,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:58:21,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:58:21,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:58:21,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:22,010 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:58:22,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:22,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123897033] [2025-03-04 09:58:22,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123897033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:22,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:22,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:58:22,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611926231] [2025-03-04 09:58:22,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:22,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:58:22,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:22,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:58:22,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:58:22,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2025-03-04 09:58:22,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:58:22,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:22,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2025-03-04 09:58:22,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:25,235 INFO L124 PetriNetUnfolderBase]: 38795/54687 cut-off events. [2025-03-04 09:58:25,236 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2025-03-04 09:58:25,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106187 conditions, 54687 events. 38795/54687 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 1683. Compared 356164 event pairs, 38795 based on Foata normal form. 3888/58302 useless extension candidates. Maximal degree in co-relation 106175. Up to 50976 conditions per place. [2025-03-04 09:58:25,507 INFO L140 encePairwiseOnDemand]: 48/52 looper letters, 34 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2025-03-04 09:58:25,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 43 transitions, 170 flow [2025-03-04 09:58:25,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:58:25,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:58:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-04 09:58:25,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2025-03-04 09:58:25,526 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 106 flow. Second operand 3 states and 72 transitions. [2025-03-04 09:58:25,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 43 transitions, 170 flow [2025-03-04 09:58:25,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:58:25,536 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 94 flow [2025-03-04 09:58:25,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2025-03-04 09:58:25,542 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2025-03-04 09:58:25,543 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 94 flow [2025-03-04 09:58:25,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:58:25,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:25,543 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:58:25,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:58:25,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 09:58:25,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:25,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1753885476, now seen corresponding path program 1 times [2025-03-04 09:58:25,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:25,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154299093] [2025-03-04 09:58:25,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:58:25,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:25,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:58:25,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:58:25,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:58:25,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:25,859 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:58:25,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:25,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154299093] [2025-03-04 09:58:25,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154299093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:25,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:25,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:58:25,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973172149] [2025-03-04 09:58:25,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:25,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:58:25,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:25,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:58:25,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:58:25,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2025-03-04 09:58:25,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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:58:25,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:25,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2025-03-04 09:58:25,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:28,422 INFO L124 PetriNetUnfolderBase]: 50444/69103 cut-off events. [2025-03-04 09:58:28,423 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:58:28,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136134 conditions, 69103 events. 50444/69103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2159. Compared 441364 event pairs, 29413 based on Foata normal form. 0/67804 useless extension candidates. Maximal degree in co-relation 136128. Up to 45334 conditions per place. [2025-03-04 09:58:28,743 INFO L140 encePairwiseOnDemand]: 43/52 looper letters, 44 selfloop transitions, 5 changer transitions 74/129 dead transitions. [2025-03-04 09:58:28,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 129 transitions, 520 flow [2025-03-04 09:58:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:58:28,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:58:28,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 213 transitions. [2025-03-04 09:58:28,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5120192307692307 [2025-03-04 09:58:28,746 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 94 flow. Second operand 8 states and 213 transitions. [2025-03-04 09:58:28,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 129 transitions, 520 flow [2025-03-04 09:58:28,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 129 transitions, 519 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:58:28,751 INFO L231 Difference]: Finished difference. Result has 64 places, 45 transitions, 148 flow [2025-03-04 09:58:28,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=148, PETRI_PLACES=64, PETRI_TRANSITIONS=45} [2025-03-04 09:58:28,752 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2025-03-04 09:58:28,752 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 148 flow [2025-03-04 09:58:28,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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:58:28,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:28,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:58:28,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:58:28,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 09:58:28,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:28,753 INFO L85 PathProgramCache]: Analyzing trace with hash 398146675, now seen corresponding path program 1 times [2025-03-04 09:58:28,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:28,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980429290] [2025-03-04 09:58:28,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:58:28,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:28,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:58:28,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:58:28,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:58:28,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:28,906 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:58:28,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:28,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980429290] [2025-03-04 09:58:28,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980429290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:28,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:28,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:58:28,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675310598] [2025-03-04 09:58:28,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:28,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:58:28,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:28,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:58:28,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:58:28,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2025-03-04 09:58:28,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 45 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:58:28,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:28,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2025-03-04 09:58:28,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:31,052 INFO L124 PetriNetUnfolderBase]: 39726/54742 cut-off events. [2025-03-04 09:58:31,053 INFO L125 PetriNetUnfolderBase]: For 42225/42225 co-relation queries the response was YES. [2025-03-04 09:58:31,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139592 conditions, 54742 events. 39726/54742 cut-off events. For 42225/42225 co-relation queries the response was YES. Maximal size of possible extension queue 1657. Compared 337578 event pairs, 5997 based on Foata normal form. 1290/55975 useless extension candidates. Maximal degree in co-relation 139580. Up to 37153 conditions per place. [2025-03-04 09:58:31,389 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 55 selfloop transitions, 3 changer transitions 73/137 dead transitions. [2025-03-04 09:58:31,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 137 transitions, 706 flow [2025-03-04 09:58:31,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:58:31,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:58:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2025-03-04 09:58:31,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5659340659340659 [2025-03-04 09:58:31,390 INFO L175 Difference]: Start difference. First operand has 64 places, 45 transitions, 148 flow. Second operand 7 states and 206 transitions. [2025-03-04 09:58:31,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 137 transitions, 706 flow [2025-03-04 09:58:32,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 137 transitions, 693 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 09:58:32,303 INFO L231 Difference]: Finished difference. Result has 66 places, 45 transitions, 158 flow [2025-03-04 09:58:32,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=158, PETRI_PLACES=66, PETRI_TRANSITIONS=45} [2025-03-04 09:58:32,304 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2025-03-04 09:58:32,304 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 45 transitions, 158 flow [2025-03-04 09:58:32,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:58:32,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:32,304 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:58:32,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:58:32,305 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 09:58:32,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:32,305 INFO L85 PathProgramCache]: Analyzing trace with hash -326247365, now seen corresponding path program 1 times [2025-03-04 09:58:32,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:32,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529509389] [2025-03-04 09:58:32,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:58:32,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:32,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:58:32,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:58:32,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:58:32,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:32,460 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:58:32,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:32,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529509389] [2025-03-04 09:58:32,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529509389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:32,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:32,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:58:32,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150966096] [2025-03-04 09:58:32,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:32,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:58:32,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:32,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:58:32,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:58:32,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2025-03-04 09:58:32,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 45 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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:58:32,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:32,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2025-03-04 09:58:32,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:35,091 INFO L124 PetriNetUnfolderBase]: 46451/62847 cut-off events. [2025-03-04 09:58:35,091 INFO L125 PetriNetUnfolderBase]: For 57958/57958 co-relation queries the response was YES. [2025-03-04 09:58:35,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160689 conditions, 62847 events. 46451/62847 cut-off events. For 57958/57958 co-relation queries the response was YES. Maximal size of possible extension queue 1848. Compared 380049 event pairs, 7750 based on Foata normal form. 1080/63870 useless extension candidates. Maximal degree in co-relation 160673. Up to 24289 conditions per place. [2025-03-04 09:58:35,496 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 68 selfloop transitions, 3 changer transitions 80/157 dead transitions. [2025-03-04 09:58:35,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 157 transitions, 799 flow [2025-03-04 09:58:35,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:58:35,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:58:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 237 transitions. [2025-03-04 09:58:35,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5697115384615384 [2025-03-04 09:58:35,497 INFO L175 Difference]: Start difference. First operand has 66 places, 45 transitions, 158 flow. Second operand 8 states and 237 transitions. [2025-03-04 09:58:35,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 157 transitions, 799 flow [2025-03-04 09:58:36,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 157 transitions, 775 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-04 09:58:36,432 INFO L231 Difference]: Finished difference. Result has 69 places, 44 transitions, 161 flow [2025-03-04 09:58:36,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=161, PETRI_PLACES=69, PETRI_TRANSITIONS=44} [2025-03-04 09:58:36,433 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2025-03-04 09:58:36,433 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 44 transitions, 161 flow [2025-03-04 09:58:36,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 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:58:36,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:36,433 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:58:36,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:58:36,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 09:58:36,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:36,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1107325394, now seen corresponding path program 1 times [2025-03-04 09:58:36,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:36,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616305110] [2025-03-04 09:58:36,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:58:36,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:36,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:58:36,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:58:36,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:58:36,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:36,585 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:58:36,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:36,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616305110] [2025-03-04 09:58:36,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616305110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:36,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:36,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:58:36,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274619810] [2025-03-04 09:58:36,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:36,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:58:36,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:36,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:58:36,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:58:36,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2025-03-04 09:58:36,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 44 transitions, 161 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:36,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:36,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2025-03-04 09:58:36,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:38,261 INFO L124 PetriNetUnfolderBase]: 25037/34690 cut-off events. [2025-03-04 09:58:38,261 INFO L125 PetriNetUnfolderBase]: For 37269/37269 co-relation queries the response was YES. [2025-03-04 09:58:38,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90394 conditions, 34690 events. 25037/34690 cut-off events. For 37269/37269 co-relation queries the response was YES. Maximal size of possible extension queue 924. Compared 197032 event pairs, 11420 based on Foata normal form. 720/35403 useless extension candidates. Maximal degree in co-relation 90376. Up to 25291 conditions per place. [2025-03-04 09:58:38,530 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 58 selfloop transitions, 3 changer transitions 61/128 dead transitions. [2025-03-04 09:58:38,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 128 transitions, 659 flow [2025-03-04 09:58:38,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:58:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:58:38,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2025-03-04 09:58:38,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5439560439560439 [2025-03-04 09:58:38,534 INFO L175 Difference]: Start difference. First operand has 69 places, 44 transitions, 161 flow. Second operand 7 states and 198 transitions. [2025-03-04 09:58:38,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 128 transitions, 659 flow [2025-03-04 09:58:39,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 128 transitions, 622 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-03-04 09:58:39,239 INFO L231 Difference]: Finished difference. Result has 68 places, 44 transitions, 160 flow [2025-03-04 09:58:39,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=7, PETRI_FLOW=160, PETRI_PLACES=68, PETRI_TRANSITIONS=44} [2025-03-04 09:58:39,239 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2025-03-04 09:58:39,240 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 44 transitions, 160 flow [2025-03-04 09:58:39,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:39,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:39,240 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:58:39,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:58:39,240 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 09:58:39,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:39,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1129838305, now seen corresponding path program 1 times [2025-03-04 09:58:39,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:39,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044237665] [2025-03-04 09:58:39,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:58:39,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:39,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 09:58:39,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 09:58:39,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:58:39,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:39,372 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:58:39,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:39,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044237665] [2025-03-04 09:58:39,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044237665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:39,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:39,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:58:39,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422142798] [2025-03-04 09:58:39,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:39,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:58:39,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:39,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:58:39,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:58:39,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2025-03-04 09:58:39,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 44 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:58:39,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:39,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2025-03-04 09:58:39,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:41,562 INFO L124 PetriNetUnfolderBase]: 33009/45075 cut-off events. [2025-03-04 09:58:41,563 INFO L125 PetriNetUnfolderBase]: For 42371/42371 co-relation queries the response was YES. [2025-03-04 09:58:41,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113634 conditions, 45075 events. 33009/45075 cut-off events. For 42371/42371 co-relation queries the response was YES. Maximal size of possible extension queue 1235. Compared 263569 event pairs, 8141 based on Foata normal form. 600/45664 useless extension candidates. Maximal degree in co-relation 113617. Up to 18763 conditions per place. [2025-03-04 09:58:41,803 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 61 selfloop transitions, 3 changer transitions 80/150 dead transitions. [2025-03-04 09:58:41,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 150 transitions, 750 flow [2025-03-04 09:58:41,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:58:41,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:58:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 231 transitions. [2025-03-04 09:58:41,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5552884615384616 [2025-03-04 09:58:41,804 INFO L175 Difference]: Start difference. First operand has 68 places, 44 transitions, 160 flow. Second operand 8 states and 231 transitions. [2025-03-04 09:58:41,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 150 transitions, 750 flow [2025-03-04 09:58:42,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 150 transitions, 728 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-04 09:58:42,260 INFO L231 Difference]: Finished difference. Result has 71 places, 43 transitions, 164 flow [2025-03-04 09:58:42,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=58, 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=8, PETRI_FLOW=164, PETRI_PLACES=71, PETRI_TRANSITIONS=43} [2025-03-04 09:58:42,261 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 13 predicate places. [2025-03-04 09:58:42,261 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 43 transitions, 164 flow [2025-03-04 09:58:42,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:58:42,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:42,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:58:42,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:58:42,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 09:58:42,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:42,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2113480789, now seen corresponding path program 1 times [2025-03-04 09:58:42,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:42,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610667511] [2025-03-04 09:58:42,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:58:42,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:42,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 09:58:42,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 09:58:42,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:58:42,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:42,392 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:58:42,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:42,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610667511] [2025-03-04 09:58:42,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610667511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:42,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:42,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:58:42,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518802381] [2025-03-04 09:58:42,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:42,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:58:42,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:42,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:58:42,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:58:42,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2025-03-04 09:58:42,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 43 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:58:42,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:42,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2025-03-04 09:58:42,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:43,657 INFO L124 PetriNetUnfolderBase]: 16413/22957 cut-off events. [2025-03-04 09:58:43,657 INFO L125 PetriNetUnfolderBase]: For 23544/23544 co-relation queries the response was YES. [2025-03-04 09:58:43,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57242 conditions, 22957 events. 16413/22957 cut-off events. For 23544/23544 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 122245 event pairs, 10770 based on Foata normal form. 480/23435 useless extension candidates. Maximal degree in co-relation 57223. Up to 16801 conditions per place. [2025-03-04 09:58:43,758 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 58 selfloop transitions, 3 changer transitions 53/120 dead transitions. [2025-03-04 09:58:43,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 120 transitions, 608 flow [2025-03-04 09:58:43,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:58:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:58:43,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2025-03-04 09:58:43,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5274725274725275 [2025-03-04 09:58:43,759 INFO L175 Difference]: Start difference. First operand has 71 places, 43 transitions, 164 flow. Second operand 7 states and 192 transitions. [2025-03-04 09:58:43,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 120 transitions, 608 flow [2025-03-04 09:58:43,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 120 transitions, 560 flow, removed 16 selfloop flow, removed 9 redundant places. [2025-03-04 09:58:43,987 INFO L231 Difference]: Finished difference. Result has 69 places, 43 transitions, 154 flow [2025-03-04 09:58:43,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=154, PETRI_PLACES=69, PETRI_TRANSITIONS=43} [2025-03-04 09:58:43,988 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2025-03-04 09:58:43,988 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 43 transitions, 154 flow [2025-03-04 09:58:43,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:58:43,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:43,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, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:58:43,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:58:43,988 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 09:58:43,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:43,989 INFO L85 PathProgramCache]: Analyzing trace with hash -676857924, now seen corresponding path program 1 times [2025-03-04 09:58:43,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:43,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495249751] [2025-03-04 09:58:43,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:58:43,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:43,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 09:58:43,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 09:58:43,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:58:43,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:44,087 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:58:44,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:44,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495249751] [2025-03-04 09:58:44,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495249751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:44,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:44,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:58:44,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049569814] [2025-03-04 09:58:44,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:44,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:58:44,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:44,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:58:44,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:58:44,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2025-03-04 09:58:44,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 43 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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:58:44,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:44,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2025-03-04 09:58:44,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:45,175 INFO L124 PetriNetUnfolderBase]: 21952/30282 cut-off events. [2025-03-04 09:58:45,175 INFO L125 PetriNetUnfolderBase]: For 23849/23849 co-relation queries the response was YES. [2025-03-04 09:58:45,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73266 conditions, 30282 events. 21952/30282 cut-off events. For 23849/23849 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 168984 event pairs, 7408 based on Foata normal form. 400/30679 useless extension candidates. Maximal degree in co-relation 73249. Up to 12724 conditions per place. [2025-03-04 09:58:45,339 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 53 selfloop transitions, 3 changer transitions 83/145 dead transitions. [2025-03-04 09:58:45,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 145 transitions, 706 flow [2025-03-04 09:58:45,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:58:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:58:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 227 transitions. [2025-03-04 09:58:45,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5456730769230769 [2025-03-04 09:58:45,340 INFO L175 Difference]: Start difference. First operand has 69 places, 43 transitions, 154 flow. Second operand 8 states and 227 transitions. [2025-03-04 09:58:45,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 145 transitions, 706 flow [2025-03-04 09:58:45,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 145 transitions, 676 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-04 09:58:45,516 INFO L231 Difference]: Finished difference. Result has 72 places, 41 transitions, 145 flow [2025-03-04 09:58:45,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=145, PETRI_PLACES=72, PETRI_TRANSITIONS=41} [2025-03-04 09:58:45,518 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2025-03-04 09:58:45,518 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 41 transitions, 145 flow [2025-03-04 09:58:45,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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:58:45,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:45,518 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:58:45,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:58:45,518 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-04 09:58:45,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:45,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1180857668, now seen corresponding path program 1 times [2025-03-04 09:58:45,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:45,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111526621] [2025-03-04 09:58:45,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:58:45,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:45,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 09:58:45,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 09:58:45,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:58:45,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:45,627 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:58:45,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:45,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111526621] [2025-03-04 09:58:45,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111526621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:45,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:45,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:58:45,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160968399] [2025-03-04 09:58:45,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:45,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:58:45,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:45,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:58:45,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:58:45,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2025-03-04 09:58:45,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 41 transitions, 145 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:45,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:45,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2025-03-04 09:58:45,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:46,159 INFO L124 PetriNetUnfolderBase]: 8497/11558 cut-off events. [2025-03-04 09:58:46,159 INFO L125 PetriNetUnfolderBase]: For 9090/9090 co-relation queries the response was YES. [2025-03-04 09:58:46,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27553 conditions, 11558 events. 8497/11558 cut-off events. For 9090/9090 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 51611 event pairs, 2641 based on Foata normal form. 320/11877 useless extension candidates. Maximal degree in co-relation 27539. Up to 5184 conditions per place. [2025-03-04 09:58:46,189 INFO L140 encePairwiseOnDemand]: 47/52 looper letters, 0 selfloop transitions, 0 changer transitions 97/97 dead transitions. [2025-03-04 09:58:46,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 97 transitions, 453 flow [2025-03-04 09:58:46,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:58:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:58:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2025-03-04 09:58:46,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43990384615384615 [2025-03-04 09:58:46,191 INFO L175 Difference]: Start difference. First operand has 72 places, 41 transitions, 145 flow. Second operand 8 states and 183 transitions. [2025-03-04 09:58:46,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 97 transitions, 453 flow [2025-03-04 09:58:46,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 97 transitions, 401 flow, removed 19 selfloop flow, removed 11 redundant places. [2025-03-04 09:58:46,239 INFO L231 Difference]: Finished difference. Result has 61 places, 0 transitions, 0 flow [2025-03-04 09:58:46,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=61, PETRI_TRANSITIONS=0} [2025-03-04 09:58:46,239 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2025-03-04 09:58:46,240 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 0 transitions, 0 flow [2025-03-04 09:58:46,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:46,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-03-04 09:58:46,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-03-04 09:58:46,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-03-04 09:58:46,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-03-04 09:58:46,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-04 09:58:46,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-03-04 09:58:46,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:58:46,243 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:58:46,245 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 09:58:46,245 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 09:58:46,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 09:58:46 BasicIcfg [2025-03-04 09:58:46,248 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 09:58:46,249 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 09:58:46,249 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 09:58:46,249 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 09:58:46,249 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:58:21" (3/4) ... [2025-03-04 09:58:46,251 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 09:58:46,253 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-03-04 09:58:46,253 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-03-04 09:58:46,253 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P2 [2025-03-04 09:58:46,253 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P3 [2025-03-04 09:58:46,255 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2025-03-04 09:58:46,255 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 09:58:46,255 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-04 09:58:46,256 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 09:58:46,298 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 09:58:46,299 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 09:58:46,299 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 09:58:46,299 INFO L158 Benchmark]: Toolchain (without parser) took 25501.96ms. Allocated memory was 167.8MB in the beginning and 6.6GB in the end (delta: 6.5GB). Free memory was 120.8MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2025-03-04 09:58:46,299 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:58:46,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.39ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 100.3MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 09:58:46,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.67ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 98.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 09:58:46,300 INFO L158 Benchmark]: Boogie Preprocessor took 37.37ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 96.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:58:46,300 INFO L158 Benchmark]: IcfgBuilder took 405.66ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 74.6MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 09:58:46,300 INFO L158 Benchmark]: TraceAbstraction took 24621.50ms. Allocated memory was 167.8MB in the beginning and 6.6GB in the end (delta: 6.5GB). Free memory was 74.2MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2025-03-04 09:58:46,300 INFO L158 Benchmark]: Witness Printer took 49.97ms. Allocated memory is still 6.6GB. Free memory was 3.8GB in the beginning and 3.8GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 09:58:46,301 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.39ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 100.3MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.67ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 98.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.37ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 96.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 405.66ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 74.6MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 24621.50ms. Allocated memory was 167.8MB in the beginning and 6.6GB in the end (delta: 6.5GB). Free memory was 74.2MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Witness Printer took 49.97ms. Allocated memory is still 6.6GB. Free memory was 3.8GB in the beginning and 3.8GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 798]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 17]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 83 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 913 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 904 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1882 IncrementalHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 2 mSDtfsCounter, 1882 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=6, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 825 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 09:58:46,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE