./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/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_04bd8b4e-d9d8-4c40-bad6-7aa989388036/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 961225f1af8bda006e5a86aed07a62a3e426daf2d218eb9a2332372592a548eb --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:14:12,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:14:12,752 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-14 05:14:12,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:14:12,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:14:12,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:14:12,781 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:14:12,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:14:12,782 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:14:12,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:14:12,782 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:14:12,782 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:14:12,783 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:14:12,783 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:14:12,783 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:14:12,783 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:14:12,783 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:14:12,783 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:14:12,784 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:14:12,784 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:14:12,784 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:14:12,784 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:14:12,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:14:12,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:14:12,785 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:14:12,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:14:12,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:14:12,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:14:12,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:14:12,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:14:12,785 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:14:12,785 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:14:12,785 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:14:12,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:14:12,785 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:14:12,786 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:14:12,786 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:14:12,786 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:14:12,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:14:12,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:14:12,786 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:14:12,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:14:12,786 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:14:12,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:14:12,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:14:12,786 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:14:12,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:14:12,787 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_04bd8b4e-d9d8-4c40-bad6-7aa989388036/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 ! call(reach_error())) ) 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 -> 961225f1af8bda006e5a86aed07a62a3e426daf2d218eb9a2332372592a548eb [2024-11-14 05:14:13,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:14:13,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:14:13,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:14:13,152 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:14:13,154 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:14:13,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i Unable to find full path for "g++" [2024-11-14 05:14:15,021 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:14:15,537 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:14:15,537 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i [2024-11-14 05:14:15,563 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/bin/utaipan-verify-sOmjnqqW8E/data/bfca87624/a86743218dc0424c94e7f2e6b56efc86/FLAGa927b0c44 [2024-11-14 05:14:15,593 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/bin/utaipan-verify-sOmjnqqW8E/data/bfca87624/a86743218dc0424c94e7f2e6b56efc86 [2024-11-14 05:14:15,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:14:15,598 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:14:15,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:14:15,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:14:15,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:14:15,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:14:15" (1/1) ... [2024-11-14 05:14:15,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15f9681d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:15, skipping insertion in model container [2024-11-14 05:14:15,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:14:15" (1/1) ... [2024-11-14 05:14:15,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:14:16,309 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i[33021,33034] [2024-11-14 05:14:16,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i[84583,84596] [2024-11-14 05:14:16,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:14:16,608 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:14:16,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i[33021,33034] [2024-11-14 05:14:16,820 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i[84583,84596] [2024-11-14 05:14:16,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:14:16,866 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:14:16,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:16 WrapperNode [2024-11-14 05:14:16,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:14:16,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:14:16,868 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:14:16,868 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:14:16,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:16" (1/1) ... [2024-11-14 05:14:16,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:16" (1/1) ... [2024-11-14 05:14:17,074 INFO L138 Inliner]: procedures = 177, calls = 773, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3413 [2024-11-14 05:14:17,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:14:17,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:14:17,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:14:17,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:14:17,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:16" (1/1) ... [2024-11-14 05:14:17,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:16" (1/1) ... [2024-11-14 05:14:17,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:16" (1/1) ... [2024-11-14 05:14:17,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:16" (1/1) ... [2024-11-14 05:14:17,148 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:16" (1/1) ... [2024-11-14 05:14:17,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:16" (1/1) ... [2024-11-14 05:14:17,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:16" (1/1) ... [2024-11-14 05:14:17,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:16" (1/1) ... [2024-11-14 05:14:17,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:14:17,244 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:14:17,244 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:14:17,244 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:14:17,245 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:16" (1/1) ... [2024-11-14 05:14:17,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:14:17,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:14:17,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:14:17,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:14:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:14:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-14 05:14:17,319 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-14 05:14:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:14:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-14 05:14:17,319 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-14 05:14:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:14:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:14:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:14:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 05:14:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:14:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:14:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:14:17,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:14:17,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:14:17,589 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:14:17,591 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:14:21,519 INFO L? ?]: Removed 817 outVars from TransFormulas that were not future-live. [2024-11-14 05:14:21,519 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:14:23,729 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:14:23,729 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-14 05:14:23,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:14:23 BoogieIcfgContainer [2024-11-14 05:14:23,730 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:14:23,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:14:23,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:14:23,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:14:23,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:14:15" (1/3) ... [2024-11-14 05:14:23,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8632da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:14:23, skipping insertion in model container [2024-11-14 05:14:23,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:14:16" (2/3) ... [2024-11-14 05:14:23,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8632da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:14:23, skipping insertion in model container [2024-11-14 05:14:23,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:14:23" (3/3) ... [2024-11-14 05:14:23,740 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test9-2.i [2024-11-14 05:14:23,758 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:14:23,759 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test9-2.i that has 3 procedures, 1121 locations, 1 initial locations, 36 loop locations, and 2 error locations. [2024-11-14 05:14:23,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:14:23,894 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=LoopHeads, 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;@4c7bbc11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:14:23,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-14 05:14:23,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 1121 states, 613 states have (on average 1.9510603588907014) internal successors, (1196), 1115 states have internal predecessors, (1196), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-14 05:14:23,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 05:14:23,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:14:23,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:14:23,921 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:14:23,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:14:23,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2053168779, now seen corresponding path program 1 times [2024-11-14 05:14:23,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:14:23,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010715870] [2024-11-14 05:14:23,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:14:23,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:14:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:14:24,125 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 05:14:24,126 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:14:24,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010715870] [2024-11-14 05:14:24,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010715870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:14:24,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:14:24,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:14:24,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418242122] [2024-11-14 05:14:24,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:14:24,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 05:14:24,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:14:24,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 05:14:24,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 05:14:24,169 INFO L87 Difference]: Start difference. First operand has 1121 states, 613 states have (on average 1.9510603588907014) internal successors, (1196), 1115 states have internal predecessors, (1196), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 05:14:26,221 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 05:14:28,231 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 05:14:29,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:14:31,711 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 05:14:32,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:14:32,300 INFO L93 Difference]: Finished difference Result 2241 states and 4903 transitions. [2024-11-14 05:14:32,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 05:14:32,307 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 05:14:32,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:14:32,343 INFO L225 Difference]: With dead ends: 2241 [2024-11-14 05:14:32,344 INFO L226 Difference]: Without dead ends: 1104 [2024-11-14 05:14:32,357 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 05:14:32,359 INFO L432 NwaCegarLoop]: 2111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:14:32,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2111 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 7.9s Time] [2024-11-14 05:14:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2024-11-14 05:14:32,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1104. [2024-11-14 05:14:32,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 597 states have (on average 1.864321608040201) internal successors, (1113), 1098 states have internal predecessors, (1113), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-14 05:14:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 2119 transitions. [2024-11-14 05:14:32,874 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 2119 transitions. Word has length 8 [2024-11-14 05:14:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:14:32,874 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 2119 transitions. [2024-11-14 05:14:32,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 05:14:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 2119 transitions. [2024-11-14 05:14:32,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:14:32,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:14:32,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:14:32,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:14:32,878 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:14:32,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:14:32,879 INFO L85 PathProgramCache]: Analyzing trace with hash -612756812, now seen corresponding path program 1 times [2024-11-14 05:14:32,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:14:32,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707298435] [2024-11-14 05:14:32,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:14:32,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:14:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:14:33,598 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 05:14:33,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:14:33,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707298435] [2024-11-14 05:14:33,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707298435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:14:33,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:14:33,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 05:14:33,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466140261] [2024-11-14 05:14:33,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:14:33,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:14:33,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:14:33,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:14:33,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 05:14:33,604 INFO L87 Difference]: Start difference. First operand 1104 states and 2119 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 05:14:35,661 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 05:14:37,664 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 05:14:39,677 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 05:14:41,682 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 05:14:44,013 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 05:14:45,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:14:47,678 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 05:14:49,685 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 05:14:51,690 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 05:14:55,004 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 05:14:57,015 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 05:14:58,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:14:58,802 INFO L93 Difference]: Finished difference Result 3206 states and 6236 transitions. [2024-11-14 05:14:58,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:14:58,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2024-11-14 05:14:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:14:58,831 INFO L225 Difference]: With dead ends: 3206 [2024-11-14 05:14:58,831 INFO L226 Difference]: Without dead ends: 2159 [2024-11-14 05:14:58,838 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 05:14:58,839 INFO L432 NwaCegarLoop]: 2339 mSDtfsCounter, 1060 mSDsluCounter, 3915 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 2 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 6254 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:14:58,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 6254 Invalid, 607 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 595 Invalid, 10 Unknown, 0 Unchecked, 24.9s Time] [2024-11-14 05:14:58,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2159 states. [2024-11-14 05:14:59,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2159 to 1106. [2024-11-14 05:14:59,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 599 states have (on average 1.8614357262103507) internal successors, (1115), 1100 states have internal predecessors, (1115), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-14 05:14:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 2121 transitions. [2024-11-14 05:14:59,553 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 2121 transitions. Word has length 22 [2024-11-14 05:14:59,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:14:59,553 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 2121 transitions. [2024-11-14 05:14:59,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 05:14:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 2121 transitions. [2024-11-14 05:14:59,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-14 05:14:59,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:14:59,556 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:14:59,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:14:59,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:14:59,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:14:59,558 INFO L85 PathProgramCache]: Analyzing trace with hash -439385909, now seen corresponding path program 1 times [2024-11-14 05:14:59,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:14:59,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738239354] [2024-11-14 05:14:59,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:14:59,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:14:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:15:00,015 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 05:15:00,016 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:15:00,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738239354] [2024-11-14 05:15:00,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738239354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:15:00,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:15:00,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:15:00,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037354282] [2024-11-14 05:15:00,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:15:00,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:15:00,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:15:00,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:15:00,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:15:00,019 INFO L87 Difference]: Start difference. First operand 1106 states and 2121 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 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 05:15:02,046 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 05:15:04,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 05:15:07,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:15:09,194 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 05:15:11,199 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 05:15:13,207 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 05:15:15,215 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 05:15:17,300 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 05:15:19,309 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 05:15:20,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:15:20,291 INFO L93 Difference]: Finished difference Result 3247 states and 6281 transitions. [2024-11-14 05:15:20,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:15:20,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 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 50 [2024-11-14 05:15:20,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:15:20,321 INFO L225 Difference]: With dead ends: 3247 [2024-11-14 05:15:20,321 INFO L226 Difference]: Without dead ends: 2144 [2024-11-14 05:15:20,330 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 05:15:20,332 INFO L432 NwaCegarLoop]: 2364 mSDtfsCounter, 1028 mSDsluCounter, 2089 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 4453 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:15:20,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1528 Valid, 4453 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 20.1s Time] [2024-11-14 05:15:20,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2144 states. [2024-11-14 05:15:21,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2144 to 2142. [2024-11-14 05:15:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2142 states, 1135 states have (on average 1.8977973568281938) internal successors, (2154), 2136 states have internal predecessors, (2154), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-14 05:15:21,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 4160 transitions. [2024-11-14 05:15:21,080 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 4160 transitions. Word has length 50 [2024-11-14 05:15:21,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:15:21,081 INFO L471 AbstractCegarLoop]: Abstraction has 2142 states and 4160 transitions. [2024-11-14 05:15:21,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 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 05:15:21,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 4160 transitions. [2024-11-14 05:15:21,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-14 05:15:21,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:15:21,088 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] [2024-11-14 05:15:21,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:15:21,088 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:15:21,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:15:21,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1367543372, now seen corresponding path program 1 times [2024-11-14 05:15:21,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:15:21,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67995730] [2024-11-14 05:15:21,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:15:21,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:15:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:15:21,873 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 05:15:21,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:15:21,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67995730] [2024-11-14 05:15:21,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67995730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:15:21,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:15:21,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:15:21,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756543435] [2024-11-14 05:15:21,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:15:21,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:15:21,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:15:21,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:15:21,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:15:21,878 INFO L87 Difference]: Start difference. First operand 2142 states and 4160 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 05:15:23,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:15:25,347 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 05:15:27,353 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 05:15:29,356 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 05:15:31,676 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 05:15:33,679 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 05:15:35,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 05:15:37,698 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 05:15:39,720 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 05:15:41,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 05:15:43,749 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 05:15:45,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-11-14 05:15:47,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:15:47,752 INFO L93 Difference]: Finished difference Result 4314 states and 8359 transitions. [2024-11-14 05:15:47,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:15:47,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 63 [2024-11-14 05:15:47,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:15:47,776 INFO L225 Difference]: With dead ends: 4314 [2024-11-14 05:15:47,776 INFO L226 Difference]: Without dead ends: 2189 [2024-11-14 05:15:47,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:15:47,788 INFO L432 NwaCegarLoop]: 2342 mSDtfsCounter, 3230 mSDsluCounter, 2621 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 1003 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3731 SdHoareTripleChecker+Valid, 4963 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1003 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2024-11-14 05:15:47,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3731 Valid, 4963 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1003 Valid, 599 Invalid, 9 Unknown, 0 Unchecked, 25.6s Time] [2024-11-14 05:15:47,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2024-11-14 05:15:48,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 1120. [2024-11-14 05:15:48,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 613 states have (on average 1.8401305057096249) internal successors, (1128), 1114 states have internal predecessors, (1128), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-14 05:15:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 2134 transitions. [2024-11-14 05:15:48,306 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 2134 transitions. Word has length 63 [2024-11-14 05:15:48,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:15:48,307 INFO L471 AbstractCegarLoop]: Abstraction has 1120 states and 2134 transitions. [2024-11-14 05:15:48,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 05:15:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 2134 transitions. [2024-11-14 05:15:48,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-14 05:15:48,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:15:48,311 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] [2024-11-14 05:15:48,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 05:15:48,311 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:15:48,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:15:48,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1739104990, now seen corresponding path program 1 times [2024-11-14 05:15:48,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:15:48,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588136317] [2024-11-14 05:15:48,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:15:48,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:15:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:15:50,277 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 05:15:50,277 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:15:50,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588136317] [2024-11-14 05:15:50,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588136317] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:15:50,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598694448] [2024-11-14 05:15:50,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:15:50,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:15:50,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:15:50,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:15:50,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:16:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:16:04,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 05:16:04,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:16:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:16:04,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:16:04,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598694448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:16:04,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:16:04,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-14 05:16:04,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141974562] [2024-11-14 05:16:04,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:16:04,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 05:16:04,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:16:04,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 05:16:04,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:16:04,957 INFO L87 Difference]: Start difference. First operand 1120 states and 2134 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:16:06,992 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 05:16:09,009 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 05:16:11,013 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 05:16:13,023 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 05:16:15,026 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 05:16:17,028 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 05:16:19,209 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 05:16:21,218 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 05:16:23,228 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 05:16:25,244 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 05:16:27,257 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 05:16:29,260 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 05:16:31,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:16:31,223 INFO L93 Difference]: Finished difference Result 2222 states and 4251 transitions. [2024-11-14 05:16:31,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 05:16:31,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 71 [2024-11-14 05:16:31,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:16:31,239 INFO L225 Difference]: With dead ends: 2222 [2024-11-14 05:16:31,240 INFO L226 Difference]: Without dead ends: 1122 [2024-11-14 05:16:31,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 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 05:16:31,246 INFO L432 NwaCegarLoop]: 2096 mSDtfsCounter, 0 mSDsluCounter, 4188 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6284 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:16:31,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6284 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 12 Unknown, 0 Unchecked, 26.1s Time] [2024-11-14 05:16:31,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2024-11-14 05:16:31,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2024-11-14 05:16:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 614 states have (on average 1.8403908794788273) internal successors, (1130), 1116 states have internal predecessors, (1130), 503 states have call successors, (503), 2 states have call predecessors, (503), 3 states have return successors, (504), 4 states have call predecessors, (504), 503 states have call successors, (504) [2024-11-14 05:16:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 2137 transitions. [2024-11-14 05:16:31,516 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 2137 transitions. Word has length 71 [2024-11-14 05:16:31,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:16:31,518 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 2137 transitions. [2024-11-14 05:16:31,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:16:31,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 2137 transitions. [2024-11-14 05:16:31,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 05:16:31,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:16:31,521 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] [2024-11-14 05:16:31,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:16:31,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:16:31,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 05:16:31,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:16:31,723 INFO L85 PathProgramCache]: Analyzing trace with hash -73852492, now seen corresponding path program 1 times [2024-11-14 05:16:31,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:16:31,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74071957] [2024-11-14 05:16:31,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:16:31,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:16:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:16:33,861 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 05:16:33,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:16:33,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74071957] [2024-11-14 05:16:33,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74071957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:16:33,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918244969] [2024-11-14 05:16:33,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:16:33,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:16:33,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:16:33,866 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:16:33,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04bd8b4e-d9d8-4c40-bad6-7aa989388036/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:16:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:16:54,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 05:16:54,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:16:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:16:54,349 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:16:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:16:54,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918244969] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:16:54,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1279188015] [2024-11-14 05:16:54,554 INFO L159 IcfgInterpreter]: Started Sifa with 67 locations of interest [2024-11-14 05:16:54,554 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:16:54,558 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:16:54,565 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:16:54,566 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:17:46,331 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 399 for LOIs [2024-11-14 05:17:51,321 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:28:41,743 WARN L286 SmtUtils]: Spent 9.86m 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 05:28:53,916 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) (exists ((|v_#memory_int_147| (Array Int (Array Int Int))) (|v_#memory_int_477| (Array Int (Array Int Int))) (|v_#valid_72| (Array Int Int)) (|v_#length_33| (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem54#1.base_17| Int) (|v_#memory_$Pointer$.offset_395| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_136| (Array Int (Array Int Int))) (|v_#memory_int_146| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_135| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_134| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_134| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc61#1.base_6| Int) (|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_395| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_136| (Array Int (Array Int Int)))) (let ((.cse31 (select (select |v_#memory_$Pointer$.base_395| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse32 (+ 16 (select (select |v_#memory_$Pointer$.offset_395| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (.cse5 (select (select |v_#memory_$Pointer$.base_134| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse6 (select (select |v_#memory_$Pointer$.offset_136| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (let ((.cse33 (store |v_#memory_$Pointer$.offset_136| .cse5 (store (select |v_#memory_$Pointer$.offset_136| .cse5) .cse6 0))) (.cse29 (store |v_#memory_$Pointer$.base_134| .cse5 (store (select |v_#memory_$Pointer$.base_134| .cse5) .cse6 |v_ULTIMATE.start_main_#t~malloc61#1.base_6|))) (.cse30 (store |v_#memory_$Pointer$.offset_395| .cse31 (store (select |v_#memory_$Pointer$.offset_395| .cse31) .cse32 8))) (.cse28 (store |v_#memory_$Pointer$.base_395| .cse31 (store (select |v_#memory_$Pointer$.base_395| .cse31) .cse32 |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse9 (select (select |v_#memory_$Pointer$.base_135| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse10 (+ (select (select |v_#memory_$Pointer$.offset_134| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 8)) (.cse2 (select (select |v_#memory_$Pointer$.base_136| |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse3 (+ (select (select |v_#memory_$Pointer$.offset_135| |c_ULTIMATE.start_main_~user~0#1.base|) 8) 20)) (.cse11 (select (select .cse28 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse12 (+ (select (select .cse30 |c_ULTIMATE.start_main_~user~0#1.base|) 8) 4)) (.cse0 (select (select .cse29 |c_ULTIMATE.start_main_~user~0#1.base|) 8)) (.cse1 (+ 40 (select (select .cse33 |c_ULTIMATE.start_main_~user~0#1.base|) 8)))) (and (= (store |v_#memory_int_147| .cse0 (store (select |v_#memory_int_147| .cse0) .cse1 2685476833)) |c_#memory_int|) (= (store |v_#memory_$Pointer$.base_136| .cse2 (store (select |v_#memory_$Pointer$.base_136| .cse2) .cse3 (select (select |v_#memory_$Pointer$.base_134| .cse2) .cse3))) |v_#memory_$Pointer$.base_134|) (= (let ((.cse4 (let ((.cse7 (let ((.cse8 (store |v_#memory_int_146| .cse11 (store (select |v_#memory_int_146| .cse11) .cse12 32)))) (store .cse8 .cse9 (store (select .cse8 .cse9) .cse10 5))))) (store .cse7 .cse2 (store (select .cse7 .cse2) .cse3 8))))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 (select (select |v_#memory_int_147| .cse5) .cse6)))) |v_#memory_int_147|) (let ((.cse16 (exists ((|v_#Ultimate.C_memset_#t~loopctr274_27| Int)) (and (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr274_27| 4294967296)) (<= 0 |v_#Ultimate.C_memset_#t~loopctr274_27|)))) (.cse17 (exists ((|v_#memory_$Pointer$.offset_43| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_392| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_393| (Array Int (Array Int Int)))) (let ((.cse27 (select |v_#memory_$Pointer$.offset_43| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_43| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse27 28 0) 32 (select (select |v_#memory_$Pointer$.offset_393| |c_ULTIMATE.start_main_~user~0#1.base|) 32))) |v_#memory_$Pointer$.offset_393|) (= |v_#memory_$Pointer$.offset_43| (store |v_#memory_$Pointer$.offset_392| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.offset_392| |c_ULTIMATE.start_main_~user~0#1.base|) 36 (select .cse27 36))))))))) (or (and (exists ((|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_18| (Array Int (Array Int Int))) (|v_#memory_int_474| (Array Int (Array Int Int))) (|v_#memory_int_145| (Array Int (Array Int Int))) (|v_#memory_int_476| (Array Int (Array Int Int)))) (let ((.cse14 (select |v_#memory_int_145| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse15 (select |v_#memory_int_476| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse13 (select |v_#memory_int_45| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_int_45| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse13 32 4) 16 (select .cse14 16))) |v_#memory_int_145|) (= (store |v_#memory_int_145| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse14 12 (select .cse15 12))) |v_#memory_int_476|) (= (store |v_#memory_int_476| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse15 8 (select (select |v_#memory_int_BEFORE_CALL_18| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) |v_#memory_int_BEFORE_CALL_18|) (= |v_#memory_int_45| (store |v_#memory_int_474| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_474| |c_ULTIMATE.start_main_~user~0#1.base|) 36 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select .cse13 28))))))) .cse16 .cse17 (exists ((|v_#memory_$Pointer$.base_393| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_392| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_43| (Array Int (Array Int Int))) (|v_#valid_71| (Array Int Int)) (|v_#length_32| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_13| (Array Int (Array Int Int)))) (let ((.cse18 (select |v_#memory_$Pointer$.base_43| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse19 (select |v_#memory_$Pointer$.base_393| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse20 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_13| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (and (= (store |v_#memory_$Pointer$.base_392| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_392| |c_ULTIMATE.start_main_~user~0#1.base|) 36 (select .cse18 36))) |v_#memory_$Pointer$.base_43|) (= (store |v_#memory_$Pointer$.base_393| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (store .cse19 16 0) 12 0) 8 .cse20)) |v_old(#memory_$Pointer$.base)_AFTER_CALL_13|) (<= (+ .cse20 1) |c_#StackHeapBarrier|) (= |v_#length_33| (store |v_#length_32| .cse20 44)) (not (= .cse20 0)) (= (store |v_#memory_$Pointer$.base_43| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse18 28 |c_ULTIMATE.start_main_~user~0#1.base|) 32 (select .cse19 32))) |v_#memory_$Pointer$.base_393|) (= (select |v_#valid_71| .cse20) 0) (= (store |v_#valid_71| .cse20 1) |v_#valid_72|) (= .cse20 |v_ULTIMATE.start_main_#t~mem54#1.base_17|))))) (and (exists ((|v_#memory_$Pointer$.base_393| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_392| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_43| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_14| (Array Int (Array Int Int))) (|v_#valid_71| (Array Int Int)) (|v_#length_32| (Array Int Int))) (let ((.cse21 (select |v_#memory_$Pointer$.base_43| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse23 (select |v_#memory_$Pointer$.base_393| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse22 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_14| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) (and (= (store |v_#memory_$Pointer$.base_392| |c_ULTIMATE.start_main_~user~0#1.base| (store (select |v_#memory_$Pointer$.base_392| |c_ULTIMATE.start_main_~user~0#1.base|) 36 (select .cse21 36))) |v_#memory_$Pointer$.base_43|) (not (= .cse22 0)) (<= (+ .cse22 1) |c_#StackHeapBarrier|) (= |v_#valid_72| (store |v_#valid_71| .cse22 1)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_14| (store |v_#memory_$Pointer$.base_393| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (store .cse23 16 0) 12 0) 8 .cse22))) (= (store |v_#memory_$Pointer$.base_43| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse21 28 |c_ULTIMATE.start_main_~user~0#1.base|) 32 (select .cse23 32))) |v_#memory_$Pointer$.base_393|) (= (select |v_#valid_71| .cse22) 0) (= |v_ULTIMATE.start_main_#t~mem54#1.base_17| .cse22) (= (store |v_#length_32| .cse22 44) |v_#length_33|)))) (exists ((|v_#memory_int_45| (Array Int (Array Int Int))) (|v_#memory_int_474| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_20| (Array Int (Array Int Int))) (|v_#memory_int_145| (Array Int (Array Int Int))) (|v_#memory_int_476| (Array Int (Array Int Int)))) (let ((.cse26 (select |v_#memory_int_145| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse24 (select |v_#memory_int_476| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse25 (select |v_#memory_int_45| |c_ULTIMATE.start_main_~user~0#1.base|))) (and (= (store |v_#memory_int_476| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse24 8 (select (select |v_#memory_int_BEFORE_CALL_20| |c_ULTIMATE.start_main_~user~0#1.base|) 8))) |v_#memory_int_BEFORE_CALL_20|) (= (store |v_#memory_int_45| |c_ULTIMATE.start_main_~user~0#1.base| (store (store .cse25 32 4) 16 (select .cse26 16))) |v_#memory_int_145|) (= (store |v_#memory_int_145| |c_ULTIMATE.start_main_~user~0#1.base| (store .cse26 12 (select .cse24 12))) |v_#memory_int_476|) (= |v_#memory_int_45| (store |v_#memory_int_474| |c_ULTIMATE.start_main_~user~0#1.base| (store (store (select |v_#memory_int_474| |c_ULTIMATE.start_main_~user~0#1.base|) 36 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) 28 (select .cse25 28))))))) .cse16 .cse17))) (= |v_#memory_$Pointer$.base_136| (store |v_#memory_$Pointer$.base_135| .cse9 (store (select |v_#memory_$Pointer$.base_135| .cse9) .cse10 (select (select |v_#memory_$Pointer$.base_136| .cse9) .cse10)))) (= (store |v_#memory_$Pointer$.offset_134| .cse9 (store (select |v_#memory_$Pointer$.offset_134| .cse9) .cse10 (select (select |v_#memory_$Pointer$.offset_135| .cse9) .cse10))) |v_#memory_$Pointer$.offset_135|) (= |v_#memory_$Pointer$.base_135| (store .cse28 .cse11 (store (select .cse28 .cse11) .cse12 (select (select |v_#memory_$Pointer$.base_135| .cse11) .cse12)))) (<= (+ |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |v_#valid_72| |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 1)) (not (= |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 0)) (= (store .cse29 .cse0 (store (select .cse29 .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) |c_#memory_$Pointer$.base|) (= |v_#memory_$Pointer$.offset_136| (store |v_#memory_$Pointer$.offset_135| .cse2 (store (select |v_#memory_$Pointer$.offset_135| .cse2) .cse3 (select (select |v_#memory_$Pointer$.offset_136| .cse2) .cse3)))) (= (store .cse30 .cse11 (store (select .cse30 .cse11) .cse12 (select (select |v_#memory_$Pointer$.offset_134| .cse11) .cse12))) |v_#memory_$Pointer$.offset_134|) (= (store |v_#memory_int_477| .cse31 (store (select |v_#memory_int_477| .cse31) .cse32 (select (select |v_#memory_int_146| .cse31) .cse32))) |v_#memory_int_146|) (= (select |v_#valid_72| |v_ULTIMATE.start_main_#t~malloc61#1.base_6|) 0) (= (store |v_#length_33| |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 384) |c_#length|) (= |c_#memory_$Pointer$.offset| (store .cse33 .cse0 (store (select .cse33 .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))))))))) (<= 2 |c_ULTIMATE.start_main_~#i~0#1.base|) (= |c_ULTIMATE.start_main_~user~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= (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