./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f54335276b565c52e40eef6a3f78ed9d794347e65877e7f862e4de86bcdea73 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 02:54:11,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 02:54:11,428 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2024-11-14 02:54:11,435 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 02:54:11,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 02:54:11,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 02:54:11,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 02:54:11,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 02:54:11,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 02:54:11,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 02:54:11,473 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 02:54:11,473 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 02:54:11,473 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 02:54:11,474 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 02:54:11,474 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 02:54:11,474 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 02:54:11,474 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 02:54:11,474 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 02:54:11,475 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 02:54:11,475 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 02:54:11,475 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 02:54:11,475 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 02:54:11,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 02:54:11,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 02:54:11,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 02:54:11,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 02:54:11,477 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 02:54:11,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 02:54:11,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 02:54:11,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 02:54:11,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 02:54:11,478 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 02:54:11,478 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 02:54:11,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 02:54:11,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 02:54:11,478 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 02:54:11,479 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 02:54:11,479 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 02:54:11,479 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 02:54:11,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 02:54:11,479 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 02:54:11,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 02:54:11,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 02:54:11,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 02:54:11,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:54:11,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 02:54:11,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 02:54:11,481 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 02:54:11,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 02:54:11,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 02:54:11,481 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 02:54:11,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 02:54:11,481 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E 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 -> Taipan 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 -> 4f54335276b565c52e40eef6a3f78ed9d794347e65877e7f862e4de86bcdea73 [2024-11-14 02:54:11,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 02:54:11,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 02:54:11,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 02:54:11,991 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 02:54:11,992 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 02:54:11,994 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i Unable to find full path for "g++" [2024-11-14 02:54:14,466 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 02:54:15,227 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 02:54:15,230 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-1.i [2024-11-14 02:54:15,267 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E/data/6ab2d4be0/d202611288464c6badca098cd48624bd/FLAGf2eb9d779 [2024-11-14 02:54:15,290 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E/data/6ab2d4be0/d202611288464c6badca098cd48624bd [2024-11-14 02:54:15,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 02:54:15,296 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 02:54:15,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 02:54:15,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 02:54:15,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 02:54:15,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:54:15" (1/1) ... [2024-11-14 02:54:15,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63674613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:54:15, skipping insertion in model container [2024-11-14 02:54:15,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:54:15" (1/1) ... [2024-11-14 02:54:15,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 02:54:16,090 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 02:54:16,121 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 02:54:16,129 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 02:54:16,135 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 02:54:16,141 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 02:54:16,169 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 02:54:16,170 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 02:54:16,173 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 02:54:16,173 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 02:54:16,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:54:16,202 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 02:54:16,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:54:16,488 INFO L204 MainTranslator]: Completed translation [2024-11-14 02:54:16,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:54:16 WrapperNode [2024-11-14 02:54:16,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 02:54:16,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 02:54:16,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 02:54:16,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 02:54:16,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:54:16" (1/1) ... [2024-11-14 02:54:16,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:54:16" (1/1) ... [2024-11-14 02:54:16,794 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3252 [2024-11-14 02:54:16,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 02:54:16,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 02:54:16,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 02:54:16,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 02:54:16,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:54:16" (1/1) ... [2024-11-14 02:54:16,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:54:16" (1/1) ... [2024-11-14 02:54:16,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:54:16" (1/1) ... [2024-11-14 02:54:16,838 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:54:16" (1/1) ... [2024-11-14 02:54:16,940 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:54:16" (1/1) ... [2024-11-14 02:54:17,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:54:16" (1/1) ... [2024-11-14 02:54:17,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:54:16" (1/1) ... [2024-11-14 02:54:17,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:54:16" (1/1) ... [2024-11-14 02:54:17,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 02:54:17,064 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 02:54:17,066 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 02:54:17,066 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 02:54:17,067 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:54:16" (1/1) ... [2024-11-14 02:54:17,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:54:17,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:54:17,119 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 02:54:17,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 02:54:17,160 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-14 02:54:17,160 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-14 02:54:17,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 02:54:17,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-14 02:54:17,161 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-14 02:54:17,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 02:54:17,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-14 02:54:17,162 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-14 02:54:17,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 02:54:17,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 02:54:17,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 02:54:17,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 02:54:17,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 02:54:17,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 02:54:17,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 02:54:17,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 02:54:17,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 02:54:17,513 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 02:54:17,516 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 02:54:22,459 INFO L? ?]: Removed 793 outVars from TransFormulas that were not future-live. [2024-11-14 02:54:22,459 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 02:54:25,055 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 02:54:25,055 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-14 02:54:25,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:54:25 BoogieIcfgContainer [2024-11-14 02:54:25,056 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 02:54:25,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 02:54:25,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 02:54:25,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 02:54:25,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 02:54:15" (1/3) ... [2024-11-14 02:54:25,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0c62ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:54:25, skipping insertion in model container [2024-11-14 02:54:25,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:54:16" (2/3) ... [2024-11-14 02:54:25,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0c62ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:54:25, skipping insertion in model container [2024-11-14 02:54:25,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:54:25" (3/3) ... [2024-11-14 02:54:25,069 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test9-1.i [2024-11-14 02:54:25,093 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 02:54:25,095 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test9-1.i that has 4 procedures, 1111 locations, 1 initial locations, 31 loop locations, and 2 error locations. [2024-11-14 02:54:25,203 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 02:54:25,228 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=FINITE_AUTOMATA, 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;@745ea823, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 02:54:25,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-14 02:54:25,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 1111 states, 600 states have (on average 1.955) internal successors, (1173), 1104 states have internal predecessors, (1173), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-11-14 02:54:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 02:54:25,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:54:25,251 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 02:54:25,252 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 02:54:25,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:54:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1298227710, now seen corresponding path program 1 times [2024-11-14 02:54:25,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:54:25,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963844962] [2024-11-14 02:54:25,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:54:25,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:54:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:54:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:54:25,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:54:25,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963844962] [2024-11-14 02:54:25,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963844962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:54:25,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:54:25,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 02:54:25,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613222619] [2024-11-14 02:54:25,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:54:25,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 02:54:25,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:54:25,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 02:54:25,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 02:54:25,556 INFO L87 Difference]: Start difference. First operand has 1111 states, 600 states have (on average 1.955) internal successors, (1173), 1104 states have internal predecessors, (1173), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2024-11-14 02:54:28,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:54:30,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:54:32,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:54:33,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:54:33,234 INFO L93 Difference]: Finished difference Result 1109 states and 2125 transitions. [2024-11-14 02:54:33,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 02:54:33,243 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-11-14 02:54:33,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:54:33,276 INFO L225 Difference]: With dead ends: 1109 [2024-11-14 02:54:33,276 INFO L226 Difference]: Without dead ends: 1108 [2024-11-14 02:54:33,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 02:54:33,282 INFO L432 NwaCegarLoop]: 2104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2104 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-14 02:54:33,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2104 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 3 Unknown, 0 Unchecked, 7.5s Time] [2024-11-14 02:54:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2024-11-14 02:54:34,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1108. [2024-11-14 02:54:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 599 states have (on average 1.8631051752921537) internal successors, (1116), 1101 states have internal predecessors, (1116), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-14 02:54:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 2124 transitions. [2024-11-14 02:54:34,056 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 2124 transitions. Word has length 6 [2024-11-14 02:54:34,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:54:34,057 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 2124 transitions. [2024-11-14 02:54:34,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2024-11-14 02:54:34,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 2124 transitions. [2024-11-14 02:54:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 02:54:34,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:54:34,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:54:34,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 02:54:34,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 02:54:34,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:54:34,060 INFO L85 PathProgramCache]: Analyzing trace with hash -754194460, now seen corresponding path program 1 times [2024-11-14 02:54:34,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:54:34,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511432282] [2024-11-14 02:54:34,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:54:34,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:54:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:54:34,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:54:34,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:54:34,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511432282] [2024-11-14 02:54:34,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511432282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:54:34,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:54:34,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 02:54:34,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164792367] [2024-11-14 02:54:34,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:54:34,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 02:54:34,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:54:34,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 02:54:34,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 02:54:34,454 INFO L87 Difference]: Start difference. First operand 1108 states and 2124 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-11-14 02:54:36,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 02:54:38,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 02:54:41,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:54:43,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:54:45,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 02:54:47,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 02:54:49,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 02:54:51,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 02:54:53,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 02:54:56,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:54:58,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:00,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:02,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:04,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:06,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:09,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-14 02:55:10,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:55:10,097 INFO L93 Difference]: Finished difference Result 2163 states and 4189 transitions. [2024-11-14 02:55:10,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 02:55:10,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-14 02:55:10,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:55:10,133 INFO L225 Difference]: With dead ends: 2163 [2024-11-14 02:55:10,133 INFO L226 Difference]: Without dead ends: 2163 [2024-11-14 02:55:10,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:55:10,135 INFO L432 NwaCegarLoop]: 2118 mSDtfsCounter, 1060 mSDsluCounter, 3697 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 2 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 5815 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.3s IncrementalHoareTripleChecker+Time [2024-11-14 02:55:10,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 5815 Invalid, 613 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 596 Invalid, 15 Unknown, 0 Unchecked, 35.3s Time] [2024-11-14 02:55:10,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2024-11-14 02:55:10,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 1110. [2024-11-14 02:55:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 601 states have (on average 1.860232945091514) internal successors, (1118), 1103 states have internal predecessors, (1118), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-14 02:55:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 2126 transitions. [2024-11-14 02:55:10,689 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 2126 transitions. Word has length 8 [2024-11-14 02:55:10,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:55:10,690 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 2126 transitions. [2024-11-14 02:55:10,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-11-14 02:55:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 2126 transitions. [2024-11-14 02:55:10,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 02:55:10,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:55:10,695 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-14 02:55:10,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 02:55:10,696 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 02:55:10,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:55:10,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1590573495, now seen corresponding path program 1 times [2024-11-14 02:55:10,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:55:10,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253185679] [2024-11-14 02:55:10,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:55:10,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:55:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:55:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:55:11,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:55:11,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253185679] [2024-11-14 02:55:11,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253185679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:55:11,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:55:11,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 02:55:11,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897819780] [2024-11-14 02:55:11,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:55:11,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 02:55:11,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:55:11,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 02:55:11,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:55:11,488 INFO L87 Difference]: Start difference. First operand 1110 states and 2126 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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) [2024-11-14 02:55:13,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:15,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:17,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:19,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:21,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:23,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:25,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:27,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:29,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:31,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:33,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:35,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:55:36,590 INFO L93 Difference]: Finished difference Result 2150 states and 4169 transitions. [2024-11-14 02:55:36,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 02:55:36,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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 36 [2024-11-14 02:55:36,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:55:36,613 INFO L225 Difference]: With dead ends: 2150 [2024-11-14 02:55:36,613 INFO L226 Difference]: Without dead ends: 2150 [2024-11-14 02:55:36,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:55:36,615 INFO L432 NwaCegarLoop]: 2127 mSDtfsCounter, 1030 mSDsluCounter, 2094 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 4221 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2024-11-14 02:55:36,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1530 Valid, 4221 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 11 Unknown, 0 Unchecked, 25.0s Time] [2024-11-14 02:55:36,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2024-11-14 02:55:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 2146. [2024-11-14 02:55:37,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2146 states, 1137 states have (on average 1.8979771328056287) internal successors, (2158), 2139 states have internal predecessors, (2158), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-14 02:55:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 4166 transitions. [2024-11-14 02:55:37,164 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 4166 transitions. Word has length 36 [2024-11-14 02:55:37,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:55:37,165 INFO L471 AbstractCegarLoop]: Abstraction has 2146 states and 4166 transitions. [2024-11-14 02:55:37,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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) [2024-11-14 02:55:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 4166 transitions. [2024-11-14 02:55:37,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-14 02:55:37,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:55:37,167 INFO L215 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] [2024-11-14 02:55:37,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 02:55:37,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 02:55:37,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:55:37,168 INFO L85 PathProgramCache]: Analyzing trace with hash -421093973, now seen corresponding path program 1 times [2024-11-14 02:55:37,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:55:37,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781887902] [2024-11-14 02:55:37,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:55:37,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:55:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:55:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 02:55:38,251 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:55:38,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781887902] [2024-11-14 02:55:38,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781887902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:55:38,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:55:38,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 02:55:38,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046022868] [2024-11-14 02:55:38,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:55:38,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 02:55:38,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:55:38,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 02:55:38,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 02:55:38,256 INFO L87 Difference]: Start difference. First operand 2146 states and 4166 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 02:55:40,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:42,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:44,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:46,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:48,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:50,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:52,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:54,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:56,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 02:55:58,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:00,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:02,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:04,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:06,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:09,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:11,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:13,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:17,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-14 02:56:17,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:56:17,592 INFO L93 Difference]: Finished difference Result 4191 states and 8220 transitions. [2024-11-14 02:56:17,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 02:56:17,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2024-11-14 02:56:17,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:56:17,630 INFO L225 Difference]: With dead ends: 4191 [2024-11-14 02:56:17,630 INFO L226 Difference]: Without dead ends: 4191 [2024-11-14 02:56:17,631 INFO L431 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 [2024-11-14 02:56:17,632 INFO L432 NwaCegarLoop]: 2300 mSDtfsCounter, 1059 mSDsluCounter, 3879 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 2 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 6179 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:56:17,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 6179 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 596 Invalid, 17 Unknown, 0 Unchecked, 39.1s Time] [2024-11-14 02:56:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4191 states. [2024-11-14 02:56:18,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4191 to 2148. [2024-11-14 02:56:18,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2148 states, 1139 states have (on average 1.8964003511852503) internal successors, (2160), 2141 states have internal predecessors, (2160), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-14 02:56:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 4168 transitions. [2024-11-14 02:56:18,649 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 4168 transitions. Word has length 49 [2024-11-14 02:56:18,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:56:18,651 INFO L471 AbstractCegarLoop]: Abstraction has 2148 states and 4168 transitions. [2024-11-14 02:56:18,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 02:56:18,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 4168 transitions. [2024-11-14 02:56:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-14 02:56:18,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:56:18,656 INFO L215 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] [2024-11-14 02:56:18,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 02:56:18,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 02:56:18,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:56:18,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1532845697, now seen corresponding path program 1 times [2024-11-14 02:56:18,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:56:18,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677307550] [2024-11-14 02:56:18,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:56:18,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:56:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:56:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 02:56:19,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:56:19,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677307550] [2024-11-14 02:56:19,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677307550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:56:19,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:56:19,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 02:56:19,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924649685] [2024-11-14 02:56:19,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:56:19,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 02:56:19,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:56:19,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 02:56:19,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 02:56:19,279 INFO L87 Difference]: Start difference. First operand 2148 states and 4168 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2024-11-14 02:56:21,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:23,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:25,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:27,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:29,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:31,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:34,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:56:34,467 INFO L93 Difference]: Finished difference Result 1126 states and 2141 transitions. [2024-11-14 02:56:34,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 02:56:34,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 65 [2024-11-14 02:56:34,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:56:34,476 INFO L225 Difference]: With dead ends: 1126 [2024-11-14 02:56:34,476 INFO L226 Difference]: Without dead ends: 1126 [2024-11-14 02:56:34,476 INFO L431 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 [2024-11-14 02:56:34,477 INFO L432 NwaCegarLoop]: 2094 mSDtfsCounter, 2156 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1003 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2156 SdHoareTripleChecker+Valid, 3135 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1003 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:56:34,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2156 Valid, 3135 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1003 Valid, 54 Invalid, 6 Unknown, 0 Unchecked, 15.1s Time] [2024-11-14 02:56:34,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2024-11-14 02:56:34,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1126. [2024-11-14 02:56:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 617 states have (on average 1.8363047001620745) internal successors, (1133), 1119 states have internal predecessors, (1133), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-14 02:56:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 2141 transitions. [2024-11-14 02:56:34,705 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 2141 transitions. Word has length 65 [2024-11-14 02:56:34,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:56:34,706 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 2141 transitions. [2024-11-14 02:56:34,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2024-11-14 02:56:34,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 2141 transitions. [2024-11-14 02:56:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 02:56:34,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:56:34,709 INFO L215 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] [2024-11-14 02:56:34,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 02:56:34,709 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 02:56:34,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:56:34,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1978162648, now seen corresponding path program 1 times [2024-11-14 02:56:34,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:56:34,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104991621] [2024-11-14 02:56:34,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:56:34,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:56:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:56:37,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 02:56:37,307 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:56:37,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104991621] [2024-11-14 02:56:37,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104991621] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:56:37,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055293819] [2024-11-14 02:56:37,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:56:37,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:56:37,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:56:37,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:56:37,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 02:56:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:56:40,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 02:56:40,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:56:40,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:56:40,495 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 02:56:40,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055293819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:56:40,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 02:56:40,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-14 02:56:40,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166038492] [2024-11-14 02:56:40,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:56:40,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 02:56:40,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:56:40,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 02:56:40,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:56:40,498 INFO L87 Difference]: Start difference. First operand 1126 states and 2141 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 02:56:42,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:44,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:46,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:48,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:50,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:52,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:54,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:56,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:56:58,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:57:00,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:57:02,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:57:04,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 02:57:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:57:06,352 INFO L93 Difference]: Finished difference Result 1128 states and 2144 transitions. [2024-11-14 02:57:06,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 02:57:06,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2024-11-14 02:57:06,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:57:06,367 INFO L225 Difference]: With dead ends: 1128 [2024-11-14 02:57:06,367 INFO L226 Difference]: Without dead ends: 1128 [2024-11-14 02:57:06,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:57:06,368 INFO L432 NwaCegarLoop]: 2101 mSDtfsCounter, 0 mSDsluCounter, 4198 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6299 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.8s IncrementalHoareTripleChecker+Time [2024-11-14 02:57:06,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6299 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 12 Unknown, 0 Unchecked, 25.8s Time] [2024-11-14 02:57:06,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2024-11-14 02:57:06,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1128. [2024-11-14 02:57:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 618 states have (on average 1.8365695792880259) internal successors, (1135), 1121 states have internal predecessors, (1135), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (504), 4 states have call predecessors, (504), 503 states have call successors, (504) [2024-11-14 02:57:06,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 2144 transitions. [2024-11-14 02:57:06,586 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 2144 transitions. Word has length 73 [2024-11-14 02:57:06,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:57:06,586 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 2144 transitions. [2024-11-14 02:57:06,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 02:57:06,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 2144 transitions. [2024-11-14 02:57:06,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-14 02:57:06,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:57:06,593 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:57:06,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 02:57:06,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-14 02:57:06,794 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 02:57:06,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:57:06,794 INFO L85 PathProgramCache]: Analyzing trace with hash -99343432, now seen corresponding path program 1 times [2024-11-14 02:57:06,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:57:06,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538098829] [2024-11-14 02:57:06,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:57:06,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:57:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:57:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 02:57:08,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:57:08,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538098829] [2024-11-14 02:57:08,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538098829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 02:57:08,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652811481] [2024-11-14 02:57:08,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:57:08,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 02:57:08,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:57:08,684 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 02:57:08,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d82a1b1-a357-44bc-a756-e88f30e31bed/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 02:57:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:57:27,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 02:57:27,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:57:27,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 02:57:27,670 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 02:57:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 02:57:27,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652811481] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 02:57:27,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1559682945] [2024-11-14 02:57:27,883 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2024-11-14 02:57:27,884 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 02:57:27,890 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 02:57:27,896 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 02:57:27,897 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 02:58:20,572 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 399 for LOIs [2024-11-14 02:58:26,415 INFO L197 IcfgInterpreter]: Interpreting procedure reach_error with input of size 78 for LOIs [2024-11-14 02:58:26,440 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:08:20,289 WARN L286 SmtUtils]: Spent 8.95m on a formula simplification. DAG size of input: 399 DAG size of output: 399 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:08:31,741 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse34 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse35 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (and (= c_~count_int_int~0 0) (<= 2 |c_ULTIMATE.start_main_~#i~0#1.base|) (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (exists ((|v_#memory_int_129| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_106| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_316| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_107| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_108| (Array Int (Array Int Int))) (|v_#valid_52| (Array Int Int)) (|v_#memory_$Pointer$.base_108| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_316| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_107| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_106| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem54#1.base_14| Int) (|v_#length_34| (Array Int Int)) (|v_#memory_int_421| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc61#1.base_6| Int) (|v_#memory_int_130| (Array Int (Array Int Int)))) (let ((.cse10 (select (select |v_#memory_$Pointer$.base_107| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse11 (select (select |v_#memory_$Pointer$.offset_106| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse7 (select (select |v_#memory_$Pointer$.base_316| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse8 (+ 16 (select (select |v_#memory_$Pointer$.offset_316| |c_ULTIMATE.start_main_~user~0#1.base|) 8)))) (let ((.cse33 (store |v_#memory_$Pointer$.offset_316| .cse7 (store (select |v_#memory_$Pointer$.offset_316| .cse7) .cse8 8))) (.cse17 (store |v_#memory_$Pointer$.base_316| .cse7 (store (select |v_#memory_$Pointer$.base_316| .cse7) .cse8 |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse16 (store |v_#memory_$Pointer$.offset_106| .cse10 (store (select |v_#memory_$Pointer$.offset_106| .cse10) .cse11 0))) (.cse4 (store |v_#memory_$Pointer$.base_107| .cse10 (store (select |v_#memory_$Pointer$.base_107| .cse10) .cse11 |v_ULTIMATE.start_main_#t~malloc61#1.base_6|)))) (let ((.cse0 (select (select |v_#memory_$Pointer$.base_108| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse1 (+ 20 (select (select |v_#memory_$Pointer$.offset_107| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse3 (+ 40 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (.cse5 (select (select |v_#memory_$Pointer$.base_106| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse6 (+ 8 (select (select |v_#memory_$Pointer$.offset_108| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse15 (+ (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4))) (and (= |c_#valid| (store |v_#valid_52| |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 1)) (= (store |v_#memory_$Pointer$.base_108| .cse0 (store (select |v_#memory_$Pointer$.base_108| .cse0) .cse1 (select (select |v_#memory_$Pointer$.base_107| .cse0) .cse1))) |v_#memory_$Pointer$.base_107|) (= (store |v_#memory_int_130| .cse2 (store (select |v_#memory_int_130| .cse2) .cse3 2685476833)) |c_#memory_int|) (= |c_#memory_$Pointer$.base| (store .cse4 .cse2 (store (select .cse4 .cse2) .cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse3)))) (= |v_#memory_$Pointer$.offset_107| (store |v_#memory_$Pointer$.offset_108| .cse5 (store (select |v_#memory_$Pointer$.offset_108| .cse5) .cse6 (select (select |v_#memory_$Pointer$.offset_107| .cse5) .cse6)))) (= (store |v_#memory_$Pointer$.offset_107| .cse0 (store (select |v_#memory_$Pointer$.offset_107| .cse0) .cse1 (select (select |v_#memory_$Pointer$.offset_106| .cse0) .cse1))) |v_#memory_$Pointer$.offset_106|) (= |v_#memory_int_129| (store |v_#memory_int_421| .cse7 (store (select |v_#memory_int_421| .cse7) .cse8 (select (select |v_#memory_int_129| .cse7) .cse8)))) (= (let ((.cse9 (let ((.cse12 (let ((.cse13 (store |v_#memory_int_129| .cse14 (store (select |v_#memory_int_129| .cse14) .cse15 32)))) (store .cse13 .cse5 (store (select .cse13 .cse5) .cse6 5))))) (store .cse12 .cse0 (store (select .cse12 .cse0) .cse1 8))))) (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 (select (select |v_#memory_int_130| .cse10) .cse11)))) |v_#memory_int_130|) (= (store |v_#length_34| |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 384) |c_#length|) (= |c_#memory_$Pointer$.offset| (store .cse16 .cse2 (store (select .cse16 .cse2) .cse3 (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3)))) (= (store .cse17 .cse14 (store (select .cse17 .cse14) .cse15 (select (select |v_#memory_$Pointer$.base_106| .cse14) .cse15))) |v_#memory_$Pointer$.base_106|) (<= (+ |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 1) |c_#StackHeapBarrier|) (not (= |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 0)) (= (store |v_#memory_$Pointer$.base_106| .cse5 (store (select |v_#memory_$Pointer$.base_106| .cse5) .cse6 (select (select |v_#memory_$Pointer$.base_108| .cse5) .cse6))) |v_#memory_$Pointer$.base_108|) (= (select |v_#valid_52| |v_ULTIMATE.start_main_#t~malloc61#1.base_6|) 0) (let ((.cse18 (exists ((|v_#Ultimate.C_memset_#t~loopctr228_26| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr228_26|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr228_26| 4294967296))))) (.cse22 (exists ((|v_#memory_$Pointer$.offset_313| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_314| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_15| (Array Int (Array Int Int)))) (let ((.cse32 (select |v_#memory_$Pointer$.offset_15| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_313| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_313| |c_ULTIMATE.start_main_~user~0#1.base|) 36 (select .cse32 36))) |v_#memory_$Pointer$.offset_15|) (= (store |v_#memory_$Pointer$.offset_15| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse32 28 0) 32 (select (select |v_#memory_$Pointer$.offset_314| |c_ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.offset_314|)))))) (or (and .cse18 (exists ((|v_#memory_int_418| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_14| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int))) (|v_#memory_int_28| (Array Int (Array Int Int))) (|v_#memory_int_420| (Array Int (Array Int Int)))) (let ((.cse19 (select |v_#memory_int_28| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse20 (select |v_#memory_int_128| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse21 (select |v_#memory_int_420| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= |v_#memory_int_128| (store |v_#memory_int_28| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse19 32 4) 16 (select .cse20 16)))) (= |v_old(#memory_int)_AFTER_CALL_14| (store |v_#memory_int_420| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse21 8 (select (select |v_old(#memory_int)_AFTER_CALL_14| |c_ULTIMATE.start_main_~user~0#1.base|) 8)))) (= (store |v_#memory_int_418| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_418| |c_ULTIMATE.start_main_~user~0#1.base|) 36 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select .cse19 28))) |v_#memory_int_28|) (= (store |v_#memory_int_128| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse20 12 (select .cse21 12))) |v_#memory_int_420|)))) .cse22 (exists ((|v_#valid_51| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_14| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_314| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_313| (Array Int (Array Int Int))) (|v_#length_33| (Array Int Int)) (|v_#memory_$Pointer$.base_15| (Array Int (Array Int Int)))) (let ((.cse24 (select |v_#memory_$Pointer$.base_15| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse25 (select |v_#memory_$Pointer$.base_314| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse23 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_14| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (and (not (= .cse23 0)) (= (store |v_#valid_51| .cse23 1) |v_#valid_52|) (<= (+ .cse23 1) |c_#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_313| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_313| |c_ULTIMATE.start_main_~user~0#1.base|) 36 (select .cse24 36))) |v_#memory_$Pointer$.base_15|) (= |v_ULTIMATE.start_main_#t~mem54#1.base_14| .cse23) (= (store |v_#memory_$Pointer$.base_15| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse24 28 |c_ULTIMATE.start_main_~user~0#1.base|) 32 (select .cse25 32))) |v_#memory_$Pointer$.base_314|) (= (store |v_#memory_$Pointer$.base_314| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (store .cse25 16 0) 12 0) 8 .cse23)) |v_old(#memory_$Pointer$.base)_AFTER_CALL_14|) (= (store |v_#length_33| .cse23 44) |v_#length_34|) (= (select |v_#valid_51| .cse23) 0))))) (and .cse18 (exists ((|v_#valid_51| (Array Int Int)) (|v_#memory_$Pointer$.base_314| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_313| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_13| (Array Int (Array Int Int))) (|v_#length_33| (Array Int Int)) (|v_#memory_$Pointer$.base_15| (Array Int (Array Int Int)))) (let ((.cse27 (select |v_#memory_$Pointer$.base_15| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse28 (select |v_#memory_$Pointer$.base_314| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse26 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_13| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (and (= (select |v_#valid_51| .cse26) 0) (= (store |v_#valid_51| .cse26 1) |v_#valid_52|) (= .cse26 |v_ULTIMATE.start_main_#t~mem54#1.base_14|) (<= (+ .cse26 1) |c_#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_313| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_313| |c_ULTIMATE.start_main_~user~0#1.base|) 36 (select .cse27 36))) |v_#memory_$Pointer$.base_15|) (= (store |v_#memory_$Pointer$.base_15| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse27 28 |c_ULTIMATE.start_main_~user~0#1.base|) 32 (select .cse28 32))) |v_#memory_$Pointer$.base_314|) (not (= .cse26 0)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_13| (store |v_#memory_$Pointer$.base_314| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (store .cse28 16 0) 12 0) 8 .cse26))) (= (store |v_#length_33| .cse26 44) |v_#length_34|)))) .cse22 (exists ((|v_#memory_int_418| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_int_28| (Array Int (Array Int Int))) (|v_#memory_int_420| (Array Int (Array Int Int)))) (let ((.cse29 (select |v_#memory_int_28| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse30 (select |v_#memory_int_128| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse31 (select |v_#memory_int_420| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= |v_#memory_int_128| (store |v_#memory_int_28| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse29 32 4) 16 (select .cse30 16)))) (= (store |v_#memory_int_418| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_418| |c_ULTIMATE.start_main_~user~0#1.base|) 36 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select .cse29 28))) |v_#memory_int_28|) (= (store |v_#memory_int_420| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse31 8 (select (select |v_#memory_int_BEFORE_CALL_18| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) |v_#memory_int_BEFORE_CALL_18|) (= (store |v_#memory_int_128| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse30 12 (select .cse31 12))) |v_#memory_int_420|))))))) (= |v_#memory_$Pointer$.offset_108| (store .cse33 .cse14 (store (select .cse33 .cse14) .cse15 (select (select |v_#memory_$Pointer$.offset_108| .cse14) .cse15))))))))) (= (select (select |c_#memory_$Pointer$.offset| .cse34) .cse35) |c_ULTIMATE.start_main_#t~mem64#1.offset|) (= |c_ULTIMATE.start_main_~#i~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| .cse34) .cse35) |c_ULTIMATE.start_main_#t~mem64#1.base|))) is different from false