./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_24-multiple-protecting_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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/goblint-regression/13-privatized_24-multiple-protecting_true.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 5a41a1715a056c3cefb9e5b0430ae444adde5aa2f4e6078578085bf381d921cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:29:59,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:29:59,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:29:59,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:29:59,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:29:59,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:29:59,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:29:59,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:29:59,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:29:59,472 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:29:59,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:29:59,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:29:59,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:29:59,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:29:59,472 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:29:59,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:29:59,473 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:29:59,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:29:59,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:29:59,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:29:59,473 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:29:59,473 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:29:59,473 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:29:59,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:29:59,473 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:29:59,473 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:29:59,474 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:29:59,474 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:29:59,474 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:29:59,474 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:29:59,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:29:59,474 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:29:59,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:29:59,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:29:59,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:29:59,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:29:59,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:29:59,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:29:59,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:29:59,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:29:59,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:29:59,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:29:59,475 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 -> 5a41a1715a056c3cefb9e5b0430ae444adde5aa2f4e6078578085bf381d921cf [2025-02-08 08:29:59,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:29:59,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:29:59,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:29:59,700 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:29:59,700 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:29:59,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_24-multiple-protecting_true.i [2025-02-08 08:30:00,894 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9f252591/bca7ae400f5f490c8bbaaba71eb60148/FLAG250b3a6e5 [2025-02-08 08:30:01,189 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:30:01,191 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_24-multiple-protecting_true.i [2025-02-08 08:30:01,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9f252591/bca7ae400f5f490c8bbaaba71eb60148/FLAG250b3a6e5 [2025-02-08 08:30:01,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b9f252591/bca7ae400f5f490c8bbaaba71eb60148 [2025-02-08 08:30:01,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:30:01,469 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:30:01,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:30:01,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:30:01,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:30:01,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:30:01" (1/1) ... [2025-02-08 08:30:01,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aeeef48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:01, skipping insertion in model container [2025-02-08 08:30:01,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:30:01" (1/1) ... [2025-02-08 08:30:01,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:30:01,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:30:01,776 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:30:01,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:30:01,841 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:30:01,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:01 WrapperNode [2025-02-08 08:30:01,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:30:01,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:30:01,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:30:01,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:30:01,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:01" (1/1) ... [2025-02-08 08:30:01,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:01" (1/1) ... [2025-02-08 08:30:01,876 INFO L138 Inliner]: procedures = 162, calls = 54, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 109 [2025-02-08 08:30:01,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:30:01,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:30:01,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:30:01,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:30:01,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:01" (1/1) ... [2025-02-08 08:30:01,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:01" (1/1) ... [2025-02-08 08:30:01,894 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:01" (1/1) ... [2025-02-08 08:30:01,908 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-02-08 08:30:01,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:01" (1/1) ... [2025-02-08 08:30:01,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:01" (1/1) ... [2025-02-08 08:30:01,912 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:01" (1/1) ... [2025-02-08 08:30:01,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:01" (1/1) ... [2025-02-08 08:30:01,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:01" (1/1) ... [2025-02-08 08:30:01,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:01" (1/1) ... [2025-02-08 08:30:01,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:30:01,921 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:30:01,921 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:30:01,921 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:30:01,922 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:01" (1/1) ... [2025-02-08 08:30:01,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:30:01,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:30:01,957 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-08 08:30:01,967 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-08 08:30:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 08:30:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:30:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 08:30:01,991 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 08:30:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:30:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:30:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:30:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 08:30:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 08:30:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:30:01,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:30:01,993 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:30:02,094 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:30:02,095 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:30:02,297 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:30:02,297 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:30:02,402 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:30:02,402 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:30:02,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:30:02 BoogieIcfgContainer [2025-02-08 08:30:02,403 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:30:02,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:30:02,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:30:02,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:30:02,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:30:01" (1/3) ... [2025-02-08 08:30:02,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9d9e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:30:02, skipping insertion in model container [2025-02-08 08:30:02,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:30:01" (2/3) ... [2025-02-08 08:30:02,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b9d9e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:30:02, skipping insertion in model container [2025-02-08 08:30:02,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:30:02" (3/3) ... [2025-02-08 08:30:02,409 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_24-multiple-protecting_true.i [2025-02-08 08:30:02,419 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:30:02,420 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_24-multiple-protecting_true.i that has 2 procedures, 82 locations, 1 initial locations, 0 loop locations, and 5 error locations. [2025-02-08 08:30:02,420 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:30:02,449 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 08:30:02,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 89 transitions, 185 flow [2025-02-08 08:30:02,547 INFO L124 PetriNetUnfolderBase]: 8/88 cut-off events. [2025-02-08 08:30:02,548 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 08:30:02,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 88 events. 8/88 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 118 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2025-02-08 08:30:02,550 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 89 transitions, 185 flow [2025-02-08 08:30:02,553 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 87 transitions, 180 flow [2025-02-08 08:30:02,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:30:02,567 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;@6097db82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:30:02,567 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 08:30:02,573 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:30:02,573 INFO L124 PetriNetUnfolderBase]: 2/22 cut-off events. [2025-02-08 08:30:02,573 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:30:02,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:02,573 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:30:02,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:30:02,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:02,577 INFO L85 PathProgramCache]: Analyzing trace with hash -97220367, now seen corresponding path program 1 times [2025-02-08 08:30:02,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:02,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729068344] [2025-02-08 08:30:02,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:30:02,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:02,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:30:02,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:30:02,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:30:02,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:02,825 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-08 08:30:02,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:02,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729068344] [2025-02-08 08:30:02,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729068344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:02,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:02,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:30:02,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493053176] [2025-02-08 08:30:02,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:02,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:30:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:02,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:30:02,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:30:02,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 89 [2025-02-08 08:30:02,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 87 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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-08 08:30:02,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:02,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 89 [2025-02-08 08:30:02,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:03,214 INFO L124 PetriNetUnfolderBase]: 526/1354 cut-off events. [2025-02-08 08:30:03,214 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 08:30:03,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2464 conditions, 1354 events. 526/1354 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7725 event pairs, 122 based on Foata normal form. 126/1412 useless extension candidates. Maximal degree in co-relation 2450. Up to 761 conditions per place. [2025-02-08 08:30:03,222 INFO L140 encePairwiseOnDemand]: 65/89 looper letters, 76 selfloop transitions, 19 changer transitions 0/121 dead transitions. [2025-02-08 08:30:03,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 121 transitions, 438 flow [2025-02-08 08:30:03,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:30:03,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:30:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 246 transitions. [2025-02-08 08:30:03,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5528089887640449 [2025-02-08 08:30:03,232 INFO L175 Difference]: Start difference. First operand has 83 places, 87 transitions, 180 flow. Second operand 5 states and 246 transitions. [2025-02-08 08:30:03,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 121 transitions, 438 flow [2025-02-08 08:30:03,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 121 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:30:03,238 INFO L231 Difference]: Finished difference. Result has 85 places, 87 transitions, 276 flow [2025-02-08 08:30:03,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=85, PETRI_TRANSITIONS=87} [2025-02-08 08:30:03,241 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 2 predicate places. [2025-02-08 08:30:03,242 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 87 transitions, 276 flow [2025-02-08 08:30:03,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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-08 08:30:03,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:03,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:30:03,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:30:03,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:30:03,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:03,243 INFO L85 PathProgramCache]: Analyzing trace with hash 556127937, now seen corresponding path program 1 times [2025-02-08 08:30:03,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:03,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041347968] [2025-02-08 08:30:03,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:30:03,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:03,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:30:03,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:30:03,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:30:03,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:03,405 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-08 08:30:03,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:03,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041347968] [2025-02-08 08:30:03,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041347968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:03,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:03,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:30:03,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154288348] [2025-02-08 08:30:03,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:03,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:30:03,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:03,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:30:03,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:30:03,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 89 [2025-02-08 08:30:03,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 87 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:03,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:03,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 89 [2025-02-08 08:30:03,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:03,658 INFO L124 PetriNetUnfolderBase]: 310/965 cut-off events. [2025-02-08 08:30:03,659 INFO L125 PetriNetUnfolderBase]: For 262/277 co-relation queries the response was YES. [2025-02-08 08:30:03,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2050 conditions, 965 events. 310/965 cut-off events. For 262/277 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5566 event pairs, 48 based on Foata normal form. 22/985 useless extension candidates. Maximal degree in co-relation 1069. Up to 430 conditions per place. [2025-02-08 08:30:03,666 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 88 selfloop transitions, 7 changer transitions 0/129 dead transitions. [2025-02-08 08:30:03,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 129 transitions, 596 flow [2025-02-08 08:30:03,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:30:03,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:30:03,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2025-02-08 08:30:03,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5926966292134831 [2025-02-08 08:30:03,669 INFO L175 Difference]: Start difference. First operand has 85 places, 87 transitions, 276 flow. Second operand 4 states and 211 transitions. [2025-02-08 08:30:03,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 129 transitions, 596 flow [2025-02-08 08:30:03,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 129 transitions, 588 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-02-08 08:30:03,676 INFO L231 Difference]: Finished difference. Result has 89 places, 91 transitions, 308 flow [2025-02-08 08:30:03,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=89, PETRI_TRANSITIONS=91} [2025-02-08 08:30:03,678 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 6 predicate places. [2025-02-08 08:30:03,678 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 91 transitions, 308 flow [2025-02-08 08:30:03,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:30:03,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:03,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:30:03,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:30:03,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:30:03,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:03,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1547389705, now seen corresponding path program 1 times [2025-02-08 08:30:03,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:03,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380826140] [2025-02-08 08:30:03,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:30:03,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:03,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 08:30:03,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 08:30:03,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:30:03,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:03,821 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-08 08:30:03,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:03,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380826140] [2025-02-08 08:30:03,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380826140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:03,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:03,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:30:03,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991776126] [2025-02-08 08:30:03,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:03,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:30:03,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:03,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:30:03,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:30:03,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 89 [2025-02-08 08:30:03,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 91 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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-08 08:30:03,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:03,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 89 [2025-02-08 08:30:03,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:04,048 INFO L124 PetriNetUnfolderBase]: 348/962 cut-off events. [2025-02-08 08:30:04,048 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2025-02-08 08:30:04,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2272 conditions, 962 events. 348/962 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5190 event pairs, 189 based on Foata normal form. 36/995 useless extension candidates. Maximal degree in co-relation 1258. Up to 526 conditions per place. [2025-02-08 08:30:04,053 INFO L140 encePairwiseOnDemand]: 74/89 looper letters, 66 selfloop transitions, 24 changer transitions 0/112 dead transitions. [2025-02-08 08:30:04,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 112 transitions, 560 flow [2025-02-08 08:30:04,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:30:04,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:30:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 239 transitions. [2025-02-08 08:30:04,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44756554307116103 [2025-02-08 08:30:04,056 INFO L175 Difference]: Start difference. First operand has 89 places, 91 transitions, 308 flow. Second operand 6 states and 239 transitions. [2025-02-08 08:30:04,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 112 transitions, 560 flow [2025-02-08 08:30:04,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 112 transitions, 559 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:30:04,063 INFO L231 Difference]: Finished difference. Result has 89 places, 90 transitions, 408 flow [2025-02-08 08:30:04,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=408, PETRI_PLACES=89, PETRI_TRANSITIONS=90} [2025-02-08 08:30:04,065 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 6 predicate places. [2025-02-08 08:30:04,065 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 408 flow [2025-02-08 08:30:04,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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-08 08:30:04,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:04,066 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:30:04,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:30:04,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:30:04,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:04,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1915856000, now seen corresponding path program 1 times [2025-02-08 08:30:04,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:04,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394531130] [2025-02-08 08:30:04,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:30:04,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:04,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:30:04,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:30:04,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:30:04,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:04,139 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-08 08:30:04,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:04,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394531130] [2025-02-08 08:30:04,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394531130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:04,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:04,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:30:04,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586430102] [2025-02-08 08:30:04,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:04,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:30:04,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:04,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:30:04,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:30:04,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 89 [2025-02-08 08:30:04,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 90 transitions, 408 flow. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-08 08:30:04,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:04,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 89 [2025-02-08 08:30:04,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:04,338 INFO L124 PetriNetUnfolderBase]: 351/971 cut-off events. [2025-02-08 08:30:04,339 INFO L125 PetriNetUnfolderBase]: For 933/933 co-relation queries the response was YES. [2025-02-08 08:30:04,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2628 conditions, 971 events. 351/971 cut-off events. For 933/933 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5305 event pairs, 109 based on Foata normal form. 11/979 useless extension candidates. Maximal degree in co-relation 1455. Up to 388 conditions per place. [2025-02-08 08:30:04,344 INFO L140 encePairwiseOnDemand]: 77/89 looper letters, 84 selfloop transitions, 31 changer transitions 0/137 dead transitions. [2025-02-08 08:30:04,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 137 transitions, 857 flow [2025-02-08 08:30:04,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:30:04,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:30:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2025-02-08 08:30:04,346 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5123595505617977 [2025-02-08 08:30:04,346 INFO L175 Difference]: Start difference. First operand has 89 places, 90 transitions, 408 flow. Second operand 5 states and 228 transitions. [2025-02-08 08:30:04,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 137 transitions, 857 flow [2025-02-08 08:30:04,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 137 transitions, 840 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-08 08:30:04,359 INFO L231 Difference]: Finished difference. Result has 95 places, 102 transitions, 614 flow [2025-02-08 08:30:04,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=614, PETRI_PLACES=95, PETRI_TRANSITIONS=102} [2025-02-08 08:30:04,360 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 12 predicate places. [2025-02-08 08:30:04,360 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 102 transitions, 614 flow [2025-02-08 08:30:04,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-08 08:30:04,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:04,360 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, 1, 1, 1] [2025-02-08 08:30:04,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:30:04,360 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:30:04,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:04,361 INFO L85 PathProgramCache]: Analyzing trace with hash 434046616, now seen corresponding path program 1 times [2025-02-08 08:30:04,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:04,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163986276] [2025-02-08 08:30:04,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:30:04,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:04,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 08:30:04,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 08:30:04,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:30:04,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:04,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-08 08:30:04,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:04,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163986276] [2025-02-08 08:30:04,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163986276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:04,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:04,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:30:04,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940507422] [2025-02-08 08:30:04,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:04,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:30:04,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:04,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:30:04,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:30:04,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 89 [2025-02-08 08:30:04,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 102 transitions, 614 flow. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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-08 08:30:04,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:04,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 89 [2025-02-08 08:30:04,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:04,807 INFO L124 PetriNetUnfolderBase]: 185/663 cut-off events. [2025-02-08 08:30:04,807 INFO L125 PetriNetUnfolderBase]: For 891/893 co-relation queries the response was YES. [2025-02-08 08:30:04,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2039 conditions, 663 events. 185/663 cut-off events. For 891/893 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3402 event pairs, 40 based on Foata normal form. 52/708 useless extension candidates. Maximal degree in co-relation 1392. Up to 269 conditions per place. [2025-02-08 08:30:04,811 INFO L140 encePairwiseOnDemand]: 70/89 looper letters, 71 selfloop transitions, 20 changer transitions 0/126 dead transitions. [2025-02-08 08:30:04,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 126 transitions, 903 flow [2025-02-08 08:30:04,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:30:04,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:30:04,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2025-02-08 08:30:04,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5674157303370787 [2025-02-08 08:30:04,812 INFO L175 Difference]: Start difference. First operand has 95 places, 102 transitions, 614 flow. Second operand 4 states and 202 transitions. [2025-02-08 08:30:04,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 126 transitions, 903 flow [2025-02-08 08:30:04,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 126 transitions, 862 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-08 08:30:04,821 INFO L231 Difference]: Finished difference. Result has 97 places, 106 transitions, 637 flow [2025-02-08 08:30:04,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=637, PETRI_PLACES=97, PETRI_TRANSITIONS=106} [2025-02-08 08:30:04,823 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 14 predicate places. [2025-02-08 08:30:04,823 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 106 transitions, 637 flow [2025-02-08 08:30:04,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 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-08 08:30:04,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:04,823 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, 1, 1, 1, 1] [2025-02-08 08:30:04,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:30:04,823 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:30:04,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:04,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1918865573, now seen corresponding path program 1 times [2025-02-08 08:30:04,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:04,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998185862] [2025-02-08 08:30:04,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:30:04,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:04,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 08:30:04,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 08:30:04,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:30:04,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:05,154 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-08 08:30:05,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:05,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998185862] [2025-02-08 08:30:05,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998185862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:05,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:05,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:30:05,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082765050] [2025-02-08 08:30:05,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:05,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:30:05,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:05,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:30:05,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:30:05,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 89 [2025-02-08 08:30:05,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 106 transitions, 637 flow. Second operand has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 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-08 08:30:05,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:05,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 89 [2025-02-08 08:30:05,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:05,278 INFO L124 PetriNetUnfolderBase]: 167/619 cut-off events. [2025-02-08 08:30:05,278 INFO L125 PetriNetUnfolderBase]: For 872/876 co-relation queries the response was YES. [2025-02-08 08:30:05,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2067 conditions, 619 events. 167/619 cut-off events. For 872/876 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3031 event pairs, 62 based on Foata normal form. 7/623 useless extension candidates. Maximal degree in co-relation 1361. Up to 411 conditions per place. [2025-02-08 08:30:05,281 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 73 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2025-02-08 08:30:05,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 110 transitions, 798 flow [2025-02-08 08:30:05,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:30:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:30:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2025-02-08 08:30:05,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49719101123595505 [2025-02-08 08:30:05,283 INFO L175 Difference]: Start difference. First operand has 97 places, 106 transitions, 637 flow. Second operand 4 states and 177 transitions. [2025-02-08 08:30:05,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 110 transitions, 798 flow [2025-02-08 08:30:05,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 110 transitions, 701 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-02-08 08:30:05,288 INFO L231 Difference]: Finished difference. Result has 90 places, 98 transitions, 507 flow [2025-02-08 08:30:05,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=507, PETRI_PLACES=90, PETRI_TRANSITIONS=98} [2025-02-08 08:30:05,290 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 7 predicate places. [2025-02-08 08:30:05,290 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 98 transitions, 507 flow [2025-02-08 08:30:05,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 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-08 08:30:05,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:05,291 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:30:05,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:30:05,291 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:30:05,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:05,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1067637543, now seen corresponding path program 1 times [2025-02-08 08:30:05,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:05,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300340037] [2025-02-08 08:30:05,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:30:05,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:05,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 08:30:05,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 08:30:05,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:30:05,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:05,473 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-08 08:30:05,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:05,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300340037] [2025-02-08 08:30:05,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300340037] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:05,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:05,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:30:05,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597779829] [2025-02-08 08:30:05,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:05,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:30:05,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:05,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:30:05,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:30:05,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 89 [2025-02-08 08:30:05,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 98 transitions, 507 flow. Second operand has 6 states, 6 states have (on average 35.666666666666664) internal successors, (214), 6 states have internal predecessors, (214), 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-08 08:30:05,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:05,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 89 [2025-02-08 08:30:05,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:05,590 INFO L124 PetriNetUnfolderBase]: 97/424 cut-off events. [2025-02-08 08:30:05,590 INFO L125 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2025-02-08 08:30:05,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 424 events. 97/424 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1689 event pairs, 25 based on Foata normal form. 16/438 useless extension candidates. Maximal degree in co-relation 650. Up to 178 conditions per place. [2025-02-08 08:30:05,592 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 65 selfloop transitions, 9 changer transitions 0/106 dead transitions. [2025-02-08 08:30:05,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 106 transitions, 705 flow [2025-02-08 08:30:05,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:30:05,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:30:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2025-02-08 08:30:05,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5056179775280899 [2025-02-08 08:30:05,594 INFO L175 Difference]: Start difference. First operand has 90 places, 98 transitions, 507 flow. Second operand 4 states and 180 transitions. [2025-02-08 08:30:05,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 106 transitions, 705 flow [2025-02-08 08:30:05,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 106 transitions, 688 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-08 08:30:05,597 INFO L231 Difference]: Finished difference. Result has 90 places, 92 transitions, 482 flow [2025-02-08 08:30:05,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=482, PETRI_PLACES=90, PETRI_TRANSITIONS=92} [2025-02-08 08:30:05,598 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 7 predicate places. [2025-02-08 08:30:05,598 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 92 transitions, 482 flow [2025-02-08 08:30:05,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.666666666666664) internal successors, (214), 6 states have internal predecessors, (214), 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-08 08:30:05,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:05,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:30:05,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:30:05,599 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:30:05,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:05,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1051093176, now seen corresponding path program 1 times [2025-02-08 08:30:05,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:05,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627549839] [2025-02-08 08:30:05,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:30:05,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:05,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 08:30:05,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 08:30:05,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:30:05,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:05,730 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-08 08:30:05,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:05,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627549839] [2025-02-08 08:30:05,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627549839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:05,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:05,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:30:05,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717750637] [2025-02-08 08:30:05,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:05,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:30:05,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:05,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:30:05,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:30:05,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 89 [2025-02-08 08:30:05,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 92 transitions, 482 flow. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 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-08 08:30:05,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:05,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 89 [2025-02-08 08:30:05,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:05,921 INFO L124 PetriNetUnfolderBase]: 108/424 cut-off events. [2025-02-08 08:30:05,921 INFO L125 PetriNetUnfolderBase]: For 378/378 co-relation queries the response was YES. [2025-02-08 08:30:05,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 424 events. 108/424 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1628 event pairs, 61 based on Foata normal form. 4/425 useless extension candidates. Maximal degree in co-relation 599. Up to 267 conditions per place. [2025-02-08 08:30:05,928 INFO L140 encePairwiseOnDemand]: 77/89 looper letters, 58 selfloop transitions, 30 changer transitions 0/106 dead transitions. [2025-02-08 08:30:05,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 106 transitions, 746 flow [2025-02-08 08:30:05,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:30:05,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:30:05,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2025-02-08 08:30:05,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41947565543071164 [2025-02-08 08:30:05,933 INFO L175 Difference]: Start difference. First operand has 90 places, 92 transitions, 482 flow. Second operand 6 states and 224 transitions. [2025-02-08 08:30:05,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 106 transitions, 746 flow [2025-02-08 08:30:05,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 106 transitions, 719 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:30:05,936 INFO L231 Difference]: Finished difference. Result has 89 places, 93 transitions, 542 flow [2025-02-08 08:30:05,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=542, PETRI_PLACES=89, PETRI_TRANSITIONS=93} [2025-02-08 08:30:05,940 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 6 predicate places. [2025-02-08 08:30:05,940 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 93 transitions, 542 flow [2025-02-08 08:30:05,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 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-08 08:30:05,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:30:05,941 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, 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-02-08 08:30:05,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:30:05,941 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-08 08:30:05,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:30:05,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1851561490, now seen corresponding path program 1 times [2025-02-08 08:30:05,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:30:05,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958394553] [2025-02-08 08:30:05,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:30:05,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:30:05,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 08:30:05,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 08:30:05,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:30:05,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:30:05,996 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-08 08:30:05,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:30:05,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958394553] [2025-02-08 08:30:05,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958394553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:30:05,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:30:05,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:30:05,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595692407] [2025-02-08 08:30:05,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:30:05,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:30:05,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:30:05,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:30:05,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:30:05,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 89 [2025-02-08 08:30:05,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 93 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 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-02-08 08:30:05,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:30:05,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 89 [2025-02-08 08:30:05,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:30:06,093 INFO L124 PetriNetUnfolderBase]: 95/398 cut-off events. [2025-02-08 08:30:06,093 INFO L125 PetriNetUnfolderBase]: For 423/423 co-relation queries the response was YES. [2025-02-08 08:30:06,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1257 conditions, 398 events. 95/398 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1540 event pairs, 69 based on Foata normal form. 1/392 useless extension candidates. Maximal degree in co-relation 345. Up to 313 conditions per place. [2025-02-08 08:30:06,094 INFO L140 encePairwiseOnDemand]: 87/89 looper letters, 0 selfloop transitions, 0 changer transitions 92/92 dead transitions. [2025-02-08 08:30:06,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 92 transitions, 662 flow [2025-02-08 08:30:06,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:30:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:30:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2025-02-08 08:30:06,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4943820224719101 [2025-02-08 08:30:06,095 INFO L175 Difference]: Start difference. First operand has 89 places, 93 transitions, 542 flow. Second operand 3 states and 132 transitions. [2025-02-08 08:30:06,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 92 transitions, 662 flow [2025-02-08 08:30:06,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 92 transitions, 661 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:30:06,098 INFO L231 Difference]: Finished difference. Result has 89 places, 0 transitions, 0 flow [2025-02-08 08:30:06,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=89, PETRI_TRANSITIONS=0} [2025-02-08 08:30:06,098 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 6 predicate places. [2025-02-08 08:30:06,098 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 0 transitions, 0 flow [2025-02-08 08:30:06,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 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-02-08 08:30:06,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-02-08 08:30:06,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-08 08:30:06,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-08 08:30:06,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 6 remaining) [2025-02-08 08:30:06,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-02-08 08:30:06,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-02-08 08:30:06,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:30:06,101 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:30:06,103 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:30:06,103 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:30:06,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:30:06 BasicIcfg [2025-02-08 08:30:06,107 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:30:06,107 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:30:06,107 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:30:06,108 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:30:06,108 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:30:02" (3/4) ... [2025-02-08 08:30:06,109 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:30:06,112 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-02-08 08:30:06,114 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2025-02-08 08:30:06,114 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-08 08:30:06,114 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 08:30:06,114 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 08:30:06,160 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:30:06,161 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:30:06,161 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:30:06,161 INFO L158 Benchmark]: Toolchain (without parser) took 4692.77ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 111.0MB in the beginning and 83.0MB in the end (delta: 27.9MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. [2025-02-08 08:30:06,161 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:30:06,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.86ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 90.9MB in the end (delta: 20.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:30:06,162 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.43ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 88.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:30:06,162 INFO L158 Benchmark]: Boogie Preprocessor took 41.37ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 87.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:30:06,162 INFO L158 Benchmark]: IcfgBuilder took 481.93ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 49.9MB in the end (delta: 37.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 08:30:06,162 INFO L158 Benchmark]: TraceAbstraction took 3702.68ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 49.4MB in the beginning and 87.5MB in the end (delta: -38.1MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2025-02-08 08:30:06,163 INFO L158 Benchmark]: Witness Printer took 53.47ms. Allocated memory is still 192.9MB. Free memory was 87.5MB in the beginning and 83.0MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:30:06,164 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.86ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 90.9MB in the end (delta: 20.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.43ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 88.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.37ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 87.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 481.93ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 49.9MB in the end (delta: 37.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3702.68ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 49.4MB in the beginning and 87.5MB in the end (delta: -38.1MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Witness Printer took 53.47ms. Allocated memory is still 192.9MB. Free memory was 87.5MB in the beginning and 83.0MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 704]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 109 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 374 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 370 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1083 IncrementalHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 15 mSDtfsCounter, 1083 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=637occurred in iteration=5, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 299 NumberOfCodeBlocks, 299 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 1424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:30:06,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE