./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 14:34:13,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:34:13,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:34:13,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:34:13,735 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:34:13,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:34:13,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:34:13,752 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:34:13,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:34:13,753 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:34:13,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:34:13,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:34:13,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:34:13,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:34:13,753 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:34:13,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:34:13,754 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:34:13,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:34:13,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:34:13,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:34:13,754 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:34:13,754 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:34:13,754 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:34:13,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:34:13,754 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:34:13,754 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:34:13,755 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:34:13,755 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:34:13,755 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:34:13,755 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:34:13,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:34:13,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:34:13,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:34:13,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:34:13,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:34:13,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:34:13,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:34:13,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:34:13,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:34:13,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:34:13,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:34:13,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:34:13,756 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-17 14:34:14,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:34:14,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:34:14,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:34:14,033 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:34:14,033 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:34:14,034 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-17 14:34:15,199 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1438b23e/92323a46f19044d3b4ef3ef612a9cb89/FLAG4e026670a [2025-03-17 14:34:15,474 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:34:15,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i [2025-03-17 14:34:15,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1438b23e/92323a46f19044d3b4ef3ef612a9cb89/FLAG4e026670a [2025-03-17 14:34:15,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1438b23e/92323a46f19044d3b4ef3ef612a9cb89 [2025-03-17 14:34:15,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:34:15,513 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:34:15,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:34:15,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:34:15,519 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:34:15,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:34:15" (1/1) ... [2025-03-17 14:34:15,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a39cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:15, skipping insertion in model container [2025-03-17 14:34:15,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:34:15" (1/1) ... [2025-03-17 14:34:15,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:34:15,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:34:15,803 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:34:15,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:34:15,890 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:34:15,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:15 WrapperNode [2025-03-17 14:34:15,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:34:15,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:34:15,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:34:15,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:34:15,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:15" (1/1) ... [2025-03-17 14:34:15,916 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:15" (1/1) ... [2025-03-17 14:34:15,936 INFO L138 Inliner]: procedures = 243, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 262 [2025-03-17 14:34:15,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:34:15,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:34:15,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:34:15,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:34:15,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:15" (1/1) ... [2025-03-17 14:34:15,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:15" (1/1) ... [2025-03-17 14:34:15,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:15" (1/1) ... [2025-03-17 14:34:15,962 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-17 14:34:15,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:15" (1/1) ... [2025-03-17 14:34:15,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:15" (1/1) ... [2025-03-17 14:34:15,968 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:15" (1/1) ... [2025-03-17 14:34:15,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:15" (1/1) ... [2025-03-17 14:34:15,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:15" (1/1) ... [2025-03-17 14:34:15,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:15" (1/1) ... [2025-03-17 14:34:15,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:34:15,978 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:34:15,978 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:34:15,978 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:34:15,979 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:15" (1/1) ... [2025-03-17 14:34:15,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:34:15,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:16,006 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-17 14:34:16,008 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-17 14:34:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 14:34:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 14:34:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 14:34:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 14:34:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:34:16,022 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:34:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:34:16,023 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:34:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 14:34:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:34:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:34:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:34:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:34:16,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:34:16,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:34:16,024 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:34:16,140 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:34:16,142 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:34:16,481 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:34:16,481 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:34:17,020 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:34:17,022 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:34:17,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:34:17 BoogieIcfgContainer [2025-03-17 14:34:17,023 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:34:17,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:34:17,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:34:17,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:34:17,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:34:15" (1/3) ... [2025-03-17 14:34:17,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af4940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:34:17, skipping insertion in model container [2025-03-17 14:34:17,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:34:15" (2/3) ... [2025-03-17 14:34:17,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af4940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:34:17, skipping insertion in model container [2025-03-17 14:34:17,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:34:17" (3/3) ... [2025-03-17 14:34:17,032 INFO L128 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_ok.i [2025-03-17 14:34:17,044 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:34:17,046 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-17 14:34:17,046 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:34:17,101 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 14:34:17,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 43 transitions, 100 flow [2025-03-17 14:34:17,169 INFO L124 PetriNetUnfolderBase]: 7/41 cut-off events. [2025-03-17 14:34:17,171 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:34:17,174 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 71 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-17 14:34:17,174 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 43 transitions, 100 flow [2025-03-17 14:34:17,180 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 40 transitions, 92 flow [2025-03-17 14:34:17,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:34:17,197 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;@5c09bb88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:34:17,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 14:34:17,218 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:34:17,218 INFO L124 PetriNetUnfolderBase]: 7/38 cut-off events. [2025-03-17 14:34:17,218 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:34:17,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:17,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:17,220 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-17 14:34:17,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:17,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1003649640, now seen corresponding path program 1 times [2025-03-17 14:34:17,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:17,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998552716] [2025-03-17 14:34:17,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:17,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:17,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:34:17,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:34:17,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:17,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:17,897 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-17 14:34:17,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:17,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998552716] [2025-03-17 14:34:17,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998552716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:17,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:17,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:17,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259178666] [2025-03-17 14:34:17,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:17,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:17,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:17,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:17,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:17,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-17 14:34:17,942 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-17 14:34:17,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:17,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-17 14:34:17,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:18,125 INFO L124 PetriNetUnfolderBase]: 430/787 cut-off events. [2025-03-17 14:34:18,125 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-17 14:34:18,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1490 conditions, 787 events. 430/787 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3695 event pairs, 169 based on Foata normal form. 20/793 useless extension candidates. Maximal degree in co-relation 1424. Up to 400 conditions per place. [2025-03-17 14:34:18,131 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 39 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2025-03-17 14:34:18,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 205 flow [2025-03-17 14:34:18,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:18,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-03-17 14:34:18,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2025-03-17 14:34:18,144 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 92 flow. Second operand 3 states and 89 transitions. [2025-03-17 14:34:18,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 205 flow [2025-03-17 14:34:18,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 195 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:34:18,149 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 90 flow [2025-03-17 14:34:18,151 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-17 14:34:18,153 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-03-17 14:34:18,153 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 90 flow [2025-03-17 14:34:18,153 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-17 14:34:18,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:18,153 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-17 14:34:18,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:34:18,154 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-17 14:34:18,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:18,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1644456246, now seen corresponding path program 1 times [2025-03-17 14:34:18,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:18,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335165326] [2025-03-17 14:34:18,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:18,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:18,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:34:18,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:34:18,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:18,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:18,436 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-17 14:34:18,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:18,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335165326] [2025-03-17 14:34:18,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335165326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:18,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:18,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:18,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778620885] [2025-03-17 14:34:18,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:18,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:18,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:18,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:18,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:18,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-17 14:34:18,441 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-17 14:34:18,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:18,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-17 14:34:18,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:18,619 INFO L124 PetriNetUnfolderBase]: 731/1321 cut-off events. [2025-03-17 14:34:18,620 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2025-03-17 14:34:18,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2592 conditions, 1321 events. 731/1321 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6718 event pairs, 294 based on Foata normal form. 29/1333 useless extension candidates. Maximal degree in co-relation 946. Up to 681 conditions per place. [2025-03-17 14:34:18,629 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 40 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-03-17 14:34:18,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 219 flow [2025-03-17 14:34:18,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-03-17 14:34:18,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-17 14:34:18,630 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 90 flow. Second operand 3 states and 86 transitions. [2025-03-17 14:34:18,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 219 flow [2025-03-17 14:34:18,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:18,632 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 100 flow [2025-03-17 14:34:18,632 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-17 14:34:18,632 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2025-03-17 14:34:18,632 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 100 flow [2025-03-17 14:34:18,632 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-17 14:34:18,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:18,633 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-17 14:34:18,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:34:18,633 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-17 14:34:18,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:18,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2032421898, now seen corresponding path program 1 times [2025-03-17 14:34:18,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:18,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416515314] [2025-03-17 14:34:18,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:18,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:18,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:34:18,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:34:18,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:18,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:18,959 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-17 14:34:18,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:18,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416515314] [2025-03-17 14:34:18,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416515314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:18,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:18,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:18,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060931381] [2025-03-17 14:34:18,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:18,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:18,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:18,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:18,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:18,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-17 14:34:18,962 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-17 14:34:18,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:18,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-17 14:34:18,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:19,083 INFO L124 PetriNetUnfolderBase]: 428/905 cut-off events. [2025-03-17 14:34:19,083 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2025-03-17 14:34:19,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1874 conditions, 905 events. 428/905 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4348 event pairs, 182 based on Foata normal form. 64/967 useless extension candidates. Maximal degree in co-relation 610. Up to 373 conditions per place. [2025-03-17 14:34:19,089 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 30 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2025-03-17 14:34:19,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 220 flow [2025-03-17 14:34:19,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:19,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-03-17 14:34:19,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2025-03-17 14:34:19,092 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 100 flow. Second operand 3 states and 83 transitions. [2025-03-17 14:34:19,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 220 flow [2025-03-17 14:34:19,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:19,094 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 114 flow [2025-03-17 14:34:19,095 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-17 14:34:19,095 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2025-03-17 14:34:19,096 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 114 flow [2025-03-17 14:34:19,096 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-17 14:34:19,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:19,096 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-17 14:34:19,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:34:19,096 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-17 14:34:19,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:19,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2010261132, now seen corresponding path program 2 times [2025-03-17 14:34:19,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:19,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852391575] [2025-03-17 14:34:19,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:34:19,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:19,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:34:19,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:34:19,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:34:19,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:19,362 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-17 14:34:19,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:19,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852391575] [2025-03-17 14:34:19,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852391575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:19,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:19,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:34:19,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214225041] [2025-03-17 14:34:19,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:19,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:34:19,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:19,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:34:19,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:34:19,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-17 14:34:19,368 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-17 14:34:19,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:19,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-17 14:34:19,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:19,557 INFO L124 PetriNetUnfolderBase]: 627/1306 cut-off events. [2025-03-17 14:34:19,557 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2025-03-17 14:34:19,559 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 6838 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-17 14:34:19,563 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 58 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2025-03-17 14:34:19,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 74 transitions, 358 flow [2025-03-17 14:34:19,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:34:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:34:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2025-03-17 14:34:19,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6918604651162791 [2025-03-17 14:34:19,564 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 114 flow. Second operand 4 states and 119 transitions. [2025-03-17 14:34:19,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 74 transitions, 358 flow [2025-03-17 14:34:19,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 74 transitions, 334 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:19,572 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 122 flow [2025-03-17 14:34:19,572 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-17 14:34:19,573 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2025-03-17 14:34:19,573 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 122 flow [2025-03-17 14:34:19,573 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-17 14:34:19,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:19,573 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-17 14:34:19,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:34:19,574 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-17 14:34:19,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:19,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1915013082, now seen corresponding path program 3 times [2025-03-17 14:34:19,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:19,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364395239] [2025-03-17 14:34:19,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:34:19,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:19,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 3 equivalence classes. [2025-03-17 14:34:19,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 32 statements. [2025-03-17 14:34:19,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:34:19,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:19,839 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-17 14:34:19,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:19,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364395239] [2025-03-17 14:34:19,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364395239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:19,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:19,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:34:19,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322971730] [2025-03-17 14:34:19,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:19,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:34:19,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:19,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:34:19,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:34:19,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2025-03-17 14:34:19,846 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-17 14:34:19,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:19,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2025-03-17 14:34:19,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:20,034 INFO L124 PetriNetUnfolderBase]: 849/1796 cut-off events. [2025-03-17 14:34:20,034 INFO L125 PetriNetUnfolderBase]: For 834/834 co-relation queries the response was YES. [2025-03-17 14:34:20,037 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 9912 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-17 14:34:20,043 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 59 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2025-03-17 14:34:20,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 75 transitions, 380 flow [2025-03-17 14:34:20,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:34:20,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:34:20,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-17 14:34:20,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6802325581395349 [2025-03-17 14:34:20,045 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 122 flow. Second operand 4 states and 117 transitions. [2025-03-17 14:34:20,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 75 transitions, 380 flow [2025-03-17 14:34:20,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 75 transitions, 362 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-17 14:34:20,048 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 132 flow [2025-03-17 14:34:20,048 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-17 14:34:20,049 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-03-17 14:34:20,050 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 132 flow [2025-03-17 14:34:20,050 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-17 14:34:20,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:20,050 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-17 14:34:20,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:34:20,051 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-17 14:34:20,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:20,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1287642824, now seen corresponding path program 4 times [2025-03-17 14:34:20,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:20,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425747957] [2025-03-17 14:34:20,051 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:34:20,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:20,201 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-17 14:34:20,207 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 37 of 38 statements. [2025-03-17 14:34:20,207 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 14:34:20,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:20,235 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-17 14:34:20,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:20,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425747957] [2025-03-17 14:34:20,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425747957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:20,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:20,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:34:20,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66981690] [2025-03-17 14:34:20,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:20,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:20,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:20,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:20,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:20,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-17 14:34:20,241 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-17 14:34:20,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:20,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-17 14:34:20,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:20,390 INFO L124 PetriNetUnfolderBase]: 870/1810 cut-off events. [2025-03-17 14:34:20,391 INFO L125 PetriNetUnfolderBase]: For 861/861 co-relation queries the response was YES. [2025-03-17 14:34:20,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4311 conditions, 1810 events. 870/1810 cut-off events. For 861/861 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 9858 event pairs, 566 based on Foata normal form. 1/1789 useless extension candidates. Maximal degree in co-relation 1523. Up to 1348 conditions per place. [2025-03-17 14:34:20,402 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 39 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2025-03-17 14:34:20,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 255 flow [2025-03-17 14:34:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:20,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-17 14:34:20,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5968992248062015 [2025-03-17 14:34:20,403 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 132 flow. Second operand 3 states and 77 transitions. [2025-03-17 14:34:20,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 255 flow [2025-03-17 14:34:20,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 249 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 14:34:20,405 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 126 flow [2025-03-17 14:34:20,405 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-17 14:34:20,408 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-03-17 14:34:20,408 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 126 flow [2025-03-17 14:34:20,408 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-17 14:34:20,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:20,408 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-17 14:34:20,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:34:20,409 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-17 14:34:20,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:20,409 INFO L85 PathProgramCache]: Analyzing trace with hash 605938396, now seen corresponding path program 1 times [2025-03-17 14:34:20,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:20,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130131557] [2025-03-17 14:34:20,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:20,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:20,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 14:34:20,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 14:34:20,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:20,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:34:20,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:20,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130131557] [2025-03-17 14:34:20,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130131557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:20,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:20,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:34:20,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460465341] [2025-03-17 14:34:20,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:20,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:34:20,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:20,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:34:20,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:34:20,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-17 14:34:20,630 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-17 14:34:20,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:20,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-17 14:34:20,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:20,772 INFO L124 PetriNetUnfolderBase]: 874/1808 cut-off events. [2025-03-17 14:34:20,772 INFO L125 PetriNetUnfolderBase]: For 702/702 co-relation queries the response was YES. [2025-03-17 14:34:20,774 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 9879 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-17 14:34:20,780 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 27 selfloop transitions, 1 changer transitions 2/39 dead transitions. [2025-03-17 14:34:20,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 180 flow [2025-03-17 14:34:20,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:34:20,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:34:20,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-03-17 14:34:20,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5193798449612403 [2025-03-17 14:34:20,781 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 126 flow. Second operand 3 states and 67 transitions. [2025-03-17 14:34:20,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 180 flow [2025-03-17 14:34:20,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:20,785 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 121 flow [2025-03-17 14:34:20,785 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-17 14:34:20,786 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-03-17 14:34:20,786 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 121 flow [2025-03-17 14:34:20,787 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-17 14:34:20,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:20,787 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-17 14:34:20,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:34:20,787 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-17 14:34:20,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash 27523851, now seen corresponding path program 1 times [2025-03-17 14:34:20,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:20,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230506474] [2025-03-17 14:34:20,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:20,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:20,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 14:34:20,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 14:34:20,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:20,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:34:21,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:21,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230506474] [2025-03-17 14:34:21,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230506474] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:34:21,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544983789] [2025-03-17 14:34:21,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:34:21,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:21,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:21,023 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-17 14:34:21,024 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-17 14:34:21,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 14:34:21,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 14:34:21,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:34:21,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:21,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:34:21,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:34:21,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:34:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:34:21,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544983789] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:34:21,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:34:21,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 14:34:21,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61225331] [2025-03-17 14:34:21,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:34:21,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:34:21,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:21,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:34:21,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:34:21,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-17 14:34:21,556 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-17 14:34:21,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:21,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-17 14:34:21,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:21,829 INFO L124 PetriNetUnfolderBase]: 1429/2782 cut-off events. [2025-03-17 14:34:21,830 INFO L125 PetriNetUnfolderBase]: For 1041/1041 co-relation queries the response was YES. [2025-03-17 14:34:21,834 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 15028 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-17 14:34:21,844 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 95 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2025-03-17 14:34:21,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 109 transitions, 571 flow [2025-03-17 14:34:21,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:34:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:34:21,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2025-03-17 14:34:21,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.686046511627907 [2025-03-17 14:34:21,846 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 121 flow. Second operand 6 states and 177 transitions. [2025-03-17 14:34:21,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 109 transitions, 571 flow [2025-03-17 14:34:21,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 109 transitions, 570 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:34:21,849 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 154 flow [2025-03-17 14:34:21,850 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-17 14:34:21,850 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2025-03-17 14:34:21,851 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 154 flow [2025-03-17 14:34:21,852 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-17 14:34:21,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:21,852 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-17 14:34:21,860 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-17 14:34:22,052 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-17 14:34:22,053 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-17 14:34:22,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:22,053 INFO L85 PathProgramCache]: Analyzing trace with hash -546364455, now seen corresponding path program 2 times [2025-03-17 14:34:22,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:22,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183044302] [2025-03-17 14:34:22,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:34:22,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:22,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-17 14:34:22,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 14:34:22,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:34:22,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:22,314 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-17 14:34:22,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:22,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183044302] [2025-03-17 14:34:22,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183044302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:34:22,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527655222] [2025-03-17 14:34:22,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:34:22,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:22,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:22,317 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-17 14:34:22,318 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-17 14:34:22,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-17 14:34:22,668 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 14:34:22,669 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:34:22,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:22,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:34:22,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:22,715 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-17 14:34:22,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:34:22,774 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-17 14:34:22,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527655222] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:34:22,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:34:22,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 14:34:22,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919729030] [2025-03-17 14:34:22,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:34:22,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:34:22,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:22,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:34:22,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:34:22,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-17 14:34:22,780 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-17 14:34:22,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:22,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-17 14:34:22,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:23,091 INFO L124 PetriNetUnfolderBase]: 1868/3645 cut-off events. [2025-03-17 14:34:23,091 INFO L125 PetriNetUnfolderBase]: For 3048/3048 co-relation queries the response was YES. [2025-03-17 14:34:23,097 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 20793 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-17 14:34:23,110 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 96 selfloop transitions, 6 changer transitions 0/111 dead transitions. [2025-03-17 14:34:23,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 111 transitions, 698 flow [2025-03-17 14:34:23,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:34:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:34:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2025-03-17 14:34:23,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6705426356589147 [2025-03-17 14:34:23,113 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 154 flow. Second operand 6 states and 173 transitions. [2025-03-17 14:34:23,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 111 transitions, 698 flow [2025-03-17 14:34:23,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 111 transitions, 638 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-03-17 14:34:23,118 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 176 flow [2025-03-17 14:34:23,118 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-17 14:34:23,119 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2025-03-17 14:34:23,120 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 176 flow [2025-03-17 14:34:23,120 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-17 14:34:23,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:23,120 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-17 14:34:23,128 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-17 14:34:23,322 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-17 14:34:23,322 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-17 14:34:23,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:23,323 INFO L85 PathProgramCache]: Analyzing trace with hash -421704373, now seen corresponding path program 3 times [2025-03-17 14:34:23,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:23,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610502874] [2025-03-17 14:34:23,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:34:23,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:23,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 5 equivalence classes. [2025-03-17 14:34:23,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 14:34:23,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 14:34:23,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:23,958 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-17 14:34:23,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:23,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610502874] [2025-03-17 14:34:23,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610502874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:34:23,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830633032] [2025-03-17 14:34:23,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:34:23,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:23,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:23,963 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-17 14:34:23,964 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-17 14:34:24,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 63 statements into 5 equivalence classes. [2025-03-17 14:34:24,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 14:34:24,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-17 14:34:24,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:24,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:34:24,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:24,431 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-17 14:34:24,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:34:24,469 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-17 14:34:24,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830633032] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:34:24,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:34:24,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 3, 3] total 13 [2025-03-17 14:34:24,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503446511] [2025-03-17 14:34:24,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:34:24,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:34:24,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:24,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:34:24,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:34:24,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2025-03-17 14:34:24,529 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-17 14:34:24,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:24,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2025-03-17 14:34:24,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:25,508 INFO L124 PetriNetUnfolderBase]: 965/1982 cut-off events. [2025-03-17 14:34:25,509 INFO L125 PetriNetUnfolderBase]: For 2392/2392 co-relation queries the response was YES. [2025-03-17 14:34:25,512 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 8110 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-17 14:34:25,519 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 185 selfloop transitions, 27 changer transitions 28/247 dead transitions. [2025-03-17 14:34:25,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 247 transitions, 1422 flow [2025-03-17 14:34:25,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 14:34:25,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-17 14:34:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 539 transitions. [2025-03-17 14:34:25,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5222868217054264 [2025-03-17 14:34:25,525 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 176 flow. Second operand 24 states and 539 transitions. [2025-03-17 14:34:25,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 247 transitions, 1422 flow [2025-03-17 14:34:25,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 247 transitions, 1390 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-03-17 14:34:25,530 INFO L231 Difference]: Finished difference. Result has 97 places, 61 transitions, 375 flow [2025-03-17 14:34:25,530 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-17 14:34:25,530 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 57 predicate places. [2025-03-17 14:34:25,530 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 61 transitions, 375 flow [2025-03-17 14:34:25,530 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-17 14:34:25,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:25,530 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-17 14:34:25,538 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-17 14:34:25,731 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-17 14:34:25,731 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-17 14:34:25,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:25,732 INFO L85 PathProgramCache]: Analyzing trace with hash -67348935, now seen corresponding path program 4 times [2025-03-17 14:34:25,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:25,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155118304] [2025-03-17 14:34:25,732 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:34:25,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:25,875 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 75 statements into 2 equivalence classes. [2025-03-17 14:34:25,882 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 73 of 75 statements. [2025-03-17 14:34:25,882 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 14:34:25,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:34:25,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:25,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155118304] [2025-03-17 14:34:25,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155118304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:34:25,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:34:25,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:34:25,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558236266] [2025-03-17 14:34:25,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:34:25,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:34:25,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:34:25,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:34:25,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:34:25,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-03-17 14:34:25,953 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-17 14:34:25,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:34:25,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-03-17 14:34:25,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:34:26,213 INFO L124 PetriNetUnfolderBase]: 508/1085 cut-off events. [2025-03-17 14:34:26,213 INFO L125 PetriNetUnfolderBase]: For 3053/3053 co-relation queries the response was YES. [2025-03-17 14:34:26,217 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 4346 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-17 14:34:26,218 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 0 selfloop transitions, 0 changer transitions 102/102 dead transitions. [2025-03-17 14:34:26,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 102 transitions, 717 flow [2025-03-17 14:34:26,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:34:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:34:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2025-03-17 14:34:26,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5913621262458472 [2025-03-17 14:34:26,220 INFO L175 Difference]: Start difference. First operand has 97 places, 61 transitions, 375 flow. Second operand 7 states and 178 transitions. [2025-03-17 14:34:26,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 102 transitions, 717 flow [2025-03-17 14:34:26,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 102 transitions, 634 flow, removed 6 selfloop flow, removed 16 redundant places. [2025-03-17 14:34:26,232 INFO L231 Difference]: Finished difference. Result has 74 places, 0 transitions, 0 flow [2025-03-17 14:34:26,232 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-17 14:34:26,233 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2025-03-17 14:34:26,233 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 0 transitions, 0 flow [2025-03-17 14:34:26,233 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-17 14:34:26,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2025-03-17 14:34:26,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-03-17 14:34:26,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-17 14:34:26,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-17 14:34:26,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:34:26,236 INFO L422 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1] [2025-03-17 14:34:26,239 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 14:34:26,239 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:34:26,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:34:26 BasicIcfg [2025-03-17 14:34:26,245 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:34:26,246 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:34:26,246 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:34:26,246 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:34:26,247 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:34:17" (3/4) ... [2025-03-17 14:34:26,249 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:34:26,251 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 14:34:26,251 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 14:34:26,259 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 144 nodes and edges [2025-03-17 14:34:26,260 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 71 nodes and edges [2025-03-17 14:34:26,260 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2025-03-17 14:34:26,260 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-17 14:34:26,261 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-17 14:34:26,261 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 14:34:26,261 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:34:26,325 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:34:26,325 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:34:26,325 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:34:26,325 INFO L158 Benchmark]: Toolchain (without parser) took 10813.06ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 103.5MB in the beginning and 580.2MB in the end (delta: -476.7MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. [2025-03-17 14:34:26,326 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:34:26,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.69ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 76.0MB in the end (delta: 27.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:34:26,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.60ms. Allocated memory is still 142.6MB. Free memory was 76.0MB in the beginning and 72.6MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:34:26,328 INFO L158 Benchmark]: Boogie Preprocessor took 38.00ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 69.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:34:26,328 INFO L158 Benchmark]: IcfgBuilder took 1044.81ms. Allocated memory is still 142.6MB. Free memory was 69.2MB in the beginning and 53.8MB in the end (delta: 15.4MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. [2025-03-17 14:34:26,328 INFO L158 Benchmark]: TraceAbstraction took 9220.74ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 52.9MB in the beginning and 588.6MB in the end (delta: -535.7MB). Peak memory consumption was 306.1MB. Max. memory is 16.1GB. [2025-03-17 14:34:26,328 INFO L158 Benchmark]: Witness Printer took 79.25ms. Allocated memory is still 696.3MB. Free memory was 588.6MB in the beginning and 580.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:34:26,330 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.69ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 76.0MB in the end (delta: 27.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.60ms. Allocated memory is still 142.6MB. Free memory was 76.0MB in the beginning and 72.6MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.00ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 69.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1044.81ms. Allocated memory is still 142.6MB. Free memory was 69.2MB in the beginning and 53.8MB in the end (delta: 15.4MB). Peak memory consumption was 59.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9220.74ms. Allocated memory was 142.6MB in the beginning and 696.3MB in the end (delta: 553.6MB). Free memory was 52.9MB in the beginning and 588.6MB in the end (delta: -535.7MB). Peak memory consumption was 306.1MB. Max. memory is 16.1GB. * Witness Printer took 79.25ms. Allocated memory is still 696.3MB. Free memory was 588.6MB in the beginning and 580.2MB 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, 69 edges, 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: 9.1s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 793 SdHoareTripleChecker+Valid, 1.6s 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.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 576 NumberOfCodeBlocks, 561 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 712 ConstructedInterpolants, 0 QuantifiedInterpolants, 1898 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1471 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 330/429 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-17 14:34:26,342 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