./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe035_power.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/pthread-wmm/safe035_power.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 6415bffc70cf05f8f6460106962f2f9c59b321fd2fc94a45894cc3c1f3d85b66 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:27:14,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:27:14,243 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:27:14,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:27:14,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:27:14,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:27:14,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:27:14,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:27:14,272 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:27:14,272 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:27:14,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:27:14,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:27:14,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:27:14,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:27:14,273 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:27:14,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:27:14,273 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:27:14,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:27:14,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:27:14,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:27:14,274 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:27:14,274 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:27:14,274 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:27:14,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:27:14,274 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:27:14,274 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:27:14,274 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:27:14,274 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:27:14,274 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:27:14,275 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:27:14,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:27:14,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:27:14,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:27:14,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:27:14,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:27:14,275 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:27:14,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:27:14,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:27:14,276 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:27:14,276 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:27:14,276 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:27:14,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:27:14,276 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 -> 6415bffc70cf05f8f6460106962f2f9c59b321fd2fc94a45894cc3c1f3d85b66 [2025-02-08 08:27:14,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:27:14,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:27:14,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:27:14,547 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:27:14,547 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:27:14,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe035_power.i [2025-02-08 08:27:15,790 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9e63c557/0403da686c22492d802fc182294a6ce6/FLAG69bf0413e [2025-02-08 08:27:16,101 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:27:16,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe035_power.i [2025-02-08 08:27:16,116 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9e63c557/0403da686c22492d802fc182294a6ce6/FLAG69bf0413e [2025-02-08 08:27:16,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9e63c557/0403da686c22492d802fc182294a6ce6 [2025-02-08 08:27:16,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:27:16,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:27:16,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:27:16,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:27:16,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:27:16,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:27:16" (1/1) ... [2025-02-08 08:27:16,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a258259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:16, skipping insertion in model container [2025-02-08 08:27:16,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:27:16" (1/1) ... [2025-02-08 08:27:16,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:27:16,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:27:16,860 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:27:16,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:27:16,979 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:27:16,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:16 WrapperNode [2025-02-08 08:27:16,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:27:16,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:27:16,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:27:16,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:27:16,989 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:27:16" (1/1) ... [2025-02-08 08:27:17,012 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:27:16" (1/1) ... [2025-02-08 08:27:17,056 INFO L138 Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 169 [2025-02-08 08:27:17,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:27:17,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:27:17,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:27:17,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:27:17,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:16" (1/1) ... [2025-02-08 08:27:17,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:16" (1/1) ... [2025-02-08 08:27:17,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:16" (1/1) ... [2025-02-08 08:27:17,095 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 08:27:17,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:16" (1/1) ... [2025-02-08 08:27:17,096 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:16" (1/1) ... [2025-02-08 08:27:17,114 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:16" (1/1) ... [2025-02-08 08:27:17,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:16" (1/1) ... [2025-02-08 08:27:17,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:16" (1/1) ... [2025-02-08 08:27:17,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:16" (1/1) ... [2025-02-08 08:27:17,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:27:17,123 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:27:17,123 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:27:17,124 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:27:17,126 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:16" (1/1) ... [2025-02-08 08:27:17,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:27:17,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:27:17,165 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:27:17,169 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:27:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:27:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:27:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:27:17,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:27:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:27:17,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:27:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 08:27:17,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 08:27:17,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:27:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:27:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:27:17,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:27:17,195 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:27:17,317 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:27:17,318 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:27:17,760 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:27:17,760 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:27:18,060 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:27:18,061 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:27:18,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:27:18 BoogieIcfgContainer [2025-02-08 08:27:18,061 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:27:18,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:27:18,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:27:18,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:27:18,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:27:16" (1/3) ... [2025-02-08 08:27:18,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600acfbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:27:18, skipping insertion in model container [2025-02-08 08:27:18,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:27:16" (2/3) ... [2025-02-08 08:27:18,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600acfbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:27:18, skipping insertion in model container [2025-02-08 08:27:18,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:27:18" (3/3) ... [2025-02-08 08:27:18,071 INFO L128 eAbstractionObserver]: Analyzing ICFG safe035_power.i [2025-02-08 08:27:18,087 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:27:18,090 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe035_power.i that has 4 procedures, 46 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-08 08:27:18,090 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:27:18,182 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:27:18,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 106 flow [2025-02-08 08:27:18,248 INFO L124 PetriNetUnfolderBase]: 2/44 cut-off events. [2025-02-08 08:27:18,253 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:18,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 2/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2025-02-08 08:27:18,260 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 47 transitions, 106 flow [2025-02-08 08:27:18,262 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 44 transitions, 97 flow [2025-02-08 08:27:18,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:27:18,288 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;@40694086, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:27:18,288 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 08:27:18,298 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:27:18,299 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-02-08 08:27:18,299 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:18,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:18,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:18,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:18,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:18,307 INFO L85 PathProgramCache]: Analyzing trace with hash 613102516, now seen corresponding path program 1 times [2025-02-08 08:27:18,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:18,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177003613] [2025-02-08 08:27:18,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:18,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:18,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:27:18,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:27:18,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:18,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:18,815 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:27:18,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:18,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177003613] [2025-02-08 08:27:18,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177003613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:18,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:18,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:27:18,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205529785] [2025-02-08 08:27:18,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:18,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:27:18,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:18,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:27:18,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:27:18,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:27:18,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:27:18,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:18,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:27:18,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:20,965 INFO L124 PetriNetUnfolderBase]: 8658/12408 cut-off events. [2025-02-08 08:27:20,966 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-08 08:27:20,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24728 conditions, 12408 events. 8658/12408 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 69290 event pairs, 972 based on Foata normal form. 686/13081 useless extension candidates. Maximal degree in co-relation 24717. Up to 10627 conditions per place. [2025-02-08 08:27:21,050 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 50 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2025-02-08 08:27:21,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 239 flow [2025-02-08 08:27:21,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:27:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:27:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-02-08 08:27:21,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6312056737588653 [2025-02-08 08:27:21,068 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 97 flow. Second operand 3 states and 89 transitions. [2025-02-08 08:27:21,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 239 flow [2025-02-08 08:27:21,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 236 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:27:21,079 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 88 flow [2025-02-08 08:27:21,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2025-02-08 08:27:21,086 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2025-02-08 08:27:21,087 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 88 flow [2025-02-08 08:27:21,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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:27:21,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:21,088 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:21,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:27:21,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:21,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:21,099 INFO L85 PathProgramCache]: Analyzing trace with hash 748707322, now seen corresponding path program 1 times [2025-02-08 08:27:21,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:21,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658464185] [2025-02-08 08:27:21,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:21,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:21,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:27:21,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:27:21,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:21,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:21,251 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:27:21,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:21,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658464185] [2025-02-08 08:27:21,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658464185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:21,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:21,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:27:21,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426020758] [2025-02-08 08:27:21,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:21,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:27:21,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:21,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:27:21,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:27:21,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2025-02-08 08:27:21,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:21,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:21,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2025-02-08 08:27:21,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:22,681 INFO L124 PetriNetUnfolderBase]: 7776/11820 cut-off events. [2025-02-08 08:27:22,682 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2025-02-08 08:27:22,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23355 conditions, 11820 events. 7776/11820 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 71686 event pairs, 7776 based on Foata normal form. 343/12101 useless extension candidates. Maximal degree in co-relation 23345. Up to 10976 conditions per place. [2025-02-08 08:27:22,761 INFO L140 encePairwiseOnDemand]: 45/47 looper letters, 30 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2025-02-08 08:27:22,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 150 flow [2025-02-08 08:27:22,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:27:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:27:22,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-02-08 08:27:22,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425531914893617 [2025-02-08 08:27:22,765 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 88 flow. Second operand 3 states and 60 transitions. [2025-02-08 08:27:22,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 150 flow [2025-02-08 08:27:22,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:27:22,769 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 82 flow [2025-02-08 08:27:22,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-02-08 08:27:22,770 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2025-02-08 08:27:22,770 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 82 flow [2025-02-08 08:27:22,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:22,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:22,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:22,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:27:22,771 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:22,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:22,772 INFO L85 PathProgramCache]: Analyzing trace with hash 748708683, now seen corresponding path program 1 times [2025-02-08 08:27:22,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:22,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209050447] [2025-02-08 08:27:22,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:22,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:22,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:27:22,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:27:22,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:22,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:23,176 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:27:23,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:23,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209050447] [2025-02-08 08:27:23,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209050447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:23,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:23,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:27:23,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266871322] [2025-02-08 08:27:23,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:23,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:27:23,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:23,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:27:23,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:27:23,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:27:23,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:27:23,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:23,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:27:23,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:24,214 INFO L124 PetriNetUnfolderBase]: 5308/8423 cut-off events. [2025-02-08 08:27:24,215 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:27:24,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16299 conditions, 8423 events. 5308/8423 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 51262 event pairs, 994 based on Foata normal form. 343/8753 useless extension candidates. Maximal degree in co-relation 16293. Up to 4351 conditions per place. [2025-02-08 08:27:24,249 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 64 selfloop transitions, 5 changer transitions 1/76 dead transitions. [2025-02-08 08:27:24,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 76 transitions, 304 flow [2025-02-08 08:27:24,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:27:24,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:27:24,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-02-08 08:27:24,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5957446808510638 [2025-02-08 08:27:24,254 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 82 flow. Second operand 4 states and 112 transitions. [2025-02-08 08:27:24,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 76 transitions, 304 flow [2025-02-08 08:27:24,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 76 transitions, 303 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:27:24,257 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 115 flow [2025-02-08 08:27:24,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2025-02-08 08:27:24,258 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2025-02-08 08:27:24,258 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 115 flow [2025-02-08 08:27:24,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:27:24,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:24,259 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:24,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:27:24,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:24,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:24,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1677780434, now seen corresponding path program 1 times [2025-02-08 08:27:24,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:24,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736903336] [2025-02-08 08:27:24,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:24,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:24,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 08:27:24,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 08:27:24,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:24,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:24,607 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:27:24,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:24,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736903336] [2025-02-08 08:27:24,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736903336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:24,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:24,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:27:24,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793146544] [2025-02-08 08:27:24,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:24,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:27:24,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:24,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:27:24,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:27:24,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:27:24,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:24,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:24,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:27:24,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:25,232 INFO L124 PetriNetUnfolderBase]: 2833/4473 cut-off events. [2025-02-08 08:27:25,233 INFO L125 PetriNetUnfolderBase]: For 797/797 co-relation queries the response was YES. [2025-02-08 08:27:25,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10064 conditions, 4473 events. 2833/4473 cut-off events. For 797/797 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 23272 event pairs, 651 based on Foata normal form. 218/4678 useless extension candidates. Maximal degree in co-relation 10055. Up to 1515 conditions per place. [2025-02-08 08:27:25,255 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 82 selfloop transitions, 8 changer transitions 1/97 dead transitions. [2025-02-08 08:27:25,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 97 transitions, 432 flow [2025-02-08 08:27:25,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:27:25,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:27:25,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2025-02-08 08:27:25,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6085106382978723 [2025-02-08 08:27:25,257 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 115 flow. Second operand 5 states and 143 transitions. [2025-02-08 08:27:25,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 97 transitions, 432 flow [2025-02-08 08:27:25,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 97 transitions, 422 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:27:25,263 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 155 flow [2025-02-08 08:27:25,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2025-02-08 08:27:25,265 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2025-02-08 08:27:25,265 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 155 flow [2025-02-08 08:27:25,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:25,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:25,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:25,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:27:25,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:25,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:25,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1942506333, now seen corresponding path program 1 times [2025-02-08 08:27:25,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:25,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787984255] [2025-02-08 08:27:25,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:25,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:25,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 08:27:25,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:27:25,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:25,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:25,714 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:27:25,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:25,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787984255] [2025-02-08 08:27:25,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787984255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:25,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:25,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:27:25,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285796676] [2025-02-08 08:27:25,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:25,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:27:25,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:25,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:27:25,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:27:25,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:27:25,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:25,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:25,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:27:25,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:26,170 INFO L124 PetriNetUnfolderBase]: 1798/2748 cut-off events. [2025-02-08 08:27:26,170 INFO L125 PetriNetUnfolderBase]: For 1492/1492 co-relation queries the response was YES. [2025-02-08 08:27:26,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6716 conditions, 2748 events. 1798/2748 cut-off events. For 1492/1492 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 12650 event pairs, 594 based on Foata normal form. 68/2803 useless extension candidates. Maximal degree in co-relation 6705. Up to 1050 conditions per place. [2025-02-08 08:27:26,185 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 68 selfloop transitions, 11 changer transitions 1/86 dead transitions. [2025-02-08 08:27:26,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 86 transitions, 411 flow [2025-02-08 08:27:26,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:27:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:27:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2025-02-08 08:27:26,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2025-02-08 08:27:26,188 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 155 flow. Second operand 6 states and 142 transitions. [2025-02-08 08:27:26,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 86 transitions, 411 flow [2025-02-08 08:27:26,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 386 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-08 08:27:26,209 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 169 flow [2025-02-08 08:27:26,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2025-02-08 08:27:26,210 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2025-02-08 08:27:26,211 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 169 flow [2025-02-08 08:27:26,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:27:26,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:26,212 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] [2025-02-08 08:27:26,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:27:26,212 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:26,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:26,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1072524635, now seen corresponding path program 1 times [2025-02-08 08:27:26,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:26,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953775032] [2025-02-08 08:27:26,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:27:26,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:26,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:27:26,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:27:26,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:26,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:29,631 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:27:29,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:29,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953775032] [2025-02-08 08:27:29,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953775032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:29,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:29,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 08:27:29,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382908704] [2025-02-08 08:27:29,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:29,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:27:29,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:29,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:27:29,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:27:29,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:27:29,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 169 flow. Second operand has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 11 states have internal predecessors, (138), 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:27:29,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:29,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:27:29,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:30,892 INFO L124 PetriNetUnfolderBase]: 3837/5860 cut-off events. [2025-02-08 08:27:30,893 INFO L125 PetriNetUnfolderBase]: For 3774/3774 co-relation queries the response was YES. [2025-02-08 08:27:30,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14508 conditions, 5860 events. 3837/5860 cut-off events. For 3774/3774 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 30720 event pairs, 288 based on Foata normal form. 8/5859 useless extension candidates. Maximal degree in co-relation 14496. Up to 1987 conditions per place. [2025-02-08 08:27:30,923 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 99 selfloop transitions, 10 changer transitions 49/164 dead transitions. [2025-02-08 08:27:30,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 164 transitions, 971 flow [2025-02-08 08:27:30,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:27:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:27:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 233 transitions. [2025-02-08 08:27:30,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4957446808510638 [2025-02-08 08:27:30,926 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 169 flow. Second operand 10 states and 233 transitions. [2025-02-08 08:27:30,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 164 transitions, 971 flow [2025-02-08 08:27:30,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 164 transitions, 745 flow, removed 30 selfloop flow, removed 8 redundant places. [2025-02-08 08:27:30,955 INFO L231 Difference]: Finished difference. Result has 66 places, 51 transitions, 197 flow [2025-02-08 08:27:30,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=197, PETRI_PLACES=66, PETRI_TRANSITIONS=51} [2025-02-08 08:27:30,958 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2025-02-08 08:27:30,958 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 197 flow [2025-02-08 08:27:30,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 11 states have internal predecessors, (138), 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:27:30,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:30,959 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] [2025-02-08 08:27:30,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:27:30,959 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:30,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:30,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1268661677, now seen corresponding path program 2 times [2025-02-08 08:27:30,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:30,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670566580] [2025-02-08 08:27:30,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:27:30,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:30,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:27:31,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:27:31,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:27:31,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:31,444 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:27:31,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:31,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670566580] [2025-02-08 08:27:31,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670566580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:31,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:31,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:27:31,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141190507] [2025-02-08 08:27:31,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:31,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:27:31,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:31,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:27:31,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:27:31,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:27:31,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 51 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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:27:31,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:31,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:27:31,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:32,373 INFO L124 PetriNetUnfolderBase]: 4017/6181 cut-off events. [2025-02-08 08:27:32,374 INFO L125 PetriNetUnfolderBase]: For 4127/4130 co-relation queries the response was YES. [2025-02-08 08:27:32,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17095 conditions, 6181 events. 4017/6181 cut-off events. For 4127/4130 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 33643 event pairs, 751 based on Foata normal form. 16/6189 useless extension candidates. Maximal degree in co-relation 17079. Up to 3016 conditions per place. [2025-02-08 08:27:32,398 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 52 selfloop transitions, 1 changer transitions 54/113 dead transitions. [2025-02-08 08:27:32,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 113 transitions, 652 flow [2025-02-08 08:27:32,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:27:32,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:27:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2025-02-08 08:27:32,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4787234042553192 [2025-02-08 08:27:32,400 INFO L175 Difference]: Start difference. First operand has 66 places, 51 transitions, 197 flow. Second operand 6 states and 135 transitions. [2025-02-08 08:27:32,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 113 transitions, 652 flow [2025-02-08 08:27:32,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 113 transitions, 622 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-02-08 08:27:32,411 INFO L231 Difference]: Finished difference. Result has 66 places, 45 transitions, 158 flow [2025-02-08 08:27:32,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=66, PETRI_TRANSITIONS=45} [2025-02-08 08:27:32,413 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2025-02-08 08:27:32,413 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 45 transitions, 158 flow [2025-02-08 08:27:32,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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:27:32,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:32,414 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:27:32,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:27:32,414 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:32,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:32,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1406266757, now seen corresponding path program 3 times [2025-02-08 08:27:32,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:32,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420491582] [2025-02-08 08:27:32,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:27:32,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:32,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:27:32,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:27:32,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:27:32,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:34,650 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:27:34,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:34,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420491582] [2025-02-08 08:27:34,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420491582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:34,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:34,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 08:27:34,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814883972] [2025-02-08 08:27:34,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:34,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:27:34,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:34,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:27:34,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:27:34,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:27:34,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 45 transitions, 158 flow. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 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:27:34,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:34,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:27:34,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:35,337 INFO L124 PetriNetUnfolderBase]: 2226/3521 cut-off events. [2025-02-08 08:27:35,337 INFO L125 PetriNetUnfolderBase]: For 1917/1917 co-relation queries the response was YES. [2025-02-08 08:27:35,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9298 conditions, 3521 events. 2226/3521 cut-off events. For 1917/1917 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 17383 event pairs, 434 based on Foata normal form. 8/3526 useless extension candidates. Maximal degree in co-relation 9282. Up to 1871 conditions per place. [2025-02-08 08:27:35,351 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 51 selfloop transitions, 6 changer transitions 65/128 dead transitions. [2025-02-08 08:27:35,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 128 transitions, 687 flow [2025-02-08 08:27:35,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:27:35,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:27:35,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 207 transitions. [2025-02-08 08:27:35,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44042553191489364 [2025-02-08 08:27:35,353 INFO L175 Difference]: Start difference. First operand has 66 places, 45 transitions, 158 flow. Second operand 10 states and 207 transitions. [2025-02-08 08:27:35,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 128 transitions, 687 flow [2025-02-08 08:27:35,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 128 transitions, 666 flow, removed 9 selfloop flow, removed 5 redundant places. [2025-02-08 08:27:35,360 INFO L231 Difference]: Finished difference. Result has 71 places, 48 transitions, 200 flow [2025-02-08 08:27:35,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=200, PETRI_PLACES=71, PETRI_TRANSITIONS=48} [2025-02-08 08:27:35,361 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2025-02-08 08:27:35,361 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 48 transitions, 200 flow [2025-02-08 08:27:35,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 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:27:35,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:35,361 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] [2025-02-08 08:27:35,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:27:35,362 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:35,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:35,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1282562135, now seen corresponding path program 4 times [2025-02-08 08:27:35,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:35,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395322828] [2025-02-08 08:27:35,363 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:27:35,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:35,374 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-02-08 08:27:35,495 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:27:35,495 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:27:35,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:37,561 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:27:37,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:37,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395322828] [2025-02-08 08:27:37,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395322828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:37,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:37,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 08:27:37,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121581820] [2025-02-08 08:27:37,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:37,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:27:37,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:37,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:27:37,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:27:37,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:27:37,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 48 transitions, 200 flow. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 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:27:37,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:37,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:27:37,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:38,433 INFO L124 PetriNetUnfolderBase]: 2559/4014 cut-off events. [2025-02-08 08:27:38,433 INFO L125 PetriNetUnfolderBase]: For 4841/4841 co-relation queries the response was YES. [2025-02-08 08:27:38,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11985 conditions, 4014 events. 2559/4014 cut-off events. For 4841/4841 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 20365 event pairs, 362 based on Foata normal form. 8/4017 useless extension candidates. Maximal degree in co-relation 11966. Up to 1919 conditions per place. [2025-02-08 08:27:38,455 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 51 selfloop transitions, 11 changer transitions 87/155 dead transitions. [2025-02-08 08:27:38,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 155 transitions, 917 flow [2025-02-08 08:27:38,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:27:38,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 08:27:38,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 238 transitions. [2025-02-08 08:27:38,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46034816247582205 [2025-02-08 08:27:38,458 INFO L175 Difference]: Start difference. First operand has 71 places, 48 transitions, 200 flow. Second operand 11 states and 238 transitions. [2025-02-08 08:27:38,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 155 transitions, 917 flow [2025-02-08 08:27:38,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 155 transitions, 829 flow, removed 42 selfloop flow, removed 6 redundant places. [2025-02-08 08:27:38,467 INFO L231 Difference]: Finished difference. Result has 78 places, 54 transitions, 271 flow [2025-02-08 08:27:38,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=271, PETRI_PLACES=78, PETRI_TRANSITIONS=54} [2025-02-08 08:27:38,468 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 26 predicate places. [2025-02-08 08:27:38,468 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 54 transitions, 271 flow [2025-02-08 08:27:38,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 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:27:38,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:38,468 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] [2025-02-08 08:27:38,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:27:38,469 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:38,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:38,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1650397449, now seen corresponding path program 5 times [2025-02-08 08:27:38,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:38,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756661258] [2025-02-08 08:27:38,469 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:27:38,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:38,481 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:27:38,609 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:27:38,610 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:27:38,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:41,085 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:27:41,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:41,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756661258] [2025-02-08 08:27:41,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756661258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:41,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:41,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 08:27:41,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259455280] [2025-02-08 08:27:41,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:41,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:27:41,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:41,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:27:41,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:27:41,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:27:41,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 54 transitions, 271 flow. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 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:27:41,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:41,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:27:41,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:42,050 INFO L124 PetriNetUnfolderBase]: 2229/3624 cut-off events. [2025-02-08 08:27:42,050 INFO L125 PetriNetUnfolderBase]: For 5798/5798 co-relation queries the response was YES. [2025-02-08 08:27:42,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11779 conditions, 3624 events. 2229/3624 cut-off events. For 5798/5798 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 19226 event pairs, 999 based on Foata normal form. 8/3627 useless extension candidates. Maximal degree in co-relation 11756. Up to 1903 conditions per place. [2025-02-08 08:27:42,067 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 45 selfloop transitions, 6 changer transitions 49/106 dead transitions. [2025-02-08 08:27:42,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 106 transitions, 676 flow [2025-02-08 08:27:42,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:27:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:27:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2025-02-08 08:27:42,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45896656534954405 [2025-02-08 08:27:42,069 INFO L175 Difference]: Start difference. First operand has 78 places, 54 transitions, 271 flow. Second operand 7 states and 151 transitions. [2025-02-08 08:27:42,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 106 transitions, 676 flow [2025-02-08 08:27:42,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 106 transitions, 632 flow, removed 19 selfloop flow, removed 6 redundant places. [2025-02-08 08:27:42,083 INFO L231 Difference]: Finished difference. Result has 77 places, 51 transitions, 249 flow [2025-02-08 08:27:42,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=77, PETRI_TRANSITIONS=51} [2025-02-08 08:27:42,084 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 25 predicate places. [2025-02-08 08:27:42,084 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 51 transitions, 249 flow [2025-02-08 08:27:42,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 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:27:42,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:42,085 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] [2025-02-08 08:27:42,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:27:42,085 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:42,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1220364309, now seen corresponding path program 6 times [2025-02-08 08:27:42,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:42,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116947982] [2025-02-08 08:27:42,086 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 08:27:42,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:42,097 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:27:42,222 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:27:42,222 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 08:27:42,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:43,557 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:27:43,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:43,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116947982] [2025-02-08 08:27:43,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116947982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:43,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:43,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 08:27:43,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279358540] [2025-02-08 08:27:43,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:43,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:27:43,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:43,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:27:43,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:27:43,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:27:43,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 51 transitions, 249 flow. Second operand has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 11 states have internal predecessors, (138), 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:27:43,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:43,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:27:43,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:44,273 INFO L124 PetriNetUnfolderBase]: 1700/2799 cut-off events. [2025-02-08 08:27:44,274 INFO L125 PetriNetUnfolderBase]: For 4556/4556 co-relation queries the response was YES. [2025-02-08 08:27:44,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8664 conditions, 2799 events. 1700/2799 cut-off events. For 4556/4556 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 13963 event pairs, 514 based on Foata normal form. 8/2804 useless extension candidates. Maximal degree in co-relation 8642. Up to 1856 conditions per place. [2025-02-08 08:27:44,288 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 51 selfloop transitions, 7 changer transitions 51/115 dead transitions. [2025-02-08 08:27:44,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 115 transitions, 720 flow [2025-02-08 08:27:44,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:27:44,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:27:44,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2025-02-08 08:27:44,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41702127659574467 [2025-02-08 08:27:44,291 INFO L175 Difference]: Start difference. First operand has 77 places, 51 transitions, 249 flow. Second operand 10 states and 196 transitions. [2025-02-08 08:27:44,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 115 transitions, 720 flow [2025-02-08 08:27:44,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 115 transitions, 690 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-02-08 08:27:44,299 INFO L231 Difference]: Finished difference. Result has 81 places, 52 transitions, 261 flow [2025-02-08 08:27:44,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=261, PETRI_PLACES=81, PETRI_TRANSITIONS=52} [2025-02-08 08:27:44,300 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places. [2025-02-08 08:27:44,300 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 52 transitions, 261 flow [2025-02-08 08:27:44,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 11 states have internal predecessors, (138), 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:27:44,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:27:44,300 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] [2025-02-08 08:27:44,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:27:44,301 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:27:44,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:27:44,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1770996107, now seen corresponding path program 7 times [2025-02-08 08:27:44,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:27:44,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756162624] [2025-02-08 08:27:44,301 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 08:27:44,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:27:44,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:27:44,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:27:44,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:27:44,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:27:47,108 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:27:47,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:27:47,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756162624] [2025-02-08 08:27:47,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756162624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:27:47,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:27:47,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 08:27:47,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2217523] [2025-02-08 08:27:47,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:27:47,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:27:47,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:27:47,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:27:47,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:27:47,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2025-02-08 08:27:47,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 52 transitions, 261 flow. Second operand has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 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:27:47,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:27:47,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2025-02-08 08:27:47,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:27:47,903 INFO L124 PetriNetUnfolderBase]: 1901/3110 cut-off events. [2025-02-08 08:27:47,904 INFO L125 PetriNetUnfolderBase]: For 5516/5516 co-relation queries the response was YES. [2025-02-08 08:27:47,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9864 conditions, 3110 events. 1901/3110 cut-off events. For 5516/5516 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 16042 event pairs, 230 based on Foata normal form. 8/3115 useless extension candidates. Maximal degree in co-relation 9848. Up to 1028 conditions per place. [2025-02-08 08:27:47,917 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 0 selfloop transitions, 0 changer transitions 118/118 dead transitions. [2025-02-08 08:27:47,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 118 transitions, 770 flow [2025-02-08 08:27:47,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:27:47,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:27:47,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2025-02-08 08:27:47,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41914893617021276 [2025-02-08 08:27:47,919 INFO L175 Difference]: Start difference. First operand has 81 places, 52 transitions, 261 flow. Second operand 10 states and 197 transitions. [2025-02-08 08:27:47,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 118 transitions, 770 flow [2025-02-08 08:27:47,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 118 transitions, 736 flow, removed 9 selfloop flow, removed 7 redundant places. [2025-02-08 08:27:47,930 INFO L231 Difference]: Finished difference. Result has 76 places, 0 transitions, 0 flow [2025-02-08 08:27:47,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=0, PETRI_PLACES=76, PETRI_TRANSITIONS=0} [2025-02-08 08:27:47,930 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places. [2025-02-08 08:27:47,930 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 0 transitions, 0 flow [2025-02-08 08:27:47,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 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:27:47,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-02-08 08:27:47,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-08 08:27:47,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-08 08:27:47,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-08 08:27:47,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-02-08 08:27:47,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-02-08 08:27:47,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-08 08:27:47,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:27:47,935 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2025-02-08 08:27:47,938 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:27:47,940 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:27:47,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:27:47 BasicIcfg [2025-02-08 08:27:47,946 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:27:47,947 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:27:47,947 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:27:47,947 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:27:47,948 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:27:18" (3/4) ... [2025-02-08 08:27:47,949 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:27:47,952 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-02-08 08:27:47,953 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-02-08 08:27:47,953 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P2 [2025-02-08 08:27:47,957 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 48 nodes and edges [2025-02-08 08:27:47,958 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-08 08:27:47,958 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 08:27:47,958 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 08:27:48,033 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:27:48,034 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:27:48,034 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:27:48,035 INFO L158 Benchmark]: Toolchain (without parser) took 31648.98ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 111.3MB in the beginning and 958.3MB in the end (delta: -846.9MB). Peak memory consumption was 676.6MB. Max. memory is 16.1GB. [2025-02-08 08:27:48,035 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:27:48,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 594.77ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 83.5MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:27:48,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.26ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 80.4MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:27:48,037 INFO L158 Benchmark]: Boogie Preprocessor took 62.59ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 75.1MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:27:48,038 INFO L158 Benchmark]: IcfgBuilder took 937.76ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 54.2MB in the end (delta: 20.9MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2025-02-08 08:27:48,038 INFO L158 Benchmark]: TraceAbstraction took 29883.58ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 53.5MB in the beginning and 962.4MB in the end (delta: -909.0MB). Peak memory consumption was 619.5MB. Max. memory is 16.1GB. [2025-02-08 08:27:48,039 INFO L158 Benchmark]: Witness Printer took 87.04ms. Allocated memory is still 1.7GB. Free memory was 962.4MB in the beginning and 958.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:27:48,040 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.22ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 594.77ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 83.5MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.26ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 80.4MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.59ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 75.1MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 937.76ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 54.2MB in the end (delta: 20.9MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. * TraceAbstraction took 29883.58ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 53.5MB in the beginning and 962.4MB in the end (delta: -909.0MB). Peak memory consumption was 619.5MB. Max. memory is 16.1GB. * Witness Printer took 87.04ms. Allocated memory is still 1.7GB. Free memory was 962.4MB in the beginning and 958.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 866]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 17]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 74 locations, 7 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: 29.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 848 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 833 mSDsluCounter, 200 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3679 IncrementalHoareTripleChecker+Invalid, 3838 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 0 mSDtfsCounter, 3679 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=271occurred in iteration=9, InterpolantAutomatonStates: 85, 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.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 305 ConstructedInterpolants, 0 QuantifiedInterpolants, 2896 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:27:48,059 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