./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 29016034e4102bf62d4fcba069301a54da1d77dfd5739e4cf52e395ddaa22e38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:18:17,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:18:17,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:18:17,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:18:17,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:18:17,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:18:17,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:18:17,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:18:17,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:18:17,488 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:18:17,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:18:17,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:18:17,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:18:17,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:18:17,489 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:18:17,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:18:17,489 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:18:17,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:18:17,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:18:17,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:18:17,490 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:18:17,490 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:18:17,490 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:18:17,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:18:17,490 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:18:17,490 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:18:17,491 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:18:17,491 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:18:17,491 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:18:17,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:18:17,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:18:17,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:18:17,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:18:17,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:18:17,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:18:17,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:18:17,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:18:17,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:18:17,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:18:17,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:18:17,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:18:17,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:18:17,492 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/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 -> 29016034e4102bf62d4fcba069301a54da1d77dfd5739e4cf52e395ddaa22e38 [2025-03-04 10:18:17,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:18:17,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:18:17,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:18:17,745 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:18:17,746 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:18:17,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i [2025-03-04 10:18:18,828 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93d30a2d2/154ad51cd34b4e11b3a7029d9ccdd35f/FLAG17eb61abb [2025-03-04 10:18:19,073 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:18:19,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i [2025-03-04 10:18:19,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93d30a2d2/154ad51cd34b4e11b3a7029d9ccdd35f/FLAG17eb61abb [2025-03-04 10:18:19,098 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93d30a2d2/154ad51cd34b4e11b3a7029d9ccdd35f [2025-03-04 10:18:19,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:18:19,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:18:19,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:18:19,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:18:19,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:18:19,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:18:19" (1/1) ... [2025-03-04 10:18:19,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eb63fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:19, skipping insertion in model container [2025-03-04 10:18:19,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:18:19" (1/1) ... [2025-03-04 10:18:19,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:18:19,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:18:19,356 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:18:19,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:18:19,439 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:18:19,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:19 WrapperNode [2025-03-04 10:18:19,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:18:19,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:18:19,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:18:19,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:18:19,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:19" (1/1) ... [2025-03-04 10:18:19,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:19" (1/1) ... [2025-03-04 10:18:19,472 INFO L138 Inliner]: procedures = 243, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 262 [2025-03-04 10:18:19,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:18:19,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:18:19,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:18:19,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:18:19,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:19" (1/1) ... [2025-03-04 10:18:19,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:19" (1/1) ... [2025-03-04 10:18:19,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:19" (1/1) ... [2025-03-04 10:18:19,500 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 1, 8]. 73 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 8]. The 0 writes are split as follows [0, 0, 0]. [2025-03-04 10:18:19,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:19" (1/1) ... [2025-03-04 10:18:19,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:19" (1/1) ... [2025-03-04 10:18:19,506 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:19" (1/1) ... [2025-03-04 10:18:19,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:19" (1/1) ... [2025-03-04 10:18:19,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:19" (1/1) ... [2025-03-04 10:18:19,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:19" (1/1) ... [2025-03-04 10:18:19,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:18:19,519 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:18:19,520 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:18:19,520 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:18:19,521 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:19" (1/1) ... [2025-03-04 10:18:19,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:18:19,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:19,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:18:19,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:18:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 10:18:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 10:18:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 10:18:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 10:18:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:18:19,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:18:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:18:19,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:18:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 10:18:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:18:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:18:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:18:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:18:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:18:19,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:18:19,563 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:18:19,698 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:18:19,701 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:18:20,018 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:18:20,019 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:18:20,469 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:18:20,470 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:18:20,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:20 BoogieIcfgContainer [2025-03-04 10:18:20,470 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:18:20,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:18:20,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:18:20,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:18:20,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:18:19" (1/3) ... [2025-03-04 10:18:20,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e45a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:18:20, skipping insertion in model container [2025-03-04 10:18:20,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:18:19" (2/3) ... [2025-03-04 10:18:20,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e45a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:18:20, skipping insertion in model container [2025-03-04 10:18:20,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:20" (3/3) ... [2025-03-04 10:18:20,476 INFO L128 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_ok.i [2025-03-04 10:18:20,491 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:18:20,493 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG arithmetic_prog_ok.i that has 3 procedures, 37 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2025-03-04 10:18:20,493 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:18:20,544 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:18:20,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 43 transitions, 100 flow [2025-03-04 10:18:20,620 INFO L124 PetriNetUnfolderBase]: 7/41 cut-off events. [2025-03-04 10:18:20,624 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:18:20,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 41 events. 7/41 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2025-03-04 10:18:20,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 43 transitions, 100 flow [2025-03-04 10:18:20,631 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 40 transitions, 92 flow [2025-03-04 10:18:20,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:18:20,652 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;@35c8cc85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:18:20,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 10:18:20,671 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:18:20,671 INFO L124 PetriNetUnfolderBase]: 7/38 cut-off events. [2025-03-04 10:18:20,671 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:18:20,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:20,672 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:20,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:20,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:20,676 INFO L85 PathProgramCache]: Analyzing trace with hash 513080561, now seen corresponding path program 1 times [2025-03-04 10:18:20,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:20,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246137181] [2025-03-04 10:18:20,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:20,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:21,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:18:21,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:18:21,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:21,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:21,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:21,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:21,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246137181] [2025-03-04 10:18:21,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246137181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:21,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:21,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:21,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753964111] [2025-03-04 10:18:21,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:21,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:21,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:21,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:21,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:21,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-04 10:18:21,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-03-04 10:18:21,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:21,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-04 10:18:21,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:21,571 INFO L124 PetriNetUnfolderBase]: 439/786 cut-off events. [2025-03-04 10:18:21,571 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-04 10:18:21,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 786 events. 439/786 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3660 event pairs, 172 based on Foata normal form. 20/777 useless extension candidates. Maximal degree in co-relation 1436. Up to 416 conditions per place. [2025-03-04 10:18:21,578 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 39 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2025-03-04 10:18:21,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 205 flow [2025-03-04 10:18:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-04 10:18:21,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2025-03-04 10:18:21,593 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 92 flow. Second operand 3 states and 89 transitions. [2025-03-04 10:18:21,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 205 flow [2025-03-04 10:18:21,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 195 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:21,602 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 90 flow [2025-03-04 10:18:21,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=38} [2025-03-04 10:18:21,606 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-03-04 10:18:21,608 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 90 flow [2025-03-04 10:18:21,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-03-04 10:18:21,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:21,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:21,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:18:21,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:21,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:21,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1868221857, now seen corresponding path program 1 times [2025-03-04 10:18:21,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:21,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181008203] [2025-03-04 10:18:21,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:21,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:21,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:18:21,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:18:21,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:21,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:21,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:21,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181008203] [2025-03-04 10:18:21,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181008203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:21,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:21,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:21,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028161297] [2025-03-04 10:18:21,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:21,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:21,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:21,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:21,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:21,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-04 10:18:21,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-03-04 10:18:21,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:21,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-04 10:18:21,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:22,024 INFO L124 PetriNetUnfolderBase]: 742/1327 cut-off events. [2025-03-04 10:18:22,024 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-03-04 10:18:22,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2615 conditions, 1327 events. 742/1327 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6742 event pairs, 300 based on Foata normal form. 29/1324 useless extension candidates. Maximal degree in co-relation 964. Up to 697 conditions per place. [2025-03-04 10:18:22,032 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 40 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-03-04 10:18:22,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 219 flow [2025-03-04 10:18:22,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:22,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-03-04 10:18:22,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 10:18:22,035 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 90 flow. Second operand 3 states and 86 transitions. [2025-03-04 10:18:22,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 219 flow [2025-03-04 10:18:22,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:22,036 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 100 flow [2025-03-04 10:18:22,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2025-03-04 10:18:22,036 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2025-03-04 10:18:22,037 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 100 flow [2025-03-04 10:18:22,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-03-04 10:18:22,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:22,037 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:22,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:18:22,037 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:22,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:22,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1774076939, now seen corresponding path program 1 times [2025-03-04 10:18:22,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:22,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924492067] [2025-03-04 10:18:22,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:22,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:22,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:18:22,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:18:22,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:22,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:22,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:22,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:22,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924492067] [2025-03-04 10:18:22,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924492067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:22,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:22,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:22,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607005364] [2025-03-04 10:18:22,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:22,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:22,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:22,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:22,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:22,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-04 10:18:22,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-03-04 10:18:22,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:22,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-04 10:18:22,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:22,441 INFO L124 PetriNetUnfolderBase]: 428/901 cut-off events. [2025-03-04 10:18:22,442 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2025-03-04 10:18:22,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 901 events. 428/901 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4338 event pairs, 182 based on Foata normal form. 64/959 useless extension candidates. Maximal degree in co-relation 607. Up to 373 conditions per place. [2025-03-04 10:18:22,447 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 30 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2025-03-04 10:18:22,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 220 flow [2025-03-04 10:18:22,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:22,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-03-04 10:18:22,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2025-03-04 10:18:22,452 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 100 flow. Second operand 3 states and 83 transitions. [2025-03-04 10:18:22,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 220 flow [2025-03-04 10:18:22,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:22,455 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 114 flow [2025-03-04 10:18:22,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2025-03-04 10:18:22,456 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2025-03-04 10:18:22,456 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 114 flow [2025-03-04 10:18:22,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-03-04 10:18:22,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:22,457 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:22,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:18:22,457 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:22,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:22,458 INFO L85 PathProgramCache]: Analyzing trace with hash -161148959, now seen corresponding path program 2 times [2025-03-04 10:18:22,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:22,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354223851] [2025-03-04 10:18:22,458 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:22,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:22,643 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:18:22,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:18:22,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:22,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:22,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:22,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:22,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354223851] [2025-03-04 10:18:22,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354223851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:22,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:22,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:18:22,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024607483] [2025-03-04 10:18:22,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:22,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:22,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:22,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:22,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:22,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-04 10:18:22,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-03-04 10:18:22,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:22,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-04 10:18:22,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:22,886 INFO L124 PetriNetUnfolderBase]: 627/1306 cut-off events. [2025-03-04 10:18:22,887 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2025-03-04 10:18:22,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 1306 events. 627/1306 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6846 event pairs, 183 based on Foata normal form. 30/1316 useless extension candidates. Maximal degree in co-relation 762. Up to 480 conditions per place. [2025-03-04 10:18:22,894 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 58 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2025-03-04 10:18:22,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 74 transitions, 358 flow [2025-03-04 10:18:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2025-03-04 10:18:22,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6918604651162791 [2025-03-04 10:18:22,897 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 114 flow. Second operand 4 states and 119 transitions. [2025-03-04 10:18:22,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 74 transitions, 358 flow [2025-03-04 10:18:22,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 74 transitions, 334 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:22,900 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 122 flow [2025-03-04 10:18:22,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2025-03-04 10:18:22,902 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2025-03-04 10:18:22,902 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 122 flow [2025-03-04 10:18:22,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-03-04 10:18:22,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:22,902 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:22,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:18:22,902 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:22,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:22,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1674157639, now seen corresponding path program 3 times [2025-03-04 10:18:22,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:22,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916141107] [2025-03-04 10:18:22,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:22,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:23,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 3 equivalence classes. [2025-03-04 10:18:23,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 32 statements. [2025-03-04 10:18:23,116 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:18:23,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:23,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:18:23,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:23,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916141107] [2025-03-04 10:18:23,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916141107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:23,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:23,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:18:23,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513998636] [2025-03-04 10:18:23,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:23,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:23,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:23,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:23,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:23,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-04 10:18:23,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-03-04 10:18:23,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:23,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-04 10:18:23,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:23,363 INFO L124 PetriNetUnfolderBase]: 849/1796 cut-off events. [2025-03-04 10:18:23,364 INFO L125 PetriNetUnfolderBase]: For 834/834 co-relation queries the response was YES. [2025-03-04 10:18:23,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4138 conditions, 1796 events. 849/1796 cut-off events. For 834/834 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 9888 event pairs, 258 based on Foata normal form. 41/1814 useless extension candidates. Maximal degree in co-relation 1304. Up to 667 conditions per place. [2025-03-04 10:18:23,373 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 59 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2025-03-04 10:18:23,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 75 transitions, 380 flow [2025-03-04 10:18:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-04 10:18:23,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6802325581395349 [2025-03-04 10:18:23,376 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 122 flow. Second operand 4 states and 117 transitions. [2025-03-04 10:18:23,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 75 transitions, 380 flow [2025-03-04 10:18:23,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 75 transitions, 362 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:23,378 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 132 flow [2025-03-04 10:18:23,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2025-03-04 10:18:23,379 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-03-04 10:18:23,379 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 132 flow [2025-03-04 10:18:23,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-03-04 10:18:23,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:23,379 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:23,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:18:23,380 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:23,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:23,382 INFO L85 PathProgramCache]: Analyzing trace with hash 756874577, now seen corresponding path program 4 times [2025-03-04 10:18:23,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:23,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676562581] [2025-03-04 10:18:23,383 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:23,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:23,539 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-04 10:18:23,542 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 37 of 38 statements. [2025-03-04 10:18:23,542 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:18:23,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:18:23,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:23,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676562581] [2025-03-04 10:18:23,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676562581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:23,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:23,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:23,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525779512] [2025-03-04 10:18:23,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:23,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:23,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:23,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:23,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:23,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-04 10:18:23,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03-04 10:18:23,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:23,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-04 10:18:23,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:23,709 INFO L124 PetriNetUnfolderBase]: 874/1809 cut-off events. [2025-03-04 10:18:23,710 INFO L125 PetriNetUnfolderBase]: For 867/867 co-relation queries the response was YES. [2025-03-04 10:18:23,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4321 conditions, 1809 events. 874/1809 cut-off events. For 867/867 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 9841 event pairs, 567 based on Foata normal form. 1/1779 useless extension candidates. Maximal degree in co-relation 1533. Up to 1355 conditions per place. [2025-03-04 10:18:23,718 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 39 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2025-03-04 10:18:23,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 255 flow [2025-03-04 10:18:23,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:23,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:23,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-04 10:18:23,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5968992248062015 [2025-03-04 10:18:23,720 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 132 flow. Second operand 3 states and 77 transitions. [2025-03-04 10:18:23,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 255 flow [2025-03-04 10:18:23,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 249 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:23,724 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 126 flow [2025-03-04 10:18:23,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2025-03-04 10:18:23,725 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-03-04 10:18:23,725 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 126 flow [2025-03-04 10:18:23,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03-04 10:18:23,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:23,725 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:23,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:18:23,725 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:23,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:23,728 INFO L85 PathProgramCache]: Analyzing trace with hash 419269280, now seen corresponding path program 1 times [2025-03-04 10:18:23,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:23,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016800113] [2025-03-04 10:18:23,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:23,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:23,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:18:23,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:18:23,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:23,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:23,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:18:23,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:23,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016800113] [2025-03-04 10:18:23,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016800113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:23,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:23,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:18:23,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259926200] [2025-03-04 10:18:23,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:23,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:23,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:23,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:23,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:23,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-04 10:18:23,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03-04 10:18:23,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:23,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-04 10:18:23,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:24,080 INFO L124 PetriNetUnfolderBase]: 874/1808 cut-off events. [2025-03-04 10:18:24,080 INFO L125 PetriNetUnfolderBase]: For 702/702 co-relation queries the response was YES. [2025-03-04 10:18:24,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4254 conditions, 1808 events. 874/1808 cut-off events. For 702/702 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 9864 event pairs, 626 based on Foata normal form. 1/1778 useless extension candidates. Maximal degree in co-relation 3852. Up to 1470 conditions per place. [2025-03-04 10:18:24,088 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 27 selfloop transitions, 1 changer transitions 2/39 dead transitions. [2025-03-04 10:18:24,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 180 flow [2025-03-04 10:18:24,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:24,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-03-04 10:18:24,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5193798449612403 [2025-03-04 10:18:24,089 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 126 flow. Second operand 3 states and 67 transitions. [2025-03-04 10:18:24,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 180 flow [2025-03-04 10:18:24,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:24,093 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 121 flow [2025-03-04 10:18:24,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2025-03-04 10:18:24,095 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-03-04 10:18:24,096 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 121 flow [2025-03-04 10:18:24,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03-04 10:18:24,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:24,096 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:24,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:18:24,096 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:24,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:24,096 INFO L85 PathProgramCache]: Analyzing trace with hash 33476740, now seen corresponding path program 1 times [2025-03-04 10:18:24,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:24,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526850197] [2025-03-04 10:18:24,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:24,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:24,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:18:24,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:18:24,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:24,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:24,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:24,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526850197] [2025-03-04 10:18:24,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526850197] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:24,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951010842] [2025-03-04 10:18:24,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:24,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:24,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:24,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:24,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:18:24,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:18:24,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:18:24,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:24,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:24,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:18:24,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:24,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:24,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:24,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951010842] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:24,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:24,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 10:18:24,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844984142] [2025-03-04 10:18:24,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:24,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:18:24,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:24,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:18:24,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:18:24,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-04 10:18:24,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 121 flow. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:24,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:24,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-04 10:18:24,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:25,096 INFO L124 PetriNetUnfolderBase]: 1429/2782 cut-off events. [2025-03-04 10:18:25,096 INFO L125 PetriNetUnfolderBase]: For 1041/1041 co-relation queries the response was YES. [2025-03-04 10:18:25,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6540 conditions, 2782 events. 1429/2782 cut-off events. For 1041/1041 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 14993 event pairs, 191 based on Foata normal form. 84/2850 useless extension candidates. Maximal degree in co-relation 6529. Up to 547 conditions per place. [2025-03-04 10:18:25,110 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 95 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2025-03-04 10:18:25,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 109 transitions, 571 flow [2025-03-04 10:18:25,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:18:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:18:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2025-03-04 10:18:25,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.686046511627907 [2025-03-04 10:18:25,113 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 121 flow. Second operand 6 states and 177 transitions. [2025-03-04 10:18:25,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 109 transitions, 571 flow [2025-03-04 10:18:25,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 109 transitions, 570 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:25,117 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 154 flow [2025-03-04 10:18:25,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2025-03-04 10:18:25,118 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2025-03-04 10:18:25,118 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 154 flow [2025-03-04 10:18:25,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:25,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:25,118 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:25,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:18:25,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:25,319 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:25,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:25,319 INFO L85 PathProgramCache]: Analyzing trace with hash -103491972, now seen corresponding path program 2 times [2025-03-04 10:18:25,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:25,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955814403] [2025-03-04 10:18:25,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:25,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:25,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 10:18:25,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:18:25,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:18:25,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:18:25,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:25,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955814403] [2025-03-04 10:18:25,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955814403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:25,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516278769] [2025-03-04 10:18:25,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:25,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:25,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:25,587 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:25,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:18:25,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 10:18:25,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:18:25,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:18:25,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:25,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:18:25,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:18:25,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:26,039 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:18:26,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516278769] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:26,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:26,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 10:18:26,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174415585] [2025-03-04 10:18:26,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:26,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:18:26,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:26,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:18:26,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:18:26,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-04 10:18:26,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:26,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:26,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-04 10:18:26,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:26,315 INFO L124 PetriNetUnfolderBase]: 1868/3645 cut-off events. [2025-03-04 10:18:26,316 INFO L125 PetriNetUnfolderBase]: For 3048/3048 co-relation queries the response was YES. [2025-03-04 10:18:26,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9119 conditions, 3645 events. 1868/3645 cut-off events. For 3048/3048 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 20765 event pairs, 221 based on Foata normal form. 110/3737 useless extension candidates. Maximal degree in co-relation 9106. Up to 704 conditions per place. [2025-03-04 10:18:26,335 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 96 selfloop transitions, 6 changer transitions 0/111 dead transitions. [2025-03-04 10:18:26,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 111 transitions, 698 flow [2025-03-04 10:18:26,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:18:26,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:18:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2025-03-04 10:18:26,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6705426356589147 [2025-03-04 10:18:26,336 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 154 flow. Second operand 6 states and 173 transitions. [2025-03-04 10:18:26,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 111 transitions, 698 flow [2025-03-04 10:18:26,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 111 transitions, 638 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:26,342 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 176 flow [2025-03-04 10:18:26,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2025-03-04 10:18:26,344 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2025-03-04 10:18:26,344 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 176 flow [2025-03-04 10:18:26,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:26,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:26,344 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:26,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:26,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-04 10:18:26,545 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:26,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:26,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1624102702, now seen corresponding path program 3 times [2025-03-04 10:18:26,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:26,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465321311] [2025-03-04 10:18:26,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:26,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:26,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 5 equivalence classes. [2025-03-04 10:18:26,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 10:18:26,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 10:18:26,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:18:27,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:27,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465321311] [2025-03-04 10:18:27,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465321311] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:27,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761393336] [2025-03-04 10:18:27,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:27,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:27,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:27,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:27,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:18:27,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 5 equivalence classes. [2025-03-04 10:18:27,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 10:18:27,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 10:18:27,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:27,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:18:27,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:27,580 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 10:18:27,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 10:18:27,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761393336] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:27,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:27,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 3, 3] total 13 [2025-03-04 10:18:27,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115723231] [2025-03-04 10:18:27,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:27,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:18:27,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:27,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:18:27,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:18:27,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2025-03-04 10:18:27,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 176 flow. Second operand has 14 states, 14 states have (on average 16.071428571428573) internal successors, (225), 14 states have internal predecessors, (225), 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-03-04 10:18:27,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:27,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2025-03-04 10:18:27,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:28,611 INFO L124 PetriNetUnfolderBase]: 965/1982 cut-off events. [2025-03-04 10:18:28,611 INFO L125 PetriNetUnfolderBase]: For 2392/2392 co-relation queries the response was YES. [2025-03-04 10:18:28,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5531 conditions, 1982 events. 965/1982 cut-off events. For 2392/2392 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8114 event pairs, 43 based on Foata normal form. 2/1982 useless extension candidates. Maximal degree in co-relation 5515. Up to 371 conditions per place. [2025-03-04 10:18:28,619 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 185 selfloop transitions, 27 changer transitions 28/247 dead transitions. [2025-03-04 10:18:28,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 247 transitions, 1422 flow [2025-03-04 10:18:28,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:18:28,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 10:18:28,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 539 transitions. [2025-03-04 10:18:28,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5222868217054264 [2025-03-04 10:18:28,622 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 176 flow. Second operand 24 states and 539 transitions. [2025-03-04 10:18:28,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 247 transitions, 1422 flow [2025-03-04 10:18:28,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 247 transitions, 1390 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:28,627 INFO L231 Difference]: Finished difference. Result has 97 places, 61 transitions, 375 flow [2025-03-04 10:18:28,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=375, PETRI_PLACES=97, PETRI_TRANSITIONS=61} [2025-03-04 10:18:28,627 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 57 predicate places. [2025-03-04 10:18:28,627 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 61 transitions, 375 flow [2025-03-04 10:18:28,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.071428571428573) internal successors, (225), 14 states have internal predecessors, (225), 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-03-04 10:18:28,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:28,628 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:28,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:28,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:28,828 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:18:28,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:28,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1386974890, now seen corresponding path program 4 times [2025-03-04 10:18:28,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:28,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681390367] [2025-03-04 10:18:28,829 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:28,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:28,982 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 75 statements into 2 equivalence classes. [2025-03-04 10:18:28,988 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 73 of 75 statements. [2025-03-04 10:18:28,988 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:18:28,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:29,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:29,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681390367] [2025-03-04 10:18:29,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681390367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:29,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:29,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:18:29,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113393805] [2025-03-04 10:18:29,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:29,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:18:29,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:29,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:18:29,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:18:29,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-04 10:18:29,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 61 transitions, 375 flow. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:29,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:29,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-04 10:18:29,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:29,275 INFO L124 PetriNetUnfolderBase]: 508/1085 cut-off events. [2025-03-04 10:18:29,275 INFO L125 PetriNetUnfolderBase]: For 3053/3053 co-relation queries the response was YES. [2025-03-04 10:18:29,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3473 conditions, 1085 events. 508/1085 cut-off events. For 3053/3053 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4333 event pairs, 23 based on Foata normal form. 22/1105 useless extension candidates. Maximal degree in co-relation 3440. Up to 235 conditions per place. [2025-03-04 10:18:29,283 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 0 selfloop transitions, 0 changer transitions 102/102 dead transitions. [2025-03-04 10:18:29,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 102 transitions, 717 flow [2025-03-04 10:18:29,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:18:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:18:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2025-03-04 10:18:29,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5913621262458472 [2025-03-04 10:18:29,285 INFO L175 Difference]: Start difference. First operand has 97 places, 61 transitions, 375 flow. Second operand 7 states and 178 transitions. [2025-03-04 10:18:29,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 102 transitions, 717 flow [2025-03-04 10:18:29,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 102 transitions, 634 flow, removed 6 selfloop flow, removed 16 redundant places. [2025-03-04 10:18:29,293 INFO L231 Difference]: Finished difference. Result has 74 places, 0 transitions, 0 flow [2025-03-04 10:18:29,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=74, PETRI_TRANSITIONS=0} [2025-03-04 10:18:29,294 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2025-03-04 10:18:29,294 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 0 transitions, 0 flow [2025-03-04 10:18:29,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:29,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2025-03-04 10:18:29,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-03-04 10:18:29,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-04 10:18:29,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-04 10:18:29,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:18:29,297 INFO L422 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1] [2025-03-04 10:18:29,300 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 10:18:29,300 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:18:29,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:18:29 BasicIcfg [2025-03-04 10:18:29,306 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:18:29,307 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:18:29,307 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:18:29,307 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:18:29,308 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:18:20" (3/4) ... [2025-03-04 10:18:29,309 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:18:29,312 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 10:18:29,312 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 10:18:29,319 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 144 nodes and edges [2025-03-04 10:18:29,320 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 71 nodes and edges [2025-03-04 10:18:29,320 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2025-03-04 10:18:29,320 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-04 10:18:29,320 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-04 10:18:29,321 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:18:29,321 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:18:29,392 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:18:29,392 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:18:29,392 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:18:29,393 INFO L158 Benchmark]: Toolchain (without parser) took 10292.31ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 112.2MB in the beginning and 300.3MB in the end (delta: -188.1MB). Peak memory consumption was 189.1MB. Max. memory is 16.1GB. [2025-03-04 10:18:29,393 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:29,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.20ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 84.5MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 10:18:29,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.45ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 81.7MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:18:29,395 INFO L158 Benchmark]: Boogie Preprocessor took 45.82ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 78.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:18:29,395 INFO L158 Benchmark]: IcfgBuilder took 950.59ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 58.4MB in the end (delta: 20.1MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2025-03-04 10:18:29,395 INFO L158 Benchmark]: TraceAbstraction took 8834.59ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 58.4MB in the beginning and 308.7MB in the end (delta: -250.3MB). Peak memory consumption was 127.6MB. Max. memory is 16.1GB. [2025-03-04 10:18:29,395 INFO L158 Benchmark]: Witness Printer took 85.77ms. Allocated memory is still 520.1MB. Free memory was 308.7MB in the beginning and 300.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:18:29,396 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.21ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.20ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 84.5MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.45ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 81.7MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.82ms. Allocated memory is still 142.6MB. Free memory was 81.7MB in the beginning and 78.5MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 950.59ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 58.4MB in the end (delta: 20.1MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8834.59ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 58.4MB in the beginning and 308.7MB in the end (delta: -250.3MB). Peak memory consumption was 127.6MB. Max. memory is 16.1GB. * Witness Printer took 85.77ms. Allocated memory is still 520.1MB. Free memory was 308.7MB in the beginning and 300.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 906]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 59 locations, 4 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: 8.7s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 793 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 776 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2079 IncrementalHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 2 mSDtfsCounter, 2079 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 371 GetRequests, 311 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=375occurred in iteration=10, InterpolantAutomatonStates: 66, 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, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 576 NumberOfCodeBlocks, 561 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 712 ConstructedInterpolants, 0 QuantifiedInterpolants, 1894 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1471 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 327/423 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 10:18:29,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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