./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:14:19,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:14:19,804 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-04 07:14:19,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:14:19,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:14:19,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:14:19,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:14:19,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:14:19,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:14:19,831 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:14:19,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:14:19,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:14:19,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:14:19,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:14:19,831 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:14:19,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:14:19,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:14:19,831 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:14:19,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:14:19,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:14:19,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:14:19,832 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:14:19,832 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:14:19,832 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:14:19,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:14:19,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:14:19,832 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:14:19,832 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:14:19,832 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:14:19,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:14:19,832 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:14:19,832 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:14:19,832 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:14:19,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:14:19,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:14:19,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:14:19,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:14:19,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:14:19,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:14:19,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:14:19,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:14:19,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:14:19,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:14:19,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:14:19,833 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:14:19,833 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2025-03-04 07:14:20,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:14:20,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:14:20,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:14:20,065 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:14:20,065 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:14:20,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i [2025-03-04 07:14:21,176 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aaef9513/c183488a66944c8ebfb9152ae2626deb/FLAG3a1bdfb26 [2025-03-04 07:14:21,482 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:14:21,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-1.i [2025-03-04 07:14:21,500 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aaef9513/c183488a66944c8ebfb9152ae2626deb/FLAG3a1bdfb26 [2025-03-04 07:14:21,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aaef9513/c183488a66944c8ebfb9152ae2626deb [2025-03-04 07:14:21,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:14:21,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:14:21,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:14:21,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:14:21,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:14:21,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:14:21" (1/1) ... [2025-03-04 07:14:21,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c90a81e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:21, skipping insertion in model container [2025-03-04 07:14:21,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:14:21" (1/1) ... [2025-03-04 07:14:21,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:14:21,806 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:14:21,823 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:14:21,827 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:14:21,829 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:14:21,836 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:14:21,846 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:14:21,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:14:21,855 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:14:21,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:14:21,937 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:14:21,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:21 WrapperNode [2025-03-04 07:14:21,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:14:21,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:14:21,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:14:21,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:14:21,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:21" (1/1) ... [2025-03-04 07:14:21,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:21" (1/1) ... [2025-03-04 07:14:21,989 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 773 [2025-03-04 07:14:21,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:14:21,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:14:21,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:14:21,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:14:21,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:21" (1/1) ... [2025-03-04 07:14:21,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:21" (1/1) ... [2025-03-04 07:14:22,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:21" (1/1) ... [2025-03-04 07:14:22,034 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2025-03-04 07:14:22,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:21" (1/1) ... [2025-03-04 07:14:22,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:21" (1/1) ... [2025-03-04 07:14:22,062 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:21" (1/1) ... [2025-03-04 07:14:22,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:21" (1/1) ... [2025-03-04 07:14:22,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:21" (1/1) ... [2025-03-04 07:14:22,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:21" (1/1) ... [2025-03-04 07:14:22,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:14:22,075 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:14:22,075 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:14:22,075 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:14:22,076 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:21" (1/1) ... [2025-03-04 07:14:22,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:14:22,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:14:22,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:14:22,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:14:22,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:14:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:14:22,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:14:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:14:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 07:14:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 07:14:22,126 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 07:14:22,126 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 07:14:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:14:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:14:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:14:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:14:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:14:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:14:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:14:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:14:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:14:22,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:14:22,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:14:22,258 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:14:22,260 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:14:22,991 INFO L? ?]: Removed 196 outVars from TransFormulas that were not future-live. [2025-03-04 07:14:22,991 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:14:23,020 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:14:23,020 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 07:14:23,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:14:23 BoogieIcfgContainer [2025-03-04 07:14:23,021 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:14:23,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:14:23,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:14:23,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:14:23,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:14:21" (1/3) ... [2025-03-04 07:14:23,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247374aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:14:23, skipping insertion in model container [2025-03-04 07:14:23,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:14:21" (2/3) ... [2025-03-04 07:14:23,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247374aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:14:23, skipping insertion in model container [2025-03-04 07:14:23,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:14:23" (3/3) ... [2025-03-04 07:14:23,030 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test1-1.i [2025-03-04 07:14:23,041 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:14:23,043 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_nondet_test1-1.i that has 3 procedures, 212 locations, 1 initial locations, 19 loop locations, and 2 error locations. [2025-03-04 07:14:23,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:14:23,115 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;@7a4023cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:14:23,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 07:14:23,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 201 states have (on average 1.6069651741293531) internal successors, (323), 203 states have internal predecessors, (323), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:23,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:14:23,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:23,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:14:23,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:23,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:23,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1288466799, now seen corresponding path program 1 times [2025-03-04 07:14:23,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:23,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136169377] [2025-03-04 07:14:23,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:23,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:23,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:14:23,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:14:23,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:23,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:14:23,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:23,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136169377] [2025-03-04 07:14:23,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136169377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:14:23,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:14:23,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:14:23,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976035511] [2025-03-04 07:14:23,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:14:23,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:14:23,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:23,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:14:23,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:14:23,307 INFO L87 Difference]: Start difference. First operand has 208 states, 201 states have (on average 1.6069651741293531) internal successors, (323), 203 states have internal predecessors, (323), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:14:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:23,469 INFO L93 Difference]: Finished difference Result 398 states and 573 transitions. [2025-03-04 07:14:23,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:14:23,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:14:23,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:23,481 INFO L225 Difference]: With dead ends: 398 [2025-03-04 07:14:23,483 INFO L226 Difference]: Without dead ends: 396 [2025-03-04 07:14:23,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:14:23,490 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 271 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:23,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 537 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:14:23,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-04 07:14:23,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 206. [2025-03-04 07:14:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 200 states have (on average 1.44) internal successors, (288), 201 states have internal predecessors, (288), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 294 transitions. [2025-03-04 07:14:23,547 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 294 transitions. Word has length 7 [2025-03-04 07:14:23,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:23,547 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 294 transitions. [2025-03-04 07:14:23,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:14:23,547 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 294 transitions. [2025-03-04 07:14:23,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 07:14:23,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:23,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:14:23,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:14:23,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:23,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:23,553 INFO L85 PathProgramCache]: Analyzing trace with hash -166629397, now seen corresponding path program 1 times [2025-03-04 07:14:23,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:23,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774592030] [2025-03-04 07:14:23,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:23,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:23,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 07:14:23,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 07:14:23,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:23,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:23,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:14:23,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:23,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774592030] [2025-03-04 07:14:23,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774592030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:14:23,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:14:23,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:14:23,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991134804] [2025-03-04 07:14:23,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:14:23,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:14:23,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:23,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:14:23,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:14:23,906 INFO L87 Difference]: Start difference. First operand 206 states and 294 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:14:24,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:24,042 INFO L93 Difference]: Finished difference Result 209 states and 290 transitions. [2025-03-04 07:14:24,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:14:24,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-04 07:14:24,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:24,044 INFO L225 Difference]: With dead ends: 209 [2025-03-04 07:14:24,044 INFO L226 Difference]: Without dead ends: 209 [2025-03-04 07:14:24,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:14:24,044 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 105 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:24,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 648 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:14:24,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-04 07:14:24,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2025-03-04 07:14:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 200 states have (on average 1.405) internal successors, (281), 201 states have internal predecessors, (281), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:24,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2025-03-04 07:14:24,058 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 80 [2025-03-04 07:14:24,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:24,058 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2025-03-04 07:14:24,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:14:24,058 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2025-03-04 07:14:24,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 07:14:24,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:24,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:14:24,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:14:24,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:24,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:24,061 INFO L85 PathProgramCache]: Analyzing trace with hash -797095740, now seen corresponding path program 1 times [2025-03-04 07:14:24,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:24,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389819714] [2025-03-04 07:14:24,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:24,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:24,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 07:14:24,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 07:14:24,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:24,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:14:24,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:24,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389819714] [2025-03-04 07:14:24,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389819714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:14:24,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:14:24,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:14:24,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515931359] [2025-03-04 07:14:24,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:14:24,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:14:24,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:24,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:14:24,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:14:24,209 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:14:24,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:24,291 INFO L93 Difference]: Finished difference Result 212 states and 293 transitions. [2025-03-04 07:14:24,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:14:24,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-04 07:14:24,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:24,292 INFO L225 Difference]: With dead ends: 212 [2025-03-04 07:14:24,292 INFO L226 Difference]: Without dead ends: 212 [2025-03-04 07:14:24,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:14:24,293 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 1 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:24,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 494 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:14:24,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-04 07:14:24,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-03-04 07:14:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 206 states have (on average 1.3932038834951457) internal successors, (287), 207 states have internal predecessors, (287), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:24,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 293 transitions. [2025-03-04 07:14:24,304 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 293 transitions. Word has length 80 [2025-03-04 07:14:24,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:24,305 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 293 transitions. [2025-03-04 07:14:24,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:14:24,305 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 293 transitions. [2025-03-04 07:14:24,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 07:14:24,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:24,306 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:14:24,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:14:24,306 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:24,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:24,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1566265755, now seen corresponding path program 1 times [2025-03-04 07:14:24,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:24,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345723739] [2025-03-04 07:14:24,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:24,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:24,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 07:14:24,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 07:14:24,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:24,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:14:24,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:24,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345723739] [2025-03-04 07:14:24,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345723739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:14:24,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:14:24,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:14:24,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94052103] [2025-03-04 07:14:24,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:14:24,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:14:24,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:24,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:14:24,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:14:24,486 INFO L87 Difference]: Start difference. First operand 212 states and 293 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:14:24,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:24,564 INFO L93 Difference]: Finished difference Result 345 states and 485 transitions. [2025-03-04 07:14:24,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:14:24,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-04 07:14:24,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:24,567 INFO L225 Difference]: With dead ends: 345 [2025-03-04 07:14:24,567 INFO L226 Difference]: Without dead ends: 345 [2025-03-04 07:14:24,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:14:24,568 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 134 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:24,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 518 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:14:24,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-04 07:14:24,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2025-03-04 07:14:24,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 339 states have (on average 1.4129793510324484) internal successors, (479), 340 states have internal predecessors, (479), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:14:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 485 transitions. [2025-03-04 07:14:24,585 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 485 transitions. Word has length 80 [2025-03-04 07:14:24,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:24,585 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 485 transitions. [2025-03-04 07:14:24,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:14:24,585 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 485 transitions. [2025-03-04 07:14:24,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 07:14:24,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:24,587 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:14:24,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:14:24,588 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:24,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:24,588 INFO L85 PathProgramCache]: Analyzing trace with hash -240570561, now seen corresponding path program 1 times [2025-03-04 07:14:24,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:24,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590072261] [2025-03-04 07:14:24,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:24,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:24,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 07:14:24,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 07:14:24,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:24,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:14:24,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:24,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590072261] [2025-03-04 07:14:24,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590072261] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:14:24,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949785964] [2025-03-04 07:14:24,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:24,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:14:24,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:14:24,861 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-04 07:14:24,862 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-04 07:14:25,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 07:14:25,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 07:14:25,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:25,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:25,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:14:25,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:14:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:14:25,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:14:25,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:14:25,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949785964] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:14:25,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:14:25,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 07:14:25,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070397447] [2025-03-04 07:14:25,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:14:25,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:14:25,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:25,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:14:25,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:14:25,388 INFO L87 Difference]: Start difference. First operand 345 states and 485 transitions. Second operand has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:14:25,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:25,570 INFO L93 Difference]: Finished difference Result 801 states and 1121 transitions. [2025-03-04 07:14:25,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:14:25,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 95 [2025-03-04 07:14:25,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:25,576 INFO L225 Difference]: With dead ends: 801 [2025-03-04 07:14:25,576 INFO L226 Difference]: Without dead ends: 801 [2025-03-04 07:14:25,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:14:25,578 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 1454 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:25,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1462 Valid, 1013 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:14:25,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-03-04 07:14:25,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2025-03-04 07:14:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 786 states have (on average 1.395674300254453) internal successors, (1097), 787 states have internal predecessors, (1097), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 07:14:25,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1121 transitions. [2025-03-04 07:14:25,606 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1121 transitions. Word has length 95 [2025-03-04 07:14:25,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:25,606 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1121 transitions. [2025-03-04 07:14:25,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:14:25,607 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1121 transitions. [2025-03-04 07:14:25,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-03-04 07:14:25,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:25,611 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:14:25,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:14:25,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:14:25,812 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:25,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:25,812 INFO L85 PathProgramCache]: Analyzing trace with hash 187466359, now seen corresponding path program 1 times [2025-03-04 07:14:25,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:25,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784933062] [2025-03-04 07:14:25,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:25,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:25,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-03-04 07:14:25,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-03-04 07:14:25,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:25,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:26,384 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 4 proven. 156 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-04 07:14:26,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:14:26,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784933062] [2025-03-04 07:14:26,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784933062] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:14:26,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267359273] [2025-03-04 07:14:26,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:26,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:14:26,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:14:26,387 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-04 07:14:26,388 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-04 07:14:26,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-03-04 07:14:26,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-03-04 07:14:26,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:14:26,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:14:26,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 1656 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:14:26,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:14:27,218 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:14:27,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:14:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:14:27,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267359273] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:14:27,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:14:27,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-04 07:14:27,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730214371] [2025-03-04 07:14:27,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:14:27,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:14:27,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:14:27,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:14:27,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:14:27,596 INFO L87 Difference]: Start difference. First operand 801 states and 1121 transitions. Second operand has 14 states, 14 states have (on average 53.0) internal successors, (742), 14 states have internal predecessors, (742), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:14:28,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:14:28,602 INFO L93 Difference]: Finished difference Result 1903 states and 2676 transitions. [2025-03-04 07:14:28,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:14:28,604 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 53.0) internal successors, (742), 14 states have internal predecessors, (742), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 314 [2025-03-04 07:14:28,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:14:28,613 INFO L225 Difference]: With dead ends: 1903 [2025-03-04 07:14:28,614 INFO L226 Difference]: Without dead ends: 1903 [2025-03-04 07:14:28,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=412, Unknown=0, NotChecked=0, Total=650 [2025-03-04 07:14:28,615 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 7584 mSDsluCounter, 2104 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7584 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 07:14:28,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7584 Valid, 2495 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 07:14:28,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2025-03-04 07:14:28,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1903. [2025-03-04 07:14:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1903 states, 1888 states have (on average 1.4046610169491525) internal successors, (2652), 1889 states have internal predecessors, (2652), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 07:14:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 2676 transitions. [2025-03-04 07:14:28,663 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 2676 transitions. Word has length 314 [2025-03-04 07:14:28,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:14:28,664 INFO L471 AbstractCegarLoop]: Abstraction has 1903 states and 2676 transitions. [2025-03-04 07:14:28,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 53.0) internal successors, (742), 14 states have internal predecessors, (742), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:14:28,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2676 transitions. [2025-03-04 07:14:28,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2025-03-04 07:14:28,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:14:28,680 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:14:28,693 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-04 07:14:28,881 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,SelfDestructingSolverStorable5 [2025-03-04 07:14:28,882 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:14:28,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:14:28,882 INFO L85 PathProgramCache]: Analyzing trace with hash -340505163, now seen corresponding path program 1 times [2025-03-04 07:14:28,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:14:28,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695948959] [2025-03-04 07:14:28,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:14:28,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:14:29,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 753 statements into 1 equivalence classes.