./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc 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/mix017_power.opt_rmo.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c394bf0b454616c76d3ba114fe7f9b161b2a3a1a85dec23beec05d3a021c1c91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:40:05,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:40:05,588 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:40:05,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:40:05,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:40:05,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:40:05,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:40:05,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:40:05,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:40:05,616 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:40:05,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:40:05,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:40:05,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:40:05,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:40:05,617 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:40:05,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:40:05,618 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:40:05,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:40:05,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:40:05,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:40:05,618 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:40:05,618 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:40:05,618 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:40:05,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:40:05,619 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:40:05,619 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:40:05,619 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:40:05,619 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:40:05,619 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:40:05,619 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:40:05,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:40:05,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:40:05,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:40:05,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:40:05,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:40:05,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:40:05,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:40:05,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:40:05,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:40:05,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:40:05,620 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:40:05,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:40:05,620 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 -> c394bf0b454616c76d3ba114fe7f9b161b2a3a1a85dec23beec05d3a021c1c91 [2025-02-06 12:40:05,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:40:05,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:40:05,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:40:05,882 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:40:05,882 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:40:05,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i [2025-02-06 12:40:07,093 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/520ff2af1/e16b43d3a4914c45ae922b061b495370/FLAG6afbe38bf [2025-02-06 12:40:07,341 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:40:07,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i [2025-02-06 12:40:07,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/520ff2af1/e16b43d3a4914c45ae922b061b495370/FLAG6afbe38bf [2025-02-06 12:40:07,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/520ff2af1/e16b43d3a4914c45ae922b061b495370 [2025-02-06 12:40:07,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:40:07,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:40:07,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:40:07,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:40:07,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:40:07,387 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:40:07" (1/1) ... [2025-02-06 12:40:07,388 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e661a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:07, skipping insertion in model container [2025-02-06 12:40:07,388 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:40:07" (1/1) ... [2025-02-06 12:40:07,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:40:07,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:40:07,731 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:40:07,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:40:07,800 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:40:07,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:07 WrapperNode [2025-02-06 12:40:07,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:40:07,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:40:07,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:40:07,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:40:07,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:07" (1/1) ... [2025-02-06 12:40:07,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:07" (1/1) ... [2025-02-06 12:40:07,846 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 133 [2025-02-06 12:40:07,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:40:07,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:40:07,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:40:07,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:40:07,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:07" (1/1) ... [2025-02-06 12:40:07,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:07" (1/1) ... [2025-02-06 12:40:07,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:07" (1/1) ... [2025-02-06 12:40:07,892 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-02-06 12:40:07,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:07" (1/1) ... [2025-02-06 12:40:07,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:07" (1/1) ... [2025-02-06 12:40:07,898 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:07" (1/1) ... [2025-02-06 12:40:07,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:07" (1/1) ... [2025-02-06 12:40:07,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:07" (1/1) ... [2025-02-06 12:40:07,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:07" (1/1) ... [2025-02-06 12:40:07,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:40:07,911 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:40:07,911 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:40:07,911 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:40:07,912 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:07" (1/1) ... [2025-02-06 12:40:07,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:40:07,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:40:07,943 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-02-06 12:40:07,946 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-02-06 12:40:07,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:40:07,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:40:07,964 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:40:07,964 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:40:07,964 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:40:07,964 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:40:07,964 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-06 12:40:07,964 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-06 12:40:07,965 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-02-06 12:40:07,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-02-06 12:40:07,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:40:07,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:40:07,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:40:07,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:40:07,966 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:40:08,082 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:40:08,083 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:40:08,345 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:40:08,346 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:40:08,549 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:40:08,550 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:40:08,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:40:08 BoogieIcfgContainer [2025-02-06 12:40:08,551 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:40:08,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:40:08,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:40:08,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:40:08,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:40:07" (1/3) ... [2025-02-06 12:40:08,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48bc8e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:40:08, skipping insertion in model container [2025-02-06 12:40:08,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:40:07" (2/3) ... [2025-02-06 12:40:08,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48bc8e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:40:08, skipping insertion in model container [2025-02-06 12:40:08,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:40:08" (3/3) ... [2025-02-06 12:40:08,560 INFO L128 eAbstractionObserver]: Analyzing ICFG mix017_power.opt_rmo.opt.i [2025-02-06 12:40:08,571 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:40:08,573 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix017_power.opt_rmo.opt.i that has 5 procedures, 53 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-06 12:40:08,575 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:40:08,627 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:40:08,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 54 transitions, 124 flow [2025-02-06 12:40:08,683 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2025-02-06 12:40:08,687 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:40:08,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 50 events. 2/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 106 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2025-02-06 12:40:08,693 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 54 transitions, 124 flow [2025-02-06 12:40:08,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 50 transitions, 112 flow [2025-02-06 12:40:08,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:40:08,721 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;@2102e168, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:40:08,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 12:40:08,726 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:40:08,726 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-02-06 12:40:08,726 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:40:08,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:40:08,727 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:40:08,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:40:08,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:40:08,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1183462188, now seen corresponding path program 1 times [2025-02-06 12:40:08,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:40:08,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729530354] [2025-02-06 12:40:08,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:40:08,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:40:08,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 12:40:08,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 12:40:08,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:40:08,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:40:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:40:09,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:40:09,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729530354] [2025-02-06 12:40:09,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729530354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:40:09,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:40:09,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:40:09,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280842685] [2025-02-06 12:40:09,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:40:09,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:40:09,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:40:09,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:40:09,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:40:09,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2025-02-06 12:40:09,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-02-06 12:40:09,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:40:09,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2025-02-06 12:40:09,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:40:13,608 INFO L124 PetriNetUnfolderBase]: 50459/66917 cut-off events. [2025-02-06 12:40:13,609 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2025-02-06 12:40:13,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133537 conditions, 66917 events. 50459/66917 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 1943. Compared 401278 event pairs, 6359 based on Foata normal form. 2988/69828 useless extension candidates. Maximal degree in co-relation 133525. Up to 57061 conditions per place. [2025-02-06 12:40:13,955 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 61 selfloop transitions, 2 changer transitions 2/73 dead transitions. [2025-02-06 12:40:13,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 291 flow [2025-02-06 12:40:13,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:40:13,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:40:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-02-06 12:40:13,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2025-02-06 12:40:13,970 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 106 transitions. [2025-02-06 12:40:13,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 291 flow [2025-02-06 12:40:13,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 286 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 12:40:13,984 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 102 flow [2025-02-06 12:40:13,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2025-02-06 12:40:13,990 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2025-02-06 12:40:13,990 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 102 flow [2025-02-06 12:40:13,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-02-06 12:40:13,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:40:13,991 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:40:13,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:40:13,992 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:40:13,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:40:13,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1206285034, now seen corresponding path program 1 times [2025-02-06 12:40:13,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:40:13,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867343161] [2025-02-06 12:40:13,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:40:13,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:40:14,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:40:14,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:40:14,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:40:14,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:40:14,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:40:14,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:40:14,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867343161] [2025-02-06 12:40:14,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867343161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:40:14,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:40:14,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:40:14,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930466167] [2025-02-06 12:40:14,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:40:14,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:40:14,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:40:14,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:40:14,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:40:14,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-02-06 12:40:14,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:40:14,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:40:14,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-02-06 12:40:14,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:40:17,463 INFO L124 PetriNetUnfolderBase]: 45383/63229 cut-off events. [2025-02-06 12:40:17,464 INFO L125 PetriNetUnfolderBase]: For 2340/2340 co-relation queries the response was YES. [2025-02-06 12:40:17,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125599 conditions, 63229 events. 45383/63229 cut-off events. For 2340/2340 co-relation queries the response was YES. Maximal size of possible extension queue 1954. Compared 409021 event pairs, 45383 based on Foata normal form. 1512/64455 useless extension candidates. Maximal degree in co-relation 125589. Up to 59508 conditions per place. [2025-02-06 12:40:17,826 INFO L140 encePairwiseOnDemand]: 52/54 looper letters, 35 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2025-02-06 12:40:17,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 174 flow [2025-02-06 12:40:17,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:40:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:40:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-02-06 12:40:17,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4382716049382716 [2025-02-06 12:40:17,831 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 71 transitions. [2025-02-06 12:40:17,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 174 flow [2025-02-06 12:40:17,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:40:17,836 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 96 flow [2025-02-06 12:40:17,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2025-02-06 12:40:17,838 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -6 predicate places. [2025-02-06 12:40:17,838 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 96 flow [2025-02-06 12:40:17,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:40:17,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:40:17,839 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:40:17,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:40:17,839 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:40:17,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:40:17,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1206285704, now seen corresponding path program 1 times [2025-02-06 12:40:17,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:40:17,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708669402] [2025-02-06 12:40:17,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:40:17,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:40:17,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 12:40:17,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 12:40:17,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:40:17,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:40:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:40:18,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:40:18,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708669402] [2025-02-06 12:40:18,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708669402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:40:18,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:40:18,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:40:18,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959296048] [2025-02-06 12:40:18,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:40:18,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:40:18,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:40:18,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:40:18,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:40:18,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-02-06 12:40:18,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:40:18,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:40:18,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-02-06 12:40:18,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:40:23,000 INFO L124 PetriNetUnfolderBase]: 58859/80463 cut-off events. [2025-02-06 12:40:23,000 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:40:23,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158441 conditions, 80463 events. 58859/80463 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2436. Compared 514702 event pairs, 29911 based on Foata normal form. 0/78951 useless extension candidates. Maximal degree in co-relation 158435. Up to 52393 conditions per place. [2025-02-06 12:40:23,318 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 49 selfloop transitions, 5 changer transitions 85/145 dead transitions. [2025-02-06 12:40:23,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 145 transitions, 584 flow [2025-02-06 12:40:23,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:40:23,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:40:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 229 transitions. [2025-02-06 12:40:23,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5300925925925926 [2025-02-06 12:40:23,320 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 96 flow. Second operand 8 states and 229 transitions. [2025-02-06 12:40:23,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 145 transitions, 584 flow [2025-02-06 12:40:23,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 145 transitions, 583 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:40:23,325 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 150 flow [2025-02-06 12:40:23,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=150, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2025-02-06 12:40:23,327 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places. [2025-02-06 12:40:23,327 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 150 flow [2025-02-06 12:40:23,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:40:23,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:40:23,327 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-02-06 12:40:23,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:40:23,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:40:23,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:40:23,329 INFO L85 PathProgramCache]: Analyzing trace with hash 510176909, now seen corresponding path program 1 times [2025-02-06 12:40:23,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:40:23,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170685333] [2025-02-06 12:40:23,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:40:23,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:40:23,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:40:23,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:40:23,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:40:23,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:40:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:40:23,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:40:23,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170685333] [2025-02-06 12:40:23,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170685333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:40:23,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:40:23,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:40:23,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026899509] [2025-02-06 12:40:23,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:40:23,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:40:23,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:40:23,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:40:23,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:40:23,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-02-06 12:40:23,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-02-06 12:40:23,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:40:23,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-02-06 12:40:23,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:40:27,992 INFO L124 PetriNetUnfolderBase]: 44451/60877 cut-off events. [2025-02-06 12:40:27,993 INFO L125 PetriNetUnfolderBase]: For 46097/46097 co-relation queries the response was YES. [2025-02-06 12:40:28,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154065 conditions, 60877 events. 44451/60877 cut-off events. For 46097/46097 co-relation queries the response was YES. Maximal size of possible extension queue 1757. Compared 374026 event pairs, 9363 based on Foata normal form. 1456/62286 useless extension candidates. Maximal degree in co-relation 154053. Up to 37153 conditions per place. [2025-02-06 12:40:28,335 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 56 selfloop transitions, 3 changer transitions 75/140 dead transitions. [2025-02-06 12:40:28,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 140 transitions, 718 flow [2025-02-06 12:40:28,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:40:28,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:40:28,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 209 transitions. [2025-02-06 12:40:28,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5529100529100529 [2025-02-06 12:40:28,338 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 150 flow. Second operand 7 states and 209 transitions. [2025-02-06 12:40:28,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 140 transitions, 718 flow [2025-02-06 12:40:29,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 140 transitions, 705 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-02-06 12:40:29,313 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 160 flow [2025-02-06 12:40:29,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=160, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2025-02-06 12:40:29,313 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 6 predicate places. [2025-02-06 12:40:29,313 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 160 flow [2025-02-06 12:40:29,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-02-06 12:40:29,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:40:29,314 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-02-06 12:40:29,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:40:29,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:40:29,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:40:29,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1191065658, now seen corresponding path program 1 times [2025-02-06 12:40:29,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:40:29,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786225115] [2025-02-06 12:40:29,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:40:29,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:40:29,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 12:40:29,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 12:40:29,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:40:29,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:40:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:40:29,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:40:29,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786225115] [2025-02-06 12:40:29,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786225115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:40:29,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:40:29,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:40:29,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509347366] [2025-02-06 12:40:29,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:40:29,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:40:29,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:40:29,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:40:29,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:40:29,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2025-02-06 12:40:29,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-02-06 12:40:29,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:40:29,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2025-02-06 12:40:29,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:40:32,079 INFO L124 PetriNetUnfolderBase]: 33511/46613 cut-off events. [2025-02-06 12:40:32,079 INFO L125 PetriNetUnfolderBase]: For 42833/42833 co-relation queries the response was YES. [2025-02-06 12:40:32,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120051 conditions, 46613 events. 33511/46613 cut-off events. For 42833/42833 co-relation queries the response was YES. Maximal size of possible extension queue 1328. Compared 289877 event pairs, 4023 based on Foata normal form. 1512/48090 useless extension candidates. Maximal degree in co-relation 120035. Up to 26017 conditions per place. [2025-02-06 12:40:32,354 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 79 selfloop transitions, 6 changer transitions 1/92 dead transitions. [2025-02-06 12:40:32,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 92 transitions, 484 flow [2025-02-06 12:40:32,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:40:32,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:40:32,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2025-02-06 12:40:32,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-02-06 12:40:32,355 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 160 flow. Second operand 4 states and 132 transitions. [2025-02-06 12:40:32,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 92 transitions, 484 flow [2025-02-06 12:40:32,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 466 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-02-06 12:40:32,750 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 188 flow [2025-02-06 12:40:32,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2025-02-06 12:40:32,751 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places. [2025-02-06 12:40:32,751 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 188 flow [2025-02-06 12:40:32,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-02-06 12:40:32,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:40:32,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:40:32,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:40:32,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:40:32,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:40:32,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1043611831, now seen corresponding path program 1 times [2025-02-06 12:40:32,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:40:32,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415815859] [2025-02-06 12:40:32,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:40:32,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:40:32,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:40:32,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:40:32,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:40:32,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:40:32,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:40:32,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:40:32,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415815859] [2025-02-06 12:40:32,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415815859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:40:32,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:40:32,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:40:32,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698384948] [2025-02-06 12:40:32,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:40:32,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:40:32,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:40:32,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:40:32,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:40:32,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2025-02-06 12:40:32,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-02-06 12:40:32,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:40:32,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2025-02-06 12:40:32,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:40:35,234 INFO L124 PetriNetUnfolderBase]: 22087/30965 cut-off events. [2025-02-06 12:40:35,234 INFO L125 PetriNetUnfolderBase]: For 27913/27913 co-relation queries the response was YES. [2025-02-06 12:40:35,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84489 conditions, 30965 events. 22087/30965 cut-off events. For 27913/27913 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 181876 event pairs, 2295 based on Foata normal form. 1192/32122 useless extension candidates. Maximal degree in co-relation 84475. Up to 12193 conditions per place. [2025-02-06 12:40:35,359 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 101 selfloop transitions, 10 changer transitions 1/118 dead transitions. [2025-02-06 12:40:35,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 118 transitions, 652 flow [2025-02-06 12:40:35,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:40:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:40:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2025-02-06 12:40:35,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2025-02-06 12:40:35,360 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 188 flow. Second operand 5 states and 170 transitions. [2025-02-06 12:40:35,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 118 transitions, 652 flow [2025-02-06 12:40:35,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 118 transitions, 641 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:40:35,367 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 240 flow [2025-02-06 12:40:35,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2025-02-06 12:40:35,367 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 5 predicate places. [2025-02-06 12:40:35,367 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 240 flow [2025-02-06 12:40:35,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-02-06 12:40:35,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:40:35,368 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-02-06 12:40:35,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:40:35,368 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:40:35,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:40:35,368 INFO L85 PathProgramCache]: Analyzing trace with hash 872357421, now seen corresponding path program 1 times [2025-02-06 12:40:35,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:40:35,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609567] [2025-02-06 12:40:35,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:40:35,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:40:35,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 12:40:35,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 12:40:35,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:40:35,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:40:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:40:35,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:40:35,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609567] [2025-02-06 12:40:35,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:40:35,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:40:35,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:40:35,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985485292] [2025-02-06 12:40:35,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:40:35,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:40:35,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:40:35,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:40:35,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:40:35,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-02-06 12:40:35,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:40:35,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:40:35,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-02-06 12:40:35,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:40:38,793 INFO L124 PetriNetUnfolderBase]: 30771/42928 cut-off events. [2025-02-06 12:40:38,793 INFO L125 PetriNetUnfolderBase]: For 49533/49533 co-relation queries the response was YES. [2025-02-06 12:40:38,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124508 conditions, 42928 events. 30771/42928 cut-off events. For 49533/49533 co-relation queries the response was YES. Maximal size of possible extension queue 1086. Compared 259519 event pairs, 8719 based on Foata normal form. 664/43585 useless extension candidates. Maximal degree in co-relation 124492. Up to 23420 conditions per place. [2025-02-06 12:40:39,027 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 119 selfloop transitions, 14 changer transitions 71/210 dead transitions. [2025-02-06 12:40:39,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 210 transitions, 1308 flow [2025-02-06 12:40:39,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:40:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:40:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 280 transitions. [2025-02-06 12:40:39,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5761316872427984 [2025-02-06 12:40:39,032 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 240 flow. Second operand 9 states and 280 transitions. [2025-02-06 12:40:39,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 210 transitions, 1308 flow [2025-02-06 12:40:39,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 210 transitions, 1236 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-02-06 12:40:39,119 INFO L231 Difference]: Finished difference. Result has 76 places, 62 transitions, 330 flow [2025-02-06 12:40:39,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=330, PETRI_PLACES=76, PETRI_TRANSITIONS=62} [2025-02-06 12:40:39,121 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 15 predicate places. [2025-02-06 12:40:39,121 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 62 transitions, 330 flow [2025-02-06 12:40:39,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:40:39,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:40:39,121 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-02-06 12:40:39,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:40:39,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:40:39,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:40:39,121 INFO L85 PathProgramCache]: Analyzing trace with hash 558150885, now seen corresponding path program 2 times [2025-02-06 12:40:39,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:40:39,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734507859] [2025-02-06 12:40:39,122 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:40:39,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:40:39,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-02-06 12:40:39,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 12:40:39,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:40:39,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:40:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:40:39,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:40:39,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734507859] [2025-02-06 12:40:39,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734507859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:40:39,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:40:39,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:40:39,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691508494] [2025-02-06 12:40:39,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:40:39,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:40:39,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:40:39,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:40:39,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:40:39,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 54 [2025-02-06 12:40:39,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 62 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:40:39,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:40:39,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 54 [2025-02-06 12:40:39,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand