./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.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 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:45:33,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:45:33,182 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:45:33,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:45:33,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:45:33,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:45:33,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:45:33,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:45:33,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:45:33,212 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:45:33,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:45:33,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:45:33,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:45:33,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:45:33,213 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:45:33,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:45:33,213 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:45:33,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:45:33,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:45:33,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:45:33,214 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:45:33,214 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:45:33,214 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:45:33,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:45:33,214 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:45:33,214 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:45:33,214 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:45:33,214 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:45:33,214 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:45:33,214 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:45:33,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:45:33,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:45:33,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:45:33,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:45:33,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:45:33,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:45:33,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:45:33,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:45:33,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:45:33,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:45:33,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:45:33,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:45:33,216 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 -> 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 [2025-02-08 08:45:33,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:45:33,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:45:33,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:45:33,468 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:45:33,469 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:45:33,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2025-02-08 08:45:34,651 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad35b5d91/ec0ce31767e94872bb063e31eebc38af/FLAG96cbcc6b3 [2025-02-08 08:45:34,950 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:45:34,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_ok.i [2025-02-08 08:45:34,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad35b5d91/ec0ce31767e94872bb063e31eebc38af/FLAG96cbcc6b3 [2025-02-08 08:45:35,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad35b5d91/ec0ce31767e94872bb063e31eebc38af [2025-02-08 08:45:35,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:45:35,226 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:45:35,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:45:35,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:45:35,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:45:35,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:45:35" (1/1) ... [2025-02-08 08:45:35,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db01a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:35, skipping insertion in model container [2025-02-08 08:45:35,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:45:35" (1/1) ... [2025-02-08 08:45:35,256 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:45:35,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:45:35,514 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:45:35,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:45:35,580 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:45:35,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:35 WrapperNode [2025-02-08 08:45:35,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:45:35,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:45:35,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:45:35,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:45:35,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:35" (1/1) ... [2025-02-08 08:45:35,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:35" (1/1) ... [2025-02-08 08:45:35,611 INFO L138 Inliner]: procedures = 168, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2025-02-08 08:45:35,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:45:35,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:45:35,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:45:35,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:45:35,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:35" (1/1) ... [2025-02-08 08:45:35,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:35" (1/1) ... [2025-02-08 08:45:35,622 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:35" (1/1) ... [2025-02-08 08:45:35,635 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 1, 12, 8]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 10, 8]. The 1 writes are split as follows [0, 0, 1, 0]. [2025-02-08 08:45:35,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:35" (1/1) ... [2025-02-08 08:45:35,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:35" (1/1) ... [2025-02-08 08:45:35,645 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:35" (1/1) ... [2025-02-08 08:45:35,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:35" (1/1) ... [2025-02-08 08:45:35,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:35" (1/1) ... [2025-02-08 08:45:35,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:35" (1/1) ... [2025-02-08 08:45:35,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:45:35,651 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:45:35,651 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:45:35,651 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:45:35,652 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:35" (1/1) ... [2025-02-08 08:45:35,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:45:35,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:45:35,687 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-02-08 08:45:35,696 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-02-08 08:45:35,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:45:35,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:45:35,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:45:35,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 08:45:35,714 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-08 08:45:35,715 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-08 08:45:35,715 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-08 08:45:35,715 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-08 08:45:35,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:45:35,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:45:35,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:45:35,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 08:45:35,715 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 08:45:35,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:45:35,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 08:45:35,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 08:45:35,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 08:45:35,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 08:45:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:45:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:45:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:45:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 08:45:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 08:45:35,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:45:35,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:45:35,717 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:45:35,835 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:45:35,837 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:45:36,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: ~send~0 := 0; [2025-02-08 08:45:36,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: ~receive~0 := 1; [2025-02-08 08:45:36,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730: assume ~i~0#1 == #t~ret4#1; [2025-02-08 08:45:36,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730: assume !(~i~0#1 == #t~ret4#1); [2025-02-08 08:45:36,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: havoc #t~ret4#1; [2025-02-08 08:45:36,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-2: havoc #t~ret4#1; [2025-02-08 08:45:36,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-3: assume { :end_inline_insertLogElement } true;assume -2147483648 <= #t~ret4#1 && #t~ret4#1 <= 2147483647; [2025-02-08 08:45:36,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-4: havoc insertLogElement_#in~b#1; [2025-02-08 08:45:36,088 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-5: havoc insertLogElement_~b#1; [2025-02-08 08:45:36,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-6: #t~ret4#1 := insertLogElement_#res#1; [2025-02-08 08:45:36,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681: assume false; [2025-02-08 08:45:36,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681: assume !false; [2025-02-08 08:45:36,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681-1: assume false; [2025-02-08 08:45:36,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681-1: assume !false; [2025-02-08 08:45:36,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: assume { :end_inline_reach_error } true;assume false; [2025-02-08 08:45:36,089 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 08:45:36,090 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-2: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 08:45:36,090 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732: ~value~0 := ~i~0#1; [2025-02-08 08:45:36,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: ~receive~0 := 0; [2025-02-08 08:45:36,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: ~send~0 := 1; [2025-02-08 08:45:36,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681: assume false; [2025-02-08 08:45:36,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681: assume !false; [2025-02-08 08:45:36,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681-1: assume false; [2025-02-08 08:45:36,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681-1: assume !false; [2025-02-08 08:45:36,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748: assume #t~ret8#1 == ~value~0; [2025-02-08 08:45:36,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748: assume !(#t~ret8#1 == ~value~0); [2025-02-08 08:45:36,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-1: havoc #t~ret8#1; [2025-02-08 08:45:36,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-2: havoc #t~ret8#1; [2025-02-08 08:45:36,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-3: assume { :end_inline_removeLogElement } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647; [2025-02-08 08:45:36,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-4: havoc removeLogElement_#t~post1#1, removeLogElement_#t~mem2#1; [2025-02-08 08:45:36,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-5: #t~ret8#1 := removeLogElement_#res#1; [2025-02-08 08:45:36,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L699: havoc removeLogElement_#t~mem2#1; [2025-02-08 08:45:36,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749: assume { :end_inline_reach_error } true;assume false; [2025-02-08 08:45:36,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 08:45:36,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-2: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 08:45:36,148 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:45:36,148 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:45:36,271 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:45:36,272 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:45:36,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:45:36 BoogieIcfgContainer [2025-02-08 08:45:36,273 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:45:36,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:45:36,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:45:36,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:45:36,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:45:35" (1/3) ... [2025-02-08 08:45:36,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad78db3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:45:36, skipping insertion in model container [2025-02-08 08:45:36,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:45:35" (2/3) ... [2025-02-08 08:45:36,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad78db3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:45:36, skipping insertion in model container [2025-02-08 08:45:36,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:45:36" (3/3) ... [2025-02-08 08:45:36,278 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2025-02-08 08:45:36,289 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:45:36,291 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_ok.i that has 3 procedures, 43 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-02-08 08:45:36,291 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:45:36,348 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 08:45:36,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 48 transitions, 110 flow [2025-02-08 08:45:36,394 INFO L124 PetriNetUnfolderBase]: 6/46 cut-off events. [2025-02-08 08:45:36,399 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:45:36,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 46 events. 6/46 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 118 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2025-02-08 08:45:36,403 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 48 transitions, 110 flow [2025-02-08 08:45:36,406 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 45 transitions, 102 flow [2025-02-08 08:45:36,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:45:36,424 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;@40beb09a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:45:36,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-08 08:45:36,430 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:45:36,430 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2025-02-08 08:45:36,430 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:45:36,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:36,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:36,431 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-02-08 08:45:36,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:36,435 INFO L85 PathProgramCache]: Analyzing trace with hash 821967411, now seen corresponding path program 1 times [2025-02-08 08:45:36,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:36,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587014309] [2025-02-08 08:45:36,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:36,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:36,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:45:36,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:45:36,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:36,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:36,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:36,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587014309] [2025-02-08 08:45:36,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587014309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:36,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:36,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:45:36,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540346304] [2025-02-08 08:45:36,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:36,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:36,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:36,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:36,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2025-02-08 08:45:36,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-02-08 08:45:36,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:36,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2025-02-08 08:45:36,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:36,903 INFO L124 PetriNetUnfolderBase]: 263/511 cut-off events. [2025-02-08 08:45:36,906 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 08:45:36,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 511 events. 263/511 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2533 event pairs, 206 based on Foata normal form. 32/492 useless extension candidates. Maximal degree in co-relation 920. Up to 434 conditions per place. [2025-02-08 08:45:36,913 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 24 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2025-02-08 08:45:36,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 142 flow [2025-02-08 08:45:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-02-08 08:45:36,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-02-08 08:45:36,927 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 102 flow. Second operand 3 states and 80 transitions. [2025-02-08 08:45:36,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 142 flow [2025-02-08 08:45:36,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 134 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:45:36,934 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 86 flow [2025-02-08 08:45:36,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2025-02-08 08:45:36,939 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2025-02-08 08:45:36,940 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 86 flow [2025-02-08 08:45:36,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-02-08 08:45:36,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:36,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:36,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:45:36,941 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-02-08 08:45:36,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:36,942 INFO L85 PathProgramCache]: Analyzing trace with hash 821967412, now seen corresponding path program 1 times [2025-02-08 08:45:36,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:36,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388819290] [2025-02-08 08:45:36,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:36,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:36,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:45:36,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:45:36,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:36,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:37,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:37,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:37,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388819290] [2025-02-08 08:45:37,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388819290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:37,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:37,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:37,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616316880] [2025-02-08 08:45:37,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:37,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:37,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:37,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:37,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:37,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-02-08 08:45:37,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-02-08 08:45:37,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:37,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-02-08 08:45:37,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:37,407 INFO L124 PetriNetUnfolderBase]: 332/618 cut-off events. [2025-02-08 08:45:37,408 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 08:45:37,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 618 events. 332/618 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3009 event pairs, 206 based on Foata normal form. 0/530 useless extension candidates. Maximal degree in co-relation 1154. Up to 434 conditions per place. [2025-02-08 08:45:37,411 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 36 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2025-02-08 08:45:37,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 187 flow [2025-02-08 08:45:37,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:37,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:37,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-02-08 08:45:37,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-02-08 08:45:37,413 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 86 flow. Second operand 4 states and 104 transitions. [2025-02-08 08:45:37,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 187 flow [2025-02-08 08:45:37,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:45:37,415 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 89 flow [2025-02-08 08:45:37,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2025-02-08 08:45:37,416 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2025-02-08 08:45:37,416 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 89 flow [2025-02-08 08:45:37,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-02-08 08:45:37,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:37,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:37,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:45:37,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-02-08 08:45:37,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:37,416 INFO L85 PathProgramCache]: Analyzing trace with hash -803764382, now seen corresponding path program 1 times [2025-02-08 08:45:37,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:37,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851512749] [2025-02-08 08:45:37,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:37,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:37,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:45:37,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:45:37,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:37,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:37,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:37,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:37,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851512749] [2025-02-08 08:45:37,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851512749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:37,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:37,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:45:37,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709236759] [2025-02-08 08:45:37,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:37,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:37,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:37,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:37,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:37,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2025-02-08 08:45:37,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 89 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-02-08 08:45:37,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:37,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2025-02-08 08:45:37,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:37,546 INFO L124 PetriNetUnfolderBase]: 160/327 cut-off events. [2025-02-08 08:45:37,546 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-08 08:45:37,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 327 events. 160/327 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1503 event pairs, 128 based on Foata normal form. 11/314 useless extension candidates. Maximal degree in co-relation 622. Up to 274 conditions per place. [2025-02-08 08:45:37,548 INFO L140 encePairwiseOnDemand]: 46/48 looper letters, 19 selfloop transitions, 1 changer transitions 1/34 dead transitions. [2025-02-08 08:45:37,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 121 flow [2025-02-08 08:45:37,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-02-08 08:45:37,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5486111111111112 [2025-02-08 08:45:37,550 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 89 flow. Second operand 3 states and 79 transitions. [2025-02-08 08:45:37,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 121 flow [2025-02-08 08:45:37,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 115 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:45:37,551 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 73 flow [2025-02-08 08:45:37,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2025-02-08 08:45:37,552 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -9 predicate places. [2025-02-08 08:45:37,552 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 73 flow [2025-02-08 08:45:37,552 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-02-08 08:45:37,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:37,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:37,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:45:37,553 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-02-08 08:45:37,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:37,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1622989864, now seen corresponding path program 1 times [2025-02-08 08:45:37,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:37,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436395762] [2025-02-08 08:45:37,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:37,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:37,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:45:37,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:45:37,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:37,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:37,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:37,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:37,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436395762] [2025-02-08 08:45:37,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436395762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:37,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:37,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:45:37,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317298133] [2025-02-08 08:45:37,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:37,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:37,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:37,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:37,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:37,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 48 [2025-02-08 08:45:37,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-02-08 08:45:37,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:37,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 48 [2025-02-08 08:45:37,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:37,776 INFO L124 PetriNetUnfolderBase]: 159/309 cut-off events. [2025-02-08 08:45:37,777 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 08:45:37,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 309 events. 159/309 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1340 event pairs, 128 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 591. Up to 274 conditions per place. [2025-02-08 08:45:37,778 INFO L140 encePairwiseOnDemand]: 46/48 looper letters, 16 selfloop transitions, 1 changer transitions 5/30 dead transitions. [2025-02-08 08:45:37,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 30 transitions, 109 flow [2025-02-08 08:45:37,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-02-08 08:45:37,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2025-02-08 08:45:37,779 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 73 flow. Second operand 3 states and 73 transitions. [2025-02-08 08:45:37,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 30 transitions, 109 flow [2025-02-08 08:45:37,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:45:37,780 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 58 flow [2025-02-08 08:45:37,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2025-02-08 08:45:37,780 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -11 predicate places. [2025-02-08 08:45:37,780 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 58 flow [2025-02-08 08:45:37,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-02-08 08:45:37,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:37,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:37,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:45:37,781 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-02-08 08:45:37,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:37,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1765660756, now seen corresponding path program 1 times [2025-02-08 08:45:37,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:37,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92306916] [2025-02-08 08:45:37,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:37,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:37,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:45:37,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:45:37,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:37,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:45:37,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:37,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92306916] [2025-02-08 08:45:37,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92306916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:37,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:37,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:45:37,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242459485] [2025-02-08 08:45:37,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:37,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:37,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:37,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:37,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:37,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2025-02-08 08:45:37,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 58 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-02-08 08:45:37,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:37,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2025-02-08 08:45:37,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:37,877 INFO L124 PetriNetUnfolderBase]: 142/299 cut-off events. [2025-02-08 08:45:37,877 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:45:37,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 299 events. 142/299 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1274 event pairs, 65 based on Foata normal form. 12/301 useless extension candidates. Maximal degree in co-relation 551. Up to 159 conditions per place. [2025-02-08 08:45:37,879 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 26 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2025-02-08 08:45:37,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 36 transitions, 137 flow [2025-02-08 08:45:37,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:37,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-02-08 08:45:37,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2025-02-08 08:45:37,884 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 58 flow. Second operand 3 states and 86 transitions. [2025-02-08 08:45:37,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 36 transitions, 137 flow [2025-02-08 08:45:37,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:45:37,886 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 69 flow [2025-02-08 08:45:37,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2025-02-08 08:45:37,886 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -14 predicate places. [2025-02-08 08:45:37,886 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 69 flow [2025-02-08 08:45:37,886 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-02-08 08:45:37,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:37,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:37,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:45:37,887 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-02-08 08:45:37,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:37,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1193402074, now seen corresponding path program 1 times [2025-02-08 08:45:37,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:37,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673365953] [2025-02-08 08:45:37,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:37,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:37,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:45:37,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:45:37,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:37,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:37,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:45:37,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:37,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673365953] [2025-02-08 08:45:37,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673365953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:37,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:37,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:45:37,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080511419] [2025-02-08 08:45:37,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:37,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:37,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:37,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:37,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:37,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2025-02-08 08:45:37,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-02-08 08:45:37,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:37,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2025-02-08 08:45:37,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:38,010 INFO L124 PetriNetUnfolderBase]: 217/472 cut-off events. [2025-02-08 08:45:38,010 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-02-08 08:45:38,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 472 events. 217/472 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2226 event pairs, 113 based on Foata normal form. 17/474 useless extension candidates. Maximal degree in co-relation 940. Up to 246 conditions per place. [2025-02-08 08:45:38,012 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 27 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-02-08 08:45:38,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 160 flow [2025-02-08 08:45:38,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:38,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:38,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2025-02-08 08:45:38,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5902777777777778 [2025-02-08 08:45:38,014 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 69 flow. Second operand 3 states and 85 transitions. [2025-02-08 08:45:38,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 160 flow [2025-02-08 08:45:38,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:45:38,015 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 79 flow [2025-02-08 08:45:38,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2025-02-08 08:45:38,017 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -12 predicate places. [2025-02-08 08:45:38,017 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 79 flow [2025-02-08 08:45:38,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-02-08 08:45:38,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:38,017 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] [2025-02-08 08:45:38,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:45:38,017 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-02-08 08:45:38,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:38,018 INFO L85 PathProgramCache]: Analyzing trace with hash 474048450, now seen corresponding path program 1 times [2025-02-08 08:45:38,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:38,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117757210] [2025-02-08 08:45:38,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:45:38,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:38,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:45:38,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:45:38,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:45:38,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:38,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:45:38,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:38,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117757210] [2025-02-08 08:45:38,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117757210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:38,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:38,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:45:38,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353126240] [2025-02-08 08:45:38,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:38,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:38,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:38,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:38,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:38,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2025-02-08 08:45:38,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 79 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-02-08 08:45:38,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:38,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2025-02-08 08:45:38,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:38,178 INFO L124 PetriNetUnfolderBase]: 295/637 cut-off events. [2025-02-08 08:45:38,178 INFO L125 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2025-02-08 08:45:38,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 637 events. 295/637 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3052 event pairs, 108 based on Foata normal form. 18/642 useless extension candidates. Maximal degree in co-relation 1355. Up to 240 conditions per place. [2025-02-08 08:45:38,182 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 39 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2025-02-08 08:45:38,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 233 flow [2025-02-08 08:45:38,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-02-08 08:45:38,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-02-08 08:45:38,184 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 79 flow. Second operand 4 states and 116 transitions. [2025-02-08 08:45:38,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 233 flow [2025-02-08 08:45:38,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 50 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:45:38,186 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 93 flow [2025-02-08 08:45:38,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2025-02-08 08:45:38,186 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -9 predicate places. [2025-02-08 08:45:38,186 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 93 flow [2025-02-08 08:45:38,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-02-08 08:45:38,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:38,186 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:38,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:45:38,187 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-02-08 08:45:38,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:38,187 INFO L85 PathProgramCache]: Analyzing trace with hash 808238762, now seen corresponding path program 2 times [2025-02-08 08:45:38,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:38,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627042616] [2025-02-08 08:45:38,187 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:45:38,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:38,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-08 08:45:38,202 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 31 statements. [2025-02-08 08:45:38,202 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:45:38,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:45:38,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:38,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627042616] [2025-02-08 08:45:38,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627042616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:38,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:38,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:45:38,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325623700] [2025-02-08 08:45:38,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:38,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:45:38,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:38,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:45:38,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:45:38,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2025-02-08 08:45:38,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-02-08 08:45:38,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:38,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2025-02-08 08:45:38,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:38,378 INFO L124 PetriNetUnfolderBase]: 397/901 cut-off events. [2025-02-08 08:45:38,379 INFO L125 PetriNetUnfolderBase]: For 413/413 co-relation queries the response was YES. [2025-02-08 08:45:38,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1975 conditions, 901 events. 397/901 cut-off events. For 413/413 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4780 event pairs, 158 based on Foata normal form. 23/915 useless extension candidates. Maximal degree in co-relation 1964. Up to 333 conditions per place. [2025-02-08 08:45:38,384 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 40 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2025-02-08 08:45:38,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 273 flow [2025-02-08 08:45:38,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:45:38,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:45:38,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-02-08 08:45:38,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-02-08 08:45:38,385 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 93 flow. Second operand 4 states and 114 transitions. [2025-02-08 08:45:38,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 273 flow [2025-02-08 08:45:38,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 255 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:38,387 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 103 flow [2025-02-08 08:45:38,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2025-02-08 08:45:38,387 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -7 predicate places. [2025-02-08 08:45:38,388 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 103 flow [2025-02-08 08:45:38,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-02-08 08:45:38,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:45:38,388 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:38,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:45:38,388 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2025-02-08 08:45:38,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:45:38,389 INFO L85 PathProgramCache]: Analyzing trace with hash 800718800, now seen corresponding path program 3 times [2025-02-08 08:45:38,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:45:38,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884531804] [2025-02-08 08:45:38,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:45:38,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:45:38,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 3 equivalence classes. [2025-02-08 08:45:38,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 37 statements. [2025-02-08 08:45:38,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:45:38,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:45:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 08:45:38,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:45:38,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884531804] [2025-02-08 08:45:38,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884531804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:45:38,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:45:38,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:45:38,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517576679] [2025-02-08 08:45:38,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:45:38,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:45:38,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:45:38,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:45:38,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:45:38,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-02-08 08:45:38,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-02-08 08:45:38,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:45:38,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-02-08 08:45:38,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:45:38,508 INFO L124 PetriNetUnfolderBase]: 397/891 cut-off events. [2025-02-08 08:45:38,508 INFO L125 PetriNetUnfolderBase]: For 417/417 co-relation queries the response was YES. [2025-02-08 08:45:38,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2032 conditions, 891 events. 397/891 cut-off events. For 417/417 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4605 event pairs, 350 based on Foata normal form. 1/879 useless extension candidates. Maximal degree in co-relation 2020. Up to 674 conditions per place. [2025-02-08 08:45:38,511 INFO L140 encePairwiseOnDemand]: 46/48 looper letters, 0 selfloop transitions, 0 changer transitions 28/28 dead transitions. [2025-02-08 08:45:38,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 28 transitions, 143 flow [2025-02-08 08:45:38,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:45:38,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:45:38,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-02-08 08:45:38,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-08 08:45:38,511 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 103 flow. Second operand 3 states and 72 transitions. [2025-02-08 08:45:38,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 28 transitions, 143 flow [2025-02-08 08:45:38,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 137 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:45:38,513 INFO L231 Difference]: Finished difference. Result has 38 places, 0 transitions, 0 flow [2025-02-08 08:45:38,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=36, 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=38, PETRI_TRANSITIONS=0} [2025-02-08 08:45:38,513 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -8 predicate places. [2025-02-08 08:45:38,513 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 0 transitions, 0 flow [2025-02-08 08:45:38,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-02-08 08:45:38,515 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2025-02-08 08:45:38,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 13 remaining) [2025-02-08 08:45:38,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 13 remaining) [2025-02-08 08:45:38,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2025-02-08 08:45:38,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2025-02-08 08:45:38,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONMEMORY_LEAK (7 of 13 remaining) [2025-02-08 08:45:38,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2025-02-08 08:45:38,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2025-02-08 08:45:38,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2025-02-08 08:45:38,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 13 remaining) [2025-02-08 08:45:38,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONMEMORY_LEAK (2 of 13 remaining) [2025-02-08 08:45:38,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2025-02-08 08:45:38,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 13 remaining) [2025-02-08 08:45:38,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:45:38,517 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2025-02-08 08:45:38,521 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:45:38,521 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:45:38,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:45:38 BasicIcfg [2025-02-08 08:45:38,525 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:45:38,526 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:45:38,526 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:45:38,526 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:45:38,526 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:45:36" (3/4) ... [2025-02-08 08:45:38,527 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:45:38,529 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-02-08 08:45:38,529 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-02-08 08:45:38,532 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2025-02-08 08:45:38,532 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-02-08 08:45:38,532 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-08 08:45:38,532 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 08:45:38,532 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:45:38,581 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:45:38,581 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:45:38,581 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:45:38,582 INFO L158 Benchmark]: Toolchain (without parser) took 3355.47ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 105.0MB in the beginning and 199.3MB in the end (delta: -94.4MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. [2025-02-08 08:45:38,582 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:45:38,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.81ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 84.7MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:45:38,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.56ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 81.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:45:38,583 INFO L158 Benchmark]: Boogie Preprocessor took 38.00ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 79.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:45:38,584 INFO L158 Benchmark]: IcfgBuilder took 621.85ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 41.7MB in the end (delta: 37.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 08:45:38,584 INFO L158 Benchmark]: TraceAbstraction took 2251.28ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 40.7MB in the beginning and 204.4MB in the end (delta: -163.8MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2025-02-08 08:45:38,584 INFO L158 Benchmark]: Witness Printer took 55.45ms. Allocated memory is still 318.8MB. Free memory was 204.4MB in the beginning and 199.3MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:45:38,585 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.23ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.81ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 84.7MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.56ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 81.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.00ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 79.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 621.85ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 41.7MB in the end (delta: 37.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2251.28ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 40.7MB in the beginning and 204.4MB in the end (delta: -163.8MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Witness Printer took 55.45ms. Allocated memory is still 318.8MB. Free memory was 204.4MB in the beginning and 199.3MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 757]: 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: 681]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 77 locations, 13 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: 2.2s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 373 IncrementalHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 5 mSDtfsCounter, 373 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=8, InterpolantAutomatonStates: 30, 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, 166 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 573 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 16/16 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:45:38,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE