./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_string_eq_ignore_case_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/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_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_string_eq_ignore_case_harness_negated.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/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 64bit --witnessprinter.graph.data.programhash ac2d6f81182a30a3913994ab9f22d7c2f1f468956657d41080d094a676bb2180 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:55:14,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:55:14,118 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-64bit-Taipan_Default.epf [2024-11-14 03:55:14,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:55:14,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:55:14,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:55:14,168 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:55:14,168 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:55:14,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:55:14,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:55:14,170 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:55:14,170 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:55:14,170 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:55:14,170 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:55:14,170 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:55:14,170 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:55:14,171 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:55:14,171 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:55:14,171 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:55:14,171 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:55:14,171 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:55:14,171 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:55:14,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:55:14,172 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 03:55:14,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:55:14,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:55:14,173 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 03:55:14,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:55:14,173 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 03:55:14,173 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:55:14,173 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 03:55:14,173 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:55:14,173 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:55:14,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:55:14,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:55:14,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:55:14,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:55:14,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:55:14,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 03:55:14,174 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:55:14,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:55:14,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:55:14,174 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:55:14,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:55:14,175 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_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac2d6f81182a30a3913994ab9f22d7c2f1f468956657d41080d094a676bb2180 [2024-11-14 03:55:14,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:55:14,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:55:14,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:55:14,508 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:55:14,508 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:55:14,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/aws-c-common/aws_string_eq_ignore_case_harness_negated.i Unable to find full path for "g++" [2024-11-14 03:55:16,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:55:16,969 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:55:16,969 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/sv-benchmarks/c/aws-c-common/aws_string_eq_ignore_case_harness_negated.i [2024-11-14 03:55:17,019 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/bin/utaipan-verify-sOmjnqqW8E/data/4253fe454/2238a9d49bf944e7a030c54862721865/FLAGf47fc7924 [2024-11-14 03:55:17,038 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/bin/utaipan-verify-sOmjnqqW8E/data/4253fe454/2238a9d49bf944e7a030c54862721865 [2024-11-14 03:55:17,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:55:17,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:55:17,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:55:17,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:55:17,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:55:17,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:55:17" (1/1) ... [2024-11-14 03:55:17,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b8be91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:17, skipping insertion in model container [2024-11-14 03:55:17,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:55:17" (1/1) ... [2024-11-14 03:55:17,157 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:55:17,458 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_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/sv-benchmarks/c/aws-c-common/aws_string_eq_ignore_case_harness_negated.i[4499,4512] [2024-11-14 03:55:17,465 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_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/sv-benchmarks/c/aws-c-common/aws_string_eq_ignore_case_harness_negated.i[4559,4572] [2024-11-14 03:55:18,671 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:18,672 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:18,673 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:18,674 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:18,676 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:18,697 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:18,698 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:18,701 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:18,701 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:19,839 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:19,839 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:19,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:55:19,955 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:55:19,979 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_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/sv-benchmarks/c/aws-c-common/aws_string_eq_ignore_case_harness_negated.i[4499,4512] [2024-11-14 03:55:19,979 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_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/sv-benchmarks/c/aws-c-common/aws_string_eq_ignore_case_harness_negated.i[4559,4572] [2024-11-14 03:55:20,066 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:20,066 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:20,067 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:20,067 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:20,068 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:20,078 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:20,079 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:20,082 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:20,083 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:20,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8556] [2024-11-14 03:55:20,351 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:20,351 WARN L1684 CHandler]: Possible shadowing of function index [2024-11-14 03:55:20,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:55:20,710 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:55:20,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:20 WrapperNode [2024-11-14 03:55:20,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:55:20,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:55:20,712 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:55:20,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:55:20,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:20" (1/1) ... [2024-11-14 03:55:20,851 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:20" (1/1) ... [2024-11-14 03:55:20,935 INFO L138 Inliner]: procedures = 670, calls = 2270, calls flagged for inlining = 57, calls inlined = 5, statements flattened = 373 [2024-11-14 03:55:20,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:55:20,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:55:20,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:55:20,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:55:20,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:20" (1/1) ... [2024-11-14 03:55:20,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:20" (1/1) ... [2024-11-14 03:55:20,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:20" (1/1) ... [2024-11-14 03:55:20,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:20" (1/1) ... [2024-11-14 03:55:20,997 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:20" (1/1) ... [2024-11-14 03:55:21,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:20" (1/1) ... [2024-11-14 03:55:21,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:20" (1/1) ... [2024-11-14 03:55:21,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:20" (1/1) ... [2024-11-14 03:55:21,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:55:21,018 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:55:21,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:55:21,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:55:21,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:20" (1/1) ... [2024-11-14 03:55:21,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:55:21,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:55:21,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:55:21,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:55:21,133 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2024-11-14 03:55:21,134 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2024-11-14 03:55:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq_ignore_case [2024-11-14 03:55:21,135 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq_ignore_case [2024-11-14 03:55:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2024-11-14 03:55:21,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2024-11-14 03:55:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2024-11-14 03:55:21,135 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2024-11-14 03:55:21,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-14 03:55:21,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:55:21,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-14 03:55:21,139 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-14 03:55:21,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:55:21,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:55:21,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:55:21,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:55:21,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:55:21,140 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2024-11-14 03:55:21,140 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2024-11-14 03:55:21,140 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-14 03:55:21,140 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-14 03:55:21,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 03:55:21,140 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2024-11-14 03:55:21,140 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2024-11-14 03:55:21,140 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-14 03:55:21,140 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-14 03:55:21,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:55:21,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:55:21,521 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:55:21,524 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:55:27,330 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2024-11-14 03:55:27,330 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:55:27,825 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:55:27,826 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 03:55:27,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:55:27 BoogieIcfgContainer [2024-11-14 03:55:27,826 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:55:27,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:55:27,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:55:27,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:55:27,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:55:17" (1/3) ... [2024-11-14 03:55:27,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f37ca98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:55:27, skipping insertion in model container [2024-11-14 03:55:27,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:55:20" (2/3) ... [2024-11-14 03:55:27,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f37ca98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:55:27, skipping insertion in model container [2024-11-14 03:55:27,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:55:27" (3/3) ... [2024-11-14 03:55:27,841 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_eq_ignore_case_harness_negated.i [2024-11-14 03:55:27,863 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:55:27,865 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_string_eq_ignore_case_harness_negated.i that has 10 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-14 03:55:27,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:55:27,957 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;@4d8a38b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:55:27,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-14 03:55:27,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 47 states have internal predecessors, (59), 23 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-14 03:55:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 03:55:27,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:55:27,975 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-14 03:55:27,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:55:27,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:55:27,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1137658563, now seen corresponding path program 1 times [2024-11-14 03:55:27,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:55:27,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144967414] [2024-11-14 03:55:27,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:55:27,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:56:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:56:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:56:31,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:56:31,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144967414] [2024-11-14 03:56:31,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144967414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:56:31,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:56:31,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:56:31,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544900827] [2024-11-14 03:56:31,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:56:31,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:56:31,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:56:31,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:56:31,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:56:31,060 INFO L87 Difference]: Start difference. First operand has 80 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 47 states have internal predecessors, (59), 23 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-14 03:56:33,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:56:35,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:56:37,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:56:38,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:56:38,544 INFO L93 Difference]: Finished difference Result 122 states and 167 transitions. [2024-11-14 03:56:38,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:56:38,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 35 [2024-11-14 03:56:38,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:56:38,556 INFO L225 Difference]: With dead ends: 122 [2024-11-14 03:56:38,556 INFO L226 Difference]: Without dead ends: 77 [2024-11-14 03:56:38,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:56:38,567 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:56:38,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 266 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 7.4s Time] [2024-11-14 03:56:38,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-14 03:56:38,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-14 03:56:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 45 states have internal predecessors, (54), 23 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-14 03:56:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2024-11-14 03:56:38,636 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 35 [2024-11-14 03:56:38,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:56:38,639 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2024-11-14 03:56:38,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-14 03:56:38,640 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2024-11-14 03:56:38,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-14 03:56:38,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:56:38,644 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:56:38,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:56:38,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:56:38,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:56:38,646 INFO L85 PathProgramCache]: Analyzing trace with hash -814516159, now seen corresponding path program 1 times [2024-11-14 03:56:38,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:56:38,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698408335] [2024-11-14 03:56:38,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:56:38,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:57:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:57:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-14 03:57:38,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:57:38,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698408335] [2024-11-14 03:57:38,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698408335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:57:38,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:57:38,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 03:57:38,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993593990] [2024-11-14 03:57:38,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:57:38,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 03:57:38,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:57:38,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 03:57:38,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:57:38,077 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 10 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-14 03:57:40,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:57:42,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:57:44,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:57:47,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:57:49,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:57:51,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:57:53,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:57:56,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:57:58,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:58:00,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:00,267 INFO L93 Difference]: Finished difference Result 115 states and 149 transitions. [2024-11-14 03:58:00,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 03:58:00,268 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 60 [2024-11-14 03:58:00,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:00,270 INFO L225 Difference]: With dead ends: 115 [2024-11-14 03:58:00,270 INFO L226 Difference]: Without dead ends: 77 [2024-11-14 03:58:00,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:58:00,272 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 20 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:00,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 689 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 9 Unknown, 0 Unchecked, 22.0s Time] [2024-11-14 03:58:00,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-14 03:58:00,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-14 03:58:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 45 states have internal predecessors, (53), 23 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-14 03:58:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2024-11-14 03:58:00,286 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 60 [2024-11-14 03:58:00,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:00,287 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2024-11-14 03:58:00,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-14 03:58:00,287 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2024-11-14 03:58:00,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-14 03:58:00,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:00,290 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-11-14 03:58:00,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:58:00,290 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:58:00,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:00,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2133618207, now seen corresponding path program 1 times [2024-11-14 03:58:00,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:58:00,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381065515] [2024-11-14 03:58:00,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:00,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:58:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:58,697 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-14 03:58:58,698 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:58:58,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381065515] [2024-11-14 03:58:58,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381065515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:58:58,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:58:58,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-14 03:58:58,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969447708] [2024-11-14 03:58:58,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:58:58,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 03:58:58,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:58:58,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 03:58:58,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-14 03:58:58,701 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand has 13 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-14 03:59:00,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:59:03,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:59:05,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:59:07,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:59:10,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:59:12,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:59:14,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:59:16,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:59:19,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:59:21,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:59:23,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:59:26,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 03:59:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:59:29,350 INFO L93 Difference]: Finished difference Result 102 states and 129 transitions. [2024-11-14 03:59:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:59:29,351 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 6 states have call successors, (13) Word has length 64 [2024-11-14 03:59:29,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:59:29,352 INFO L225 Difference]: With dead ends: 102 [2024-11-14 03:59:29,353 INFO L226 Difference]: Without dead ends: 85 [2024-11-14 03:59:29,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-14 03:59:29,354 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 40 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 13 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:59:29,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 838 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 259 Invalid, 12 Unknown, 0 Unchecked, 30.0s Time] [2024-11-14 03:59:29,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-14 03:59:29,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2024-11-14 03:59:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-14 03:59:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2024-11-14 03:59:29,371 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 64 [2024-11-14 03:59:29,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:59:29,372 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2024-11-14 03:59:29,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-14 03:59:29,372 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2024-11-14 03:59:29,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-14 03:59:29,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:59:29,375 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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] [2024-11-14 03:59:29,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:59:29,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 03:59:29,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:59:29,376 INFO L85 PathProgramCache]: Analyzing trace with hash 88615423, now seen corresponding path program 1 times [2024-11-14 03:59:29,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:59:29,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52960443] [2024-11-14 03:59:29,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:59:29,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:00:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:00:30,499 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-14 04:00:30,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:00:30,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52960443] [2024-11-14 04:00:30,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52960443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:00:30,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:00:30,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-14 04:00:30,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653574783] [2024-11-14 04:00:30,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:00:30,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 04:00:30,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:00:30,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 04:00:30,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-14 04:00:30,502 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-14 04:00:32,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:00:34,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:00:37,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:00:39,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:00:41,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:00:44,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:00:46,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:00:48,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:00:50,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:00:53,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:00:55,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:00:57,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:00:57,999 INFO L93 Difference]: Finished difference Result 98 states and 122 transitions. [2024-11-14 04:00:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 04:00:58,000 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) Word has length 65 [2024-11-14 04:00:58,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:00:58,001 INFO L225 Difference]: With dead ends: 98 [2024-11-14 04:00:58,002 INFO L226 Difference]: Without dead ends: 81 [2024-11-14 04:00:58,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-14 04:00:58,003 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 25 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 7 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:00:58,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 783 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 218 Invalid, 11 Unknown, 0 Unchecked, 27.0s Time] [2024-11-14 04:00:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-14 04:00:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2024-11-14 04:00:58,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 46 states have (on average 1.173913043478261) internal successors, (54), 47 states have internal predecessors, (54), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-14 04:00:58,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2024-11-14 04:00:58,016 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 65 [2024-11-14 04:00:58,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:00:58,017 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2024-11-14 04:00:58,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-14 04:00:58,018 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2024-11-14 04:00:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-14 04:00:58,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:00:58,020 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:00:58,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 04:00:58,020 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-14 04:00:58,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:00:58,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1265470589, now seen corresponding path program 1 times [2024-11-14 04:00:58,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:00:58,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017255199] [2024-11-14 04:00:58,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:00:58,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:02:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:02:00,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 04:02:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 04:02:11,428 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 04:02:11,428 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 04:02:11,430 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-14 04:02:11,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 04:02:11,437 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-14 04:02:11,509 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 04:02:11,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:02:11 BoogieIcfgContainer [2024-11-14 04:02:11,513 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 04:02:11,513 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 04:02:11,513 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 04:02:11,514 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 04:02:11,514 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:55:27" (3/4) ... [2024-11-14 04:02:11,515 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-14 04:02:11,606 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/bin/utaipan-verify-sOmjnqqW8E/witness.graphml [2024-11-14 04:02:11,606 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 04:02:11,607 INFO L158 Benchmark]: Toolchain (without parser) took 414564.75ms. Allocated memory was 117.4MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 85.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-14 04:02:11,608 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 167.8MB. Free memory is still 102.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 04:02:11,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3666.92ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 85.7MB in the beginning and 243.8MB in the end (delta: -158.1MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. [2024-11-14 04:02:11,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 224.93ms. Allocated memory is still 352.3MB. Free memory was 243.8MB in the beginning and 235.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:02:11,610 INFO L158 Benchmark]: Boogie Preprocessor took 79.66ms. Allocated memory is still 352.3MB. Free memory was 235.4MB in the beginning and 230.9MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:02:11,611 INFO L158 Benchmark]: RCFGBuilder took 6808.11ms. Allocated memory was 352.3MB in the beginning and 503.3MB in the end (delta: 151.0MB). Free memory was 230.9MB in the beginning and 301.1MB in the end (delta: -70.1MB). Peak memory consumption was 136.5MB. Max. memory is 16.1GB. [2024-11-14 04:02:11,611 INFO L158 Benchmark]: TraceAbstraction took 403682.43ms. Allocated memory was 503.3MB in the beginning and 2.9GB in the end (delta: 2.4GB). Free memory was 301.1MB in the beginning and 1.5GB in the end (delta: -1.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-14 04:02:11,612 INFO L158 Benchmark]: Witness Printer took 92.98ms. Allocated memory is still 2.9GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 04:02:11,614 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 167.8MB. Free memory is still 102.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 3666.92ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 85.7MB in the beginning and 243.8MB in the end (delta: -158.1MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 224.93ms. Allocated memory is still 352.3MB. Free memory was 243.8MB in the beginning and 235.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.66ms. Allocated memory is still 352.3MB. Free memory was 235.4MB in the beginning and 230.9MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 6808.11ms. Allocated memory was 352.3MB in the beginning and 503.3MB in the end (delta: 151.0MB). Free memory was 230.9MB in the beginning and 301.1MB in the end (delta: -70.1MB). Peak memory consumption was 136.5MB. Max. memory is 16.1GB. * TraceAbstraction took 403682.43ms. Allocated memory was 503.3MB in the beginning and 2.9GB in the end (delta: 2.4GB). Free memory was 301.1MB in the beginning and 1.5GB in the end (delta: -1.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 92.98ms. Allocated memory is still 2.9GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 8556]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8556] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 223]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L6855-L6860] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7935-L7947] static const uint8_t s_tolower_table[256] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 91, 92, 93, 94, 95, 96, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255}; [L8893] CALL aws_string_eq_ignore_case_harness() [L8880] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L261] return __VERIFIER_nondet_bool(); [L8880] RET, EXPR nondet_bool() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L8880-L8881] EXPR nondet_bool() ? ensure_string_is_allocated_bounded_length(16) : ((void *)0) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L8880] CALL, EXPR ensure_string_is_allocated_bounded_length(16) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6790] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L266] return __VERIFIER_nondet_ulong(); [L6790] RET, EXPR nondet_uint64_t() VAL [\old(max_size)=16, max_size=16, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6790] size_t len = nondet_uint64_t(); [L6791] CALL assume_abort_if_not(len < max_size) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) [L6791] RET assume_abort_if_not(len < max_size) VAL [\old(max_size)=16, len=((unsigned __int128) 1 << 64), max_size=16, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6792] CALL, EXPR ensure_string_is_allocated(len) [L6796] CALL, EXPR bounded_malloc(sizeof(struct aws_string) + len + 1) VAL [\old(size)=(((unsigned __int128) 1 << 64) | 17), s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6872-L6874] CALL assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) [L6872-L6874] RET assume_abort_if_not(size <= ( (18446744073709551615UL) >> (8 + 1))) VAL [\old(size)=(((unsigned __int128) 1 << 64) | 17), s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, size=(((unsigned __int128) 1 << 64) | 17)] [L6875] return malloc(size); [L6796] RET, EXPR bounded_malloc(sizeof(struct aws_string) + len + 1) VAL [len=((unsigned __int128) 1 << 64), s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6796] struct aws_string *str = bounded_malloc(sizeof(struct aws_string) + len + 1); [L6799] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L261] return __VERIFIER_nondet_bool(); [L6799] RET, EXPR nondet_bool() VAL [len=((unsigned __int128) 1 << 64), s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L6799-L6800] EXPR nondet_bool() ? can_fail_allocator() : ((void *)0) VAL [len=((unsigned __int128) 1 << 64), s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str={-2:0}] [L6799-L6800] *(struct aws_allocator **)(&str->allocator) = nondet_bool() ? can_fail_allocator() : ((void *)0) [L6802] *(size_t *)(&str->len) = len [L6803] *(uint8_t *)&str->bytes[len] = '\0' [L6804] return str; [L6792] RET, EXPR ensure_string_is_allocated(len) [L6792] return ensure_string_is_allocated(len); [L8880] RET, EXPR ensure_string_is_allocated_bounded_length(16) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L8880-L8881] EXPR nondet_bool() ? ensure_string_is_allocated_bounded_length(16) : ((void *)0) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L8880-L8882] struct aws_string *str_a = nondet_bool() ? ensure_string_is_allocated_bounded_length(16) : ((void *)0) ; [L8884] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L261] return __VERIFIER_nondet_bool(); [L8884] RET, EXPR nondet_bool() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str_a={-2:0}] [L8884-L8886] EXPR nondet_bool() ? (nondet_bool() ? str_a : ((void *)0) ) : ensure_string_is_allocated_bounded_length(16) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str_a={-2:0}] [L8884] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L261] return __VERIFIER_nondet_bool(); [L8884] RET, EXPR nondet_bool() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str_a={-2:0}] [L8884-L8886] EXPR nondet_bool() ? (nondet_bool() ? str_a : ((void *)0) ) : ensure_string_is_allocated_bounded_length(16) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str_a={-2:0}] [L8883-L8886] struct aws_string *str_b = nondet_bool() ? (nondet_bool() ? str_a : ((void *)0) ) : ensure_string_is_allocated_bounded_length(16); [L8887] CALL, EXPR aws_string_eq_ignore_case(str_a, str_b) [L7407] EXPR !a || aws_string_is_valid(a) VAL [a={-2:0}, b={-2:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7407] CALL, EXPR aws_string_is_valid(a) VAL [\old(str)={-2:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6245] EXPR str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) [L6245] EXPR str->len [L6245] EXPR str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) [L6245] EXPR str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) && str->bytes[str->len] == 0 [L6245] EXPR str->len [L6245] EXPR str->bytes[str->len] [L6245] EXPR str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) && str->bytes[str->len] == 0 [L6245] return str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) && str->bytes[str->len] == 0; [L7407] RET, EXPR aws_string_is_valid(a) VAL [a={-2:0}, b={-2:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7407] EXPR !a || aws_string_is_valid(a) VAL [a={-2:0}, b={-2:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7407] CALL assume_abort_if_not((!a || aws_string_is_valid(a))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) [L7407] RET assume_abort_if_not((!a || aws_string_is_valid(a))) VAL [a={-2:0}, b={-2:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7408] EXPR !b || aws_string_is_valid(b) VAL [a={-2:0}, b={-2:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7408] CALL, EXPR aws_string_is_valid(b) VAL [\old(str)={-2:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6245] EXPR str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) [L6245] EXPR str->len [L6245] EXPR str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) [L6245] EXPR str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) && str->bytes[str->len] == 0 [L6245] EXPR str->len [L6245] EXPR str->bytes[str->len] [L6245] EXPR str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) && str->bytes[str->len] == 0 [L6245] return str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) && str->bytes[str->len] == 0; [L7408] RET, EXPR aws_string_is_valid(b) VAL [a={-2:0}, b={-2:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7408] EXPR !b || aws_string_is_valid(b) VAL [a={-2:0}, b={-2:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7408] CALL assume_abort_if_not((!b || aws_string_is_valid(b))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L211] COND FALSE !(!cond) [L7408] RET assume_abort_if_not((!b || aws_string_is_valid(b))) VAL [a={-2:0}, b={-2:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L7409] COND TRUE a == b [L7410-L7412] return 1 ; VAL [\result=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L8887] RET, EXPR aws_string_eq_ignore_case(str_a, str_b) [L8887] COND TRUE aws_string_eq_ignore_case(str_a, str_b) && str_a && str_b [L8888] CALL, EXPR aws_string_is_valid(str_a) VAL [\old(str)={-2:0}, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L6245] EXPR str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) [L6245] EXPR str->len [L6245] EXPR str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) [L6245] EXPR str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) && str->bytes[str->len] == 0 [L6245] EXPR str->len [L6245] EXPR str->bytes[str->len] [L6245] EXPR str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) && str->bytes[str->len] == 0 [L6245] return str && ((((str->len + 1)) == 0) || ((&str->bytes[0]))) && str->bytes[str->len] == 0; [L8888] RET, EXPR aws_string_is_valid(str_a) VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str_a={-2:0}, str_b={-2:0}] [L8888] CALL __VERIFIER_assert(!(aws_string_is_valid(str_a))) VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] COND TRUE !cond VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L223] reach_error() VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 403.5s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 87.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 35 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 86.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 2576 SdHoareTripleChecker+Invalid, 76.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2252 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 658 IncrementalHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 324 mSDtfsCounter, 658 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 8.3s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 548 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 84/84 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-14 04:02:11,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a11c08f4-760d-45bd-ad3f-44563a3e3ee3/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE