./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:15:39,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:15:39,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-08 22:15:40,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:15:40,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:15:40,026 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:15:40,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:15:40,027 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:15:40,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:15:40,027 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:15:40,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:15:40,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:15:40,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:15:40,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:15:40,030 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:15:40,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:15:40,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:15:40,030 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:15:40,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:15:40,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:15:40,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:15:40,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:15:40,031 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:15:40,031 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:15:40,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:15:40,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:15:40,032 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:15:40,032 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:15:40,032 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:15:40,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:15:40,032 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:15:40,032 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:15:40,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:15:40,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:15:40,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:15:40,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:15:40,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:15:40,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:15:40,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:15:40,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:15:40,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:15:40,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:15:40,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:15:40,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:15:40,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:15:40,034 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> 0eca46c14885d62179341dcc13b398752af03e020a80dcf533f4c9afc7372707 [2025-03-08 22:15:40,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:15:40,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:15:40,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:15:40,284 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:15:40,284 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:15:40,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2025-03-08 22:15:41,490 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178d67c58/63ea37d0b1c04109888cf4836591372b/FLAG244b1dcb2 [2025-03-08 22:15:41,782 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:15:41,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dll_of_dll-2.i [2025-03-08 22:15:41,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178d67c58/63ea37d0b1c04109888cf4836591372b/FLAG244b1dcb2 [2025-03-08 22:15:42,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/178d67c58/63ea37d0b1c04109888cf4836591372b [2025-03-08 22:15:42,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:15:42,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:15:42,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:15:42,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:15:42,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:15:42,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:15:42" (1/1) ... [2025-03-08 22:15:42,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74bbff2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:42, skipping insertion in model container [2025-03-08 22:15:42,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:15:42" (1/1) ... [2025-03-08 22:15:42,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:15:42,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:15:42,311 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:15:42,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:15:42,383 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:15:42,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:42 WrapperNode [2025-03-08 22:15:42,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:15:42,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:15:42,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:15:42,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:15:42,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:42" (1/1) ... [2025-03-08 22:15:42,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:42" (1/1) ... [2025-03-08 22:15:42,414 INFO L138 Inliner]: procedures = 140, calls = 95, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 204 [2025-03-08 22:15:42,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:15:42,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:15:42,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:15:42,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:15:42,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:42" (1/1) ... [2025-03-08 22:15:42,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:42" (1/1) ... [2025-03-08 22:15:42,429 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:42" (1/1) ... [2025-03-08 22:15:42,459 INFO L175 MemorySlicer]: Split 48 memory accesses to 3 slices as follows [2, 40, 6]. 83 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 13 writes are split as follows [0, 11, 2]. [2025-03-08 22:15:42,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:42" (1/1) ... [2025-03-08 22:15:42,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:42" (1/1) ... [2025-03-08 22:15:42,469 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:42" (1/1) ... [2025-03-08 22:15:42,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:42" (1/1) ... [2025-03-08 22:15:42,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:42" (1/1) ... [2025-03-08 22:15:42,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:42" (1/1) ... [2025-03-08 22:15:42,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:15:42,475 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:15:42,475 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:15:42,475 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:15:42,475 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:42" (1/1) ... [2025-03-08 22:15:42,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:15:42,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:15:42,498 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:15:42,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:15:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-03-08 22:15:42,516 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-03-08 22:15:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2025-03-08 22:15:42,516 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2025-03-08 22:15:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:15:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:15:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2025-03-08 22:15:42,516 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2025-03-08 22:15:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:15:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:15:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:15:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 22:15:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-08 22:15:42,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-08 22:15:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:15:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:15:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 22:15:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:15:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 22:15:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 22:15:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 22:15:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2025-03-08 22:15:42,517 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2025-03-08 22:15:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2025-03-08 22:15:42,517 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2025-03-08 22:15:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:15:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:15:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 22:15:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:15:42,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:15:42,624 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:15:42,626 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:15:42,645 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L597: havoc #t~ret12.base, #t~ret12.offset; [2025-03-08 22:15:42,748 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L593: havoc #t~mem11.base, #t~mem11.offset;call ULTIMATE.dealloc(~#dll~0.base, ~#dll~0.offset);havoc ~#dll~0.base, ~#dll~0.offset; [2025-03-08 22:15:42,951 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L641: havoc dll_create_master_#t~ret21#1.base, dll_create_master_#t~ret21#1.offset; [2025-03-08 22:15:42,970 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2025-03-08 22:15:42,970 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:15:42,978 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:15:42,979 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:15:42,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:15:42 BoogieIcfgContainer [2025-03-08 22:15:42,979 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:15:42,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:15:42,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:15:42,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:15:42,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:15:42" (1/3) ... [2025-03-08 22:15:42,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176488ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:15:42, skipping insertion in model container [2025-03-08 22:15:42,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:42" (2/3) ... [2025-03-08 22:15:42,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176488ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:15:42, skipping insertion in model container [2025-03-08 22:15:42,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:15:42" (3/3) ... [2025-03-08 22:15:42,989 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2025-03-08 22:15:43,000 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:15:43,001 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_of_dll-2.i that has 7 procedures, 131 locations, 1 initial locations, 24 loop locations, and 2 error locations. [2025-03-08 22:15:43,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:15:43,049 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;@3a9d7fe8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:15:43,049 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 22:15:43,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 98 states have (on average 1.6224489795918366) internal successors, (159), 119 states have internal predecessors, (159), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 22:15:43,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 22:15:43,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:43,061 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:15:43,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:15:43,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:15:43,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1136279108, now seen corresponding path program 1 times [2025-03-08 22:15:43,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:15:43,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127732383] [2025-03-08 22:15:43,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:43,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:15:43,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 22:15:43,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:15:43,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:43,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:15:43,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:15:43,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127732383] [2025-03-08 22:15:43,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127732383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:15:43,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983004170] [2025-03-08 22:15:43,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:43,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:15:43,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:15:43,314 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:15:43,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:15:43,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 22:15:43,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:15:43,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:43,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:43,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 22:15:43,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:15:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 22:15:43,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:15:43,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983004170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:15:43,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:15:43,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 22:15:43,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306914834] [2025-03-08 22:15:43,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:15:43,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:15:43,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:15:43,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:15:43,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:15:43,528 INFO L87 Difference]: Start difference. First operand has 131 states, 98 states have (on average 1.6224489795918366) internal successors, (159), 119 states have internal predecessors, (159), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 22:15:43,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:15:43,548 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2025-03-08 22:15:43,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:15:43,550 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2025-03-08 22:15:43,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:15:43,555 INFO L225 Difference]: With dead ends: 128 [2025-03-08 22:15:43,557 INFO L226 Difference]: Without dead ends: 126 [2025-03-08 22:15:43,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:15:43,561 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:15:43,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:15:43,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-08 22:15:43,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-08 22:15:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 95 states have (on average 1.2842105263157895) internal successors, (122), 114 states have internal predecessors, (122), 24 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 22:15:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 156 transitions. [2025-03-08 22:15:43,604 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 156 transitions. Word has length 39 [2025-03-08 22:15:43,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:15:43,604 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 156 transitions. [2025-03-08 22:15:43,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 22:15:43,605 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 156 transitions. [2025-03-08 22:15:43,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 22:15:43,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:43,607 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:15:43,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 22:15:43,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 22:15:43,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:15:43,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:15:43,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1070337962, now seen corresponding path program 1 times [2025-03-08 22:15:43,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:15:43,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124737810] [2025-03-08 22:15:43,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:43,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:15:43,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 22:15:43,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 22:15:43,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:43,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:44,456 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:15:44,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:15:44,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124737810] [2025-03-08 22:15:44,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124737810] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:15:44,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275032600] [2025-03-08 22:15:44,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:44,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:15:44,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:15:44,460 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:15:44,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:15:44,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 22:15:44,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 22:15:44,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:44,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:44,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 22:15:44,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:15:44,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:15:44,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:15:44,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275032600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:15:44,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:15:44,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-08 22:15:44,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108905327] [2025-03-08 22:15:44,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:15:44,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:15:44,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:15:44,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:15:44,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:15:44,693 INFO L87 Difference]: Start difference. First operand 126 states and 156 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 22:15:44,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:15:44,778 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2025-03-08 22:15:44,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:15:44,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2025-03-08 22:15:44,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:15:44,780 INFO L225 Difference]: With dead ends: 139 [2025-03-08 22:15:44,780 INFO L226 Difference]: Without dead ends: 139 [2025-03-08 22:15:44,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:15:44,781 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 14 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:15:44,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 582 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:15:44,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-08 22:15:44,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-03-08 22:15:44,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 103 states have (on average 1.2718446601941749) internal successors, (131), 122 states have internal predecessors, (131), 27 states have call successors, (27), 8 states have call predecessors, (27), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 22:15:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 171 transitions. [2025-03-08 22:15:44,798 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 171 transitions. Word has length 40 [2025-03-08 22:15:44,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:15:44,798 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 171 transitions. [2025-03-08 22:15:44,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 22:15:44,798 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 171 transitions. [2025-03-08 22:15:44,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 22:15:44,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:44,804 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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-03-08 22:15:44,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 22:15:45,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 22:15:45,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:15:45,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:15:45,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1003792470, now seen corresponding path program 1 times [2025-03-08 22:15:45,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:15:45,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052426122] [2025-03-08 22:15:45,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:45,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:15:45,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 22:15:45,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 22:15:45,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:45,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:45,842 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 22:15:45,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:15:45,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052426122] [2025-03-08 22:15:45,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052426122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:15:45,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758113279] [2025-03-08 22:15:45,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:45,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:15:45,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:15:45,845 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:15:45,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:15:45,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 22:15:46,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 22:15:46,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:46,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:46,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 22:15:46,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:15:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 22:15:46,230 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:15:46,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758113279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:15:46,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:15:46,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 13 [2025-03-08 22:15:46,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299946716] [2025-03-08 22:15:46,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:15:46,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:15:46,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:15:46,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:15:46,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:15:46,232 INFO L87 Difference]: Start difference. First operand 139 states and 171 transitions. Second operand has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 22:15:46,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:15:46,561 INFO L93 Difference]: Finished difference Result 143 states and 176 transitions. [2025-03-08 22:15:46,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:15:46,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2025-03-08 22:15:46,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:15:46,562 INFO L225 Difference]: With dead ends: 143 [2025-03-08 22:15:46,562 INFO L226 Difference]: Without dead ends: 143 [2025-03-08 22:15:46,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-08 22:15:46,563 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 49 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:15:46,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 604 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:15:46,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-08 22:15:46,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-03-08 22:15:46,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 106 states have (on average 1.2641509433962264) internal successors, (134), 126 states have internal predecessors, (134), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (15), 11 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-08 22:15:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 176 transitions. [2025-03-08 22:15:46,568 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 176 transitions. Word has length 112 [2025-03-08 22:15:46,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:15:46,569 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 176 transitions. [2025-03-08 22:15:46,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 22:15:46,569 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 176 transitions. [2025-03-08 22:15:46,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 22:15:46,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:46,570 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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-03-08 22:15:46,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 22:15:46,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:15:46,774 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:15:46,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:15:46,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1493627446, now seen corresponding path program 1 times [2025-03-08 22:15:46,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:15:46,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209739894] [2025-03-08 22:15:46,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:46,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:15:46,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 22:15:46,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 22:15:46,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:46,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 22:15:47,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:15:47,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209739894] [2025-03-08 22:15:47,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209739894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:15:47,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165694304] [2025-03-08 22:15:47,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:47,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:15:47,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:15:47,365 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:15:47,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:15:47,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 22:15:47,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 22:15:47,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:47,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:47,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 22:15:47,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:15:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 94 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 22:15:47,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:15:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 22:15:48,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165694304] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:15:48,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:15:48,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 17 [2025-03-08 22:15:48,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795520913] [2025-03-08 22:15:48,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:15:48,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 22:15:48,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:15:48,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 22:15:48,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-08 22:15:48,261 INFO L87 Difference]: Start difference. First operand 143 states and 176 transitions. Second operand has 17 states, 15 states have (on average 5.333333333333333) internal successors, (80), 13 states have internal predecessors, (80), 7 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 5 states have call predecessors, (17), 7 states have call successors, (17) [2025-03-08 22:15:48,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:15:48,649 INFO L93 Difference]: Finished difference Result 149 states and 184 transitions. [2025-03-08 22:15:48,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:15:48,650 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.333333333333333) internal successors, (80), 13 states have internal predecessors, (80), 7 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 5 states have call predecessors, (17), 7 states have call successors, (17) Word has length 112 [2025-03-08 22:15:48,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:15:48,651 INFO L225 Difference]: With dead ends: 149 [2025-03-08 22:15:48,651 INFO L226 Difference]: Without dead ends: 149 [2025-03-08 22:15:48,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:15:48,652 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 87 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:15:48,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 795 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 22:15:48,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-08 22:15:48,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-03-08 22:15:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 109 states have (on average 1.2568807339449541) internal successors, (137), 130 states have internal predecessors, (137), 28 states have call successors, (28), 8 states have call predecessors, (28), 10 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) [2025-03-08 22:15:48,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 184 transitions. [2025-03-08 22:15:48,658 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 184 transitions. Word has length 112 [2025-03-08 22:15:48,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:15:48,658 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 184 transitions. [2025-03-08 22:15:48,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.333333333333333) internal successors, (80), 13 states have internal predecessors, (80), 7 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 5 states have call predecessors, (17), 7 states have call successors, (17) [2025-03-08 22:15:48,658 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 184 transitions. [2025-03-08 22:15:48,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 22:15:48,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:48,659 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:15:48,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 22:15:48,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:15:48,864 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:15:48,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:15:48,864 INFO L85 PathProgramCache]: Analyzing trace with hash 294892181, now seen corresponding path program 1 times [2025-03-08 22:15:48,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:15:48,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594772206] [2025-03-08 22:15:48,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:48,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:15:48,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 22:15:48,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 22:15:48,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:48,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 22:15:49,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:15:49,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594772206] [2025-03-08 22:15:49,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594772206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:15:49,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551196134] [2025-03-08 22:15:49,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:49,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:15:49,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:15:49,429 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:15:49,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:15:49,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 22:15:49,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 22:15:49,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:49,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:49,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-08 22:15:49,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:15:49,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:15:49,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-08 22:15:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 22:15:49,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:15:49,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-03-08 22:15:49,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-03-08 22:15:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 22:15:50,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551196134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:15:50,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:15:50,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2025-03-08 22:15:50,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902530330] [2025-03-08 22:15:50,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:15:50,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 22:15:50,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:15:50,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 22:15:50,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:15:50,092 INFO L87 Difference]: Start difference. First operand 149 states and 184 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 22:15:50,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:15:50,414 INFO L93 Difference]: Finished difference Result 220 states and 274 transitions. [2025-03-08 22:15:50,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 22:15:50,415 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 112 [2025-03-08 22:15:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:15:50,417 INFO L225 Difference]: With dead ends: 220 [2025-03-08 22:15:50,417 INFO L226 Difference]: Without dead ends: 213 [2025-03-08 22:15:50,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:15:50,417 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 82 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:15:50,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 2086 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:15:50,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-08 22:15:50,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 181. [2025-03-08 22:15:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 139 states have (on average 1.2446043165467626) internal successors, (173), 158 states have internal predecessors, (173), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2025-03-08 22:15:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 222 transitions. [2025-03-08 22:15:50,434 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 222 transitions. Word has length 112 [2025-03-08 22:15:50,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:15:50,434 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 222 transitions. [2025-03-08 22:15:50,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 5 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 22:15:50,435 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 222 transitions. [2025-03-08 22:15:50,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 22:15:50,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:50,436 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:15:50,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 22:15:50,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:15:50,636 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:15:50,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:15:50,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1695034642, now seen corresponding path program 1 times [2025-03-08 22:15:50,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:15:50,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560625760] [2025-03-08 22:15:50,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:50,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:15:50,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 22:15:50,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 22:15:50,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:50,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:51,273 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-08 22:15:51,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:15:51,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560625760] [2025-03-08 22:15:51,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560625760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:15:51,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004638007] [2025-03-08 22:15:51,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:51,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:15:51,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:15:51,283 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:15:51,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 22:15:51,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 22:15:51,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 22:15:51,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:51,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:51,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-08 22:15:51,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:15:51,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:15:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-08 22:15:51,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:15:52,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-03-08 22:15:52,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-03-08 22:15:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 29 proven. 25 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-08 22:15:52,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004638007] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:15:52,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:15:52,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 23 [2025-03-08 22:15:52,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456374872] [2025-03-08 22:15:52,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:15:52,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 22:15:52,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:15:52,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 22:15:52,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2025-03-08 22:15:52,120 INFO L87 Difference]: Start difference. First operand 181 states and 222 transitions. Second operand has 23 states, 21 states have (on average 3.0) internal successors, (63), 18 states have internal predecessors, (63), 9 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-08 22:15:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:15:52,782 INFO L93 Difference]: Finished difference Result 181 states and 218 transitions. [2025-03-08 22:15:52,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 22:15:52,782 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.0) internal successors, (63), 18 states have internal predecessors, (63), 9 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 115 [2025-03-08 22:15:52,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:15:52,783 INFO L225 Difference]: With dead ends: 181 [2025-03-08 22:15:52,783 INFO L226 Difference]: Without dead ends: 181 [2025-03-08 22:15:52,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=1186, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 22:15:52,784 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 102 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:15:52,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1262 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:15:52,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-08 22:15:52,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-08 22:15:52,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 139 states have (on average 1.2374100719424461) internal successors, (172), 158 states have internal predecessors, (172), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (17), 13 states have call predecessors, (17), 15 states have call successors, (17) [2025-03-08 22:15:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 218 transitions. [2025-03-08 22:15:52,793 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 218 transitions. Word has length 115 [2025-03-08 22:15:52,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:15:52,793 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 218 transitions. [2025-03-08 22:15:52,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.0) internal successors, (63), 18 states have internal predecessors, (63), 9 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-08 22:15:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 218 transitions. [2025-03-08 22:15:52,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 22:15:52,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:52,795 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:15:52,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 22:15:52,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:15:52,995 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:15:52,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:15:52,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1674697267, now seen corresponding path program 1 times [2025-03-08 22:15:52,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:15:52,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352868395] [2025-03-08 22:15:52,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:52,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:15:53,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 22:15:53,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 22:15:53,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:53,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:58,702 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 85 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 22:15:58,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:15:58,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352868395] [2025-03-08 22:15:58,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352868395] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:15:58,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901150560] [2025-03-08 22:15:58,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:58,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:15:58,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:15:58,704 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:15:58,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 22:15:58,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 22:15:58,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 22:15:58,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:58,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:58,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 203 conjuncts are in the unsatisfiable core [2025-03-08 22:15:58,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:15:59,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:15:59,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:15:59,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 22:15:59,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:15:59,313 INFO L349 Elim1Store]: treesize reduction 41, result has 37.9 percent of original size [2025-03-08 22:15:59,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 33 [2025-03-08 22:15:59,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-08 22:15:59,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:15:59,899 INFO L349 Elim1Store]: treesize reduction 52, result has 24.6 percent of original size [2025-03-08 22:15:59,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 101 [2025-03-08 22:15:59,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 61 [2025-03-08 22:15:59,924 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:15:59,934 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2025-03-08 22:15:59,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 19 [2025-03-08 22:16:00,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 86 [2025-03-08 22:16:00,916 INFO L349 Elim1Store]: treesize reduction 105, result has 16.0 percent of original size [2025-03-08 22:16:00,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 144 [2025-03-08 22:16:00,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:16:00,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 189 [2025-03-08 22:16:03,667 INFO L349 Elim1Store]: treesize reduction 113, result has 4.2 percent of original size [2025-03-08 22:16:03,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 67 treesize of output 43 [2025-03-08 22:16:03,694 INFO L349 Elim1Store]: treesize reduction 109, result has 0.9 percent of original size [2025-03-08 22:16:03,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 67 treesize of output 1 [2025-03-08 22:16:03,716 INFO L349 Elim1Store]: treesize reduction 87, result has 1.1 percent of original size [2025-03-08 22:16:03,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 67 treesize of output 1 [2025-03-08 22:16:03,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 22:16:03,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2025-03-08 22:16:03,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 22:16:04,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2025-03-08 22:16:04,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 22:16:04,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-03-08 22:16:04,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-08 22:16:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 82 proven. 38 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 22:16:04,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:16:06,010 INFO L349 Elim1Store]: treesize reduction 25, result has 67.1 percent of original size [2025-03-08 22:16:06,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 65 [2025-03-08 22:16:06,016 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:16:06,016 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:16:06,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2025-03-08 22:16:06,022 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:16:06,024 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:16:06,030 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-03-08 22:16:06,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 58 [2025-03-08 22:16:06,724 INFO L349 Elim1Store]: treesize reduction 275, result has 46.4 percent of original size [2025-03-08 22:16:06,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 2632 treesize of output 2076 [2025-03-08 22:16:06,755 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:16:06,756 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:16:06,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:16:06,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1588 treesize of output 1608 [2025-03-08 22:16:06,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1968 treesize of output 1844 [2025-03-08 22:16:06,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2410 treesize of output 2246 [2025-03-08 22:16:06,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:16:06,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1608 treesize of output 1601 [2025-03-08 22:16:06,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:16:06,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1592 treesize of output 1593 [2025-03-08 22:16:06,985 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:16:06,995 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:16:07,006 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-03-08 22:16:07,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 58 [2025-03-08 22:16:09,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-08 22:16:09,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:16:09,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 78 [2025-03-08 22:16:09,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:16:09,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 61 [2025-03-08 22:16:09,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-08 22:16:09,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-03-08 22:16:09,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-03-08 22:16:09,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 22:16:09,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2025-03-08 22:16:09,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:09,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:09,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2025-03-08 22:16:10,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901150560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:16:10,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:16:10,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 41] total 68 [2025-03-08 22:16:10,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576240535] [2025-03-08 22:16:10,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:16:10,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-08 22:16:10,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:16:10,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-08 22:16:10,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=5145, Unknown=1, NotChecked=0, Total=5402 [2025-03-08 22:16:10,216 INFO L87 Difference]: Start difference. First operand 181 states and 218 transitions. Second operand has 68 states, 59 states have (on average 2.016949152542373) internal successors, (119), 56 states have internal predecessors, (119), 15 states have call successors, (18), 7 states have call predecessors, (18), 15 states have return successors, (20), 17 states have call predecessors, (20), 12 states have call successors, (20) [2025-03-08 22:16:16,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:16:33,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:16:40,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:16:47,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:16:52,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:16:56,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:17:01,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:17:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:17:01,621 INFO L93 Difference]: Finished difference Result 269 states and 328 transitions. [2025-03-08 22:17:01,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 22:17:01,622 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 59 states have (on average 2.016949152542373) internal successors, (119), 56 states have internal predecessors, (119), 15 states have call successors, (18), 7 states have call predecessors, (18), 15 states have return successors, (20), 17 states have call predecessors, (20), 12 states have call successors, (20) Word has length 115 [2025-03-08 22:17:01,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:17:01,623 INFO L225 Difference]: With dead ends: 269 [2025-03-08 22:17:01,623 INFO L226 Difference]: Without dead ends: 269 [2025-03-08 22:17:01,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2604 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=599, Invalid=10742, Unknown=1, NotChecked=0, Total=11342 [2025-03-08 22:17:01,625 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 343 mSDsluCounter, 2396 mSDsCounter, 0 mSdLazyCounter, 4478 mSolverCounterSat, 132 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 2494 SdHoareTripleChecker+Invalid, 4618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 4478 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.3s IncrementalHoareTripleChecker+Time [2025-03-08 22:17:01,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 2494 Invalid, 4618 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [132 Valid, 4478 Invalid, 8 Unknown, 0 Unchecked, 45.3s Time] [2025-03-08 22:17:01,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-08 22:17:01,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 225. [2025-03-08 22:17:01,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 176 states have (on average 1.2272727272727273) internal successors, (216), 195 states have internal predecessors, (216), 30 states have call successors, (30), 12 states have call predecessors, (30), 17 states have return successors, (25), 19 states have call predecessors, (25), 16 states have call successors, (25) [2025-03-08 22:17:01,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 271 transitions. [2025-03-08 22:17:01,633 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 271 transitions. Word has length 115 [2025-03-08 22:17:01,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:17:01,633 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 271 transitions. [2025-03-08 22:17:01,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 59 states have (on average 2.016949152542373) internal successors, (119), 56 states have internal predecessors, (119), 15 states have call successors, (18), 7 states have call predecessors, (18), 15 states have return successors, (20), 17 states have call predecessors, (20), 12 states have call successors, (20) [2025-03-08 22:17:01,633 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 271 transitions. [2025-03-08 22:17:01,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 22:17:01,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:17:01,634 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:17:01,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 22:17:01,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:17:01,835 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:17:01,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:17:01,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1493911703, now seen corresponding path program 1 times [2025-03-08 22:17:01,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:17:01,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860754481] [2025-03-08 22:17:01,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:17:01,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:17:01,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 22:17:01,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 22:17:01,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:17:01,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat