./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-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_SFH_test5-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 adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:23:16,072 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:23:16,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-04 07:23:16,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:23:16,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:23:16,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:23:16,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:23:16,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:23:16,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:23:16,156 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:23:16,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:23:16,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:23:16,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:23:16,157 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:23:16,157 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:23:16,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:23:16,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:23:16,158 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:23:16,158 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:23:16,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:23:16,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:23:16,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:23:16,158 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:23:16,158 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:23:16,158 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:23:16,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:23:16,158 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:23:16,158 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:23:16,158 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:23:16,158 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:23:16,159 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:23:16,159 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:23:16,159 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:23:16,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:23:16,159 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:23:16,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:23:16,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:23:16,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:23:16,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:23:16,160 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:23:16,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:23:16,160 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:23:16,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:23:16,160 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:23:16,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:23:16,160 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 -> adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 [2025-03-04 07:23:16,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:23:16,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:23:16,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:23:16,549 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:23:16,550 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:23:16,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2025-03-04 07:23:17,669 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876858f98/ebab236d08af410ca51dba1d55803e5f/FLAGe76d3ac4c [2025-03-04 07:23:17,993 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:23:17,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2025-03-04 07:23:18,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876858f98/ebab236d08af410ca51dba1d55803e5f/FLAGe76d3ac4c [2025-03-04 07:23:18,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876858f98/ebab236d08af410ca51dba1d55803e5f [2025-03-04 07:23:18,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:23:18,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:23:18,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:23:18,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:23:18,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:23:18,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:23:18" (1/1) ... [2025-03-04 07:23:18,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5da80790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:23:18, skipping insertion in model container [2025-03-04 07:23:18,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:23:18" (1/1) ... [2025-03-04 07:23:18,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:23:18,352 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:23:18,378 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:23:18,382 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:23:18,389 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:23:18,392 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:23:18,422 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:23:18,423 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:23:18,424 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:23:18,428 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:23:18,448 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:23:18,448 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:23:18,449 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:23:18,449 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:23:18,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:23:18,472 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:23:18,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:23:18,567 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:23:18,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:23:18 WrapperNode [2025-03-04 07:23:18,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:23:18,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:23:18,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:23:18,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:23:18,574 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:23:18" (1/1) ... [2025-03-04 07:23:18,604 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:23:18" (1/1) ... [2025-03-04 07:23:18,663 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1974 [2025-03-04 07:23:18,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:23:18,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:23:18,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:23:18,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:23:18,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:23:18" (1/1) ... [2025-03-04 07:23:18,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:23:18" (1/1) ... [2025-03-04 07:23:18,686 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:23:18" (1/1) ... [2025-03-04 07:23:18,771 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [2, 323, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 83 writes are split as follows [0, 82, 1]. [2025-03-04 07:23:18,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:23:18" (1/1) ... [2025-03-04 07:23:18,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:23:18" (1/1) ... [2025-03-04 07:23:18,812 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:23:18" (1/1) ... [2025-03-04 07:23:18,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:23:18" (1/1) ... [2025-03-04 07:23:18,826 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:23:18" (1/1) ... [2025-03-04 07:23:18,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:23:18" (1/1) ... [2025-03-04 07:23:18,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:23:18,844 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:23:18,844 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:23:18,844 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:23:18,845 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:23:18" (1/1) ... [2025-03-04 07:23:18,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:23:18,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:23:18,871 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:23:18,875 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:23:18,893 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 07:23:18,895 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 07:23:18,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:23:18,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:23:18,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 07:23:18,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 07:23:18,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 07:23:18,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:23:18,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:23:18,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 07:23:18,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 07:23:18,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 07:23:18,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 07:23:18,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 07:23:18,897 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 07:23:18,897 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 07:23:18,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:23:18,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:23:18,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:23:18,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:23:18,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:23:18,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:23:18,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:23:18,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:23:18,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:23:18,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:23:18,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:23:18,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:23:18,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:23:18,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:23:18,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:23:19,083 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:23:19,084 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:23:20,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#j~0#1.base, main_~#j~0#1.offset);havoc main_~#j~0#1.base, main_~#j~0#1.offset; [2025-03-04 07:23:20,489 INFO L? ?]: Removed 484 outVars from TransFormulas that were not future-live. [2025-03-04 07:23:20,490 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:23:20,539 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:23:20,540 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 07:23:20,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:23:20 BoogieIcfgContainer [2025-03-04 07:23:20,540 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:23:20,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:23:20,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:23:20,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:23:20,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:23:18" (1/3) ... [2025-03-04 07:23:20,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215d1b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:23:20, skipping insertion in model container [2025-03-04 07:23:20,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:23:18" (2/3) ... [2025-03-04 07:23:20,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215d1b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:23:20, skipping insertion in model container [2025-03-04 07:23:20,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:23:20" (3/3) ... [2025-03-04 07:23:20,549 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-1.i [2025-03-04 07:23:20,559 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:23:20,561 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test5-1.i that has 6 procedures, 571 locations, 1 initial locations, 46 loop locations, and 2 error locations. [2025-03-04 07:23:20,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:23:20,609 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;@82c01b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:23:20,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 07:23:20,616 INFO L276 IsEmpty]: Start isEmpty. Operand has 563 states, 544 states have (on average 1.6213235294117647) internal successors, (882), 553 states have internal predecessors, (882), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 07:23:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:23:20,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:23:20,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:23:20,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:23:20,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:23:20,624 INFO L85 PathProgramCache]: Analyzing trace with hash 961247646, now seen corresponding path program 1 times [2025-03-04 07:23:20,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:23:20,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112372024] [2025-03-04 07:23:20,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:23:20,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:23:20,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:23:20,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:23:20,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:23:20,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:23:20,765 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:23:20,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:23:20,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112372024] [2025-03-04 07:23:20,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112372024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:23:20,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:23:20,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:23:20,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337943268] [2025-03-04 07:23:20,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:23:20,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:23:20,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:23:20,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:23:20,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:23:20,790 INFO L87 Difference]: Start difference. First operand has 563 states, 544 states have (on average 1.6213235294117647) internal successors, (882), 553 states have internal predecessors, (882), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:23:21,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:23:21,028 INFO L93 Difference]: Finished difference Result 1104 states and 1624 transitions. [2025-03-04 07:23:21,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:23:21,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-04 07:23:21,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:23:21,042 INFO L225 Difference]: With dead ends: 1104 [2025-03-04 07:23:21,042 INFO L226 Difference]: Without dead ends: 1102 [2025-03-04 07:23:21,043 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:23:21,045 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 778 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:23:21,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 1552 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:23:21,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2025-03-04 07:23:21,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 561. [2025-03-04 07:23:21,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 544 states have (on average 1.4650735294117647) internal successors, (797), 551 states have internal predecessors, (797), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 07:23:21,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 821 transitions. [2025-03-04 07:23:21,112 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 821 transitions. Word has length 5 [2025-03-04 07:23:21,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:23:21,112 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 821 transitions. [2025-03-04 07:23:21,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:23:21,113 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 821 transitions. [2025-03-04 07:23:21,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-04 07:23:21,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:23:21,118 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, 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, 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:23:21,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:23:21,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:23:21,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:23:21,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1733851947, now seen corresponding path program 1 times [2025-03-04 07:23:21,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:23:21,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553272810] [2025-03-04 07:23:21,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:23:21,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:23:21,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-04 07:23:21,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-04 07:23:21,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:23:21,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:23:21,738 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:23:21,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:23:21,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553272810] [2025-03-04 07:23:21,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553272810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:23:21,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:23:21,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:23:21,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622349766] [2025-03-04 07:23:21,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:23:21,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:23:21,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:23:21,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:23:21,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:23:21,742 INFO L87 Difference]: Start difference. First operand 561 states and 821 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:23:21,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:23:21,919 INFO L93 Difference]: Finished difference Result 564 states and 817 transitions. [2025-03-04 07:23:21,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:23:21,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-03-04 07:23:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:23:21,922 INFO L225 Difference]: With dead ends: 564 [2025-03-04 07:23:21,923 INFO L226 Difference]: Without dead ends: 564 [2025-03-04 07:23:21,924 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:23:21,924 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 105 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:23:21,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 2103 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:23:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-04 07:23:21,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 561. [2025-03-04 07:23:21,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 544 states have (on average 1.4522058823529411) internal successors, (790), 551 states have internal predecessors, (790), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 07:23:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 814 transitions. [2025-03-04 07:23:21,948 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 814 transitions. Word has length 203 [2025-03-04 07:23:21,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:23:21,948 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 814 transitions. [2025-03-04 07:23:21,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 4 states have internal predecessors, (202), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:23:21,948 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 814 transitions. [2025-03-04 07:23:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-04 07:23:21,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:23:21,955 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, 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, 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:23:21,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:23:21,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:23:21,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:23:21,955 INFO L85 PathProgramCache]: Analyzing trace with hash 579428187, now seen corresponding path program 1 times [2025-03-04 07:23:21,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:23:21,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411578279] [2025-03-04 07:23:21,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:23:21,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:23:22,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-04 07:23:22,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-04 07:23:22,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:23:22,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:23:22,212 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:23:22,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:23:22,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411578279] [2025-03-04 07:23:22,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411578279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:23:22,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:23:22,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:23:22,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073659366] [2025-03-04 07:23:22,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:23:22,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:23:22,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:23:22,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:23:22,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:23:22,217 INFO L87 Difference]: Start difference. First operand 561 states and 814 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:23:22,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:23:22,389 INFO L93 Difference]: Finished difference Result 688 states and 1000 transitions. [2025-03-04 07:23:22,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:23:22,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-03-04 07:23:22,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:23:22,403 INFO L225 Difference]: With dead ends: 688 [2025-03-04 07:23:22,403 INFO L226 Difference]: Without dead ends: 688 [2025-03-04 07:23:22,404 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:23:22,405 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 134 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1489 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:23:22,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1489 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:23:22,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-04 07:23:22,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2025-03-04 07:23:22,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 671 states have (on average 1.4545454545454546) internal successors, (976), 678 states have internal predecessors, (976), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 07:23:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1000 transitions. [2025-03-04 07:23:22,423 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1000 transitions. Word has length 203 [2025-03-04 07:23:22,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:23:22,424 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1000 transitions. [2025-03-04 07:23:22,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:23:22,425 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1000 transitions. [2025-03-04 07:23:22,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-04 07:23:22,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:23:22,427 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, 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, 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:23:22,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:23:22,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:23:22,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:23:22,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1422821200, now seen corresponding path program 1 times [2025-03-04 07:23:22,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:23:22,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383254484] [2025-03-04 07:23:22,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:23:22,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:23:22,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-04 07:23:22,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-04 07:23:22,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:23:22,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:23:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:23:22,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:23:22,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383254484] [2025-03-04 07:23:22,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383254484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:23:22,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:23:22,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:23:22,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61399698] [2025-03-04 07:23:22,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:23:22,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:23:22,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:23:22,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:23:22,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:23:22,801 INFO L87 Difference]: Start difference. First operand 688 states and 1000 transitions. Second operand has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:23:22,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:23:22,955 INFO L93 Difference]: Finished difference Result 646 states and 923 transitions. [2025-03-04 07:23:22,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:23:22,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 218 [2025-03-04 07:23:22,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:23:22,958 INFO L225 Difference]: With dead ends: 646 [2025-03-04 07:23:22,959 INFO L226 Difference]: Without dead ends: 646 [2025-03-04 07:23:22,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:23:22,960 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 30 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:23:22,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1952 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:23:22,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2025-03-04 07:23:22,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2025-03-04 07:23:22,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 629 states have (on average 1.4292527821939587) internal successors, (899), 636 states have internal predecessors, (899), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 07:23:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 923 transitions. [2025-03-04 07:23:22,978 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 923 transitions. Word has length 218 [2025-03-04 07:23:22,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:23:22,978 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 923 transitions. [2025-03-04 07:23:22,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:23:22,979 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 923 transitions. [2025-03-04 07:23:22,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-04 07:23:22,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:23:22,981 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, 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, 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:23:22,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:23:22,981 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:23:22,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:23:22,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2124110999, now seen corresponding path program 1 times [2025-03-04 07:23:22,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:23:22,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381517907] [2025-03-04 07:23:22,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:23:22,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:23:23,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-04 07:23:23,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-04 07:23:23,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:23:23,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:23:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:23:23,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:23:23,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381517907] [2025-03-04 07:23:23,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381517907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:23:23,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:23:23,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:23:23,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339894935] [2025-03-04 07:23:23,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:23:23,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:23:23,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:23:23,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:23:23,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:23:23,299 INFO L87 Difference]: Start difference. First operand 646 states and 923 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:23:23,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:23:23,476 INFO L93 Difference]: Finished difference Result 935 states and 1340 transitions. [2025-03-04 07:23:23,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:23:23,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 218 [2025-03-04 07:23:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:23:23,482 INFO L225 Difference]: With dead ends: 935 [2025-03-04 07:23:23,482 INFO L226 Difference]: Without dead ends: 935 [2025-03-04 07:23:23,483 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:23:23,483 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 453 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:23:23,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1509 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:23:23,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-03-04 07:23:23,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 932. [2025-03-04 07:23:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 907 states have (on average 1.4310915104740904) internal successors, (1298), 919 states have internal predecessors, (1298), 21 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 07:23:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1338 transitions. [2025-03-04 07:23:23,500 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1338 transitions. Word has length 218 [2025-03-04 07:23:23,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:23:23,502 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1338 transitions. [2025-03-04 07:23:23,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:23:23,502 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1338 transitions. [2025-03-04 07:23:23,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-04 07:23:23,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:23:23,507 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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, 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:23:23,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:23:23,508 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:23:23,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:23:23,508 INFO L85 PathProgramCache]: Analyzing trace with hash 907517257, now seen corresponding path program 1 times [2025-03-04 07:23:23,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:23:23,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355477785] [2025-03-04 07:23:23,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:23:23,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:23:23,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-04 07:23:23,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-04 07:23:23,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:23:23,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:23:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:23:23,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:23:23,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355477785] [2025-03-04 07:23:23,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355477785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:23:23,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598807028] [2025-03-04 07:23:23,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:23:23,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:23:23,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:23:23,881 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:23:23,883 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:23:24,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-04 07:23:24,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-04 07:23:24,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:23:24,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:23:24,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:23:24,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:23:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 07:23:24,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:23:24,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598807028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:23:24,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:23:24,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 07:23:24,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074300452] [2025-03-04 07:23:24,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:23:24,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:23:24,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:23:24,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:23:24,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:23:24,364 INFO L87 Difference]: Start difference. First operand 932 states and 1338 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:23:24,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:23:24,499 INFO L93 Difference]: Finished difference Result 972 states and 1378 transitions. [2025-03-04 07:23:24,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:23:24,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 233 [2025-03-04 07:23:24,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:23:24,505 INFO L225 Difference]: With dead ends: 972 [2025-03-04 07:23:24,505 INFO L226 Difference]: Without dead ends: 972 [2025-03-04 07:23:24,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:23:24,506 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 8 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:23:24,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1295 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:23:24,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2025-03-04 07:23:24,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2025-03-04 07:23:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 947 states have (on average 1.412882787750792) internal successors, (1338), 959 states have internal predecessors, (1338), 21 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 07:23:24,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1378 transitions. [2025-03-04 07:23:24,530 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1378 transitions. Word has length 233 [2025-03-04 07:23:24,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:23:24,530 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1378 transitions. [2025-03-04 07:23:24,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:23:24,531 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1378 transitions. [2025-03-04 07:23:24,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-04 07:23:24,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:23:24,534 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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, 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:23:24,543 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-04 07:23:24,735 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,SelfDestructingSolverStorable5 [2025-03-04 07:23:24,735 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:23:24,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:23:24,736 INFO L85 PathProgramCache]: Analyzing trace with hash 783444010, now seen corresponding path program 1 times [2025-03-04 07:23:24,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:23:24,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737863781] [2025-03-04 07:23:24,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:23:24,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:23:24,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-04 07:23:24,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-04 07:23:24,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:23:24,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:23:25,099 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:23:25,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:23:25,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737863781] [2025-03-04 07:23:25,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737863781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:23:25,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156927212] [2025-03-04 07:23:25,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:23:25,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:23:25,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:23:25,101 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:23:25,103 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:23:25,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-04 07:23:25,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-04 07:23:25,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:23:25,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:23:25,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 1200 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:23:25,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:23:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-04 07:23:25,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:23:25,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156927212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:23:25,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:23:25,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 07:23:25,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578235964] [2025-03-04 07:23:25,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:23:25,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:23:25,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:23:25,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:23:25,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:23:25,539 INFO L87 Difference]: Start difference. First operand 972 states and 1378 transitions. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:23:25,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:23:25,680 INFO L93 Difference]: Finished difference Result 944 states and 1336 transitions. [2025-03-04 07:23:25,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:23:25,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 233 [2025-03-04 07:23:25,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:23:25,685 INFO L225 Difference]: With dead ends: 944 [2025-03-04 07:23:25,686 INFO L226 Difference]: Without dead ends: 944 [2025-03-04 07:23:25,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:23:25,686 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 105 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:23:25,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1860 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:23:25,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-03-04 07:23:25,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2025-03-04 07:23:25,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 919 states have (on average 1.410228509249184) internal successors, (1296), 931 states have internal predecessors, (1296), 21 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 11 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 07:23:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1336 transitions. [2025-03-04 07:23:25,702 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1336 transitions. Word has length 233 [2025-03-04 07:23:25,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:23:25,702 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1336 transitions. [2025-03-04 07:23:25,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 07:23:25,702 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1336 transitions. [2025-03-04 07:23:25,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-04 07:23:25,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:23:25,704 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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, 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:23:25,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:23:25,908 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,SelfDestructingSolverStorable6 [2025-03-04 07:23:25,908 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:23:25,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:23:25,908 INFO L85 PathProgramCache]: Analyzing trace with hash 635696451, now seen corresponding path program 1 times [2025-03-04 07:23:25,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:23:25,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978386184] [2025-03-04 07:23:25,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:23:25,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:23:25,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-04 07:23:25,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-04 07:23:25,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:23:25,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:23:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:23:26,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:23:26,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978386184] [2025-03-04 07:23:26,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978386184] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:23:26,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113790192] [2025-03-04 07:23:26,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:23:26,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:23:26,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:23:26,163 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-04 07:23:26,164 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-04 07:23:26,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-04 07:23:26,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-04 07:23:26,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:23:26,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:23:26,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 1172 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:23:26,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:23:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:23:26,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:23:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:23:26,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113790192] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:23:26,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:23:26,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 07:23:26,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64832575] [2025-03-04 07:23:26,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:23:26,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:23:26,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:23:26,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:23:26,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:23:26,906 INFO L87 Difference]: Start difference. First operand 944 states and 1336 transitions. Second operand has 7 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 07:23:27,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:23:27,298 INFO L93 Difference]: Finished difference Result 2185 states and 3100 transitions. [2025-03-04 07:23:27,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:23:27,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 233 [2025-03-04 07:23:27,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:23:27,306 INFO L225 Difference]: With dead ends: 2185 [2025-03-04 07:23:27,306 INFO L226 Difference]: Without dead ends: 2185 [2025-03-04 07:23:27,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 463 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:23:27,307 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 3371 mSDsluCounter, 2730 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3402 SdHoareTripleChecker+Valid, 3434 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:23:27,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3402 Valid, 3434 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:23:27,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2025-03-04 07:23:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 1866. [2025-03-04 07:23:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1816 states have (on average 1.3997797356828194) internal successors, (2542), 1838 states have internal predecessors, (2542), 46 states have call successors, (46), 3 states have call predecessors, (46), 2 states have return successors, (44), 28 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 07:23:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2632 transitions. [2025-03-04 07:23:27,341 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2632 transitions. Word has length 233 [2025-03-04 07:23:27,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:23:27,341 INFO L471 AbstractCegarLoop]: Abstraction has 1866 states and 2632 transitions. [2025-03-04 07:23:27,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 07:23:27,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2632 transitions. [2025-03-04 07:23:27,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2025-03-04 07:23:27,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:23:27,350 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, 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, 3, 3, 3, 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:23:27,360 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-04 07:23:27,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:23:27,551 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:23:27,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:23:27,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1537833877, now seen corresponding path program 1 times [2025-03-04 07:23:27,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:23:27,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462177217] [2025-03-04 07:23:27,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:23:27,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:23:27,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 659 statements into 1 equivalence classes. [2025-03-04 07:23:27,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 659 of 659 statements. [2025-03-04 07:23:27,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:23:27,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:23:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 4 proven. 357 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-03-04 07:23:28,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:23:28,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462177217] [2025-03-04 07:23:28,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462177217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:23:28,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516009921] [2025-03-04 07:23:28,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:23:28,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:23:28,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:23:28,389 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-04 07:23:28,391 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-04 07:23:28,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 659 statements into 1 equivalence classes. [2025-03-04 07:23:29,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 659 of 659 statements. [2025-03-04 07:23:29,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:23:29,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:23:29,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 3215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:23:29,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:23:29,882 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 844 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:23:29,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:23:30,515 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 844 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 07:23:30,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516009921] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:23:30,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:23:30,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-04 07:23:30,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193352224] [2025-03-04 07:23:30,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:23:30,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:23:30,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:23:30,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:23:30,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:23:30,522 INFO L87 Difference]: Start difference. First operand 1866 states and 2632 transitions. Second operand has 14 states, 14 states have (on average 110.71428571428571) internal successors, (1550), 14 states have internal predecessors, (1550), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 07:23:33,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:23:33,285 INFO L93 Difference]: Finished difference Result 4318 states and 6077 transitions. [2025-03-04 07:23:33,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:23:33,286 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 110.71428571428571) internal successors, (1550), 14 states have internal predecessors, (1550), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 659 [2025-03-04 07:23:33,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:23:33,300 INFO L225 Difference]: With dead ends: 4318 [2025-03-04 07:23:33,300 INFO L226 Difference]: Without dead ends: 4318 [2025-03-04 07:23:33,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1332 GetRequests, 1308 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:23:33,302 INFO L435 NwaCegarLoop]: 976 mSDtfsCounter, 17228 mSDsluCounter, 5088 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17228 SdHoareTripleChecker+Valid, 6064 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:23:33,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17228 Valid, 6064 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-04 07:23:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4318 states. [2025-03-04 07:23:33,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4318 to 4144. [2025-03-04 07:23:33,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4071 states have (on average 1.397445345124048) internal successors, (5689), 4098 states have internal predecessors, (5689), 69 states have call successors, (69), 3 states have call predecessors, (69), 2 states have return successors, (67), 47 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-04 07:23:33,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5825 transitions. [2025-03-04 07:23:33,364 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5825 transitions. Word has length 659 [2025-03-04 07:23:33,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:23:33,364 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5825 transitions. [2025-03-04 07:23:33,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 110.71428571428571) internal successors, (1550), 14 states have internal predecessors, (1550), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 07:23:33,366 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5825 transitions. [2025-03-04 07:23:33,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1522 [2025-03-04 07:23:33,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:23:33,409 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, 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, 9, 9, 9, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2025-03-04 07:23:33,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:23:33,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:23:33,610 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:23:33,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:23:33,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1187051691, now seen corresponding path program 1 times [2025-03-04 07:23:33,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:23:33,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651915889] [2025-03-04 07:23:33,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:23:33,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:23:33,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1521 statements into 1 equivalence classes.