./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_20-publish-regression_true.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/goblint-regression/13-privatized_20-publish-regression_true.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 bdbcb1f6d336419408bc21eb9ac3a89d4566c9a0348f626a712e605b31e52535 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:57:17,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:57:17,464 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:57:17,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:57:17,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:57:17,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:57:17,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:57:17,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:57:17,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:57:17,489 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:57:17,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:57:17,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:57:17,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:57:17,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:57:17,490 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:57:17,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:57:17,491 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:57:17,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:57:17,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:57:17,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:57:17,491 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:57:17,491 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:57:17,491 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:57:17,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:57:17,491 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:57:17,491 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:57:17,491 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:57:17,492 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:57:17,492 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:57:17,492 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:57:17,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:57:17,492 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:57:17,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:57:17,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:57:17,492 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:57:17,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:57:17,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:57:17,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:57:17,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:57:17,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:57:17,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:57:17,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:57:17,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:57:17,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:57:17,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:57:17,493 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:57:17,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:57:17,494 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 -> bdbcb1f6d336419408bc21eb9ac3a89d4566c9a0348f626a712e605b31e52535 [2025-01-10 00:57:17,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:57:17,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:57:17,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:57:17,715 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:57:17,716 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:57:17,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_20-publish-regression_true.i [2025-01-10 00:57:18,827 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2c0f87a5/93f9b7c4600e417a950a6ea910c6aee5/FLAGe57d42f59 [2025-01-10 00:57:19,127 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:57:19,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_20-publish-regression_true.i [2025-01-10 00:57:19,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2c0f87a5/93f9b7c4600e417a950a6ea910c6aee5/FLAGe57d42f59 [2025-01-10 00:57:19,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2c0f87a5/93f9b7c4600e417a950a6ea910c6aee5 [2025-01-10 00:57:19,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:57:19,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:57:19,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:57:19,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:57:19,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:57:19,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:57:19" (1/1) ... [2025-01-10 00:57:19,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c29dfe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:19, skipping insertion in model container [2025-01-10 00:57:19,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:57:19" (1/1) ... [2025-01-10 00:57:19,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:57:19,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:57:19,398 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:57:19,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:57:19,460 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:57:19,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:19 WrapperNode [2025-01-10 00:57:19,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:57:19,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:57:19,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:57:19,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:57:19,467 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:57:19" (1/1) ... [2025-01-10 00:57:19,474 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:57:19" (1/1) ... [2025-01-10 00:57:19,489 INFO L138 Inliner]: procedures = 162, calls = 31, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 86 [2025-01-10 00:57:19,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:57:19,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:57:19,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:57:19,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:57:19,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:19" (1/1) ... [2025-01-10 00:57:19,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:19" (1/1) ... [2025-01-10 00:57:19,498 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:19" (1/1) ... [2025-01-10 00:57:19,505 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:57:19,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:19" (1/1) ... [2025-01-10 00:57:19,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:19" (1/1) ... [2025-01-10 00:57:19,508 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:19" (1/1) ... [2025-01-10 00:57:19,509 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:19" (1/1) ... [2025-01-10 00:57:19,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:19" (1/1) ... [2025-01-10 00:57:19,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:19" (1/1) ... [2025-01-10 00:57:19,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:19" (1/1) ... [2025-01-10 00:57:19,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:57:19,514 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:57:19,514 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:57:19,514 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:57:19,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:19" (1/1) ... [2025-01-10 00:57:19,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:57:19,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:57:19,540 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:57:19,541 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:57:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:57:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:57:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:57:19,558 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:57:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:57:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:57:19,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:57:19,559 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:57:19,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:57:19,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:57:19,560 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:57:19,656 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:57:19,657 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:57:19,810 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:57:19,810 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:57:19,886 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:57:19,886 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:57:19,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:57:19 BoogieIcfgContainer [2025-01-10 00:57:19,886 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:57:19,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:57:19,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:57:19,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:57:19,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:57:19" (1/3) ... [2025-01-10 00:57:19,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5bffb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:57:19, skipping insertion in model container [2025-01-10 00:57:19,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:19" (2/3) ... [2025-01-10 00:57:19,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5bffb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:57:19, skipping insertion in model container [2025-01-10 00:57:19,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:57:19" (3/3) ... [2025-01-10 00:57:19,893 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_20-publish-regression_true.i [2025-01-10 00:57:19,903 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:57:19,904 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_20-publish-regression_true.i that has 2 procedures, 44 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-01-10 00:57:19,904 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:57:19,940 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 00:57:19,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 105 flow [2025-01-10 00:57:19,983 INFO L124 PetriNetUnfolderBase]: 6/48 cut-off events. [2025-01-10 00:57:19,986 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:57:19,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 48 events. 6/48 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-01-10 00:57:19,990 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 49 transitions, 105 flow [2025-01-10 00:57:19,992 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 47 transitions, 100 flow [2025-01-10 00:57:20,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:57:20,010 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;@3e1b1edd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:57:20,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 00:57:20,014 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:57:20,014 INFO L124 PetriNetUnfolderBase]: 2/9 cut-off events. [2025-01-10 00:57:20,015 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:57:20,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:20,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:57:20,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:57:20,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:20,020 INFO L85 PathProgramCache]: Analyzing trace with hash 8911709, now seen corresponding path program 1 times [2025-01-10 00:57:20,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:20,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894701175] [2025-01-10 00:57:20,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:20,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:20,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:57:20,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:57:20,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:20,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:20,220 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:57:20,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:20,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894701175] [2025-01-10 00:57:20,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894701175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:20,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:20,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:57:20,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627329542] [2025-01-10 00:57:20,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:20,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:57:20,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:20,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:57:20,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:57:20,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2025-01-10 00:57:20,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 100 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-01-10 00:57:20,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:20,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2025-01-10 00:57:20,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:20,367 INFO L124 PetriNetUnfolderBase]: 77/226 cut-off events. [2025-01-10 00:57:20,367 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:57:20,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 226 events. 77/226 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 894 event pairs, 66 based on Foata normal form. 40/252 useless extension candidates. Maximal degree in co-relation 391. Up to 153 conditions per place. [2025-01-10 00:57:20,369 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 30 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2025-01-10 00:57:20,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 46 transitions, 166 flow [2025-01-10 00:57:20,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:57:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:57:20,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-01-10 00:57:20,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5850340136054422 [2025-01-10 00:57:20,381 INFO L175 Difference]: Start difference. First operand has 45 places, 47 transitions, 100 flow. Second operand 3 states and 86 transitions. [2025-01-10 00:57:20,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 46 transitions, 166 flow [2025-01-10 00:57:20,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:57:20,385 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 80 flow [2025-01-10 00:57:20,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2025-01-10 00:57:20,389 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2025-01-10 00:57:20,389 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 80 flow [2025-01-10 00:57:20,389 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-01-10 00:57:20,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:20,389 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:20,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:57:20,390 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:57:20,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:20,390 INFO L85 PathProgramCache]: Analyzing trace with hash 604973900, now seen corresponding path program 1 times [2025-01-10 00:57:20,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:20,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205558282] [2025-01-10 00:57:20,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:20,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:20,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:57:20,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:57:20,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:20,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:20,509 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:57:20,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:20,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205558282] [2025-01-10 00:57:20,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205558282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:20,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:20,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:57:20,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787150142] [2025-01-10 00:57:20,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:20,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:57:20,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:20,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:57:20,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:57:20,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2025-01-10 00:57:20,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:20,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:20,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2025-01-10 00:57:20,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:20,722 INFO L124 PetriNetUnfolderBase]: 98/287 cut-off events. [2025-01-10 00:57:20,723 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-01-10 00:57:20,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 287 events. 98/287 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1340 event pairs, 24 based on Foata normal form. 16/301 useless extension candidates. Maximal degree in co-relation 253. Up to 97 conditions per place. [2025-01-10 00:57:20,724 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 49 selfloop transitions, 14 changer transitions 0/75 dead transitions. [2025-01-10 00:57:20,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 75 transitions, 298 flow [2025-01-10 00:57:20,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:57:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:57:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2025-01-10 00:57:20,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49854227405247814 [2025-01-10 00:57:20,726 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 80 flow. Second operand 7 states and 171 transitions. [2025-01-10 00:57:20,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 75 transitions, 298 flow [2025-01-10 00:57:20,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 75 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:57:20,729 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 157 flow [2025-01-10 00:57:20,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=157, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-01-10 00:57:20,730 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2025-01-10 00:57:20,730 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 157 flow [2025-01-10 00:57:20,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:20,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:20,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:20,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:57:20,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:57:20,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:20,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2074944965, now seen corresponding path program 1 times [2025-01-10 00:57:20,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:20,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123870825] [2025-01-10 00:57:20,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:20,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:20,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:57:20,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:57:20,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:20,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:20,898 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:57:20,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:20,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123870825] [2025-01-10 00:57:20,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123870825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:20,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:20,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:57:20,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571557464] [2025-01-10 00:57:20,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:20,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:57:20,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:20,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:57:20,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:57:20,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 49 [2025-01-10 00:57:20,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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:57:20,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:20,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 49 [2025-01-10 00:57:20,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:20,947 INFO L124 PetriNetUnfolderBase]: 20/98 cut-off events. [2025-01-10 00:57:20,947 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-10 00:57:20,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 98 events. 20/98 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 242 event pairs, 6 based on Foata normal form. 11/107 useless extension candidates. Maximal degree in co-relation 206. Up to 50 conditions per place. [2025-01-10 00:57:20,948 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 18 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2025-01-10 00:57:20,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 143 flow [2025-01-10 00:57:20,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:57:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:57:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-01-10 00:57:20,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4744897959183674 [2025-01-10 00:57:20,949 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 157 flow. Second operand 4 states and 93 transitions. [2025-01-10 00:57:20,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 143 flow [2025-01-10 00:57:20,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 118 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-01-10 00:57:20,952 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 76 flow [2025-01-10 00:57:20,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2025-01-10 00:57:20,953 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2025-01-10 00:57:20,953 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 76 flow [2025-01-10 00:57:20,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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:57:20,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:20,953 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:20,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:57:20,954 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:57:20,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:20,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1934888918, now seen corresponding path program 1 times [2025-01-10 00:57:20,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:20,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090961305] [2025-01-10 00:57:20,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:20,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:20,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:57:20,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:57:20,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:20,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:21,041 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:57:21,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:21,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090961305] [2025-01-10 00:57:21,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090961305] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:21,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:21,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:57:21,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549917011] [2025-01-10 00:57:21,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:21,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:57:21,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:21,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:57:21,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:57:21,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2025-01-10 00:57:21,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:57:21,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:21,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2025-01-10 00:57:21,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:21,099 INFO L124 PetriNetUnfolderBase]: 20/88 cut-off events. [2025-01-10 00:57:21,099 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-10 00:57:21,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 88 events. 20/88 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 180 event pairs, 15 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 175. Up to 52 conditions per place. [2025-01-10 00:57:21,100 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 19 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2025-01-10 00:57:21,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 118 flow [2025-01-10 00:57:21,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:57:21,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:57:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-01-10 00:57:21,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44387755102040816 [2025-01-10 00:57:21,103 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 76 flow. Second operand 4 states and 87 transitions. [2025-01-10 00:57:21,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 118 flow [2025-01-10 00:57:21,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 113 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:57:21,104 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 71 flow [2025-01-10 00:57:21,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2025-01-10 00:57:21,104 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2025-01-10 00:57:21,104 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 71 flow [2025-01-10 00:57:21,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:57:21,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:21,104 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:21,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:57:21,105 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:57:21,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:21,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1578027872, now seen corresponding path program 1 times [2025-01-10 00:57:21,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:21,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475238843] [2025-01-10 00:57:21,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:21,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:21,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 00:57:21,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 00:57:21,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:21,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:21,152 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:57:21,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:21,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475238843] [2025-01-10 00:57:21,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475238843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:21,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:21,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:57:21,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368574704] [2025-01-10 00:57:21,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:21,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:57:21,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:21,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:57:21,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:57:21,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2025-01-10 00:57:21,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:21,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:21,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2025-01-10 00:57:21,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:21,179 INFO L124 PetriNetUnfolderBase]: 19/86 cut-off events. [2025-01-10 00:57:21,180 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 00:57:21,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 86 events. 19/86 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 178 event pairs, 19 based on Foata normal form. 1/84 useless extension candidates. Maximal degree in co-relation 171. Up to 67 conditions per place. [2025-01-10 00:57:21,181 INFO L140 encePairwiseOnDemand]: 47/49 looper letters, 0 selfloop transitions, 0 changer transitions 28/28 dead transitions. [2025-01-10 00:57:21,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 28 transitions, 107 flow [2025-01-10 00:57:21,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:57:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:57:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-01-10 00:57:21,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46258503401360546 [2025-01-10 00:57:21,182 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 71 flow. Second operand 3 states and 68 transitions. [2025-01-10 00:57:21,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 28 transitions, 107 flow [2025-01-10 00:57:21,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 101 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:57:21,183 INFO L231 Difference]: Finished difference. Result has 35 places, 0 transitions, 0 flow [2025-01-10 00:57:21,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=35, PETRI_TRANSITIONS=0} [2025-01-10 00:57:21,183 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -10 predicate places. [2025-01-10 00:57:21,183 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 0 transitions, 0 flow [2025-01-10 00:57:21,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:21,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-01-10 00:57:21,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-01-10 00:57:21,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-01-10 00:57:21,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-01-10 00:57:21,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2025-01-10 00:57:21,186 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-01-10 00:57:21,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:57:21,186 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 00:57:21,190 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:57:21,190 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:57:21,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:57:21 BasicIcfg [2025-01-10 00:57:21,194 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:57:21,195 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:57:21,195 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:57:21,195 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:57:21,196 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:57:19" (3/4) ... [2025-01-10 00:57:21,197 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 00:57:21,200 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-01-10 00:57:21,204 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2025-01-10 00:57:21,204 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-01-10 00:57:21,205 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 00:57:21,205 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 00:57:21,263 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 00:57:21,263 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 00:57:21,263 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:57:21,264 INFO L158 Benchmark]: Toolchain (without parser) took 2103.80ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 76.2MB in the end (delta: 35.6MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. [2025-01-10 00:57:21,264 INFO L158 Benchmark]: CDTParser took 0.77ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:57:21,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.90ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 92.3MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:57:21,266 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.60ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 90.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:57:21,266 INFO L158 Benchmark]: Boogie Preprocessor took 23.67ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 88.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:57:21,267 INFO L158 Benchmark]: RCFGBuilder took 372.17ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 64.2MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:57:21,267 INFO L158 Benchmark]: TraceAbstraction took 1306.61ms. Allocated memory is still 142.6MB. Free memory was 63.7MB in the beginning and 81.8MB in the end (delta: -18.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:57:21,267 INFO L158 Benchmark]: Witness Printer took 68.48ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 76.2MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:57:21,268 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.77ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.90ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 92.3MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.60ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 90.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.67ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 88.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 372.17ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 64.2MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1306.61ms. Allocated memory is still 142.6MB. Free memory was 63.7MB in the beginning and 81.8MB in the end (delta: -18.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 68.48ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 76.2MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 696]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 65 locations, 6 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.2s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 99 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 306 IncrementalHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 2 mSDtfsCounter, 306 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=2, 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.5s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 00:57:21,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE