./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-atomic/time_var_mutex.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-atomic/time_var_mutex.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1985bb251db70a1c798d345be7e1671f9dcc6a359b969ca99d23e0003d9a3770 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:38:44,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:38:44,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:38:44,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:38:44,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:38:44,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:38:44,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:38:44,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:38:44,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:38:44,522 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:38:44,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:38:44,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:38:44,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:38:44,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:38:44,522 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:38:44,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:38:44,522 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:38:44,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:38:44,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:38:44,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:38:44,522 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:38:44,522 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:38:44,522 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:38:44,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:38:44,523 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:44,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:44,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:38:44,523 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1985bb251db70a1c798d345be7e1671f9dcc6a359b969ca99d23e0003d9a3770 [2025-01-10 00:38:44,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:38:44,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:38:44,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:38:44,746 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:38:44,746 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:38:44,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/time_var_mutex.i [2025-01-10 00:38:45,868 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e57d8e6dc/5d08cd1454974aca8280559774ec4878/FLAGbde342ec1 [2025-01-10 00:38:46,136 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:38:46,137 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-atomic/time_var_mutex.i [2025-01-10 00:38:46,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e57d8e6dc/5d08cd1454974aca8280559774ec4878/FLAGbde342ec1 [2025-01-10 00:38:46,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e57d8e6dc/5d08cd1454974aca8280559774ec4878 [2025-01-10 00:38:46,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:38:46,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:38:46,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:38:46,434 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:38:46,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:38:46,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:38:46" (1/1) ... [2025-01-10 00:38:46,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32900a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:46, skipping insertion in model container [2025-01-10 00:38:46,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:38:46" (1/1) ... [2025-01-10 00:38:46,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:38:46,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:38:46,696 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:38:46,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:38:46,743 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:38:46,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:46 WrapperNode [2025-01-10 00:38:46,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:38:46,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:38:46,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:38:46,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:38:46,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:46" (1/1) ... [2025-01-10 00:38:46,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:46" (1/1) ... [2025-01-10 00:38:46,772 INFO L138 Inliner]: procedures = 169, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 91 [2025-01-10 00:38:46,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:38:46,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:38:46,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:38:46,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:38:46,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:46" (1/1) ... [2025-01-10 00:38:46,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:46" (1/1) ... [2025-01-10 00:38:46,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:46" (1/1) ... [2025-01-10 00:38:46,790 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2025-01-10 00:38:46,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:46" (1/1) ... [2025-01-10 00:38:46,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:46" (1/1) ... [2025-01-10 00:38:46,793 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:46" (1/1) ... [2025-01-10 00:38:46,794 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:46" (1/1) ... [2025-01-10 00:38:46,795 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:46" (1/1) ... [2025-01-10 00:38:46,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:46" (1/1) ... [2025-01-10 00:38:46,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:46" (1/1) ... [2025-01-10 00:38:46,797 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:38:46,798 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:38:46,798 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:38:46,798 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:38:46,799 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:46" (1/1) ... [2025-01-10 00:38:46,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:38:46,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:38:46,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:38:46,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:38:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure allocator [2025-01-10 00:38:46,845 INFO L138 BoogieDeclarations]: Found implementation of procedure allocator [2025-01-10 00:38:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure de_allocator [2025-01-10 00:38:46,845 INFO L138 BoogieDeclarations]: Found implementation of procedure de_allocator [2025-01-10 00:38:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:38:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:38:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:38:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:38:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:38:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:38:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:38:46,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:38:46,847 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:38:46,963 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:38:46,965 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:38:47,121 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:38:47,121 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:38:47,215 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:38:47,215 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:38:47,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:47 BoogieIcfgContainer [2025-01-10 00:38:47,216 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:38:47,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:38:47,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:38:47,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:38:47,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:38:46" (1/3) ... [2025-01-10 00:38:47,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19512260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:38:47, skipping insertion in model container [2025-01-10 00:38:47,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:38:46" (2/3) ... [2025-01-10 00:38:47,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19512260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:38:47, skipping insertion in model container [2025-01-10 00:38:47,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:47" (3/3) ... [2025-01-10 00:38:47,225 INFO L128 eAbstractionObserver]: Analyzing ICFG time_var_mutex.i [2025-01-10 00:38:47,236 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:38:47,238 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG time_var_mutex.i that has 3 procedures, 40 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:38:47,238 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:38:47,279 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:38:47,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 104 flow [2025-01-10 00:38:47,341 INFO L124 PetriNetUnfolderBase]: 6/43 cut-off events. [2025-01-10 00:38:47,342 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:38:47,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 43 events. 6/43 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 92 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 38. Up to 3 conditions per place. [2025-01-10 00:38:47,347 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 45 transitions, 104 flow [2025-01-10 00:38:47,350 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 42 transitions, 96 flow [2025-01-10 00:38:47,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:38:47,371 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;@6a0ba9d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:38:47,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 00:38:47,385 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:38:47,385 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2025-01-10 00:38:47,385 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:38:47,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:47,386 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:47,386 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK === [allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK, de_allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:38:47,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:47,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1331324847, now seen corresponding path program 1 times [2025-01-10 00:38:47,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:47,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481908286] [2025-01-10 00:38:47,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:47,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:47,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:38:47,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:38:47,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:47,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:47,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:47,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481908286] [2025-01-10 00:38:47,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481908286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:47,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:47,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:38:47,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532158027] [2025-01-10 00:38:47,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:47,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:47,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:47,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:47,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:47,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2025-01-10 00:38:47,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:47,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:47,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2025-01-10 00:38:47,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:47,779 INFO L124 PetriNetUnfolderBase]: 175/412 cut-off events. [2025-01-10 00:38:47,782 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-10 00:38:47,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 412 events. 175/412 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2062 event pairs, 95 based on Foata normal form. 68/470 useless extension candidates. Maximal degree in co-relation 722. Up to 180 conditions per place. [2025-01-10 00:38:47,789 INFO L140 encePairwiseOnDemand]: 38/45 looper letters, 27 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2025-01-10 00:38:47,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 159 flow [2025-01-10 00:38:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:47,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-01-10 00:38:47,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2025-01-10 00:38:47,803 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 96 flow. Second operand 3 states and 84 transitions. [2025-01-10 00:38:47,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 159 flow [2025-01-10 00:38:47,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 149 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 00:38:47,811 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 78 flow [2025-01-10 00:38:47,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2025-01-10 00:38:47,817 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2025-01-10 00:38:47,819 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 78 flow [2025-01-10 00:38:47,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:47,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:47,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:47,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:38:47,820 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting de_allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK === [allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK, de_allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:38:47,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:47,820 INFO L85 PathProgramCache]: Analyzing trace with hash -683475818, now seen corresponding path program 1 times [2025-01-10 00:38:47,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:47,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763116816] [2025-01-10 00:38:47,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:47,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:47,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:38:47,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:38:47,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:47,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:47,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:47,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763116816] [2025-01-10 00:38:47,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763116816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:47,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:47,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:47,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804660190] [2025-01-10 00:38:47,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:47,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:47,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:47,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:47,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:47,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-01-10 00:38:47,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-01-10 00:38:47,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:47,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-01-10 00:38:47,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:47,976 INFO L124 PetriNetUnfolderBase]: 258/537 cut-off events. [2025-01-10 00:38:47,978 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 00:38:47,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 537 events. 258/537 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2595 event pairs, 118 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 314. Up to 287 conditions per place. [2025-01-10 00:38:47,983 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 32 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2025-01-10 00:38:47,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 48 transitions, 179 flow [2025-01-10 00:38:47,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:47,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-01-10 00:38:47,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6148148148148148 [2025-01-10 00:38:47,989 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 78 flow. Second operand 3 states and 83 transitions. [2025-01-10 00:38:47,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 48 transitions, 179 flow [2025-01-10 00:38:47,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 175 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:47,991 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 102 flow [2025-01-10 00:38:47,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2025-01-10 00:38:47,991 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2025-01-10 00:38:47,991 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 102 flow [2025-01-10 00:38:47,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-01-10 00:38:47,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:47,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:47,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:38:47,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK === [allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK, de_allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:38:47,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:47,995 INFO L85 PathProgramCache]: Analyzing trace with hash -841870282, now seen corresponding path program 1 times [2025-01-10 00:38:47,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:47,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935010290] [2025-01-10 00:38:47,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:47,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:48,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:38:48,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:38:48,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:48,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:48,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:48,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935010290] [2025-01-10 00:38:48,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935010290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:48,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:48,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:48,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390467731] [2025-01-10 00:38:48,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:48,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:48,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:48,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:48,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:48,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-01-10 00:38:48,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-01-10 00:38:48,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:48,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-01-10 00:38:48,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:48,154 INFO L124 PetriNetUnfolderBase]: 226/473 cut-off events. [2025-01-10 00:38:48,154 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-01-10 00:38:48,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 473 events. 226/473 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2200 event pairs, 122 based on Foata normal form. 25/487 useless extension candidates. Maximal degree in co-relation 407. Up to 275 conditions per place. [2025-01-10 00:38:48,157 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 32 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-01-10 00:38:48,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 187 flow [2025-01-10 00:38:48,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:48,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-01-10 00:38:48,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-01-10 00:38:48,158 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 102 flow. Second operand 3 states and 81 transitions. [2025-01-10 00:38:48,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 187 flow [2025-01-10 00:38:48,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 181 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:48,164 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 98 flow [2025-01-10 00:38:48,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2025-01-10 00:38:48,165 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2025-01-10 00:38:48,165 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 98 flow [2025-01-10 00:38:48,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-01-10 00:38:48,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:48,165 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-01-10 00:38:48,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:38:48,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting de_allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK === [allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK, de_allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:38:48,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:48,184 INFO L85 PathProgramCache]: Analyzing trace with hash 837972320, now seen corresponding path program 1 times [2025-01-10 00:38:48,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:48,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445605506] [2025-01-10 00:38:48,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:48,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:48,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:38:48,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:38:48,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:48,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:48,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:48,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:48,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445605506] [2025-01-10 00:38:48,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445605506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:48,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:48,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:48,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998058953] [2025-01-10 00:38:48,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:48,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:48,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:48,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:48,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:48,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2025-01-10 00:38:48,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-01-10 00:38:48,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:48,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2025-01-10 00:38:48,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:48,425 INFO L124 PetriNetUnfolderBase]: 156/381 cut-off events. [2025-01-10 00:38:48,426 INFO L125 PetriNetUnfolderBase]: For 95/97 co-relation queries the response was YES. [2025-01-10 00:38:48,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 381 events. 156/381 cut-off events. For 95/97 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1782 event pairs, 79 based on Foata normal form. 10/386 useless extension candidates. Maximal degree in co-relation 302. Up to 198 conditions per place. [2025-01-10 00:38:48,428 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 29 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2025-01-10 00:38:48,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 203 flow [2025-01-10 00:38:48,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2025-01-10 00:38:48,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6592592592592592 [2025-01-10 00:38:48,431 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 98 flow. Second operand 3 states and 89 transitions. [2025-01-10 00:38:48,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 203 flow [2025-01-10 00:38:48,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:38:48,433 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 119 flow [2025-01-10 00:38:48,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2025-01-10 00:38:48,433 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2025-01-10 00:38:48,434 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 119 flow [2025-01-10 00:38:48,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-01-10 00:38:48,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:48,434 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-01-10 00:38:48,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:38:48,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting de_allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK === [allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK, de_allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:38:48,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:48,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1691737040, now seen corresponding path program 2 times [2025-01-10 00:38:48,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:48,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971404161] [2025-01-10 00:38:48,437 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:38:48,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:48,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:38:48,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:38:48,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:38:48,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:48,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:48,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971404161] [2025-01-10 00:38:48,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971404161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:48,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:48,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:48,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061211754] [2025-01-10 00:38:48,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:48,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:48,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:48,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:48,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:48,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45 [2025-01-10 00:38:48,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-01-10 00:38:48,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:48,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45 [2025-01-10 00:38:48,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:48,551 INFO L124 PetriNetUnfolderBase]: 89/220 cut-off events. [2025-01-10 00:38:48,551 INFO L125 PetriNetUnfolderBase]: For 134/140 co-relation queries the response was YES. [2025-01-10 00:38:48,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 220 events. 89/220 cut-off events. For 134/140 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 843 event pairs, 31 based on Foata normal form. 18/229 useless extension candidates. Maximal degree in co-relation 314. Up to 119 conditions per place. [2025-01-10 00:38:48,553 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 25 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2025-01-10 00:38:48,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 37 transitions, 168 flow [2025-01-10 00:38:48,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:48,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-01-10 00:38:48,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5851851851851851 [2025-01-10 00:38:48,559 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 119 flow. Second operand 3 states and 79 transitions. [2025-01-10 00:38:48,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 37 transitions, 168 flow [2025-01-10 00:38:48,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 154 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 00:38:48,560 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 90 flow [2025-01-10 00:38:48,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2025-01-10 00:38:48,563 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2025-01-10 00:38:48,563 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 90 flow [2025-01-10 00:38:48,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-01-10 00:38:48,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:48,563 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:48,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:38:48,563 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK, de_allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:38:48,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:48,565 INFO L85 PathProgramCache]: Analyzing trace with hash 668333963, now seen corresponding path program 1 times [2025-01-10 00:38:48,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:48,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899679137] [2025-01-10 00:38:48,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:48,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:48,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:38:48,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:38:48,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:48,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:48,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:48,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:48,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899679137] [2025-01-10 00:38:48,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899679137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:48,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:48,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:38:48,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126640173] [2025-01-10 00:38:48,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:48,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:48,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:48,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:48,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:48,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2025-01-10 00:38:48,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-01-10 00:38:48,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:48,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2025-01-10 00:38:48,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:48,687 INFO L124 PetriNetUnfolderBase]: 103/234 cut-off events. [2025-01-10 00:38:48,687 INFO L125 PetriNetUnfolderBase]: For 68/72 co-relation queries the response was YES. [2025-01-10 00:38:48,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 234 events. 103/234 cut-off events. For 68/72 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 873 event pairs, 55 based on Foata normal form. 2/229 useless extension candidates. Maximal degree in co-relation 201. Up to 150 conditions per place. [2025-01-10 00:38:48,688 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 25 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-01-10 00:38:48,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 37 transitions, 161 flow [2025-01-10 00:38:48,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:48,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-01-10 00:38:48,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5703703703703704 [2025-01-10 00:38:48,690 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 90 flow. Second operand 3 states and 77 transitions. [2025-01-10 00:38:48,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 37 transitions, 161 flow [2025-01-10 00:38:48,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:38:48,691 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 97 flow [2025-01-10 00:38:48,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2025-01-10 00:38:48,692 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2025-01-10 00:38:48,692 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 97 flow [2025-01-10 00:38:48,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-01-10 00:38:48,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:48,692 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:48,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:38:48,692 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK, de_allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:38:48,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:48,693 INFO L85 PathProgramCache]: Analyzing trace with hash 984438261, now seen corresponding path program 2 times [2025-01-10 00:38:48,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:48,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346719146] [2025-01-10 00:38:48,693 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:38:48,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:48,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-01-10 00:38:48,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 00:38:48,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:38:48,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:48,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:48,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346719146] [2025-01-10 00:38:48,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346719146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:48,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:48,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:38:48,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858015967] [2025-01-10 00:38:48,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:48,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:38:48,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:48,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:38:48,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:38:48,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45 [2025-01-10 00:38:48,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-01-10 00:38:48,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:48,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45 [2025-01-10 00:38:48,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:48,776 INFO L124 PetriNetUnfolderBase]: 87/213 cut-off events. [2025-01-10 00:38:48,776 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-01-10 00:38:48,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 213 events. 87/213 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 820 event pairs, 78 based on Foata normal form. 1/201 useless extension candidates. Maximal degree in co-relation 195. Up to 178 conditions per place. [2025-01-10 00:38:48,777 INFO L140 encePairwiseOnDemand]: 43/45 looper letters, 0 selfloop transitions, 0 changer transitions 30/30 dead transitions. [2025-01-10 00:38:48,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 135 flow [2025-01-10 00:38:48,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:38:48,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:38:48,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-01-10 00:38:48,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-01-10 00:38:48,778 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 97 flow. Second operand 3 states and 70 transitions. [2025-01-10 00:38:48,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 135 flow [2025-01-10 00:38:48,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 30 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:48,780 INFO L231 Difference]: Finished difference. Result has 39 places, 0 transitions, 0 flow [2025-01-10 00:38:48,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=39, PETRI_TRANSITIONS=0} [2025-01-10 00:38:48,781 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2025-01-10 00:38:48,782 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 0 transitions, 0 flow [2025-01-10 00:38:48,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-01-10 00:38:48,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-01-10 00:38:48,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-01-10 00:38:48,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-01-10 00:38:48,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-01-10 00:38:48,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-01-10 00:38:48,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-01-10 00:38:48,787 INFO L782 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-01-10 00:38:48,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:38:48,787 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-01-10 00:38:48,790 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:38:48,790 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:38:48,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:38:48 BasicIcfg [2025-01-10 00:38:48,803 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:38:48,803 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:38:48,804 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:38:48,804 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:38:48,804 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:38:47" (3/4) ... [2025-01-10 00:38:48,806 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 00:38:48,807 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure allocator [2025-01-10 00:38:48,808 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure de_allocator [2025-01-10 00:38:48,814 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 51 nodes and edges [2025-01-10 00:38:48,814 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-10 00:38:48,814 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-10 00:38:48,814 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 00:38:48,894 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 00:38:48,895 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 00:38:48,895 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:38:48,895 INFO L158 Benchmark]: Toolchain (without parser) took 2465.04ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 84.6MB in the end (delta: 24.6MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2025-01-10 00:38:48,896 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:38:48,896 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.74ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 89.2MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:38:48,896 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.70ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 87.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:38:48,896 INFO L158 Benchmark]: Boogie Preprocessor took 25.06ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 85.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:38:48,897 INFO L158 Benchmark]: RCFGBuilder took 417.87ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 57.5MB in the end (delta: 27.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:38:48,897 INFO L158 Benchmark]: TraceAbstraction took 1585.60ms. Allocated memory is still 142.6MB. Free memory was 56.6MB in the beginning and 89.8MB in the end (delta: -33.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:38:48,897 INFO L158 Benchmark]: Witness Printer took 91.44ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 84.6MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:38:48,898 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.15ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.74ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 89.2MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.70ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 87.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.06ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 85.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 417.87ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 57.5MB in the end (delta: 27.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1585.60ms. Allocated memory is still 142.6MB. Free memory was 56.6MB in the beginning and 89.8MB in the end (delta: -33.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 91.44ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 84.6MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 16]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 715]: 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, 71 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 259 IncrementalHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 5 mSDtfsCounter, 259 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=4, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 246 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 00:38:48,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE