./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix008_tso.oepc.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/mix008_tso.oepc.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 5babed9169ff1f82a919f6310b42a42108866edd5cf3c99389faf03347963192 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:42:05,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:42:05,572 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:42:05,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:42:05,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:42:05,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:42:05,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:42:05,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:42:05,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:42:05,615 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:42:05,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:42:05,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:42:05,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:42:05,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:42:05,617 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:42:05,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:42:05,617 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:42:05,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:42:05,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:42:05,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:42:05,617 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:42:05,617 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:42:05,617 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:42:05,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:42:05,618 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:42:05,618 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:42:05,618 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:42:05,618 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:42:05,618 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:42:05,618 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:42:05,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:42:05,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:42:05,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:42:05,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:42:05,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:42:05,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:42:05,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:42:05,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:42:05,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:42:05,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:42:05,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:42:05,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:42:05,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:42:05,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:42:05,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:42:05,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:42:05,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:42:05,621 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 -> 5babed9169ff1f82a919f6310b42a42108866edd5cf3c99389faf03347963192 [2025-01-10 00:42:05,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:42:05,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:42:05,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:42:05,960 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:42:05,960 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:42:05,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix008_tso.oepc.i [2025-01-10 00:42:07,234 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f7ed7dff/77365abaa7c445889798b1898d51b8ff/FLAG31ef4020e [2025-01-10 00:42:07,560 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:42:07,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix008_tso.oepc.i [2025-01-10 00:42:07,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f7ed7dff/77365abaa7c445889798b1898d51b8ff/FLAG31ef4020e [2025-01-10 00:42:07,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f7ed7dff/77365abaa7c445889798b1898d51b8ff [2025-01-10 00:42:07,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:42:07,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:42:07,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:42:07,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:42:07,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:42:07,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:42:07" (1/1) ... [2025-01-10 00:42:07,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56051390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:07, skipping insertion in model container [2025-01-10 00:42:07,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:42:07" (1/1) ... [2025-01-10 00:42:07,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:42:08,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:42:08,103 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:42:08,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:42:08,238 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:42:08,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:08 WrapperNode [2025-01-10 00:42:08,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:42:08,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:42:08,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:42:08,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:42:08,249 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:42:08" (1/1) ... [2025-01-10 00:42:08,274 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:42:08" (1/1) ... [2025-01-10 00:42:08,320 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 279 [2025-01-10 00:42:08,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:42:08,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:42:08,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:42:08,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:42:08,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:08" (1/1) ... [2025-01-10 00:42:08,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:08" (1/1) ... [2025-01-10 00:42:08,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:08" (1/1) ... [2025-01-10 00:42:08,363 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:42:08,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:08" (1/1) ... [2025-01-10 00:42:08,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:08" (1/1) ... [2025-01-10 00:42:08,379 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:08" (1/1) ... [2025-01-10 00:42:08,385 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:08" (1/1) ... [2025-01-10 00:42:08,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:08" (1/1) ... [2025-01-10 00:42:08,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:08" (1/1) ... [2025-01-10 00:42:08,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:08" (1/1) ... [2025-01-10 00:42:08,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:42:08,403 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:42:08,403 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:42:08,403 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:42:08,404 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:08" (1/1) ... [2025-01-10 00:42:08,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:42:08,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:42:08,439 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:42:08,443 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:42:08,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:42:08,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:42:08,468 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:42:08,468 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:42:08,468 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:42:08,468 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:42:08,468 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:42:08,468 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:42:08,468 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-01-10 00:42:08,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-01-10 00:42:08,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:42:08,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:42:08,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:42:08,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:42:08,470 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:42:08,640 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:42:08,643 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:42:09,132 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:42:09,133 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:42:09,514 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:42:09,514 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:42:09,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:42:09 BoogieIcfgContainer [2025-01-10 00:42:09,516 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:42:09,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:42:09,518 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:42:09,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:42:09,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:42:07" (1/3) ... [2025-01-10 00:42:09,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f8ff2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:42:09, skipping insertion in model container [2025-01-10 00:42:09,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:42:08" (2/3) ... [2025-01-10 00:42:09,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f8ff2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:42:09, skipping insertion in model container [2025-01-10 00:42:09,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:42:09" (3/3) ... [2025-01-10 00:42:09,526 INFO L128 eAbstractionObserver]: Analyzing ICFG mix008_tso.oepc.i [2025-01-10 00:42:09,542 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:42:09,544 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix008_tso.oepc.i that has 5 procedures, 55 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-01-10 00:42:09,546 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:42:09,630 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:42:09,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 56 transitions, 128 flow [2025-01-10 00:42:09,710 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2025-01-10 00:42:09,713 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:42:09,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 52 events. 2/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 119 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2025-01-10 00:42:09,718 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 56 transitions, 128 flow [2025-01-10 00:42:09,722 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 52 transitions, 116 flow [2025-01-10 00:42:09,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:42:09,745 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;@60362a97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:42:09,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 00:42:09,756 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:42:09,756 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2025-01-10 00:42:09,756 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:42:09,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:09,757 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:09,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-01-10 00:42:09,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:09,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1813919590, now seen corresponding path program 1 times [2025-01-10 00:42:09,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:09,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711349776] [2025-01-10 00:42:09,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:09,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:09,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:42:09,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:42:09,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:09,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:10,315 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:42:10,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:10,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711349776] [2025-01-10 00:42:10,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711349776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:10,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:10,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:42:10,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221062357] [2025-01-10 00:42:10,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:10,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:42:10,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:10,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:42:10,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:42:10,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 56 [2025-01-10 00:42:10,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:42:10,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:10,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 56 [2025-01-10 00:42:10,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:12,057 INFO L124 PetriNetUnfolderBase]: 5453/8045 cut-off events. [2025-01-10 00:42:12,058 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-01-10 00:42:12,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15627 conditions, 8045 events. 5453/8045 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 60364 event pairs, 643 based on Foata normal form. 432/8129 useless extension candidates. Maximal degree in co-relation 15615. Up to 6491 conditions per place. [2025-01-10 00:42:12,133 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 45 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2025-01-10 00:42:12,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 241 flow [2025-01-10 00:42:12,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:42:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:42:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2025-01-10 00:42:12,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7202380952380952 [2025-01-10 00:42:12,147 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 121 transitions. [2025-01-10 00:42:12,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 241 flow [2025-01-10 00:42:12,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 66 transitions, 236 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:42:12,158 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 108 flow [2025-01-10 00:42:12,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2025-01-10 00:42:12,165 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -4 predicate places. [2025-01-10 00:42:12,167 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 108 flow [2025-01-10 00:42:12,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:42:12,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:12,168 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:12,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:42:12,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-01-10 00:42:12,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:12,169 INFO L85 PathProgramCache]: Analyzing trace with hash 579502019, now seen corresponding path program 1 times [2025-01-10 00:42:12,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:12,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081341588] [2025-01-10 00:42:12,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:12,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:12,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:42:12,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:42:12,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:12,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:12,471 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:42:12,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:12,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081341588] [2025-01-10 00:42:12,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081341588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:12,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:12,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:42:12,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350543273] [2025-01-10 00:42:12,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:12,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:42:12,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:12,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:42:12,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:42:12,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 56 [2025-01-10 00:42:12,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:12,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:12,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 56 [2025-01-10 00:42:12,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:13,659 INFO L124 PetriNetUnfolderBase]: 4517/7091 cut-off events. [2025-01-10 00:42:13,659 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-01-10 00:42:13,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13693 conditions, 7091 events. 4517/7091 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 54169 event pairs, 773 based on Foata normal form. 0/7061 useless extension candidates. Maximal degree in co-relation 13683. Up to 5041 conditions per place. [2025-01-10 00:42:13,707 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 40 selfloop transitions, 2 changer transitions 2/63 dead transitions. [2025-01-10 00:42:13,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 228 flow [2025-01-10 00:42:13,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:42:13,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:42:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2025-01-10 00:42:13,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-01-10 00:42:13,709 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 108 flow. Second operand 3 states and 114 transitions. [2025-01-10 00:42:13,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 228 flow [2025-01-10 00:42:13,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:42:13,714 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 104 flow [2025-01-10 00:42:13,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2025-01-10 00:42:13,715 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -5 predicate places. [2025-01-10 00:42:13,715 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 104 flow [2025-01-10 00:42:13,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:42:13,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:13,718 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:42:13,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:42:13,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-01-10 00:42:13,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:13,719 INFO L85 PathProgramCache]: Analyzing trace with hash -827365833, now seen corresponding path program 1 times [2025-01-10 00:42:13,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:13,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009750411] [2025-01-10 00:42:13,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:13,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:13,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:42:13,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:42:13,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:13,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:13,817 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:42:13,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:13,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009750411] [2025-01-10 00:42:13,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009750411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:13,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:13,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:42:13,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845332811] [2025-01-10 00:42:13,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:13,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:42:13,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:13,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:42:13,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:42:13,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-01-10 00:42:13,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:42:13,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:13,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-01-10 00:42:13,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:14,998 INFO L124 PetriNetUnfolderBase]: 4013/6383 cut-off events. [2025-01-10 00:42:14,999 INFO L125 PetriNetUnfolderBase]: For 288/288 co-relation queries the response was YES. [2025-01-10 00:42:15,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12307 conditions, 6383 events. 4013/6383 cut-off events. For 288/288 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 48885 event pairs, 4013 based on Foata normal form. 180/6443 useless extension candidates. Maximal degree in co-relation 12297. Up to 5542 conditions per place. [2025-01-10 00:42:15,031 INFO L140 encePairwiseOnDemand]: 54/56 looper letters, 25 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2025-01-10 00:42:15,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 156 flow [2025-01-10 00:42:15,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:42:15,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:42:15,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2025-01-10 00:42:15,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2025-01-10 00:42:15,034 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 94 transitions. [2025-01-10 00:42:15,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 156 flow [2025-01-10 00:42:15,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 45 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:42:15,037 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2025-01-10 00:42:15,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-01-10 00:42:15,037 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -7 predicate places. [2025-01-10 00:42:15,038 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2025-01-10 00:42:15,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:42:15,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:15,038 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:42:15,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:42:15,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-01-10 00:42:15,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:15,039 INFO L85 PathProgramCache]: Analyzing trace with hash -827364483, now seen corresponding path program 1 times [2025-01-10 00:42:15,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:15,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964155350] [2025-01-10 00:42:15,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:15,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:15,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:42:15,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:42:15,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:15,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:15,373 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:42:15,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:15,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964155350] [2025-01-10 00:42:15,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964155350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:15,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:15,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:42:15,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994629765] [2025-01-10 00:42:15,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:15,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:42:15,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:15,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:42:15,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:42:15,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-01-10 00:42:15,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:42:15,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:15,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-01-10 00:42:15,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:16,480 INFO L124 PetriNetUnfolderBase]: 4553/7157 cut-off events. [2025-01-10 00:42:16,480 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:42:16,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13585 conditions, 7157 events. 4553/7157 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 55351 event pairs, 1025 based on Foata normal form. 0/7007 useless extension candidates. Maximal degree in co-relation 13579. Up to 2809 conditions per place. [2025-01-10 00:42:16,515 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 35 selfloop transitions, 2 changer transitions 56/110 dead transitions. [2025-01-10 00:42:16,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 110 transitions, 416 flow [2025-01-10 00:42:16,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:42:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:42:16,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 271 transitions. [2025-01-10 00:42:16,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6049107142857143 [2025-01-10 00:42:16,522 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 8 states and 271 transitions. [2025-01-10 00:42:16,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 110 transitions, 416 flow [2025-01-10 00:42:16,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 110 transitions, 415 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:42:16,528 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 111 flow [2025-01-10 00:42:16,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=111, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2025-01-10 00:42:16,529 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 3 predicate places. [2025-01-10 00:42:16,530 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 111 flow [2025-01-10 00:42:16,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:42:16,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:16,530 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:42:16,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:42:16,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-01-10 00:42:16,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:16,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1023404418, now seen corresponding path program 1 times [2025-01-10 00:42:16,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:16,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218746063] [2025-01-10 00:42:16,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:16,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:16,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:42:16,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:42:16,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:16,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:17,342 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:42:17,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:17,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218746063] [2025-01-10 00:42:17,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218746063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:17,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:17,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:42:17,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305405205] [2025-01-10 00:42:17,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:17,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:42:17,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:17,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:42:17,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:42:17,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-01-10 00:42:17,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 111 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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:42:17,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:17,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-01-10 00:42:17,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:20,002 INFO L124 PetriNetUnfolderBase]: 12219/18947 cut-off events. [2025-01-10 00:42:20,002 INFO L125 PetriNetUnfolderBase]: For 3536/3536 co-relation queries the response was YES. [2025-01-10 00:42:20,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39303 conditions, 18947 events. 12219/18947 cut-off events. For 3536/3536 co-relation queries the response was YES. Maximal size of possible extension queue 896. Compared 142097 event pairs, 2003 based on Foata normal form. 416/19315 useless extension candidates. Maximal degree in co-relation 39291. Up to 8569 conditions per place. [2025-01-10 00:42:20,106 INFO L140 encePairwiseOnDemand]: 42/56 looper letters, 52 selfloop transitions, 11 changer transitions 67/144 dead transitions. [2025-01-10 00:42:20,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 144 transitions, 607 flow [2025-01-10 00:42:20,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:42:20,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:42:20,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 323 transitions. [2025-01-10 00:42:20,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5767857142857142 [2025-01-10 00:42:20,109 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 111 flow. Second operand 10 states and 323 transitions. [2025-01-10 00:42:20,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 144 transitions, 607 flow [2025-01-10 00:42:20,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 144 transitions, 571 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-01-10 00:42:20,264 INFO L231 Difference]: Finished difference. Result has 72 places, 52 transitions, 224 flow [2025-01-10 00:42:20,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=224, PETRI_PLACES=72, PETRI_TRANSITIONS=52} [2025-01-10 00:42:20,265 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 9 predicate places. [2025-01-10 00:42:20,267 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 52 transitions, 224 flow [2025-01-10 00:42:20,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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:42:20,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:20,268 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:42:20,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:42:20,268 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-01-10 00:42:20,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:20,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1742486631, now seen corresponding path program 1 times [2025-01-10 00:42:20,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:20,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299869900] [2025-01-10 00:42:20,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:20,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:20,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 00:42:20,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 00:42:20,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:20,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:20,658 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:42:20,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:20,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299869900] [2025-01-10 00:42:20,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299869900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:20,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:20,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:42:20,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864281799] [2025-01-10 00:42:20,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:20,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:42:20,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:20,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:42:20,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:42:20,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 56 [2025-01-10 00:42:20,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 52 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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:42:20,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:20,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 56 [2025-01-10 00:42:20,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:22,402 INFO L124 PetriNetUnfolderBase]: 10618/17287 cut-off events. [2025-01-10 00:42:22,402 INFO L125 PetriNetUnfolderBase]: For 23381/23874 co-relation queries the response was YES. [2025-01-10 00:42:22,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53099 conditions, 17287 events. 10618/17287 cut-off events. For 23381/23874 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 133037 event pairs, 3143 based on Foata normal form. 335/17345 useless extension candidates. Maximal degree in co-relation 53082. Up to 11983 conditions per place. [2025-01-10 00:42:22,520 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 53 selfloop transitions, 4 changer transitions 47/120 dead transitions. [2025-01-10 00:42:22,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 120 transitions, 799 flow [2025-01-10 00:42:22,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:42:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:42:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions. [2025-01-10 00:42:22,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5790816326530612 [2025-01-10 00:42:22,522 INFO L175 Difference]: Start difference. First operand has 72 places, 52 transitions, 224 flow. Second operand 7 states and 227 transitions. [2025-01-10 00:42:22,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 120 transitions, 799 flow [2025-01-10 00:42:22,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 120 transitions, 780 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-01-10 00:42:22,752 INFO L231 Difference]: Finished difference. Result has 74 places, 55 transitions, 272 flow [2025-01-10 00:42:22,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=63, 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=272, PETRI_PLACES=74, PETRI_TRANSITIONS=55} [2025-01-10 00:42:22,752 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 11 predicate places. [2025-01-10 00:42:22,752 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 55 transitions, 272 flow [2025-01-10 00:42:22,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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:42:22,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:22,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:22,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:42:22,753 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-01-10 00:42:22,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:22,753 INFO L85 PathProgramCache]: Analyzing trace with hash 93326016, now seen corresponding path program 1 times [2025-01-10 00:42:22,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:22,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874259357] [2025-01-10 00:42:22,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:22,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:22,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 00:42:22,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 00:42:22,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:22,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:23,119 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:42:23,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:23,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874259357] [2025-01-10 00:42:23,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874259357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:23,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:23,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:42:23,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943651826] [2025-01-10 00:42:23,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:23,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:42:23,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:23,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:42:23,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:42:23,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 56 [2025-01-10 00:42:23,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 55 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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:42:23,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:23,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 56 [2025-01-10 00:42:23,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:27,117 INFO L124 PetriNetUnfolderBase]: 26194/37863 cut-off events. [2025-01-10 00:42:27,117 INFO L125 PetriNetUnfolderBase]: For 50172/54417 co-relation queries the response was YES. [2025-01-10 00:42:27,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112421 conditions, 37863 events. 26194/37863 cut-off events. For 50172/54417 co-relation queries the response was YES. Maximal size of possible extension queue 1528. Compared 261849 event pairs, 4011 based on Foata normal form. 1274/37922 useless extension candidates. Maximal degree in co-relation 112400. Up to 20251 conditions per place. [2025-01-10 00:42:27,385 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 77 selfloop transitions, 6 changer transitions 0/101 dead transitions. [2025-01-10 00:42:27,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 101 transitions, 638 flow [2025-01-10 00:42:27,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:42:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:42:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-01-10 00:42:27,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6294642857142857 [2025-01-10 00:42:27,387 INFO L175 Difference]: Start difference. First operand has 74 places, 55 transitions, 272 flow. Second operand 4 states and 141 transitions. [2025-01-10 00:42:27,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 101 transitions, 638 flow [2025-01-10 00:42:27,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 101 transitions, 622 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-01-10 00:42:27,517 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 302 flow [2025-01-10 00:42:27,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2025-01-10 00:42:27,518 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 7 predicate places. [2025-01-10 00:42:27,518 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 302 flow [2025-01-10 00:42:27,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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:42:27,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:27,518 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:27,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:42:27,518 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-01-10 00:42:27,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash 840694961, now seen corresponding path program 1 times [2025-01-10 00:42:27,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:27,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507423520] [2025-01-10 00:42:27,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:27,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:27,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 00:42:27,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:42:27,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:27,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:27,912 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:42:27,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:27,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507423520] [2025-01-10 00:42:27,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507423520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:27,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:27,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:42:27,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758216098] [2025-01-10 00:42:27,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:27,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:42:27,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:27,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:42:27,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:42:27,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 56 [2025-01-10 00:42:27,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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:42:27,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:27,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 56 [2025-01-10 00:42:27,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:32,350 INFO L124 PetriNetUnfolderBase]: 23695/36959 cut-off events. [2025-01-10 00:42:32,351 INFO L125 PetriNetUnfolderBase]: For 53754/56264 co-relation queries the response was YES. [2025-01-10 00:42:32,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117293 conditions, 36959 events. 23695/36959 cut-off events. For 53754/56264 co-relation queries the response was YES. Maximal size of possible extension queue 1665. Compared 298406 event pairs, 10124 based on Foata normal form. 568/34652 useless extension candidates. Maximal degree in co-relation 117273. Up to 15413 conditions per place. [2025-01-10 00:42:32,776 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 88 selfloop transitions, 11 changer transitions 0/120 dead transitions. [2025-01-10 00:42:32,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 120 transitions, 806 flow [2025-01-10 00:42:32,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:42:32,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:42:32,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 231 transitions. [2025-01-10 00:42:32,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2025-01-10 00:42:32,778 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 302 flow. Second operand 7 states and 231 transitions. [2025-01-10 00:42:32,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 120 transitions, 806 flow [2025-01-10 00:42:32,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 120 transitions, 798 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-10 00:42:32,823 INFO L231 Difference]: Finished difference. Result has 80 places, 65 transitions, 392 flow [2025-01-10 00:42:32,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=392, PETRI_PLACES=80, PETRI_TRANSITIONS=65} [2025-01-10 00:42:32,825 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 17 predicate places. [2025-01-10 00:42:32,827 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 65 transitions, 392 flow [2025-01-10 00:42:32,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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:42:32,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:32,827 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:32,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:42:32,827 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-01-10 00:42:32,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:32,828 INFO L85 PathProgramCache]: Analyzing trace with hash 127850953, now seen corresponding path program 1 times [2025-01-10 00:42:32,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:32,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419872447] [2025-01-10 00:42:32,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:32,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:32,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 00:42:32,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 00:42:32,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:32,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:33,206 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:42:33,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:33,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419872447] [2025-01-10 00:42:33,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419872447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:33,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:33,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:42:33,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969049491] [2025-01-10 00:42:33,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:33,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:42:33,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:33,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:42:33,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:42:33,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 56 [2025-01-10 00:42:33,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 65 transitions, 392 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:42:33,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:33,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 56 [2025-01-10 00:42:33,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:38,232 INFO L124 PetriNetUnfolderBase]: 32312/46465 cut-off events. [2025-01-10 00:42:38,232 INFO L125 PetriNetUnfolderBase]: For 77784/86509 co-relation queries the response was YES. [2025-01-10 00:42:38,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151002 conditions, 46465 events. 32312/46465 cut-off events. For 77784/86509 co-relation queries the response was YES. Maximal size of possible extension queue 1850. Compared 324622 event pairs, 3146 based on Foata normal form. 1958/47093 useless extension candidates. Maximal degree in co-relation 150977. Up to 18125 conditions per place. [2025-01-10 00:42:38,582 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 97 selfloop transitions, 10 changer transitions 8/133 dead transitions. [2025-01-10 00:42:38,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 133 transitions, 935 flow [2025-01-10 00:42:38,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:42:38,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:42:38,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2025-01-10 00:42:38,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6464285714285715 [2025-01-10 00:42:38,583 INFO L175 Difference]: Start difference. First operand has 80 places, 65 transitions, 392 flow. Second operand 5 states and 181 transitions. [2025-01-10 00:42:38,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 133 transitions, 935 flow [2025-01-10 00:42:38,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 133 transitions, 913 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-01-10 00:42:38,746 INFO L231 Difference]: Finished difference. Result has 85 places, 65 transitions, 385 flow [2025-01-10 00:42:38,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=385, PETRI_PLACES=85, PETRI_TRANSITIONS=65} [2025-01-10 00:42:38,747 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 22 predicate places. [2025-01-10 00:42:38,747 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 65 transitions, 385 flow [2025-01-10 00:42:38,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:42:38,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:38,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:38,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:42:38,747 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-01-10 00:42:38,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:38,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1549392262, now seen corresponding path program 1 times [2025-01-10 00:42:38,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:38,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446126063] [2025-01-10 00:42:38,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:38,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:38,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 00:42:38,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 00:42:38,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:38,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:39,194 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:42:39,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:39,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446126063] [2025-01-10 00:42:39,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446126063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:39,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:39,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:42:39,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627204709] [2025-01-10 00:42:39,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:39,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:42:39,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:39,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:42:39,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:42:39,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 56 [2025-01-10 00:42:39,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 65 transitions, 385 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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:42:39,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:39,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 56 [2025-01-10 00:42:39,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:42:43,659 INFO L124 PetriNetUnfolderBase]: 24556/35193 cut-off events. [2025-01-10 00:42:43,660 INFO L125 PetriNetUnfolderBase]: For 77389/90366 co-relation queries the response was YES. [2025-01-10 00:42:43,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124284 conditions, 35193 events. 24556/35193 cut-off events. For 77389/90366 co-relation queries the response was YES. Maximal size of possible extension queue 1568. Compared 239283 event pairs, 1908 based on Foata normal form. 1584/35550 useless extension candidates. Maximal degree in co-relation 124256. Up to 12780 conditions per place. [2025-01-10 00:42:43,943 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 108 selfloop transitions, 14 changer transitions 13/153 dead transitions. [2025-01-10 00:42:43,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 153 transitions, 1084 flow [2025-01-10 00:42:43,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:42:43,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:42:43,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2025-01-10 00:42:43,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6517857142857143 [2025-01-10 00:42:43,944 INFO L175 Difference]: Start difference. First operand has 85 places, 65 transitions, 385 flow. Second operand 6 states and 219 transitions. [2025-01-10 00:42:43,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 153 transitions, 1084 flow [2025-01-10 00:42:44,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 153 transitions, 1058 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-01-10 00:42:44,017 INFO L231 Difference]: Finished difference. Result has 82 places, 69 transitions, 439 flow [2025-01-10 00:42:44,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=439, PETRI_PLACES=82, PETRI_TRANSITIONS=69} [2025-01-10 00:42:44,017 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 19 predicate places. [2025-01-10 00:42:44,018 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 69 transitions, 439 flow [2025-01-10 00:42:44,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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:42:44,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:42:44,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:42:44,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:42:44,018 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-01-10 00:42:44,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:42:44,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1865949677, now seen corresponding path program 1 times [2025-01-10 00:42:44,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:42:44,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098477280] [2025-01-10 00:42:44,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:42:44,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:42:44,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 00:42:44,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 00:42:44,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:42:44,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:42:44,503 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:42:44,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:42:44,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098477280] [2025-01-10 00:42:44,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098477280] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:42:44,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:42:44,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:42:44,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017221602] [2025-01-10 00:42:44,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:42:44,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:42:44,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:42:44,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:42:44,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:42:44,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 56 [2025-01-10 00:42:44,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 69 transitions, 439 flow. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 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:42:44,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:42:44,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 56 [2025-01-10 00:42:44,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand