./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_string_eq_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8166237-c508-4c11-98be-0354a95f4b6c/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8166237-c508-4c11-98be-0354a95f4b6c/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8166237-c508-4c11-98be-0354a95f4b6c/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8166237-c508-4c11-98be-0354a95f4b6c/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_string_eq_harness_negated.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8166237-c508-4c11-98be-0354a95f4b6c/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8166237-c508-4c11-98be-0354a95f4b6c/bin/utaipan-verify-YMUCfTKeje --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 e2fe4853cb1b3e71bc40ffc508ef15031942a963e69ef7c7092b9454f87d180b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:14:45,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:14:45,475 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8166237-c508-4c11-98be-0354a95f4b6c/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-64bit-Taipan_Default.epf [2024-11-09 05:14:45,480 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:14:45,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:14:45,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:14:45,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:14:45,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:14:45,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:14:45,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:14:45,512 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:14:45,512 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:14:45,513 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:14:45,513 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:14:45,514 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:14:45,514 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:14:45,515 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:14:45,515 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:14:45,516 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:14:45,516 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:14:45,517 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:14:45,518 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:14:45,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:14:45,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 05:14:45,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:14:45,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:14:45,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 05:14:45,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:14:45,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 05:14:45,522 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:14:45,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 05:14:45,523 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:14:45,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:14:45,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:14:45,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:14:45,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:14:45,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:14:45,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:14:45,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 05:14:45,526 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:14:45,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:14:45,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:14:45,528 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:14:45,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:14:45,529 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8166237-c508-4c11-98be-0354a95f4b6c/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_c8166237-c508-4c11-98be-0354a95f4b6c/bin/utaipan-verify-YMUCfTKeje 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 -> e2fe4853cb1b3e71bc40ffc508ef15031942a963e69ef7c7092b9454f87d180b [2024-11-09 05:14:45,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:14:45,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:14:45,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:14:45,940 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:14:45,941 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:14:45,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8166237-c508-4c11-98be-0354a95f4b6c/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/aws-c-common/aws_string_eq_harness_negated.i Unable to find full path for "g++" [2024-11-09 05:14:48,191 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:14:48,880 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:14:48,880 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8166237-c508-4c11-98be-0354a95f4b6c/sv-benchmarks/c/aws-c-common/aws_string_eq_harness_negated.i [2024-11-09 05:14:48,949 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8166237-c508-4c11-98be-0354a95f4b6c/bin/utaipan-verify-YMUCfTKeje/data/12d303941/76fb863b21cd4b69bd821391d0148a72/FLAGe770fdbae [2024-11-09 05:14:48,981 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8166237-c508-4c11-98be-0354a95f4b6c/bin/utaipan-verify-YMUCfTKeje/data/12d303941/76fb863b21cd4b69bd821391d0148a72 [2024-11-09 05:14:48,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:14:48,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:14:48,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:14:48,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:14:48,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:14:48,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:14:48" (1/1) ... [2024-11-09 05:14:49,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20869e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:14:49, skipping insertion in model container [2024-11-09 05:14:49,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:14:48" (1/1) ... [2024-11-09 05:14:49,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:14:49,607 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_c8166237-c508-4c11-98be-0354a95f4b6c/sv-benchmarks/c/aws-c-common/aws_string_eq_harness_negated.i[4487,4500] [2024-11-09 05:14:49,618 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_c8166237-c508-4c11-98be-0354a95f4b6c/sv-benchmarks/c/aws-c-common/aws_string_eq_harness_negated.i[4547,4560] [2024-11-09 05:14:50,955 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:50,956 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:50,961 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:50,963 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:50,964 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:51,000 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:51,001 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:51,004 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:51,005 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:52,264 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:52,265 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:52,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:14:52,378 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:14:52,405 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_c8166237-c508-4c11-98be-0354a95f4b6c/sv-benchmarks/c/aws-c-common/aws_string_eq_harness_negated.i[4487,4500] [2024-11-09 05:14:52,406 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_c8166237-c508-4c11-98be-0354a95f4b6c/sv-benchmarks/c/aws-c-common/aws_string_eq_harness_negated.i[4547,4560] [2024-11-09 05:14:52,479 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:52,481 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:52,482 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:52,483 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:52,484 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:52,500 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:52,501 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:52,504 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:52,505 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:52,750 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" : "+r"(index)); [8556] [2024-11-09 05:14:52,753 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:52,753 WARN L1698 CHandler]: Possible shadowing of function index [2024-11-09 05:14:52,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:14:53,097 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:14:53,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:14:53 WrapperNode [2024-11-09 05:14:53,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:14:53,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:14:53,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:14:53,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:14:53,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:14:53" (1/1) ... [2024-11-09 05:14:53,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:14:53" (1/1) ... [2024-11-09 05:14:53,310 INFO L138 Inliner]: procedures = 670, calls = 2271, calls flagged for inlining = 58, calls inlined = 6, statements flattened = 389 [2024-11-09 05:14:53,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:14:53,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:14:53,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:14:53,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:14:53,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:14:53" (1/1) ... [2024-11-09 05:14:53,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:14:53" (1/1) ... [2024-11-09 05:14:53,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:14:53" (1/1) ... [2024-11-09 05:14:53,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:14:53" (1/1) ... [2024-11-09 05:14:53,363 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:14:53" (1/1) ... [2024-11-09 05:14:53,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:14:53" (1/1) ... [2024-11-09 05:14:53,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:14:53" (1/1) ... [2024-11-09 05:14:53,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:14:53" (1/1) ... [2024-11-09 05:14:53,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:14:53,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:14:53,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:14:53,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:14:53,386 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:14:53" (1/1) ... [2024-11-09 05:14:53,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:14:53,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8166237-c508-4c11-98be-0354a95f4b6c/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:14:53,450 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8166237-c508-4c11-98be-0354a95f4b6c/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:14:53,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8166237-c508-4c11-98be-0354a95f4b6c/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:14:53,493 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2024-11-09 05:14:53,493 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2024-11-09 05:14:53,493 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2024-11-09 05:14:53,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2024-11-09 05:14:53,497 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2024-11-09 05:14:53,497 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2024-11-09 05:14:53,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 05:14:53,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:14:53,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 05:14:53,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 05:14:53,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:14:53,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:14:53,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:14:53,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:14:53,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:14:53,500 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2024-11-09 05:14:53,500 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2024-11-09 05:14:53,501 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 05:14:53,501 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 05:14:53,501 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2024-11-09 05:14:53,502 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2024-11-09 05:14:53,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 05:14:53,502 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2024-11-09 05:14:53,502 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2024-11-09 05:14:53,502 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-09 05:14:53,503 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-09 05:14:53,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:14:53,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:14:53,848 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:14:53,851 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:14:59,982 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-09 05:14:59,982 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:15:00,469 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:15:00,470 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 05:15:00,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:15:00 BoogieIcfgContainer [2024-11-09 05:15:00,471 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:15:00,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:15:00,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:15:00,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:15:00,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:14:48" (1/3) ... [2024-11-09 05:15:00,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df3b87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:15:00, skipping insertion in model container [2024-11-09 05:15:00,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:14:53" (2/3) ... [2024-11-09 05:15:00,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df3b87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:15:00, skipping insertion in model container [2024-11-09 05:15:00,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:15:00" (3/3) ... [2024-11-09 05:15:00,483 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_string_eq_harness_negated.i [2024-11-09 05:15:00,510 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:15:00,510 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 05:15:00,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:15:00,627 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;@7b633e8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:15:00,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 05:15:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 48 states have internal predecessors, (58), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 05:15:00,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 05:15:00,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:15:00,646 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 05:15:00,647 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:15:00,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:15:00,654 INFO L85 PathProgramCache]: Analyzing trace with hash 384185935, now seen corresponding path program 1 times [2024-11-09 05:15:00,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:15:00,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010629245] [2024-11-09 05:15:00,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:15:00,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:16:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:16:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:16:19,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:16:19,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010629245] [2024-11-09 05:16:19,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010629245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:16:19,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:16:19,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:16:19,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582706408] [2024-11-09 05:16:19,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:16:19,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:16:19,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:16:19,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:16:19,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 05:16:19,600 INFO L87 Difference]: Start difference. First operand has 84 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 48 states have internal predecessors, (58), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 05:16:21,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:16:24,043 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-09 05:16:26,283 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-09 05:16:27,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:16:27,019 INFO L93 Difference]: Finished difference Result 137 states and 187 transitions. [2024-11-09 05:16:27,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:16:27,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-11-09 05:16:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:16:27,034 INFO L225 Difference]: With dead ends: 137 [2024-11-09 05:16:27,035 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 05:16:27,038 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-09 05:16:27,043 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 10 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 281 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:16:27,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 281 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 7.3s Time] [2024-11-09 05:16:27,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 05:16:27,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 05:16:27,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 46 states have internal predecessors, (53), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 05:16:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2024-11-09 05:16:27,121 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 28 [2024-11-09 05:16:27,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:16:27,125 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2024-11-09 05:16:27,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 05:16:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2024-11-09 05:16:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 05:16:27,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:16:27,129 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 05:16:27,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:16:27,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:16:27,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:16:27,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1174160761, now seen corresponding path program 1 times [2024-11-09 05:16:27,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:16:27,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554494457] [2024-11-09 05:16:27,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:16:27,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:17:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:17:43,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 05:17:43,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:17:43,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554494457] [2024-11-09 05:17:43,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554494457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:17:43,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:17:43,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 05:17:43,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096996451] [2024-11-09 05:17:43,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:17:43,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 05:17:43,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:17:43,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 05:17:43,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:17:43,130 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 10 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-09 05:17:45,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:17:47,541 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-09 05:17:49,839 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-09 05:17:52,115 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-09 05:17:54,420 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-09 05:17:56,700 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-09 05:17:58,987 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-09 05:18:01,300 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-09 05:18:03,578 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-09 05:18:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:18:05,136 INFO L93 Difference]: Finished difference Result 127 states and 163 transitions. [2024-11-09 05:18:05,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 05:18:05,137 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 53 [2024-11-09 05:18:05,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:18:05,139 INFO L225 Difference]: With dead ends: 127 [2024-11-09 05:18:05,139 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 05:18:05,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:18:05,141 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 27 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:18:05,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 726 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 9 Unknown, 0 Unchecked, 21.8s Time] [2024-11-09 05:18:05,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 05:18:05,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 05:18:05,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 46 states have internal predecessors, (52), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 05:18:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2024-11-09 05:18:05,156 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 53 [2024-11-09 05:18:05,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:18:05,157 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2024-11-09 05:18:05,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-09 05:18:05,158 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2024-11-09 05:18:05,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 05:18:05,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:18:05,160 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 05:18:05,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:18:05,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:18:05,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:18:05,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1896428441, now seen corresponding path program 1 times [2024-11-09 05:18:05,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:18:05,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365527247] [2024-11-09 05:18:05,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:18:05,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:19:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:19:27,986 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 05:19:27,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:19:27,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365527247] [2024-11-09 05:19:27,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365527247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:19:27,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:19:27,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 05:19:27,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899133656] [2024-11-09 05:19:27,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:19:27,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 05:19:27,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:19:27,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 05:19:27,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-09 05:19:27,990 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 13 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-09 05:19:30,100 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-09 05:19:32,388 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-09 05:19:34,690 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-09 05:19:36,958 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-09 05:19:39,225 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-09 05:19:41,471 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-09 05:19:43,732 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-09 05:19:46,021 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-09 05:19:48,326 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-09 05:19:50,627 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-09 05:19:52,930 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-09 05:19:55,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 05:19:58,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:19:58,308 INFO L93 Difference]: Finished difference Result 138 states and 178 transitions. [2024-11-09 05:19:58,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:19:58,309 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) Word has length 57 [2024-11-09 05:19:58,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:19:58,311 INFO L225 Difference]: With dead ends: 138 [2024-11-09 05:19:58,312 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 05:19:58,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-09 05:19:58,314 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 53 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 11 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:19:58,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 828 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 251 Invalid, 12 Unknown, 0 Unchecked, 29.8s Time] [2024-11-09 05:19:58,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 05:19:58,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2024-11-09 05:19:58,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.14) internal successors, (57), 51 states have internal predecessors, (57), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 05:19:58,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2024-11-09 05:19:58,337 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 57 [2024-11-09 05:19:58,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:19:58,338 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2024-11-09 05:19:58,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-09 05:19:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2024-11-09 05:19:58,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 05:19:58,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:19:58,341 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:19:58,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:19:58,341 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:19:58,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:19:58,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1693926647, now seen corresponding path program 1 times [2024-11-09 05:19:58,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:19:58,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289919250] [2024-11-09 05:19:58,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:19:58,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:21:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:21:15,207 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 05:21:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 05:21:25,998 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 05:21:25,998 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 05:21:26,000 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 05:21:26,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:21:26,004 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 05:21:26,067 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 05:21:26,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 05:21:26 BoogieIcfgContainer [2024-11-09 05:21:26,070 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 05:21:26,071 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 05:21:26,071 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 05:21:26,071 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 05:21:26,072 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:15:00" (3/4) ... [2024-11-09 05:21:26,073 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 05:21:26,154 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8166237-c508-4c11-98be-0354a95f4b6c/bin/utaipan-verify-YMUCfTKeje/witness.graphml [2024-11-09 05:21:26,154 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 05:21:26,155 INFO L158 Benchmark]: Toolchain (without parser) took 397168.30ms. Allocated memory was 132.1MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 81.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 596.1MB. Max. memory is 16.1GB. [2024-11-09 05:21:26,155 INFO L158 Benchmark]: CDTParser took 1.64ms. Allocated memory is still 132.1MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:21:26,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 4108.70ms. Allocated memory was 132.1MB in the beginning and 165.7MB in the end (delta: 33.6MB). Free memory was 81.1MB in the beginning and 90.9MB in the end (delta: -9.8MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2024-11-09 05:21:26,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 214.51ms. Allocated memory is still 165.7MB. Free memory was 90.9MB in the beginning and 81.7MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 05:21:26,156 INFO L158 Benchmark]: Boogie Preprocessor took 69.57ms. Allocated memory is still 165.7MB. Free memory was 81.7MB in the beginning and 76.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 05:21:26,157 INFO L158 Benchmark]: RCFGBuilder took 7086.60ms. Allocated memory was 165.7MB in the beginning and 268.4MB in the end (delta: 102.8MB). Free memory was 76.4MB in the beginning and 124.8MB in the end (delta: -48.4MB). Peak memory consumption was 116.1MB. Max. memory is 16.1GB. [2024-11-09 05:21:26,157 INFO L158 Benchmark]: TraceAbstraction took 385597.15ms. Allocated memory was 268.4MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 123.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-09 05:21:26,158 INFO L158 Benchmark]: Witness Printer took 83.41ms. Allocated memory is still 2.3GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 05:21:26,159 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.64ms. Allocated memory is still 132.1MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 4108.70ms. Allocated memory was 132.1MB in the beginning and 165.7MB in the end (delta: 33.6MB). Free memory was 81.1MB in the beginning and 90.9MB in the end (delta: -9.8MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 214.51ms. Allocated memory is still 165.7MB. Free memory was 90.9MB in the beginning and 81.7MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.57ms. Allocated memory is still 165.7MB. Free memory was 81.7MB in the beginning and 76.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 7086.60ms. Allocated memory was 165.7MB in the beginning and 268.4MB in the end (delta: 102.8MB). Free memory was 76.4MB in the beginning and 124.8MB in the end (delta: -48.4MB). Peak memory consumption was 116.1MB. Max. memory is 16.1GB. * TraceAbstraction took 385597.15ms. Allocated memory was 268.4MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 123.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 83.41ms. Allocated memory is still 2.3GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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}; [L8891] CALL aws_string_eq_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) | 1), 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) | 18), 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) | 18), s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, size=(((unsigned __int128) 1 << 64) | 18)] [L6875] return malloc(size); [L6796] RET, EXPR bounded_malloc(sizeof(struct aws_string) + len + 1) VAL [len=(((unsigned __int128) 1 << 64) | 1), 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) | 1), 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) | 1), 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) ; [L8883] CALL, EXPR nondet_bool() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L261] return __VERIFIER_nondet_bool(); [L8883] RET, EXPR nondet_bool() VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str_a={-2:0}] [L8883] EXPR nondet_bool() ? str_a : 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] struct aws_string *str_b = nondet_bool() ? str_a : ensure_string_is_allocated_bounded_length(16); [L8884] CALL, EXPR aws_string_eq(str_a, str_b) [L7382] 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}] [L7382] 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; [L7382] 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}] [L7382] 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}] [L7382] 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) [L7382] 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}] [L7383] 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}] [L7383] 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; [L7383] 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}] [L7383] 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}] [L7383] 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) [L7383] 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}] [L7384] COND TRUE a == b [L7385-L7387] return 1 ; VAL [\result=1, s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}] [L8884] RET, EXPR aws_string_eq(str_a, str_b) [L8884] COND TRUE aws_string_eq(str_a, str_b) && str_a && str_b [L8885] EXPR str_a->len [L8885] EXPR str_b->len VAL [s_can_fail_allocator_static={4:0}, s_tolower_table={5:0}, str_a={-2:0}, str_b={-2:0}] [L8885] CALL __VERIFIER_assert(!(str_a->len == str_b->len)) 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, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 385.4s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 59.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 24 mSolverCounterUnknown, 124 SdHoareTripleChecker+Valid, 59.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 90 mSDsluCounter, 1835 SdHoareTripleChecker+Invalid, 52.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1573 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 431 IncrementalHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 262 mSDtfsCounter, 431 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=3, InterpolantAutomatonStates: 27, 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, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 291 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 40/40 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-09 05:21:26,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8166237-c508-4c11-98be-0354a95f4b6c/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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