./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:47:38,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:47:38,224 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:47:38,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:47:38,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:47:38,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:47:38,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:47:38,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:47:38,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:47:38,254 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:47:38,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:47:38,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:47:38,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:47:38,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:47:38,255 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:47:38,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:47:38,255 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:47:38,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:47:38,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:47:38,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:47:38,256 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:47:38,256 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:47:38,256 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:47:38,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:47:38,256 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:47:38,256 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:47:38,256 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:47:38,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:47:38,257 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:47:38,257 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:47:38,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:47:38,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:47:38,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:47:38,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:47:38,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:47:38,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:47:38,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:47:38,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:47:38,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:47:38,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:47:38,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:47:38,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:47:38,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:47:38,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:47:38,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:47:38,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:47:38,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:47:38,259 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-jdk21/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 -> a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 [2025-01-10 00:47:38,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:47:38,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:47:38,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:47:38,552 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:47:38,552 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:47:38,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-01-10 00:47:39,901 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f648612a7/b55726d9fa4e4938b1f661220b3d90a2/FLAG9bf5c485c [2025-01-10 00:47:40,206 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:47:40,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-01-10 00:47:40,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f648612a7/b55726d9fa4e4938b1f661220b3d90a2/FLAG9bf5c485c [2025-01-10 00:47:40,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f648612a7/b55726d9fa4e4938b1f661220b3d90a2 [2025-01-10 00:47:40,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:47:40,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:47:40,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:47:40,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:47:40,243 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:47:40,244 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:47:40" (1/1) ... [2025-01-10 00:47:40,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf32be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:40, skipping insertion in model container [2025-01-10 00:47:40,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:47:40" (1/1) ... [2025-01-10 00:47:40,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:47:40,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:47:40,570 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:47:40,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:47:40,682 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:47:40,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:40 WrapperNode [2025-01-10 00:47:40,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:47:40,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:47:40,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:47:40,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:47:40,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:40" (1/1) ... [2025-01-10 00:47:40,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:40" (1/1) ... [2025-01-10 00:47:40,729 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 148 [2025-01-10 00:47:40,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:47:40,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:47:40,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:47:40,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:47:40,738 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:40" (1/1) ... [2025-01-10 00:47:40,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:40" (1/1) ... [2025-01-10 00:47:40,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:40" (1/1) ... [2025-01-10 00:47:40,765 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-01-10 00:47:40,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:40" (1/1) ... [2025-01-10 00:47:40,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:40" (1/1) ... [2025-01-10 00:47:40,773 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:40" (1/1) ... [2025-01-10 00:47:40,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:40" (1/1) ... [2025-01-10 00:47:40,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:40" (1/1) ... [2025-01-10 00:47:40,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:40" (1/1) ... [2025-01-10 00:47:40,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:40" (1/1) ... [2025-01-10 00:47:40,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:47:40,783 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:47:40,783 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:47:40,783 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:47:40,784 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:40" (1/1) ... [2025-01-10 00:47:40,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:47:40,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:47:40,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:47:40,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:47:40,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:47:40,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:47:40,850 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:47:40,850 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:47:40,850 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:47:40,850 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:47:40,850 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:47:40,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:47:40,851 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-01-10 00:47:40,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-01-10 00:47:40,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:47:40,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:47:40,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:47:40,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:47:40,853 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:47:40,987 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:47:40,989 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:47:41,316 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:47:41,317 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:47:41,532 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:47:41,533 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:47:41,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:47:41 BoogieIcfgContainer [2025-01-10 00:47:41,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:47:41,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:47:41,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:47:41,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:47:41,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:47:40" (1/3) ... [2025-01-10 00:47:41,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226af7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:47:41, skipping insertion in model container [2025-01-10 00:47:41,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:47:40" (2/3) ... [2025-01-10 00:47:41,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226af7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:47:41, skipping insertion in model container [2025-01-10 00:47:41,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:47:41" (3/3) ... [2025-01-10 00:47:41,542 INFO L128 eAbstractionObserver]: Analyzing ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-01-10 00:47:41,554 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:47:41,556 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i that has 5 procedures, 52 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:47:41,557 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:47:41,618 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:47:41,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 122 flow [2025-01-10 00:47:41,692 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2025-01-10 00:47:41,696 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:47:41,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 2/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2025-01-10 00:47:41,700 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 53 transitions, 122 flow [2025-01-10 00:47:41,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 49 transitions, 110 flow [2025-01-10 00:47:41,714 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:47:41,730 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;@211d2692, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:47:41,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 00:47:41,743 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:47:41,743 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-01-10 00:47:41,743 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:47:41,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:41,744 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:41,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:41,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:41,750 INFO L85 PathProgramCache]: Analyzing trace with hash -924434098, now seen corresponding path program 1 times [2025-01-10 00:47:41,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:41,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730270852] [2025-01-10 00:47:41,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:41,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:41,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:47:41,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:47:41,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:41,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:42,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:42,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730270852] [2025-01-10 00:47:42,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730270852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:42,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:42,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:47:42,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840791108] [2025-01-10 00:47:42,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:42,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:47:42,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:42,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:47:42,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:47:42,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2025-01-10 00:47:42,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-01-10 00:47:42,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:42,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2025-01-10 00:47:42,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:42,818 INFO L124 PetriNetUnfolderBase]: 1047/1835 cut-off events. [2025-01-10 00:47:42,819 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:47:42,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3395 conditions, 1835 events. 1047/1835 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 12952 event pairs, 219 based on Foata normal form. 96/1889 useless extension candidates. Maximal degree in co-relation 3383. Up to 1153 conditions per place. [2025-01-10 00:47:42,846 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 31 selfloop transitions, 2 changer transitions 2/57 dead transitions. [2025-01-10 00:47:42,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 196 flow [2025-01-10 00:47:42,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:47:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:47:42,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-01-10 00:47:42,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7421383647798742 [2025-01-10 00:47:42,861 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 118 transitions. [2025-01-10 00:47:42,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 196 flow [2025-01-10 00:47:42,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 57 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:47:42,872 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 100 flow [2025-01-10 00:47:42,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-01-10 00:47:42,878 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2025-01-10 00:47:42,878 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 100 flow [2025-01-10 00:47:42,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-01-10 00:47:42,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:42,879 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:42,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:47:42,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:42,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:42,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1857640590, now seen corresponding path program 1 times [2025-01-10 00:47:42,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:42,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943671520] [2025-01-10 00:47:42,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:42,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:42,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:47:42,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:47:42,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:42,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:43,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:43,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:43,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943671520] [2025-01-10 00:47:43,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943671520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:43,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:43,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:47:43,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204559794] [2025-01-10 00:47:43,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:43,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:47:43,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:43,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:47:43,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:47:43,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2025-01-10 00:47:43,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-01-10 00:47:43,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:43,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2025-01-10 00:47:43,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:43,335 INFO L124 PetriNetUnfolderBase]: 931/1611 cut-off events. [2025-01-10 00:47:43,335 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2025-01-10 00:47:43,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3101 conditions, 1611 events. 931/1611 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 11734 event pairs, 931 based on Foata normal form. 48/1593 useless extension candidates. Maximal degree in co-relation 3091. Up to 1352 conditions per place. [2025-01-10 00:47:43,349 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 20 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2025-01-10 00:47:43,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 142 flow [2025-01-10 00:47:43,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:47:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:47:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2025-01-10 00:47:43,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6163522012578616 [2025-01-10 00:47:43,352 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 98 transitions. [2025-01-10 00:47:43,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 142 flow [2025-01-10 00:47:43,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:47:43,356 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 94 flow [2025-01-10 00:47:43,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2025-01-10 00:47:43,357 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2025-01-10 00:47:43,357 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 94 flow [2025-01-10 00:47:43,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-01-10 00:47:43,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:43,358 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:43,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:47:43,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:43,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:43,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1857641872, now seen corresponding path program 1 times [2025-01-10 00:47:43,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:43,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466238367] [2025-01-10 00:47:43,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:43,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:43,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:47:43,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:47:43,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:43,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:44,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:44,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:44,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466238367] [2025-01-10 00:47:44,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466238367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:44,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:44,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:47:44,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719842266] [2025-01-10 00:47:44,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:44,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:47:44,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:44,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:47:44,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:47:44,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2025-01-10 00:47:44,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-01-10 00:47:44,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:44,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2025-01-10 00:47:44,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:47,018 INFO L124 PetriNetUnfolderBase]: 12285/19363 cut-off events. [2025-01-10 00:47:47,019 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:47:47,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36451 conditions, 19363 events. 12285/19363 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 152880 event pairs, 647 based on Foata normal form. 0/18935 useless extension candidates. Maximal degree in co-relation 36445. Up to 6657 conditions per place. [2025-01-10 00:47:47,149 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 49 selfloop transitions, 12 changer transitions 100/176 dead transitions. [2025-01-10 00:47:47,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 176 transitions, 690 flow [2025-01-10 00:47:47,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:47:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:47:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 404 transitions. [2025-01-10 00:47:47,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6352201257861635 [2025-01-10 00:47:47,154 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 94 flow. Second operand 12 states and 404 transitions. [2025-01-10 00:47:47,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 176 transitions, 690 flow [2025-01-10 00:47:47,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 176 transitions, 689 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:47:47,162 INFO L231 Difference]: Finished difference. Result has 74 places, 52 transitions, 231 flow [2025-01-10 00:47:47,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=231, PETRI_PLACES=74, PETRI_TRANSITIONS=52} [2025-01-10 00:47:47,163 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2025-01-10 00:47:47,164 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 52 transitions, 231 flow [2025-01-10 00:47:47,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-01-10 00:47:47,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:47,164 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-01-10 00:47:47,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:47:47,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:47,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:47,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1560504885, now seen corresponding path program 1 times [2025-01-10 00:47:47,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:47,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108251800] [2025-01-10 00:47:47,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:47,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:47,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:47:47,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:47:47,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:47,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:47,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:47,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:47,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108251800] [2025-01-10 00:47:47,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108251800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:47,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:47,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:47:47,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196924727] [2025-01-10 00:47:47,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:47,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:47:47,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:47,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:47:47,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:47:47,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 53 [2025-01-10 00:47:47,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 52 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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-01-10 00:47:47,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:47,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 53 [2025-01-10 00:47:47,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:49,042 INFO L124 PetriNetUnfolderBase]: 7519/13171 cut-off events. [2025-01-10 00:47:49,043 INFO L125 PetriNetUnfolderBase]: For 26979/28308 co-relation queries the response was YES. [2025-01-10 00:47:49,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42243 conditions, 13171 events. 7519/13171 cut-off events. For 26979/28308 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 110098 event pairs, 2275 based on Foata normal form. 370/13103 useless extension candidates. Maximal degree in co-relation 42225. Up to 7918 conditions per place. [2025-01-10 00:47:49,173 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 42 selfloop transitions, 4 changer transitions 45/114 dead transitions. [2025-01-10 00:47:49,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 114 transitions, 797 flow [2025-01-10 00:47:49,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:47:49,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:47:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 237 transitions. [2025-01-10 00:47:49,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388140161725068 [2025-01-10 00:47:49,175 INFO L175 Difference]: Start difference. First operand has 74 places, 52 transitions, 231 flow. Second operand 7 states and 237 transitions. [2025-01-10 00:47:49,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 114 transitions, 797 flow [2025-01-10 00:47:49,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 114 transitions, 731 flow, removed 33 selfloop flow, removed 4 redundant places. [2025-01-10 00:47:49,250 INFO L231 Difference]: Finished difference. Result has 72 places, 55 transitions, 273 flow [2025-01-10 00:47:49,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=273, PETRI_PLACES=72, PETRI_TRANSITIONS=55} [2025-01-10 00:47:49,252 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 12 predicate places. [2025-01-10 00:47:49,252 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 55 transitions, 273 flow [2025-01-10 00:47:49,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 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-01-10 00:47:49,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:49,253 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:47:49,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:47:49,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:49,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:49,253 INFO L85 PathProgramCache]: Analyzing trace with hash 852582280, now seen corresponding path program 1 times [2025-01-10 00:47:49,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:49,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541330115] [2025-01-10 00:47:49,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:49,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:49,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:47:49,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:47:49,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:49,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:50,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:50,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:50,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541330115] [2025-01-10 00:47:50,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541330115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:50,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:50,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:47:50,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338495021] [2025-01-10 00:47:50,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:50,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:47:50,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:50,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:47:50,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:47:50,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2025-01-10 00:47:50,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 55 transitions, 273 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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-01-10 00:47:50,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:50,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2025-01-10 00:47:50,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:52,046 INFO L124 PetriNetUnfolderBase]: 11217/18235 cut-off events. [2025-01-10 00:47:52,046 INFO L125 PetriNetUnfolderBase]: For 37196/37196 co-relation queries the response was YES. [2025-01-10 00:47:52,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60407 conditions, 18235 events. 11217/18235 cut-off events. For 37196/37196 co-relation queries the response was YES. Maximal size of possible extension queue 1043. Compared 149798 event pairs, 2338 based on Foata normal form. 350/18289 useless extension candidates. Maximal degree in co-relation 60386. Up to 5814 conditions per place. [2025-01-10 00:47:52,214 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 61 selfloop transitions, 24 changer transitions 68/168 dead transitions. [2025-01-10 00:47:52,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 168 transitions, 1209 flow [2025-01-10 00:47:52,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:47:52,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:47:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 327 transitions. [2025-01-10 00:47:52,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6169811320754717 [2025-01-10 00:47:52,217 INFO L175 Difference]: Start difference. First operand has 72 places, 55 transitions, 273 flow. Second operand 10 states and 327 transitions. [2025-01-10 00:47:52,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 168 transitions, 1209 flow [2025-01-10 00:47:52,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 168 transitions, 1177 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-01-10 00:47:52,333 INFO L231 Difference]: Finished difference. Result has 83 places, 71 transitions, 543 flow [2025-01-10 00:47:52,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=543, PETRI_PLACES=83, PETRI_TRANSITIONS=71} [2025-01-10 00:47:52,334 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 23 predicate places. [2025-01-10 00:47:52,334 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 71 transitions, 543 flow [2025-01-10 00:47:52,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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-01-10 00:47:52,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:52,334 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-01-10 00:47:52,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:47:52,335 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:52,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:52,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1983474222, now seen corresponding path program 1 times [2025-01-10 00:47:52,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:52,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343942888] [2025-01-10 00:47:52,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:52,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:52,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 00:47:52,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 00:47:52,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:52,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:53,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:53,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343942888] [2025-01-10 00:47:53,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343942888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:53,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:53,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:47:53,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871763202] [2025-01-10 00:47:53,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:53,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:47:53,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:53,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:47:53,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:47:53,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2025-01-10 00:47:53,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 543 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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-01-10 00:47:53,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:53,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2025-01-10 00:47:53,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:55,166 INFO L124 PetriNetUnfolderBase]: 11325/20082 cut-off events. [2025-01-10 00:47:55,167 INFO L125 PetriNetUnfolderBase]: For 87863/88857 co-relation queries the response was YES. [2025-01-10 00:47:55,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75875 conditions, 20082 events. 11325/20082 cut-off events. For 87863/88857 co-relation queries the response was YES. Maximal size of possible extension queue 1298. Compared 183907 event pairs, 3243 based on Foata normal form. 680/19974 useless extension candidates. Maximal degree in co-relation 75846. Up to 11113 conditions per place. [2025-01-10 00:47:55,425 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 41 selfloop transitions, 6 changer transitions 43/128 dead transitions. [2025-01-10 00:47:55,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 128 transitions, 1125 flow [2025-01-10 00:47:55,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:47:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:47:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2025-01-10 00:47:55,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6145552560646901 [2025-01-10 00:47:55,427 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 543 flow. Second operand 7 states and 228 transitions. [2025-01-10 00:47:55,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 128 transitions, 1125 flow [2025-01-10 00:47:55,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 128 transitions, 1105 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-01-10 00:47:55,827 INFO L231 Difference]: Finished difference. Result has 84 places, 75 transitions, 617 flow [2025-01-10 00:47:55,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=617, PETRI_PLACES=84, PETRI_TRANSITIONS=75} [2025-01-10 00:47:55,828 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 24 predicate places. [2025-01-10 00:47:55,828 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 75 transitions, 617 flow [2025-01-10 00:47:55,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 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-01-10 00:47:55,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:55,828 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-01-10 00:47:55,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:47:55,828 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:55,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:55,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1883622927, now seen corresponding path program 1 times [2025-01-10 00:47:55,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:55,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307358843] [2025-01-10 00:47:55,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:47:55,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:55,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:47:55,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:47:55,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:47:55,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:56,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:56,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307358843] [2025-01-10 00:47:56,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307358843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:56,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:56,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:47:56,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051297341] [2025-01-10 00:47:56,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:56,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:47:56,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:56,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:47:56,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:47:56,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-01-10 00:47:56,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 75 transitions, 617 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-01-10 00:47:56,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:56,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-01-10 00:47:56,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:47:58,897 INFO L124 PetriNetUnfolderBase]: 14278/23422 cut-off events. [2025-01-10 00:47:58,897 INFO L125 PetriNetUnfolderBase]: For 111216/111216 co-relation queries the response was YES. [2025-01-10 00:47:59,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97266 conditions, 23422 events. 14278/23422 cut-off events. For 111216/111216 co-relation queries the response was YES. Maximal size of possible extension queue 1328. Compared 197189 event pairs, 1529 based on Foata normal form. 435/23737 useless extension candidates. Maximal degree in co-relation 97234. Up to 9247 conditions per place. [2025-01-10 00:47:59,087 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 79 selfloop transitions, 47 changer transitions 91/231 dead transitions. [2025-01-10 00:47:59,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 231 transitions, 2441 flow [2025-01-10 00:47:59,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 00:47:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 00:47:59,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 398 transitions. [2025-01-10 00:47:59,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5776487663280117 [2025-01-10 00:47:59,089 INFO L175 Difference]: Start difference. First operand has 84 places, 75 transitions, 617 flow. Second operand 13 states and 398 transitions. [2025-01-10 00:47:59,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 231 transitions, 2441 flow [2025-01-10 00:47:59,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 231 transitions, 2405 flow, removed 14 selfloop flow, removed 3 redundant places. [2025-01-10 00:47:59,323 INFO L231 Difference]: Finished difference. Result has 101 places, 102 transitions, 1163 flow [2025-01-10 00:47:59,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1163, PETRI_PLACES=101, PETRI_TRANSITIONS=102} [2025-01-10 00:47:59,324 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 41 predicate places. [2025-01-10 00:47:59,324 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 102 transitions, 1163 flow [2025-01-10 00:47:59,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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-01-10 00:47:59,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:47:59,324 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-01-10 00:47:59,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:47:59,324 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:47:59,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:47:59,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1767986703, now seen corresponding path program 2 times [2025-01-10 00:47:59,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:47:59,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122999436] [2025-01-10 00:47:59,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:47:59,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:47:59,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:47:59,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:47:59,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:47:59,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:47:59,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:47:59,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:47:59,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122999436] [2025-01-10 00:47:59,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122999436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:47:59,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:47:59,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:47:59,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672918729] [2025-01-10 00:47:59,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:47:59,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:47:59,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:47:59,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:47:59,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:47:59,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2025-01-10 00:47:59,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 102 transitions, 1163 flow. Second operand has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 7 states have internal predecessors, (183), 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-01-10 00:47:59,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:47:59,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2025-01-10 00:47:59,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:01,391 INFO L124 PetriNetUnfolderBase]: 9918/17495 cut-off events. [2025-01-10 00:48:01,391 INFO L125 PetriNetUnfolderBase]: For 147145/148714 co-relation queries the response was YES. [2025-01-10 00:48:01,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80548 conditions, 17495 events. 9918/17495 cut-off events. For 147145/148714 co-relation queries the response was YES. Maximal size of possible extension queue 1044. Compared 154811 event pairs, 1977 based on Foata normal form. 566/17413 useless extension candidates. Maximal degree in co-relation 80505. Up to 9267 conditions per place. [2025-01-10 00:48:01,575 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 46 selfloop transitions, 22 changer transitions 44/169 dead transitions. [2025-01-10 00:48:01,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 169 transitions, 2077 flow [2025-01-10 00:48:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:48:01,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:48:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 259 transitions. [2025-01-10 00:48:01,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6108490566037735 [2025-01-10 00:48:01,577 INFO L175 Difference]: Start difference. First operand has 101 places, 102 transitions, 1163 flow. Second operand 8 states and 259 transitions. [2025-01-10 00:48:01,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 169 transitions, 2077 flow [2025-01-10 00:48:02,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 169 transitions, 2011 flow, removed 33 selfloop flow, removed 6 redundant places. [2025-01-10 00:48:02,193 INFO L231 Difference]: Finished difference. Result has 100 places, 112 transitions, 1375 flow [2025-01-10 00:48:02,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1375, PETRI_PLACES=100, PETRI_TRANSITIONS=112} [2025-01-10 00:48:02,194 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 40 predicate places. [2025-01-10 00:48:02,194 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 112 transitions, 1375 flow [2025-01-10 00:48:02,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 7 states have internal predecessors, (183), 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-01-10 00:48:02,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:02,194 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-01-10 00:48:02,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:48:02,194 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:48:02,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:02,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1585188850, now seen corresponding path program 1 times [2025-01-10 00:48:02,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:02,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428704723] [2025-01-10 00:48:02,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:02,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:02,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:48:02,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:48:02,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:02,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:02,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:02,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428704723] [2025-01-10 00:48:02,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428704723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:02,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:02,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:48:02,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951833270] [2025-01-10 00:48:02,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:02,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:48:02,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:02,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:48:02,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:48:02,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2025-01-10 00:48:02,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 112 transitions, 1375 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-01-10 00:48:02,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:02,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2025-01-10 00:48:02,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:06,959 INFO L124 PetriNetUnfolderBase]: 30367/46275 cut-off events. [2025-01-10 00:48:06,959 INFO L125 PetriNetUnfolderBase]: For 307892/324518 co-relation queries the response was YES. [2025-01-10 00:48:07,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179414 conditions, 46275 events. 30367/46275 cut-off events. For 307892/324518 co-relation queries the response was YES. Maximal size of possible extension queue 2163. Compared 369008 event pairs, 5562 based on Foata normal form. 3495/48421 useless extension candidates. Maximal degree in co-relation 179369. Up to 25673 conditions per place. [2025-01-10 00:48:07,482 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 113 selfloop transitions, 6 changer transitions 2/175 dead transitions. [2025-01-10 00:48:07,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 175 transitions, 2447 flow [2025-01-10 00:48:07,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:48:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:48:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2025-01-10 00:48:07,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6509433962264151 [2025-01-10 00:48:07,483 INFO L175 Difference]: Start difference. First operand has 100 places, 112 transitions, 1375 flow. Second operand 4 states and 138 transitions. [2025-01-10 00:48:07,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 175 transitions, 2447 flow [2025-01-10 00:48:08,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 175 transitions, 2259 flow, removed 75 selfloop flow, removed 5 redundant places. [2025-01-10 00:48:08,314 INFO L231 Difference]: Finished difference. Result has 96 places, 114 transitions, 1301 flow [2025-01-10 00:48:08,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1301, PETRI_PLACES=96, PETRI_TRANSITIONS=114} [2025-01-10 00:48:08,315 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 36 predicate places. [2025-01-10 00:48:08,315 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 114 transitions, 1301 flow [2025-01-10 00:48:08,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-01-10 00:48:08,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:08,315 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] [2025-01-10 00:48:08,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:48:08,316 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:48:08,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:08,316 INFO L85 PathProgramCache]: Analyzing trace with hash 50796556, now seen corresponding path program 1 times [2025-01-10 00:48:08,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:08,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909440176] [2025-01-10 00:48:08,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:08,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:08,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:48:08,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:48:08,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:08,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:08,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:08,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909440176] [2025-01-10 00:48:08,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909440176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:08,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:08,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:48:08,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480964539] [2025-01-10 00:48:08,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:08,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:48:08,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:08,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:48:08,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:48:08,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 53 [2025-01-10 00:48:08,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 114 transitions, 1301 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 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-01-10 00:48:08,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:08,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 53 [2025-01-10 00:48:08,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:14,941 INFO L124 PetriNetUnfolderBase]: 33542/54483 cut-off events. [2025-01-10 00:48:14,941 INFO L125 PetriNetUnfolderBase]: For 262912/265452 co-relation queries the response was YES. [2025-01-10 00:48:15,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219927 conditions, 54483 events. 33542/54483 cut-off events. For 262912/265452 co-relation queries the response was YES. Maximal size of possible extension queue 2873. Compared 498477 event pairs, 10339 based on Foata normal form. 911/50958 useless extension candidates. Maximal degree in co-relation 219883. Up to 19467 conditions per place. [2025-01-10 00:48:15,560 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 128 selfloop transitions, 51 changer transitions 27/228 dead transitions. [2025-01-10 00:48:15,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 228 transitions, 2741 flow [2025-01-10 00:48:15,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:48:15,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:48:15,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 323 transitions. [2025-01-10 00:48:15,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6094339622641509 [2025-01-10 00:48:15,563 INFO L175 Difference]: Start difference. First operand has 96 places, 114 transitions, 1301 flow. Second operand 10 states and 323 transitions. [2025-01-10 00:48:15,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 228 transitions, 2741 flow [2025-01-10 00:48:16,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 228 transitions, 2715 flow, removed 12 selfloop flow, removed 3 redundant places. [2025-01-10 00:48:16,596 INFO L231 Difference]: Finished difference. Result has 110 places, 130 transitions, 1724 flow [2025-01-10 00:48:16,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1724, PETRI_PLACES=110, PETRI_TRANSITIONS=130} [2025-01-10 00:48:16,597 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 50 predicate places. [2025-01-10 00:48:16,598 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 130 transitions, 1724 flow [2025-01-10 00:48:16,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 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-01-10 00:48:16,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:16,598 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] [2025-01-10 00:48:16,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:48:16,598 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:48:16,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:16,599 INFO L85 PathProgramCache]: Analyzing trace with hash 4550788, now seen corresponding path program 1 times [2025-01-10 00:48:16,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:16,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104101747] [2025-01-10 00:48:16,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:16,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:16,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:48:16,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:48:16,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:16,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:17,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:17,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104101747] [2025-01-10 00:48:17,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104101747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:17,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:17,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:48:17,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224942552] [2025-01-10 00:48:17,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:17,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:48:17,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:17,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:48:17,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:48:17,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2025-01-10 00:48:17,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 130 transitions, 1724 flow. Second operand has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 7 states have internal predecessors, (183), 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-01-10 00:48:17,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:17,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2025-01-10 00:48:17,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:22,497 INFO L124 PetriNetUnfolderBase]: 28411/48658 cut-off events. [2025-01-10 00:48:22,497 INFO L125 PetriNetUnfolderBase]: For 324600/330691 co-relation queries the response was YES. [2025-01-10 00:48:23,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202369 conditions, 48658 events. 28411/48658 cut-off events. For 324600/330691 co-relation queries the response was YES. Maximal size of possible extension queue 2847. Compared 469784 event pairs, 11189 based on Foata normal form. 1560/45739 useless extension candidates. Maximal degree in co-relation 202318. Up to 28942 conditions per place. [2025-01-10 00:48:23,199 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 82 selfloop transitions, 25 changer transitions 28/202 dead transitions. [2025-01-10 00:48:23,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 202 transitions, 2787 flow [2025-01-10 00:48:23,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:48:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:48:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 257 transitions. [2025-01-10 00:48:23,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6061320754716981 [2025-01-10 00:48:23,200 INFO L175 Difference]: Start difference. First operand has 110 places, 130 transitions, 1724 flow. Second operand 8 states and 257 transitions. [2025-01-10 00:48:23,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 202 transitions, 2787 flow [2025-01-10 00:48:24,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 202 transitions, 2623 flow, removed 82 selfloop flow, removed 0 redundant places. [2025-01-10 00:48:24,913 INFO L231 Difference]: Finished difference. Result has 122 places, 145 transitions, 1971 flow [2025-01-10 00:48:24,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1638, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1971, PETRI_PLACES=122, PETRI_TRANSITIONS=145} [2025-01-10 00:48:24,914 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 62 predicate places. [2025-01-10 00:48:24,914 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 145 transitions, 1971 flow [2025-01-10 00:48:24,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 7 states have internal predecessors, (183), 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-01-10 00:48:24,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:24,915 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] [2025-01-10 00:48:24,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:48:24,915 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:48:24,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:24,915 INFO L85 PathProgramCache]: Analyzing trace with hash -2016975304, now seen corresponding path program 1 times [2025-01-10 00:48:24,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:24,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654303076] [2025-01-10 00:48:24,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:24,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:24,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:48:24,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:48:24,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:24,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:25,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-01-10 00:48:25,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:25,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654303076] [2025-01-10 00:48:25,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654303076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:25,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:25,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:48:25,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876960020] [2025-01-10 00:48:25,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:25,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:48:25,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:25,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:48:25,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:48:25,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2025-01-10 00:48:25,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 145 transitions, 1971 flow. Second operand has 9 states, 9 states have (on average 25.88888888888889) internal successors, (233), 9 states have internal predecessors, (233), 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-01-10 00:48:25,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:25,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2025-01-10 00:48:25,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:33,182 INFO L124 PetriNetUnfolderBase]: 36352/61891 cut-off events. [2025-01-10 00:48:33,182 INFO L125 PetriNetUnfolderBase]: For 527848/534935 co-relation queries the response was YES. [2025-01-10 00:48:33,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275860 conditions, 61891 events. 36352/61891 cut-off events. For 527848/534935 co-relation queries the response was YES. Maximal size of possible extension queue 3657. Compared 612999 event pairs, 11245 based on Foata normal form. 1977/58387 useless extension candidates. Maximal degree in co-relation 275802. Up to 31729 conditions per place. [2025-01-10 00:48:34,009 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 103 selfloop transitions, 45 changer transitions 20/235 dead transitions. [2025-01-10 00:48:34,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 235 transitions, 3351 flow [2025-01-10 00:48:34,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:48:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:48:34,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 289 transitions. [2025-01-10 00:48:34,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6058700209643606 [2025-01-10 00:48:34,010 INFO L175 Difference]: Start difference. First operand has 122 places, 145 transitions, 1971 flow. Second operand 9 states and 289 transitions. [2025-01-10 00:48:34,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 235 transitions, 3351 flow [2025-01-10 00:48:36,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 235 transitions, 3300 flow, removed 21 selfloop flow, removed 1 redundant places. [2025-01-10 00:48:36,492 INFO L231 Difference]: Finished difference. Result has 133 places, 173 transitions, 2593 flow [2025-01-10 00:48:36,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1920, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2593, PETRI_PLACES=133, PETRI_TRANSITIONS=173} [2025-01-10 00:48:36,493 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 73 predicate places. [2025-01-10 00:48:36,493 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 173 transitions, 2593 flow [2025-01-10 00:48:36,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.88888888888889) internal successors, (233), 9 states have internal predecessors, (233), 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-01-10 00:48:36,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:36,493 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] [2025-01-10 00:48:36,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:48:36,494 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-01-10 00:48:36,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:36,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1293494212, now seen corresponding path program 2 times [2025-01-10 00:48:36,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:36,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798769919] [2025-01-10 00:48:36,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:48:36,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:36,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:48:36,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:48:36,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:48:36,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:36,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:36,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798769919] [2025-01-10 00:48:36,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798769919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:36,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:36,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:48:36,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788671929] [2025-01-10 00:48:36,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:36,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:48:36,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:36,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:48:36,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:48:36,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2025-01-10 00:48:36,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 173 transitions, 2593 flow. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 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-01-10 00:48:36,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:36,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2025-01-10 00:48:36,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand