./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe014_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/safe014_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 26c7def9550acbb8db0f014014632a2eeeeca7df9ce503e9999e1bc5b1d84980 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:55:41,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:55:42,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:55:42,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:55:42,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:55:42,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:55:42,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:55:42,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:55:42,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:55:42,052 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:55:42,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:55:42,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:55:42,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:55:42,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:55:42,053 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:55:42,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:55:42,054 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:55:42,054 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:55:42,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:55:42,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:55:42,054 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:55:42,054 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:55:42,054 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:55:42,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:55:42,054 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:55:42,055 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:55:42,055 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:55:42,055 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:55:42,055 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:55:42,055 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:55:42,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:55:42,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:55:42,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:55:42,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:55:42,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:55:42,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:55:42,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:55:42,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:55:42,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:55:42,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:55:42,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:55:42,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:55:42,056 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 -> 26c7def9550acbb8db0f014014632a2eeeeca7df9ce503e9999e1bc5b1d84980 [2025-03-04 09:55:42,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:55:42,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:55:42,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:55:42,303 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:55:42,303 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:55:42,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-03-04 09:55:43,473 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5916283a5/55c5789804e34f4db9b18c3b824c04db/FLAGdacb757ee [2025-03-04 09:55:43,774 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:55:43,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-03-04 09:55:43,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5916283a5/55c5789804e34f4db9b18c3b824c04db/FLAGdacb757ee [2025-03-04 09:55:43,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5916283a5/55c5789804e34f4db9b18c3b824c04db [2025-03-04 09:55:43,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:55:43,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:55:43,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:55:43,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:55:43,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:55:43,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:55:43" (1/1) ... [2025-03-04 09:55:43,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@139279b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:43, skipping insertion in model container [2025-03-04 09:55:43,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:55:43" (1/1) ... [2025-03-04 09:55:43,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:55:44,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:55:44,124 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:55:44,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:55:44,201 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:55:44,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:44 WrapperNode [2025-03-04 09:55:44,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:55:44,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:55:44,203 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:55:44,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:55:44,207 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:55:44" (1/1) ... [2025-03-04 09:55:44,219 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:55:44" (1/1) ... [2025-03-04 09:55:44,237 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 60 [2025-03-04 09:55:44,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:55:44,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:55:44,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:55:44,239 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:55:44,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:44" (1/1) ... [2025-03-04 09:55:44,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:44" (1/1) ... [2025-03-04 09:55:44,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:44" (1/1) ... [2025-03-04 09:55:44,257 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:55:44,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:44" (1/1) ... [2025-03-04 09:55:44,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:44" (1/1) ... [2025-03-04 09:55:44,263 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:44" (1/1) ... [2025-03-04 09:55:44,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:44" (1/1) ... [2025-03-04 09:55:44,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:44" (1/1) ... [2025-03-04 09:55:44,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:44" (1/1) ... [2025-03-04 09:55:44,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:55:44,273 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:55:44,273 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:55:44,273 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:55:44,273 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:44" (1/1) ... [2025-03-04 09:55:44,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:55:44,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:55:44,303 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:55:44,305 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:55:44,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:55:44,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:55:44,326 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 09:55:44,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 09:55:44,326 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 09:55:44,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 09:55:44,326 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 09:55:44,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 09:55:44,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:55:44,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:55:44,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:55:44,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:55:44,327 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:55:44,419 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:55:44,421 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:55:44,525 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:55:44,525 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:55:44,588 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:55:44,589 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:55:44,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:55:44 BoogieIcfgContainer [2025-03-04 09:55:44,589 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:55:44,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:55:44,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:55:44,595 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:55:44,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:55:43" (1/3) ... [2025-03-04 09:55:44,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22af1836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:55:44, skipping insertion in model container [2025-03-04 09:55:44,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:55:44" (2/3) ... [2025-03-04 09:55:44,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22af1836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:55:44, skipping insertion in model container [2025-03-04 09:55:44,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:55:44" (3/3) ... [2025-03-04 09:55:44,598 INFO L128 eAbstractionObserver]: Analyzing ICFG safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-03-04 09:55:44,611 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:55:44,613 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe014_pso.oepc_pso.opt_tso.oepc_tso.opt.i that has 4 procedures, 42 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-04 09:55:44,614 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:55:44,659 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:55:44,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 98 flow [2025-03-04 09:55:44,719 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2025-03-04 09:55:44,722 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:55:44,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-03-04 09:55:44,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 43 transitions, 98 flow [2025-03-04 09:55:44,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 39 transitions, 87 flow [2025-03-04 09:55:44,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:55:44,743 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;@26dba832, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:55:44,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 09:55:44,754 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:55:44,755 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events. [2025-03-04 09:55:44,755 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:55:44,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:44,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:55:44,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 09:55:44,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:44,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1029472030, now seen corresponding path program 1 times [2025-03-04 09:55:44,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:44,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366318073] [2025-03-04 09:55:44,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:44,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:44,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:55:44,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:55:44,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:44,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:44,991 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:55:44,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:44,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366318073] [2025-03-04 09:55:44,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366318073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:44,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:44,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:55:44,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729027045] [2025-03-04 09:55:44,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:45,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:55:45,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:45,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:55:45,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:55:45,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-03-04 09:55:45,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:55:45,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:45,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-03-04 09:55:45,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:45,581 INFO L124 PetriNetUnfolderBase]: 4775/7427 cut-off events. [2025-03-04 09:55:45,582 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-04 09:55:45,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14322 conditions, 7427 events. 4775/7427 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 43781 event pairs, 4775 based on Foata normal form. 648/8026 useless extension candidates. Maximal degree in co-relation 14311. Up to 6804 conditions per place. [2025-03-04 09:55:45,617 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 27 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-03-04 09:55:45,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 35 transitions, 137 flow [2025-03-04 09:55:45,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:55:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:55:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-03-04 09:55:45,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4573643410852713 [2025-03-04 09:55:45,629 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 87 flow. Second operand 3 states and 59 transitions. [2025-03-04 09:55:45,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 35 transitions, 137 flow [2025-03-04 09:55:45,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 134 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 09:55:45,636 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2025-03-04 09:55:45,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-03-04 09:55:45,640 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2025-03-04 09:55:45,641 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2025-03-04 09:55:45,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:55:45,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:45,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:55:45,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:55:45,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 09:55:45,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:45,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1029471599, now seen corresponding path program 1 times [2025-03-04 09:55:45,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:45,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101893281] [2025-03-04 09:55:45,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:45,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:45,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 09:55:45,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 09:55:45,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:45,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:45,955 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:55:45,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:45,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101893281] [2025-03-04 09:55:45,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101893281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:45,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:45,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:55:45,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789331946] [2025-03-04 09:55:45,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:45,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:55:45,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:45,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:55:45,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:55:45,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-03-04 09:55:45,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:55:45,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:45,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-03-04 09:55:45,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:46,991 INFO L124 PetriNetUnfolderBase]: 10199/15096 cut-off events. [2025-03-04 09:55:46,992 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:55:47,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29886 conditions, 15096 events. 10199/15096 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 93202 event pairs, 2427 based on Foata normal form. 0/14712 useless extension candidates. Maximal degree in co-relation 29880. Up to 5690 conditions per place. [2025-03-04 09:55:47,053 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 47 selfloop transitions, 6 changer transitions 97/155 dead transitions. [2025-03-04 09:55:47,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 155 transitions, 622 flow [2025-03-04 09:55:47,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:55:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 09:55:47,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 233 transitions. [2025-03-04 09:55:47,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020671834625323 [2025-03-04 09:55:47,058 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 9 states and 233 transitions. [2025-03-04 09:55:47,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 155 transitions, 622 flow [2025-03-04 09:55:47,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 155 transitions, 621 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:55:47,062 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 157 flow [2025-03-04 09:55:47,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=157, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2025-03-04 09:55:47,063 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2025-03-04 09:55:47,063 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 157 flow [2025-03-04 09:55:47,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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:55:47,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:47,064 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:55:47,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:55:47,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 09:55:47,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:47,065 INFO L85 PathProgramCache]: Analyzing trace with hash -320120528, now seen corresponding path program 1 times [2025-03-04 09:55:47,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:47,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242720759] [2025-03-04 09:55:47,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:47,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:47,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:55:47,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:55:47,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:47,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:47,263 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:55:47,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:47,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242720759] [2025-03-04 09:55:47,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242720759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:47,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:47,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:55:47,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895021166] [2025-03-04 09:55:47,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:47,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:55:47,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:47,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:55:47,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:55:47,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-03-04 09:55:47,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 38 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:55:47,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:47,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-03-04 09:55:47,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:48,180 INFO L124 PetriNetUnfolderBase]: 7739/11617 cut-off events. [2025-03-04 09:55:48,180 INFO L125 PetriNetUnfolderBase]: For 14021/14024 co-relation queries the response was YES. [2025-03-04 09:55:48,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31860 conditions, 11617 events. 7739/11617 cut-off events. For 14021/14024 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 69949 event pairs, 926 based on Foata normal form. 351/11961 useless extension candidates. Maximal degree in co-relation 31845. Up to 5012 conditions per place. [2025-03-04 09:55:48,229 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 62 selfloop transitions, 7 changer transitions 86/160 dead transitions. [2025-03-04 09:55:48,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 160 transitions, 933 flow [2025-03-04 09:55:48,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:55:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 09:55:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 241 transitions. [2025-03-04 09:55:48,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5604651162790698 [2025-03-04 09:55:48,233 INFO L175 Difference]: Start difference. First operand has 58 places, 38 transitions, 157 flow. Second operand 10 states and 241 transitions. [2025-03-04 09:55:48,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 160 transitions, 933 flow [2025-03-04 09:55:48,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 160 transitions, 839 flow, removed 24 selfloop flow, removed 4 redundant places. [2025-03-04 09:55:48,270 INFO L231 Difference]: Finished difference. Result has 65 places, 41 transitions, 205 flow [2025-03-04 09:55:48,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=205, PETRI_PLACES=65, PETRI_TRANSITIONS=41} [2025-03-04 09:55:48,271 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 18 predicate places. [2025-03-04 09:55:48,271 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 41 transitions, 205 flow [2025-03-04 09:55:48,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:55:48,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:48,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:55:48,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:55:48,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 09:55:48,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:48,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1393668742, now seen corresponding path program 1 times [2025-03-04 09:55:48,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:48,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255466510] [2025-03-04 09:55:48,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:48,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:48,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 09:55:48,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 09:55:48,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:48,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:48,434 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:55:48,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:48,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255466510] [2025-03-04 09:55:48,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255466510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:48,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:48,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:55:48,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618345376] [2025-03-04 09:55:48,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:48,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:55:48,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:48,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:55:48,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:55:48,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-03-04 09:55:48,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 41 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:55:48,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:48,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-03-04 09:55:48,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:49,319 INFO L124 PetriNetUnfolderBase]: 7144/10717 cut-off events. [2025-03-04 09:55:49,320 INFO L125 PetriNetUnfolderBase]: For 24063/24066 co-relation queries the response was YES. [2025-03-04 09:55:49,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31615 conditions, 10717 events. 7144/10717 cut-off events. For 24063/24066 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 61093 event pairs, 871 based on Foata normal form. 290/10998 useless extension candidates. Maximal degree in co-relation 31593. Up to 4611 conditions per place. [2025-03-04 09:55:49,361 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 62 selfloop transitions, 9 changer transitions 76/152 dead transitions. [2025-03-04 09:55:49,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 152 transitions, 953 flow [2025-03-04 09:55:49,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:55:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 09:55:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 227 transitions. [2025-03-04 09:55:49,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5279069767441861 [2025-03-04 09:55:49,363 INFO L175 Difference]: Start difference. First operand has 65 places, 41 transitions, 205 flow. Second operand 10 states and 227 transitions. [2025-03-04 09:55:49,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 152 transitions, 953 flow [2025-03-04 09:55:49,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 152 transitions, 888 flow, removed 30 selfloop flow, removed 3 redundant places. [2025-03-04 09:55:49,429 INFO L231 Difference]: Finished difference. Result has 74 places, 46 transitions, 293 flow [2025-03-04 09:55:49,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=293, PETRI_PLACES=74, PETRI_TRANSITIONS=46} [2025-03-04 09:55:49,430 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 27 predicate places. [2025-03-04 09:55:49,430 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 46 transitions, 293 flow [2025-03-04 09:55:49,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:55:49,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:49,431 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:55:49,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:55:49,431 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 09:55:49,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:49,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1726014253, now seen corresponding path program 1 times [2025-03-04 09:55:49,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:49,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96580446] [2025-03-04 09:55:49,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:49,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:49,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:55:49,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:55:49,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:49,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:49,554 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:55:49,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:49,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96580446] [2025-03-04 09:55:49,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96580446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:49,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:49,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:55:49,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71091225] [2025-03-04 09:55:49,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:49,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:55:49,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:49,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:55:49,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:55:49,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-03-04 09:55:49,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 46 transitions, 293 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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:55:49,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:49,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-03-04 09:55:49,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:50,175 INFO L124 PetriNetUnfolderBase]: 6703/10226 cut-off events. [2025-03-04 09:55:50,175 INFO L125 PetriNetUnfolderBase]: For 23484/23484 co-relation queries the response was YES. [2025-03-04 09:55:50,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30731 conditions, 10226 events. 6703/10226 cut-off events. For 23484/23484 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 59270 event pairs, 3584 based on Foata normal form. 230/10453 useless extension candidates. Maximal degree in co-relation 30701. Up to 7885 conditions per place. [2025-03-04 09:55:50,224 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 59 selfloop transitions, 5 changer transitions 47/116 dead transitions. [2025-03-04 09:55:50,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 116 transitions, 831 flow [2025-03-04 09:55:50,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:55:50,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:55:50,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2025-03-04 09:55:50,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5182724252491694 [2025-03-04 09:55:50,226 INFO L175 Difference]: Start difference. First operand has 74 places, 46 transitions, 293 flow. Second operand 7 states and 156 transitions. [2025-03-04 09:55:50,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 116 transitions, 831 flow [2025-03-04 09:55:50,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 116 transitions, 776 flow, removed 24 selfloop flow, removed 9 redundant places. [2025-03-04 09:55:50,286 INFO L231 Difference]: Finished difference. Result has 70 places, 46 transitions, 282 flow [2025-03-04 09:55:50,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=70, PETRI_TRANSITIONS=46} [2025-03-04 09:55:50,287 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2025-03-04 09:55:50,287 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 46 transitions, 282 flow [2025-03-04 09:55:50,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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:55:50,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:50,287 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:55:50,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:55:50,287 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 09:55:50,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:50,288 INFO L85 PathProgramCache]: Analyzing trace with hash -492752880, now seen corresponding path program 1 times [2025-03-04 09:55:50,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:50,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906178120] [2025-03-04 09:55:50,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:50,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:50,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 09:55:50,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 09:55:50,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:50,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:50,402 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:55:50,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:50,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906178120] [2025-03-04 09:55:50,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906178120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:50,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:50,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:55:50,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040882805] [2025-03-04 09:55:50,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:50,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:55:50,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:50,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:55:50,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:55:50,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-03-04 09:55:50,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 46 transitions, 282 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:55:50,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:50,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-03-04 09:55:50,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:51,265 INFO L124 PetriNetUnfolderBase]: 8349/12342 cut-off events. [2025-03-04 09:55:51,266 INFO L125 PetriNetUnfolderBase]: For 22262/22268 co-relation queries the response was YES. [2025-03-04 09:55:51,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35917 conditions, 12342 events. 8349/12342 cut-off events. For 22262/22268 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 70094 event pairs, 1206 based on Foata normal form. 225/12558 useless extension candidates. Maximal degree in co-relation 35889. Up to 4132 conditions per place. [2025-03-04 09:55:51,330 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 67 selfloop transitions, 8 changer transitions 68/148 dead transitions. [2025-03-04 09:55:51,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 148 transitions, 1038 flow [2025-03-04 09:55:51,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:55:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 09:55:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 203 transitions. [2025-03-04 09:55:51,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.524547803617571 [2025-03-04 09:55:51,337 INFO L175 Difference]: Start difference. First operand has 70 places, 46 transitions, 282 flow. Second operand 9 states and 203 transitions. [2025-03-04 09:55:51,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 148 transitions, 1038 flow [2025-03-04 09:55:51,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 148 transitions, 992 flow, removed 16 selfloop flow, removed 10 redundant places. [2025-03-04 09:55:51,406 INFO L231 Difference]: Finished difference. Result has 72 places, 43 transitions, 282 flow [2025-03-04 09:55:51,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=282, PETRI_PLACES=72, PETRI_TRANSITIONS=43} [2025-03-04 09:55:51,407 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 25 predicate places. [2025-03-04 09:55:51,407 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 43 transitions, 282 flow [2025-03-04 09:55:51,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:55:51,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:51,408 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:55:51,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:55:51,408 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 09:55:51,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1583085232, now seen corresponding path program 1 times [2025-03-04 09:55:51,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:51,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144162236] [2025-03-04 09:55:51,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:51,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:51,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:55:51,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:55:51,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:51,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:51,544 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:55:51,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:51,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144162236] [2025-03-04 09:55:51,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144162236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:51,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:51,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:55:51,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513243463] [2025-03-04 09:55:51,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:51,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:55:51,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:51,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:55:51,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:55:51,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-03-04 09:55:51,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 43 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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:55:51,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:51,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-03-04 09:55:51,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:52,001 INFO L124 PetriNetUnfolderBase]: 3990/6202 cut-off events. [2025-03-04 09:55:52,001 INFO L125 PetriNetUnfolderBase]: For 14402/14402 co-relation queries the response was YES. [2025-03-04 09:55:52,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18377 conditions, 6202 events. 3990/6202 cut-off events. For 14402/14402 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 33707 event pairs, 2993 based on Foata normal form. 164/6363 useless extension candidates. Maximal degree in co-relation 18349. Up to 4436 conditions per place. [2025-03-04 09:55:52,032 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 46 selfloop transitions, 7 changer transitions 41/99 dead transitions. [2025-03-04 09:55:52,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 99 transitions, 733 flow [2025-03-04 09:55:52,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:55:52,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:55:52,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2025-03-04 09:55:52,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49169435215946844 [2025-03-04 09:55:52,033 INFO L175 Difference]: Start difference. First operand has 72 places, 43 transitions, 282 flow. Second operand 7 states and 148 transitions. [2025-03-04 09:55:52,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 99 transitions, 733 flow [2025-03-04 09:55:52,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 99 transitions, 668 flow, removed 16 selfloop flow, removed 9 redundant places. [2025-03-04 09:55:52,053 INFO L231 Difference]: Finished difference. Result has 70 places, 43 transitions, 273 flow [2025-03-04 09:55:52,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=273, PETRI_PLACES=70, PETRI_TRANSITIONS=43} [2025-03-04 09:55:52,053 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2025-03-04 09:55:52,053 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 43 transitions, 273 flow [2025-03-04 09:55:52,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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:55:52,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:52,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:55:52,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:55:52,054 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 09:55:52,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:52,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1717110084, now seen corresponding path program 1 times [2025-03-04 09:55:52,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:52,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108538122] [2025-03-04 09:55:52,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:52,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:52,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 09:55:52,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 09:55:52,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:52,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:52,144 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:55:52,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:52,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108538122] [2025-03-04 09:55:52,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108538122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:52,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:52,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:55:52,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883777130] [2025-03-04 09:55:52,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:52,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:55:52,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:52,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:55:52,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:55:52,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-03-04 09:55:52,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 43 transitions, 273 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:55:52,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:52,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-03-04 09:55:52,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:52,380 INFO L124 PetriNetUnfolderBase]: 3080/4894 cut-off events. [2025-03-04 09:55:52,380 INFO L125 PetriNetUnfolderBase]: For 12654/12654 co-relation queries the response was YES. [2025-03-04 09:55:52,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14224 conditions, 4894 events. 3080/4894 cut-off events. For 12654/12654 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 26949 event pairs, 476 based on Foata normal form. 229/5120 useless extension candidates. Maximal degree in co-relation 14199. Up to 2737 conditions per place. [2025-03-04 09:55:52,400 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 77 selfloop transitions, 5 changer transitions 1/88 dead transitions. [2025-03-04 09:55:52,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 88 transitions, 787 flow [2025-03-04 09:55:52,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:55:52,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:55:52,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-03-04 09:55:52,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5872093023255814 [2025-03-04 09:55:52,402 INFO L175 Difference]: Start difference. First operand has 70 places, 43 transitions, 273 flow. Second operand 4 states and 101 transitions. [2025-03-04 09:55:52,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 88 transitions, 787 flow [2025-03-04 09:55:52,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 88 transitions, 737 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 09:55:52,413 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 281 flow [2025-03-04 09:55:52,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=281, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2025-03-04 09:55:52,413 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 18 predicate places. [2025-03-04 09:55:52,413 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 281 flow [2025-03-04 09:55:52,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:55:52,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:52,414 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:55:52,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:55:52,414 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 09:55:52,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:52,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1572653299, now seen corresponding path program 1 times [2025-03-04 09:55:52,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:52,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883090942] [2025-03-04 09:55:52,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:52,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:52,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 09:55:52,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 09:55:52,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:52,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:52,528 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:55:52,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:52,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883090942] [2025-03-04 09:55:52,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883090942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:52,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:52,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:55:52,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366622602] [2025-03-04 09:55:52,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:52,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:55:52,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:52,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:55:52,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:55:52,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-03-04 09:55:52,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 281 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:55:52,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:52,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-03-04 09:55:52,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:52,828 INFO L124 PetriNetUnfolderBase]: 1894/3047 cut-off events. [2025-03-04 09:55:52,829 INFO L125 PetriNetUnfolderBase]: For 6885/6885 co-relation queries the response was YES. [2025-03-04 09:55:52,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9308 conditions, 3047 events. 1894/3047 cut-off events. For 6885/6885 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 15136 event pairs, 230 based on Foata normal form. 176/3220 useless extension candidates. Maximal degree in co-relation 9284. Up to 1125 conditions per place. [2025-03-04 09:55:52,843 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 78 selfloop transitions, 8 changer transitions 2/93 dead transitions. [2025-03-04 09:55:52,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 93 transitions, 770 flow [2025-03-04 09:55:52,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:55:52,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:55:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2025-03-04 09:55:52,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5720930232558139 [2025-03-04 09:55:52,845 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 281 flow. Second operand 5 states and 123 transitions. [2025-03-04 09:55:52,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 93 transitions, 770 flow [2025-03-04 09:55:52,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 93 transitions, 736 flow, removed 13 selfloop flow, removed 4 redundant places. [2025-03-04 09:55:52,852 INFO L231 Difference]: Finished difference. Result has 67 places, 49 transitions, 313 flow [2025-03-04 09:55:52,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=67, PETRI_TRANSITIONS=49} [2025-03-04 09:55:52,853 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2025-03-04 09:55:52,853 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 49 transitions, 313 flow [2025-03-04 09:55:52,853 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:55:52,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:52,854 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:55:52,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:55:52,854 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 09:55:52,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:52,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1077379434, now seen corresponding path program 1 times [2025-03-04 09:55:52,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:52,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813965551] [2025-03-04 09:55:52,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:52,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:52,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 09:55:52,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 09:55:52,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:52,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:52,933 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:55:52,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:52,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813965551] [2025-03-04 09:55:52,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813965551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:52,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:52,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:55:52,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13398646] [2025-03-04 09:55:52,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:52,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:55:52,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:52,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:55:52,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:55:52,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-03-04 09:55:52,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 49 transitions, 313 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:55:52,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:52,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-03-04 09:55:52,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:53,077 INFO L124 PetriNetUnfolderBase]: 1102/1747 cut-off events. [2025-03-04 09:55:53,078 INFO L125 PetriNetUnfolderBase]: For 4653/4653 co-relation queries the response was YES. [2025-03-04 09:55:53,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5838 conditions, 1747 events. 1102/1747 cut-off events. For 4653/4653 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 7544 event pairs, 158 based on Foata normal form. 80/1824 useless extension candidates. Maximal degree in co-relation 5814. Up to 568 conditions per place. [2025-03-04 09:55:53,085 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 58 selfloop transitions, 11 changer transitions 13/87 dead transitions. [2025-03-04 09:55:53,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 87 transitions, 706 flow [2025-03-04 09:55:53,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:55:53,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:55:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-03-04 09:55:53,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49224806201550386 [2025-03-04 09:55:53,086 INFO L175 Difference]: Start difference. First operand has 67 places, 49 transitions, 313 flow. Second operand 6 states and 127 transitions. [2025-03-04 09:55:53,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 87 transitions, 706 flow [2025-03-04 09:55:53,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 87 transitions, 646 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-03-04 09:55:53,092 INFO L231 Difference]: Finished difference. Result has 67 places, 45 transitions, 275 flow [2025-03-04 09:55:53,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=67, PETRI_TRANSITIONS=45} [2025-03-04 09:55:53,092 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2025-03-04 09:55:53,093 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 45 transitions, 275 flow [2025-03-04 09:55:53,093 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:55:53,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:53,093 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:55:53,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:55:53,093 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 09:55:53,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:53,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1926008785, now seen corresponding path program 1 times [2025-03-04 09:55:53,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:53,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658374046] [2025-03-04 09:55:53,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:55:53,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:53,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 09:55:53,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 09:55:53,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:55:53,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:53,182 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:55:53,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:53,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658374046] [2025-03-04 09:55:53,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658374046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:53,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:53,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:55:53,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834812491] [2025-03-04 09:55:53,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:53,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:55:53,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:53,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:55:53,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:55:53,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-03-04 09:55:53,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 45 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:55:53,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:53,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-03-04 09:55:53,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:53,362 INFO L124 PetriNetUnfolderBase]: 1202/1918 cut-off events. [2025-03-04 09:55:53,363 INFO L125 PetriNetUnfolderBase]: For 4038/4038 co-relation queries the response was YES. [2025-03-04 09:55:53,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6267 conditions, 1918 events. 1202/1918 cut-off events. For 4038/4038 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8327 event pairs, 417 based on Foata normal form. 8/1924 useless extension candidates. Maximal degree in co-relation 6245. Up to 1138 conditions per place. [2025-03-04 09:55:53,370 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 35 selfloop transitions, 3 changer transitions 45/88 dead transitions. [2025-03-04 09:55:53,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 88 transitions, 660 flow [2025-03-04 09:55:53,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:55:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:55:53,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2025-03-04 09:55:53,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4689922480620155 [2025-03-04 09:55:53,371 INFO L175 Difference]: Start difference. First operand has 67 places, 45 transitions, 275 flow. Second operand 6 states and 121 transitions. [2025-03-04 09:55:53,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 88 transitions, 660 flow [2025-03-04 09:55:53,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 510 flow, removed 20 selfloop flow, removed 11 redundant places. [2025-03-04 09:55:53,379 INFO L231 Difference]: Finished difference. Result has 64 places, 39 transitions, 163 flow [2025-03-04 09:55:53,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=200, 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=6, PETRI_FLOW=163, PETRI_PLACES=64, PETRI_TRANSITIONS=39} [2025-03-04 09:55:53,380 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 17 predicate places. [2025-03-04 09:55:53,380 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 39 transitions, 163 flow [2025-03-04 09:55:53,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:55:53,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:55:53,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:55:53,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:55:53,381 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 09:55:53,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:55:53,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1680469113, now seen corresponding path program 2 times [2025-03-04 09:55:53,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:55:53,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303791776] [2025-03-04 09:55:53,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:55:53,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:55:53,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-03-04 09:55:53,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 09:55:53,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:55:53,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:55:53,482 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:55:53,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:55:53,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303791776] [2025-03-04 09:55:53,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303791776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:55:53,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:55:53,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:55:53,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019589665] [2025-03-04 09:55:53,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:55:53,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:55:53,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:55:53,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:55:53,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:55:53,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-03-04 09:55:53,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 39 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:55:53,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:55:53,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-03-04 09:55:53,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:55:53,581 INFO L124 PetriNetUnfolderBase]: 374/606 cut-off events. [2025-03-04 09:55:53,581 INFO L125 PetriNetUnfolderBase]: For 758/758 co-relation queries the response was YES. [2025-03-04 09:55:53,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1589 conditions, 606 events. 374/606 cut-off events. For 758/758 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1980 event pairs, 38 based on Foata normal form. 8/613 useless extension candidates. Maximal degree in co-relation 1579. Up to 444 conditions per place. [2025-03-04 09:55:53,583 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 0 selfloop transitions, 0 changer transitions 55/55 dead transitions. [2025-03-04 09:55:53,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 55 transitions, 307 flow [2025-03-04 09:55:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:55:53,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:55:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2025-03-04 09:55:53,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3588039867109635 [2025-03-04 09:55:53,584 INFO L175 Difference]: Start difference. First operand has 64 places, 39 transitions, 163 flow. Second operand 7 states and 108 transitions. [2025-03-04 09:55:53,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 55 transitions, 307 flow [2025-03-04 09:55:53,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 255 flow, removed 5 selfloop flow, removed 14 redundant places. [2025-03-04 09:55:53,586 INFO L231 Difference]: Finished difference. Result has 51 places, 0 transitions, 0 flow [2025-03-04 09:55:53,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=51, PETRI_TRANSITIONS=0} [2025-03-04 09:55:53,586 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2025-03-04 09:55:53,587 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 0 transitions, 0 flow [2025-03-04 09:55:53,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:55:53,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2025-03-04 09:55:53,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-03-04 09:55:53,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-03-04 09:55:53,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-03-04 09:55:53,590 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-03-04 09:55:53,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 09:55:53,590 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:55:53,594 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 09:55:53,595 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 09:55:53,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 09:55:53 BasicIcfg [2025-03-04 09:55:53,598 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 09:55:53,599 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 09:55:53,599 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 09:55:53,599 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 09:55:53,600 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:55:44" (3/4) ... [2025-03-04 09:55:53,601 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 09:55:53,603 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-03-04 09:55:53,604 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-03-04 09:55:53,604 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P2 [2025-03-04 09:55:53,606 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2025-03-04 09:55:53,606 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-04 09:55:53,606 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 09:55:53,606 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 09:55:53,674 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 09:55:53,674 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 09:55:53,674 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 09:55:53,675 INFO L158 Benchmark]: Toolchain (without parser) took 9861.14ms. Allocated memory was 167.8MB in the beginning and 922.7MB in the end (delta: 755.0MB). Free memory was 132.7MB in the beginning and 323.8MB in the end (delta: -191.2MB). Peak memory consumption was 559.5MB. Max. memory is 16.1GB. [2025-03-04 09:55:53,676 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory was 127.8MB in the beginning and 127.5MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:55:53,676 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.11ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 112.7MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 09:55:53,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.51ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 111.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 09:55:53,677 INFO L158 Benchmark]: Boogie Preprocessor took 33.60ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 109.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:55:53,679 INFO L158 Benchmark]: IcfgBuilder took 316.94ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 89.8MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 09:55:53,679 INFO L158 Benchmark]: TraceAbstraction took 9007.17ms. Allocated memory was 167.8MB in the beginning and 922.7MB in the end (delta: 755.0MB). Free memory was 89.4MB in the beginning and 332.2MB in the end (delta: -242.8MB). Peak memory consumption was 517.6MB. Max. memory is 16.1GB. [2025-03-04 09:55:53,679 INFO L158 Benchmark]: Witness Printer took 75.44ms. Allocated memory is still 922.7MB. Free memory was 332.2MB in the beginning and 323.8MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:55:53,680 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.21ms. Allocated memory is still 201.3MB. Free memory was 127.8MB in the beginning and 127.5MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.11ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 112.7MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.51ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 111.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.60ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 109.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 316.94ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 89.8MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9007.17ms. Allocated memory was 167.8MB in the beginning and 922.7MB in the end (delta: 755.0MB). Free memory was 89.4MB in the beginning and 332.2MB in the end (delta: -242.8MB). Peak memory consumption was 517.6MB. Max. memory is 16.1GB. * Witness Printer took 75.44ms. Allocated memory is still 922.7MB. Free memory was 332.2MB in the beginning and 323.8MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 776]: 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 7 procedures, 66 locations, 5 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: 8.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 783 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 781 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1966 IncrementalHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 2 mSDtfsCounter, 1966 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=9, InterpolantAutomatonStates: 83, 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.4s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 904 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:55:53,705 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