./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-races/race-1_1-join.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-races/race-1_1-join.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 ab598119c4148bae0d8b880ae1fca3b30d4f7d9a1b46bb07e7f3565fa04f9e72 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:58:24,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:58:24,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:58:24,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:58:24,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:58:25,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:58:25,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:58:25,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:58:25,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:58:25,007 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:58:25,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:58:25,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:58:25,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:58:25,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:58:25,008 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:58:25,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:58:25,008 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:58:25,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:58:25,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:58:25,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:58:25,009 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:58:25,009 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:58:25,009 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:58:25,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:58:25,009 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:58:25,009 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:58:25,009 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:58:25,009 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:58:25,009 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:58:25,009 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:58:25,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:58:25,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:58:25,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:58:25,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:58:25,010 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:58:25,010 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:58:25,010 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:58:25,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:58:25,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:58:25,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:58:25,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:58:25,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:58:25,011 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 -> ab598119c4148bae0d8b880ae1fca3b30d4f7d9a1b46bb07e7f3565fa04f9e72 [2025-03-04 09:58:25,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:58:25,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:58:25,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:58:25,234 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:58:25,234 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:58:25,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-1_1-join.i [2025-03-04 09:58:26,355 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eac1db595/51edb31e3f4d45e38c5a364acdc2fe4e/FLAG8bdc434a0 [2025-03-04 09:58:26,661 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:58:26,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-1_1-join.i [2025-03-04 09:58:26,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eac1db595/51edb31e3f4d45e38c5a364acdc2fe4e/FLAG8bdc434a0 [2025-03-04 09:58:26,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eac1db595/51edb31e3f4d45e38c5a364acdc2fe4e [2025-03-04 09:58:26,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:58:26,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:58:26,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:58:26,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:58:26,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:58:26,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:58:26" (1/1) ... [2025-03-04 09:58:26,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c9874e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:26, skipping insertion in model container [2025-03-04 09:58:26,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:58:26" (1/1) ... [2025-03-04 09:58:26,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:58:27,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:58:27,169 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:58:27,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:58:27,298 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:58:27,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:27 WrapperNode [2025-03-04 09:58:27,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:58:27,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:58:27,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:58:27,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:58:27,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:27" (1/1) ... [2025-03-04 09:58:27,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:27" (1/1) ... [2025-03-04 09:58:27,333 INFO L138 Inliner]: procedures = 481, calls = 25, calls flagged for inlining = 9, calls inlined = 12, statements flattened = 98 [2025-03-04 09:58:27,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:58:27,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:58:27,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:58:27,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:58:27,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:27" (1/1) ... [2025-03-04 09:58:27,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:27" (1/1) ... [2025-03-04 09:58:27,342 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:27" (1/1) ... [2025-03-04 09:58:27,352 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 5, 1]. 63 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 1 writes are split as follows [0, 0, 1]. [2025-03-04 09:58:27,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:27" (1/1) ... [2025-03-04 09:58:27,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:27" (1/1) ... [2025-03-04 09:58:27,360 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:27" (1/1) ... [2025-03-04 09:58:27,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:27" (1/1) ... [2025-03-04 09:58:27,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:27" (1/1) ... [2025-03-04 09:58:27,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:27" (1/1) ... [2025-03-04 09:58:27,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:58:27,367 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:58:27,367 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:58:27,367 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:58:27,367 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:27" (1/1) ... [2025-03-04 09:58:27,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:58:27,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:58:27,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:58:27,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:58:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 09:58:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 09:58:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:58:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 09:58:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 09:58:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 09:58:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:58:27,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:58:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 09:58:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 09:58:27,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 09:58:27,421 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 09:58:27,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:58:27,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 09:58:27,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 09:58:27,422 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:58:27,628 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:58:27,630 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:58:27,769 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:58:27,769 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:58:27,830 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:58:27,830 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:58:27,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:58:27 BoogieIcfgContainer [2025-03-04 09:58:27,831 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:58:27,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:58:27,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:58:27,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:58:27,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:58:26" (1/3) ... [2025-03-04 09:58:27,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25dd700e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:58:27, skipping insertion in model container [2025-03-04 09:58:27,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:27" (2/3) ... [2025-03-04 09:58:27,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25dd700e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:58:27, skipping insertion in model container [2025-03-04 09:58:27,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:58:27" (3/3) ... [2025-03-04 09:58:27,840 INFO L128 eAbstractionObserver]: Analyzing ICFG race-1_1-join.i [2025-03-04 09:58:27,850 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:58:27,852 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-1_1-join.i that has 2 procedures, 44 locations, 1 initial locations, 0 loop locations, and 7 error locations. [2025-03-04 09:58:27,852 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:58:27,878 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 09:58:27,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 53 transitions, 113 flow [2025-03-04 09:58:27,928 INFO L124 PetriNetUnfolderBase]: 9/58 cut-off events. [2025-03-04 09:58:27,931 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 09:58:27,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 58 events. 9/58 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 124 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 25. Up to 3 conditions per place. [2025-03-04 09:58:27,936 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 53 transitions, 113 flow [2025-03-04 09:58:27,938 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 52 transitions, 110 flow [2025-03-04 09:58:27,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:58:27,951 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;@3c8ad3a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:58:27,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-04 09:58:27,954 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:58:27,956 INFO L124 PetriNetUnfolderBase]: 2/10 cut-off events. [2025-03-04 09:58:27,956 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:58:27,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:27,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 09:58:27,957 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-03-04 09:58:27,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:27,961 INFO L85 PathProgramCache]: Analyzing trace with hash 8104364, now seen corresponding path program 1 times [2025-03-04 09:58:27,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:27,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072929679] [2025-03-04 09:58:27,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:58:27,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:28,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 09:58:28,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 09:58:28,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:58:28,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:28,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:58:28,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:28,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072929679] [2025-03-04 09:58:28,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072929679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:28,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:28,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:58:28,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882949774] [2025-03-04 09:58:28,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:28,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:58:28,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:28,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:58:28,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:58:28,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2025-03-04 09:58:28,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 52 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:28,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:28,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2025-03-04 09:58:28,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:28,373 INFO L124 PetriNetUnfolderBase]: 31/114 cut-off events. [2025-03-04 09:58:28,373 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 09:58:28,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 114 events. 31/114 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 438 event pairs, 30 based on Foata normal form. 12/114 useless extension candidates. Maximal degree in co-relation 165. Up to 82 conditions per place. [2025-03-04 09:58:28,377 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 17 selfloop transitions, 6 changer transitions 0/31 dead transitions. [2025-03-04 09:58:28,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 114 flow [2025-03-04 09:58:28,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:58:28,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:58:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-04 09:58:28,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4591194968553459 [2025-03-04 09:58:28,388 INFO L175 Difference]: Start difference. First operand has 46 places, 52 transitions, 110 flow. Second operand 3 states and 73 transitions. [2025-03-04 09:58:28,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 114 flow [2025-03-04 09:58:28,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:58:28,394 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 76 flow [2025-03-04 09:58:28,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2025-03-04 09:58:28,398 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -13 predicate places. [2025-03-04 09:58:28,400 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 76 flow [2025-03-04 09:58:28,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:28,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:28,400 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:58:28,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:58:28,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-03-04 09:58:28,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:28,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1332329596, now seen corresponding path program 1 times [2025-03-04 09:58:28,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:28,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259288287] [2025-03-04 09:58:28,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:58:28,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:28,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:58:28,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:58:28,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:58:28,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:58:28,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:28,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259288287] [2025-03-04 09:58:28,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259288287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:28,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:28,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:58:28,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254272556] [2025-03-04 09:58:28,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:28,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:58:28,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:28,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:58:28,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:58:28,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 53 [2025-03-04 09:58:28,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:28,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:28,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 53 [2025-03-04 09:58:28,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:28,645 INFO L124 PetriNetUnfolderBase]: 18/72 cut-off events. [2025-03-04 09:58:28,646 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 09:58:28,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 72 events. 18/72 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 206 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 103. Up to 30 conditions per place. [2025-03-04 09:58:28,646 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 29 selfloop transitions, 3 changer transitions 3/46 dead transitions. [2025-03-04 09:58:28,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 176 flow [2025-03-04 09:58:28,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:58:28,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:58:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-03-04 09:58:28,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5094339622641509 [2025-03-04 09:58:28,649 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 76 flow. Second operand 4 states and 108 transitions. [2025-03-04 09:58:28,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 176 flow [2025-03-04 09:58:28,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:58:28,652 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 79 flow [2025-03-04 09:58:28,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=79, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2025-03-04 09:58:28,653 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -10 predicate places. [2025-03-04 09:58:28,653 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 79 flow [2025-03-04 09:58:28,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:28,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:28,653 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:58:28,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:58:28,654 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-03-04 09:58:28,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:28,654 INFO L85 PathProgramCache]: Analyzing trace with hash 481766755, now seen corresponding path program 1 times [2025-03-04 09:58:28,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:28,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882861705] [2025-03-04 09:58:28,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:58:28,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:28,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:58:28,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:58:28,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:58:28,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:58:28,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:28,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882861705] [2025-03-04 09:58:28,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882861705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:28,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:28,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:58:28,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758449529] [2025-03-04 09:58:28,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:28,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:58:28,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:28,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:58:28,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:58:28,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 53 [2025-03-04 09:58:28,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:28,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:28,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 53 [2025-03-04 09:58:28,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:28,746 INFO L124 PetriNetUnfolderBase]: 18/74 cut-off events. [2025-03-04 09:58:28,747 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-04 09:58:28,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 74 events. 18/74 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 199 event pairs, 12 based on Foata normal form. 1/73 useless extension candidates. Maximal degree in co-relation 70. Up to 40 conditions per place. [2025-03-04 09:58:28,748 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 21 selfloop transitions, 2 changer transitions 5/37 dead transitions. [2025-03-04 09:58:28,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 37 transitions, 145 flow [2025-03-04 09:58:28,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:58:28,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:58:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2025-03-04 09:58:28,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49056603773584906 [2025-03-04 09:58:28,749 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 79 flow. Second operand 3 states and 78 transitions. [2025-03-04 09:58:28,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 37 transitions, 145 flow [2025-03-04 09:58:28,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:58:28,750 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 72 flow [2025-03-04 09:58:28,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, 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=72, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2025-03-04 09:58:28,751 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -9 predicate places. [2025-03-04 09:58:28,751 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 72 flow [2025-03-04 09:58:28,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:28,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:28,751 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:58:28,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:58:28,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-03-04 09:58:28,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:28,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1406499397, now seen corresponding path program 1 times [2025-03-04 09:58:28,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:28,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136097248] [2025-03-04 09:58:28,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:58:28,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:28,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 09:58:28,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 09:58:28,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:58:28,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:58:28,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:28,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136097248] [2025-03-04 09:58:28,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136097248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:28,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:28,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:58:28,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835075026] [2025-03-04 09:58:28,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:28,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:58:28,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:28,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:58:28,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:58:28,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 53 [2025-03-04 09:58:28,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:28,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:28,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 53 [2025-03-04 09:58:28,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:28,898 INFO L124 PetriNetUnfolderBase]: 18/59 cut-off events. [2025-03-04 09:58:28,898 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2025-03-04 09:58:28,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 59 events. 18/59 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 12 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 94. Up to 39 conditions per place. [2025-03-04 09:58:28,900 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 17 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2025-03-04 09:58:28,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 123 flow [2025-03-04 09:58:28,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:58:28,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:58:28,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-04 09:58:28,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44654088050314467 [2025-03-04 09:58:28,902 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 72 flow. Second operand 3 states and 71 transitions. [2025-03-04 09:58:28,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 123 flow [2025-03-04 09:58:28,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 26 transitions, 92 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-04 09:58:28,903 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 52 flow [2025-03-04 09:58:28,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2025-03-04 09:58:28,903 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -19 predicate places. [2025-03-04 09:58:28,903 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 52 flow [2025-03-04 09:58:28,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:28,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:28,904 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:58:28,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:58:28,904 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-03-04 09:58:28,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:28,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1678605273, now seen corresponding path program 1 times [2025-03-04 09:58:28,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:28,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991974962] [2025-03-04 09:58:28,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:58:28,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:28,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:58:28,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:58:28,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:58:28,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:58:29,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:29,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991974962] [2025-03-04 09:58:29,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991974962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:29,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:29,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:58:29,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837394054] [2025-03-04 09:58:29,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:29,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:58:29,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:29,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:58:29,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:58:29,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 53 [2025-03-04 09:58:29,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:29,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:29,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 53 [2025-03-04 09:58:29,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:29,090 INFO L124 PetriNetUnfolderBase]: 15/54 cut-off events. [2025-03-04 09:58:29,090 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 09:58:29,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 54 events. 15/54 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 10 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 31. Up to 33 conditions per place. [2025-03-04 09:58:29,091 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 18 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2025-03-04 09:58:29,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 27 transitions, 104 flow [2025-03-04 09:58:29,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:58:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:58:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-04 09:58:29,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4528301886792453 [2025-03-04 09:58:29,092 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 52 flow. Second operand 3 states and 72 transitions. [2025-03-04 09:58:29,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 27 transitions, 104 flow [2025-03-04 09:58:29,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 27 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:58:29,093 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 50 flow [2025-03-04 09:58:29,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2025-03-04 09:58:29,093 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -20 predicate places. [2025-03-04 09:58:29,093 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 50 flow [2025-03-04 09:58:29,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:29,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:29,093 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:58:29,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:58:29,093 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-03-04 09:58:29,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:29,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1648968034, now seen corresponding path program 1 times [2025-03-04 09:58:29,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:29,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876806216] [2025-03-04 09:58:29,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:58:29,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:29,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:58:29,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:58:29,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:58:29,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:58:29,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:29,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876806216] [2025-03-04 09:58:29,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876806216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:29,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:29,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:58:29,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994887874] [2025-03-04 09:58:29,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:29,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:58:29,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:29,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:58:29,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:58:29,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 53 [2025-03-04 09:58:29,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:29,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:29,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 53 [2025-03-04 09:58:29,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:29,194 INFO L124 PetriNetUnfolderBase]: 15/53 cut-off events. [2025-03-04 09:58:29,194 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 09:58:29,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 53 events. 15/53 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 10 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 68. Up to 33 conditions per place. [2025-03-04 09:58:29,195 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 18 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2025-03-04 09:58:29,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 98 flow [2025-03-04 09:58:29,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:58:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:58:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-04 09:58:29,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4528301886792453 [2025-03-04 09:58:29,196 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 50 flow. Second operand 3 states and 72 transitions. [2025-03-04 09:58:29,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 98 flow [2025-03-04 09:58:29,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:58:29,197 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 48 flow [2025-03-04 09:58:29,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2025-03-04 09:58:29,197 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -21 predicate places. [2025-03-04 09:58:29,198 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 48 flow [2025-03-04 09:58:29,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:29,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:29,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:58:29,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:58:29,198 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (and 6 more)] === [2025-03-04 09:58:29,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:29,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1365670315, now seen corresponding path program 1 times [2025-03-04 09:58:29,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:29,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211923450] [2025-03-04 09:58:29,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:58:29,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:29,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 09:58:29,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 09:58:29,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:58:29,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:58:29,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:29,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211923450] [2025-03-04 09:58:29,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211923450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:29,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:29,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 09:58:29,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055900266] [2025-03-04 09:58:29,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:29,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:58:29,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:29,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:58:29,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:58:29,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 53 [2025-03-04 09:58:29,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 48 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:29,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:29,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 53 [2025-03-04 09:58:29,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:29,392 INFO L124 PetriNetUnfolderBase]: 15/52 cut-off events. [2025-03-04 09:58:29,393 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 09:58:29,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 52 events. 15/52 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 10 based on Foata normal form. 1/52 useless extension candidates. Maximal degree in co-relation 68. Up to 32 conditions per place. [2025-03-04 09:58:29,394 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 0 selfloop transitions, 0 changer transitions 25/25 dead transitions. [2025-03-04 09:58:29,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 25 transitions, 96 flow [2025-03-04 09:58:29,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:58:29,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:58:29,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-03-04 09:58:29,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.419811320754717 [2025-03-04 09:58:29,395 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 48 flow. Second operand 4 states and 89 transitions. [2025-03-04 09:58:29,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 25 transitions, 96 flow [2025-03-04 09:58:29,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 25 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:58:29,397 INFO L231 Difference]: Finished difference. Result has 25 places, 0 transitions, 0 flow [2025-03-04 09:58:29,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=25, PETRI_TRANSITIONS=0} [2025-03-04 09:58:29,398 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -21 predicate places. [2025-03-04 09:58:29,398 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 0 transitions, 0 flow [2025-03-04 09:58:29,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:29,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 9 remaining) [2025-03-04 09:58:29,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (7 of 9 remaining) [2025-03-04 09:58:29,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (6 of 9 remaining) [2025-03-04 09:58:29,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 9 remaining) [2025-03-04 09:58:29,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2025-03-04 09:58:29,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2025-03-04 09:58:29,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 9 remaining) [2025-03-04 09:58:29,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2025-03-04 09:58:29,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2025-03-04 09:58:29,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:58:29,404 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:58:29,410 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 09:58:29,411 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 09:58:29,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 09:58:29 BasicIcfg [2025-03-04 09:58:29,416 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 09:58:29,416 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 09:58:29,417 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 09:58:29,417 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 09:58:29,417 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:58:27" (3/4) ... [2025-03-04 09:58:29,418 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 09:58:29,420 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 09:58:29,425 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 51 nodes and edges [2025-03-04 09:58:29,427 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-03-04 09:58:29,427 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-04 09:58:29,428 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 09:58:29,428 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 09:58:29,483 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 09:58:29,483 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 09:58:29,483 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 09:58:29,484 INFO L158 Benchmark]: Toolchain (without parser) took 2790.99ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 109.6MB in the beginning and 137.0MB in the end (delta: -27.4MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. [2025-03-04 09:58:29,484 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:58:29,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 605.59ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 55.7MB in the end (delta: 53.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-04 09:58:29,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.26ms. Allocated memory is still 142.6MB. Free memory was 55.7MB in the beginning and 53.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:58:29,485 INFO L158 Benchmark]: Boogie Preprocessor took 32.33ms. Allocated memory is still 142.6MB. Free memory was 53.0MB in the beginning and 50.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:58:29,485 INFO L158 Benchmark]: IcfgBuilder took 464.85ms. Allocated memory is still 142.6MB. Free memory was 49.8MB in the beginning and 85.8MB in the end (delta: -35.9MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2025-03-04 09:58:29,485 INFO L158 Benchmark]: TraceAbstraction took 1582.69ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 41.2MB in the end (delta: 43.8MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2025-03-04 09:58:29,486 INFO L158 Benchmark]: Witness Printer took 67.33ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 41.2MB in the beginning and 137.0MB in the end (delta: -95.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:58:29,487 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 605.59ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 55.7MB in the end (delta: 53.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.26ms. Allocated memory is still 142.6MB. Free memory was 55.7MB in the beginning and 53.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.33ms. Allocated memory is still 142.6MB. Free memory was 53.0MB in the beginning and 50.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 464.85ms. Allocated memory is still 142.6MB. Free memory was 49.8MB in the beginning and 85.8MB in the end (delta: -35.9MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1582.69ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 41.2MB in the end (delta: 43.8MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. * Witness Printer took 67.33ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 41.2MB in the beginning and 137.0MB in the end (delta: -95.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1691]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1691]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1691]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1724]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1691]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 57 locations, 9 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: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 305 IncrementalHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 7 mSDtfsCounter, 305 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=0, InterpolantAutomatonStates: 23, 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.7s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 203 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 7 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 09:58:29,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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