./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b64b813c3d856efe8cd859d380d09d4b682c371a0a165a5a5fe0d11dc206dad7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 22:34:15,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 22:34:16,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 22:34:16,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 22:34:16,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 22:34:16,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 22:34:16,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 22:34:16,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 22:34:16,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 22:34:16,041 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 22:34:16,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 22:34:16,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 22:34:16,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 22:34:16,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 22:34:16,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 22:34:16,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 22:34:16,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 22:34:16,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 22:34:16,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 22:34:16,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 22:34:16,057 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 22:34:16,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 22:34:16,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 22:34:16,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 22:34:16,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 22:34:16,064 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 22:34:16,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 22:34:16,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 22:34:16,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 22:34:16,066 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 22:34:16,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 22:34:16,067 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 22:34:16,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 22:34:16,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 22:34:16,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 22:34:16,070 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 22:34:16,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 22:34:16,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 22:34:16,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 22:34:16,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 22:34:16,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 22:34:16,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 22:34:16,074 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-22 22:34:16,097 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 22:34:16,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 22:34:16,098 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 22:34:16,098 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 22:34:16,099 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 22:34:16,099 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 22:34:16,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 22:34:16,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 22:34:16,099 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 22:34:16,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 22:34:16,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 22:34:16,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 22:34:16,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 22:34:16,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 22:34:16,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 22:34:16,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 22:34:16,102 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 22:34:16,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 22:34:16,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 22:34:16,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 22:34:16,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 22:34:16,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:34:16,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 22:34:16,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 22:34:16,107 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 22:34:16,108 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 22:34:16,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 22:34:16,108 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 22:34:16,108 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 22:34:16,109 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 22:34:16,109 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Automizer 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 -> b64b813c3d856efe8cd859d380d09d4b682c371a0a165a5a5fe0d11dc206dad7 [2022-07-22 22:34:16,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 22:34:16,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 22:34:16,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 22:34:16,306 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 22:34:16,306 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 22:34:16,307 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness.i [2022-07-22 22:34:16,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/573201e34/031cf5e1c2734148bb9aa0208e5fe89b/FLAGf6490e878 [2022-07-22 22:34:16,872 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 22:34:16,873 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness.i [2022-07-22 22:34:16,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/573201e34/031cf5e1c2734148bb9aa0208e5fe89b/FLAGf6490e878 [2022-07-22 22:34:17,131 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/573201e34/031cf5e1c2734148bb9aa0208e5fe89b [2022-07-22 22:34:17,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 22:34:17,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 22:34:17,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 22:34:17,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 22:34:17,139 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 22:34:17,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:34:17" (1/1) ... [2022-07-22 22:34:17,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd1a196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:17, skipping insertion in model container [2022-07-22 22:34:17,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:34:17" (1/1) ... [2022-07-22 22:34:17,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 22:34:17,229 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 22:34:17,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness.i[4493,4506] [2022-07-22 22:34:17,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness.i[4553,4566] [2022-07-22 22:34:17,908 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:17,908 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:17,909 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:17,909 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:17,910 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:17,918 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:17,919 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:17,920 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:17,920 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:18,132 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:34:18,133 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:34:18,134 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:34:18,134 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:34:18,135 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:34:18,136 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:34:18,136 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:34:18,137 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:34:18,137 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:34:18,138 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:34:18,249 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:34:18,400 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:18,400 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:18,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:34:18,473 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 22:34:18,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness.i[4493,4506] [2022-07-22 22:34:18,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_c_str_harness.i[4553,4566] [2022-07-22 22:34:18,527 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:18,528 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:18,529 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:18,529 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:18,530 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:18,538 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:18,540 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:18,541 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:18,541 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:18,571 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-22 22:34:18,572 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-22 22:34:18,575 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-22 22:34:18,576 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-22 22:34:18,577 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-22 22:34:18,578 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-22 22:34:18,578 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-22 22:34:18,578 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-22 22:34:18,579 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-22 22:34:18,579 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-22 22:34:18,592 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-22 22:34:18,643 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:18,644 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-22 22:34:18,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:34:18,817 INFO L208 MainTranslator]: Completed translation [2022-07-22 22:34:18,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:18 WrapperNode [2022-07-22 22:34:18,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 22:34:18,819 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 22:34:18,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 22:34:18,819 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 22:34:18,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:18" (1/1) ... [2022-07-22 22:34:18,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:18" (1/1) ... [2022-07-22 22:34:18,947 INFO L137 Inliner]: procedures = 681, calls = 2272, calls flagged for inlining = 60, calls inlined = 8, statements flattened = 391 [2022-07-22 22:34:18,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 22:34:18,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 22:34:18,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 22:34:18,949 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 22:34:18,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:18" (1/1) ... [2022-07-22 22:34:18,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:18" (1/1) ... [2022-07-22 22:34:18,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:18" (1/1) ... [2022-07-22 22:34:18,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:18" (1/1) ... [2022-07-22 22:34:18,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:18" (1/1) ... [2022-07-22 22:34:19,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:18" (1/1) ... [2022-07-22 22:34:19,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:18" (1/1) ... [2022-07-22 22:34:19,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 22:34:19,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 22:34:19,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 22:34:19,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 22:34:19,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:18" (1/1) ... [2022-07-22 22:34:19,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:34:19,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:19,051 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 22:34:19,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 22:34:19,082 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq_c_str [2022-07-22 22:34:19,082 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq_c_str [2022-07-22 22:34:19,082 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2022-07-22 22:34:19,082 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2022-07-22 22:34:19,083 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2022-07-22 22:34:19,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2022-07-22 22:34:19,083 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-22 22:34:19,083 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-22 22:34:19,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 22:34:19,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 22:34:19,084 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 22:34:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 22:34:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 22:34:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 22:34:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 22:34:19,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 22:34:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-22 22:34:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-22 22:34:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 22:34:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 22:34:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 22:34:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-22 22:34:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-22 22:34:19,086 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-22 22:34:19,086 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-22 22:34:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 22:34:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 22:34:19,299 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 22:34:19,300 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 22:34:19,651 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 22:34:19,657 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 22:34:19,657 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 22:34:19,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:34:19 BoogieIcfgContainer [2022-07-22 22:34:19,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 22:34:19,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 22:34:19,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 22:34:19,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 22:34:19,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:34:17" (1/3) ... [2022-07-22 22:34:19,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644af3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:34:19, skipping insertion in model container [2022-07-22 22:34:19,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:34:18" (2/3) ... [2022-07-22 22:34:19,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644af3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:34:19, skipping insertion in model container [2022-07-22 22:34:19,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:34:19" (3/3) ... [2022-07-22 22:34:19,665 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_c_str_harness.i [2022-07-22 22:34:19,675 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 22:34:19,676 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 22:34:19,761 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 22:34:19,768 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@603207e2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@424ff90b [2022-07-22 22:34:19,768 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 22:34:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 71 states have internal predecessors, (87), 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) [2022-07-22 22:34:19,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-22 22:34:19,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:19,782 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:19,782 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:19,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1676862830, now seen corresponding path program 1 times [2022-07-22 22:34:19,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:19,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612599199] [2022-07-22 22:34:19,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:19,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:34:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 22:34:20,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:20,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612599199] [2022-07-22 22:34:20,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612599199] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:20,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:20,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 22:34:20,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598469713] [2022-07-22 22:34:20,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:20,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 22:34:20,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:20,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 22:34:20,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 22:34:20,248 INFO L87 Difference]: Start difference. First operand has 107 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 71 states have internal predecessors, (87), 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 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 22:34:20,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:20,273 INFO L93 Difference]: Finished difference Result 205 states and 281 transitions. [2022-07-22 22:34:20,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 22:34:20,275 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2022-07-22 22:34:20,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:20,281 INFO L225 Difference]: With dead ends: 205 [2022-07-22 22:34:20,281 INFO L226 Difference]: Without dead ends: 101 [2022-07-22 22:34:20,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 22:34:20,286 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:20,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:34:20,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-22 22:34:20,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-22 22:34:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 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) [2022-07-22 22:34:20,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2022-07-22 22:34:20,343 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 36 [2022-07-22 22:34:20,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:20,344 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2022-07-22 22:34:20,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-22 22:34:20,345 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2022-07-22 22:34:20,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-22 22:34:20,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:20,347 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:20,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 22:34:20,347 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:20,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:20,348 INFO L85 PathProgramCache]: Analyzing trace with hash -12080912, now seen corresponding path program 1 times [2022-07-22 22:34:20,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:20,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501104854] [2022-07-22 22:34:20,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:20,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 22:34:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 22:34:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 22:34:20,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:20,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501104854] [2022-07-22 22:34:20,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501104854] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:20,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:20,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 22:34:20,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341736700] [2022-07-22 22:34:20,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:20,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:34:20,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:20,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:34:20,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 22:34:20,511 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-22 22:34:20,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:20,557 INFO L93 Difference]: Finished difference Result 148 states and 186 transitions. [2022-07-22 22:34:20,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 22:34:20,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2022-07-22 22:34:20,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:20,559 INFO L225 Difference]: With dead ends: 148 [2022-07-22 22:34:20,559 INFO L226 Difference]: Without dead ends: 101 [2022-07-22 22:34:20,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 22:34:20,560 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 6 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:20,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 380 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:34:20,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-22 22:34:20,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-22 22:34:20,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 66 states have internal predecessors, (76), 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) [2022-07-22 22:34:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 127 transitions. [2022-07-22 22:34:20,570 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 127 transitions. Word has length 36 [2022-07-22 22:34:20,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:20,571 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 127 transitions. [2022-07-22 22:34:20,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-22 22:34:20,571 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 127 transitions. [2022-07-22 22:34:20,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-22 22:34:20,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:20,573 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:20,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 22:34:20,573 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:20,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:20,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2108660913, now seen corresponding path program 1 times [2022-07-22 22:34:20,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:20,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077386125] [2022-07-22 22:34:20,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:20,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:34:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:34:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 22:34:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:34:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 22:34:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 22:34:20,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:20,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077386125] [2022-07-22 22:34:20,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077386125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:20,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:20,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 22:34:20,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42776724] [2022-07-22 22:34:20,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:20,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 22:34:20,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:20,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 22:34:20,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:34:20,870 INFO L87 Difference]: Start difference. First operand 101 states and 127 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-22 22:34:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:21,192 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2022-07-22 22:34:21,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 22:34:21,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 64 [2022-07-22 22:34:21,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:21,205 INFO L225 Difference]: With dead ends: 138 [2022-07-22 22:34:21,205 INFO L226 Difference]: Without dead ends: 101 [2022-07-22 22:34:21,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:34:21,207 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 89 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:21,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 454 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:34:21,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-22 22:34:21,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-22 22:34:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 66 states have internal predecessors, (75), 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) [2022-07-22 22:34:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2022-07-22 22:34:21,224 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 64 [2022-07-22 22:34:21,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:21,228 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2022-07-22 22:34:21,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-22 22:34:21,231 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2022-07-22 22:34:21,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 22:34:21,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:21,232 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:21,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 22:34:21,232 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:21,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:21,233 INFO L85 PathProgramCache]: Analyzing trace with hash -63104247, now seen corresponding path program 1 times [2022-07-22 22:34:21,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:21,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836543648] [2022-07-22 22:34:21,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:21,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 22:34:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 22:34:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 22:34:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 22:34:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:34:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-22 22:34:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,414 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 22:34:21,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:21,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836543648] [2022-07-22 22:34:21,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836543648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:34:21,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:34:21,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 22:34:21,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031068771] [2022-07-22 22:34:21,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:34:21,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:34:21,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:21,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:34:21,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:34:21,417 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-22 22:34:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:21,597 INFO L93 Difference]: Finished difference Result 159 states and 199 transitions. [2022-07-22 22:34:21,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:34:21,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 65 [2022-07-22 22:34:21,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:21,599 INFO L225 Difference]: With dead ends: 159 [2022-07-22 22:34:21,599 INFO L226 Difference]: Without dead ends: 101 [2022-07-22 22:34:21,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:34:21,600 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 41 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:21,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 288 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:34:21,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-22 22:34:21,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-22 22:34:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 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) [2022-07-22 22:34:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 125 transitions. [2022-07-22 22:34:21,608 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 125 transitions. Word has length 65 [2022-07-22 22:34:21,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:21,608 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 125 transitions. [2022-07-22 22:34:21,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-22 22:34:21,608 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2022-07-22 22:34:21,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-22 22:34:21,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:34:21,610 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:34:21,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 22:34:21,610 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:34:21,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:34:21,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1726009102, now seen corresponding path program 1 times [2022-07-22 22:34:21,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:34:21,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182644778] [2022-07-22 22:34:21,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:21,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:34:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:34:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 22:34:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 22:34:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:21,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 22:34:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 22:34:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 22:34:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 22:34:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-22 22:34:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 22:34:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 22:34:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:34:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 22:34:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 22:34:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,112 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-22 22:34:22,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:34:22,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182644778] [2022-07-22 22:34:22,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182644778] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:34:22,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556729537] [2022-07-22 22:34:22,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:34:22,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:22,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:34:22,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 22:34:22,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 22:34:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:34:22,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 22:34:22,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:34:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-22 22:34:22,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:34:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-22 22:34:22,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556729537] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:34:22,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:34:22,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 27 [2022-07-22 22:34:22,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982309779] [2022-07-22 22:34:22,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:34:22,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-22 22:34:22,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:34:22,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-22 22:34:22,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2022-07-22 22:34:22,573 INFO L87 Difference]: Start difference. First operand 101 states and 125 transitions. Second operand has 27 states, 25 states have (on average 3.12) internal successors, (78), 20 states have internal predecessors, (78), 10 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (25), 13 states have call predecessors, (25), 10 states have call successors, (25) [2022-07-22 22:34:23,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:34:23,062 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2022-07-22 22:34:23,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 22:34:23,062 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.12) internal successors, (78), 20 states have internal predecessors, (78), 10 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (25), 13 states have call predecessors, (25), 10 states have call successors, (25) Word has length 99 [2022-07-22 22:34:23,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:34:23,063 INFO L225 Difference]: With dead ends: 116 [2022-07-22 22:34:23,063 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 22:34:23,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=1336, Unknown=0, NotChecked=0, Total=1482 [2022-07-22 22:34:23,064 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 58 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:34:23,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 316 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 22:34:23,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 22:34:23,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 22:34:23,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 22:34:23,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 22:34:23,065 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2022-07-22 22:34:23,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:34:23,065 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 22:34:23,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.12) internal successors, (78), 20 states have internal predecessors, (78), 10 states have call successors, (26), 4 states have call predecessors, (26), 7 states have return successors, (25), 13 states have call predecessors, (25), 10 states have call successors, (25) [2022-07-22 22:34:23,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 22:34:23,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 22:34:23,067 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 22:34:23,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 22:34:23,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:34:23,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 22:34:23,434 INFO L895 garLoopResultBuilder]: At program point L6816(lines 6807 6817) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2022-07-22 22:34:23,434 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6801 6805) no Hoare annotation was computed. [2022-07-22 22:34:23,434 INFO L899 garLoopResultBuilder]: For program point L6811-1(lines 6811 6812) no Hoare annotation was computed. [2022-07-22 22:34:23,434 INFO L895 garLoopResultBuilder]: At program point L6811(line 6811) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2022-07-22 22:34:23,434 INFO L899 garLoopResultBuilder]: For program point L6811-5(lines 6811 6812) no Hoare annotation was computed. [2022-07-22 22:34:23,435 INFO L899 garLoopResultBuilder]: For program point L6808-1(line 6808) no Hoare annotation was computed. [2022-07-22 22:34:23,435 INFO L895 garLoopResultBuilder]: At program point L6808(line 6808) the Hoare annotation is: (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (or (<= 0 (+ (* 18446744073709551616 (div (+ (* (- 1) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 15) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|)) .cse0) (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or .cse0 (let ((.cse1 (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)))) (<= .cse1 (+ |ensure_string_is_allocated_bounded_length_~len~1#1| (* 18446744073709551616 (div (+ .cse1 15 (* (- 1) |ensure_string_is_allocated_bounded_length_~len~1#1|)) 18446744073709551616)))))) (= |old(#valid)| |#valid|))) [2022-07-22 22:34:23,435 INFO L899 garLoopResultBuilder]: For program point L6811-3(line 6811) no Hoare annotation was computed. [2022-07-22 22:34:23,435 INFO L895 garLoopResultBuilder]: At program point L6811-2(line 6811) the Hoare annotation is: (and (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2022-07-22 22:34:23,435 INFO L895 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-22 22:34:23,435 INFO L899 garLoopResultBuilder]: For program point L6803-1(line 6803) no Hoare annotation was computed. [2022-07-22 22:34:23,435 INFO L895 garLoopResultBuilder]: At program point L6803(line 6803) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= (+ (- 16) |ensure_string_is_allocated_bounded_length_~max_size#1|) 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-22 22:34:23,435 INFO L895 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6801 6805) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2022-07-22 22:34:23,435 INFO L899 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-07-22 22:34:23,435 INFO L899 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6801 6805) no Hoare annotation was computed. [2022-07-22 22:34:23,435 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6883 6888) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-22 22:34:23,435 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6883 6888) no Hoare annotation was computed. [2022-07-22 22:34:23,435 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6883 6888) no Hoare annotation was computed. [2022-07-22 22:34:23,435 INFO L899 garLoopResultBuilder]: For program point L6884-1(lines 6884 6886) no Hoare annotation was computed. [2022-07-22 22:34:23,436 INFO L895 garLoopResultBuilder]: At program point L6884(lines 6884 6886) the Hoare annotation is: (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-07-22 22:34:23,436 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-22 22:34:23,436 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-22 22:34:23,436 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-22 22:34:23,436 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-22 22:34:23,436 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-22 22:34:23,436 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-22 22:34:23,436 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-22 22:34:23,436 INFO L899 garLoopResultBuilder]: For program point L8097(lines 8097 8101) no Hoare annotation was computed. [2022-07-22 22:34:23,436 INFO L899 garLoopResultBuilder]: For program point L8095-4(lines 8095 8108) no Hoare annotation was computed. [2022-07-22 22:34:23,436 INFO L902 garLoopResultBuilder]: At program point L8095-3(lines 8095 8108) the Hoare annotation is: true [2022-07-22 22:34:23,436 INFO L899 garLoopResultBuilder]: For program point L8095-2(lines 8095 8108) no Hoare annotation was computed. [2022-07-22 22:34:23,436 INFO L899 garLoopResultBuilder]: For program point aws_array_eq_c_strFINAL(lines 8078 8111) no Hoare annotation was computed. [2022-07-22 22:34:23,436 INFO L899 garLoopResultBuilder]: For program point L8083(lines 8083 8085) no Hoare annotation was computed. [2022-07-22 22:34:23,436 INFO L902 garLoopResultBuilder]: At program point L8080-1(line 8080) the Hoare annotation is: true [2022-07-22 22:34:23,436 INFO L902 garLoopResultBuilder]: At program point L8080(line 8080) the Hoare annotation is: true [2022-07-22 22:34:23,436 INFO L902 garLoopResultBuilder]: At program point aws_array_eq_c_strENTRY(lines 8078 8111) the Hoare annotation is: true [2022-07-22 22:34:23,436 INFO L899 garLoopResultBuilder]: For program point L8103(lines 8103 8107) no Hoare annotation was computed. [2022-07-22 22:34:23,436 INFO L899 garLoopResultBuilder]: For program point aws_array_eq_c_strEXIT(lines 8078 8111) no Hoare annotation was computed. [2022-07-22 22:34:23,436 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6890 6892) no Hoare annotation was computed. [2022-07-22 22:34:23,437 INFO L899 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6890 6892) no Hoare annotation was computed. [2022-07-22 22:34:23,437 INFO L902 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6890 6892) the Hoare annotation is: true [2022-07-22 22:34:23,437 INFO L902 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6253 6258) the Hoare annotation is: true [2022-07-22 22:34:23,437 INFO L899 garLoopResultBuilder]: For program point L6257-2(line 6257) no Hoare annotation was computed. [2022-07-22 22:34:23,437 INFO L899 garLoopResultBuilder]: For program point L6257-3(line 6257) no Hoare annotation was computed. [2022-07-22 22:34:23,437 INFO L899 garLoopResultBuilder]: For program point L6257(line 6257) no Hoare annotation was computed. [2022-07-22 22:34:23,437 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6253 6258) no Hoare annotation was computed. [2022-07-22 22:34:23,437 INFO L899 garLoopResultBuilder]: For program point L6257-5(line 6257) no Hoare annotation was computed. [2022-07-22 22:34:23,437 INFO L899 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6253 6258) no Hoare annotation was computed. [2022-07-22 22:34:23,437 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-22 22:34:23,437 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-22 22:34:23,437 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-22 22:34:23,437 INFO L902 garLoopResultBuilder]: At program point L8925(line 8925) the Hoare annotation is: true [2022-07-22 22:34:23,437 INFO L899 garLoopResultBuilder]: For program point L7579(line 7579) no Hoare annotation was computed. [2022-07-22 22:34:23,437 INFO L899 garLoopResultBuilder]: For program point L7100(lines 7100 7113) no Hoare annotation was computed. [2022-07-22 22:34:23,437 INFO L899 garLoopResultBuilder]: For program point L7579-5(line 7579) no Hoare annotation was computed. [2022-07-22 22:34:23,437 INFO L895 garLoopResultBuilder]: At program point L7579-4(line 7579) the Hoare annotation is: (or (and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_#res#1.base| 0))) (and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))) [2022-07-22 22:34:23,437 INFO L899 garLoopResultBuilder]: For program point L7579-3(line 7579) no Hoare annotation was computed. [2022-07-22 22:34:23,437 INFO L895 garLoopResultBuilder]: At program point L7579-2(line 7579) the Hoare annotation is: (or (and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_#res#1.base| 0))) (and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))) [2022-07-22 22:34:23,438 INFO L895 garLoopResultBuilder]: At program point L8921(line 8921) the Hoare annotation is: false [2022-07-22 22:34:23,438 INFO L899 garLoopResultBuilder]: For program point L8921-1(line 8921) no Hoare annotation was computed. [2022-07-22 22:34:23,438 INFO L899 garLoopResultBuilder]: For program point L6820-1(line 6820) no Hoare annotation was computed. [2022-07-22 22:34:23,438 INFO L895 garLoopResultBuilder]: At program point L6820(line 6820) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)) [2022-07-22 22:34:23,438 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 22:34:23,438 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 22:34:23,438 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 22:34:23,438 INFO L899 garLoopResultBuilder]: For program point L7580(lines 7580 7588) no Hoare annotation was computed. [2022-07-22 22:34:23,438 INFO L899 garLoopResultBuilder]: For program point L7101-1(lines 7100 7113) no Hoare annotation was computed. [2022-07-22 22:34:23,438 INFO L895 garLoopResultBuilder]: At program point L7101(line 7101) the Hoare annotation is: false [2022-07-22 22:34:23,438 INFO L899 garLoopResultBuilder]: For program point L8918(lines 8918 8923) no Hoare annotation was computed. [2022-07-22 22:34:23,438 INFO L895 garLoopResultBuilder]: At program point L6821-1(line 6821) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)) [2022-07-22 22:34:23,438 INFO L895 garLoopResultBuilder]: At program point L6821(line 6821) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)) [2022-07-22 22:34:23,438 INFO L899 garLoopResultBuilder]: For program point L7589(lines 7589 7597) no Hoare annotation was computed. [2022-07-22 22:34:23,438 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 22:34:23,438 INFO L895 garLoopResultBuilder]: At program point L6272(lines 6263 6273) the Hoare annotation is: false [2022-07-22 22:34:23,438 INFO L899 garLoopResultBuilder]: For program point L8919-2(line 8919) no Hoare annotation was computed. [2022-07-22 22:34:23,438 INFO L895 garLoopResultBuilder]: At program point L8915(line 8915) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)) [2022-07-22 22:34:23,438 INFO L899 garLoopResultBuilder]: For program point L8915-1(lines 8915 8916) no Hoare annotation was computed. [2022-07-22 22:34:23,438 INFO L895 garLoopResultBuilder]: At program point L8919(line 8919) the Hoare annotation is: false [2022-07-22 22:34:23,439 INFO L895 garLoopResultBuilder]: At program point L8919-1(line 8919) the Hoare annotation is: false [2022-07-22 22:34:23,439 INFO L895 garLoopResultBuilder]: At program point L7598(line 7598) the Hoare annotation is: (or (and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_#res#1.base| 0))) (and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))) [2022-07-22 22:34:23,439 INFO L895 garLoopResultBuilder]: At program point L6826(line 6826) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0)) [2022-07-22 22:34:23,439 INFO L899 garLoopResultBuilder]: For program point L8915-3(lines 8915 8916) no Hoare annotation was computed. [2022-07-22 22:34:23,439 INFO L895 garLoopResultBuilder]: At program point L7598-2(lines 7577 7599) the Hoare annotation is: (or (and (not (= |ULTIMATE.start_aws_string_eq_c_str_~c_str#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_#res#1.base| 0))) (and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.base| 0) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~c_str~0#1.offset| 0))) [2022-07-22 22:34:23,439 INFO L899 garLoopResultBuilder]: For program point L8911(lines 8911 8924) no Hoare annotation was computed. [2022-07-22 22:34:23,439 INFO L899 garLoopResultBuilder]: For program point L7598-1(line 7598) no Hoare annotation was computed. [2022-07-22 22:34:23,439 INFO L899 garLoopResultBuilder]: For program point L6822(line 6822) no Hoare annotation was computed. [2022-07-22 22:34:23,439 INFO L899 garLoopResultBuilder]: For program point L7111-1(line 7111) no Hoare annotation was computed. [2022-07-22 22:34:23,439 INFO L895 garLoopResultBuilder]: At program point L7111(line 7111) the Hoare annotation is: false [2022-07-22 22:34:23,439 INFO L899 garLoopResultBuilder]: For program point L6826-1(line 6826) no Hoare annotation was computed. [2022-07-22 22:34:23,439 INFO L899 garLoopResultBuilder]: For program point L7107-1(line 7107) no Hoare annotation was computed. [2022-07-22 22:34:23,439 INFO L895 garLoopResultBuilder]: At program point L7107(line 7107) the Hoare annotation is: false [2022-07-22 22:34:23,439 INFO L895 garLoopResultBuilder]: At program point L8920(line 8920) the Hoare annotation is: false [2022-07-22 22:34:23,439 INFO L899 garLoopResultBuilder]: For program point L8920-1(line 8920) no Hoare annotation was computed. [2022-07-22 22:34:23,439 INFO L899 garLoopResultBuilder]: For program point L8912-3(line 8912) no Hoare annotation was computed. [2022-07-22 22:34:23,439 INFO L899 garLoopResultBuilder]: For program point L8912-5(lines 8912 8913) no Hoare annotation was computed. [2022-07-22 22:34:23,439 INFO L902 garLoopResultBuilder]: At program point L8912(line 8912) the Hoare annotation is: true [2022-07-22 22:34:23,439 INFO L895 garLoopResultBuilder]: At program point L6827(lines 6819 6828) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_~str~1#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_c_str_harness_~str~3#1.base| 0) (not (= |ULTIMATE.start_ensure_c_str_is_allocated_#res#1.base| 0))) [2022-07-22 22:34:23,440 INFO L899 garLoopResultBuilder]: For program point L8912-1(lines 8912 8913) no Hoare annotation was computed. [2022-07-22 22:34:23,440 INFO L902 garLoopResultBuilder]: At program point L8912-2(line 8912) the Hoare annotation is: true [2022-07-22 22:34:23,440 INFO L899 garLoopResultBuilder]: For program point L7108-1(lines 7108 7110) no Hoare annotation was computed. [2022-07-22 22:34:23,440 INFO L895 garLoopResultBuilder]: At program point L7108(lines 7108 7110) the Hoare annotation is: false [2022-07-22 22:34:23,440 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-22 22:34:23,440 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-22 22:34:23,440 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-22 22:34:23,440 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-22 22:34:23,440 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-22 22:34:23,440 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-22 22:34:23,443 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-07-22 22:34:23,445 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 22:34:23,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 10:34:23 BoogieIcfgContainer [2022-07-22 22:34:23,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 22:34:23,456 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 22:34:23,456 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 22:34:23,456 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 22:34:23,456 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:34:19" (3/4) ... [2022-07-22 22:34:23,458 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 22:34:23,462 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2022-07-22 22:34:23,462 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-22 22:34:23,462 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-22 22:34:23,463 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-22 22:34:23,463 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-22 22:34:23,463 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-22 22:34:23,463 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq_c_str [2022-07-22 22:34:23,463 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2022-07-22 22:34:23,463 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2022-07-22 22:34:23,469 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2022-07-22 22:34:23,469 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-22 22:34:23,470 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 22:34:23,470 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 22:34:23,488 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((str == 0 && !(str == 0)) && str == 0) && !(\result == 0) [2022-07-22 22:34:23,489 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(c_str == 0) && str == 0) && !(str == 0)) && str == 0) && !(\result == 0)) || (c_str == 0 && c_str == 0) [2022-07-22 22:34:23,489 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(str == 0) && (\old(max_size) == max_size || -16 + max_size == 0)) && !(\result == 0)) && !(\old(max_size) == 16) [2022-07-22 22:34:23,552 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 22:34:23,553 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 22:34:23,553 INFO L158 Benchmark]: Toolchain (without parser) took 6419.07ms. Allocated memory was 96.5MB in the beginning and 201.3MB in the end (delta: 104.9MB). Free memory was 57.0MB in the beginning and 97.9MB in the end (delta: -40.9MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. [2022-07-22 22:34:23,553 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 96.5MB. Free memory is still 51.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 22:34:23,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1681.82ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 56.8MB in the beginning and 84.7MB in the end (delta: -27.9MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. [2022-07-22 22:34:23,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 129.10ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 75.0MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 22:34:23,554 INFO L158 Benchmark]: Boogie Preprocessor took 75.25ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 70.0MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 22:34:23,554 INFO L158 Benchmark]: RCFGBuilder took 634.74ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 70.0MB in the beginning and 134.6MB in the end (delta: -64.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-07-22 22:34:23,554 INFO L158 Benchmark]: TraceAbstraction took 3795.20ms. Allocated memory is still 201.3MB. Free memory was 134.6MB in the beginning and 117.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2022-07-22 22:34:23,555 INFO L158 Benchmark]: Witness Printer took 97.06ms. Allocated memory is still 201.3MB. Free memory was 117.3MB in the beginning and 97.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-22 22:34:23,556 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 96.5MB. Free memory is still 51.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1681.82ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 56.8MB in the beginning and 84.7MB in the end (delta: -27.9MB). Peak memory consumption was 66.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 129.10ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 75.0MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.25ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 70.0MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 634.74ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 70.0MB in the beginning and 134.6MB in the end (delta: -64.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3795.20ms. Allocated memory is still 201.3MB. Free memory was 134.6MB in the beginning and 117.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Witness Printer took 97.06ms. Allocated memory is still 201.3MB. Free memory was 117.3MB in the beginning and 97.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * 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 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 1574 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1039 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1086 IncrementalHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 535 mSDtfsCounter, 1086 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 330 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=0, InterpolantAutomatonStates: 35, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 41 LocationsWithAnnotation, 129 PreInvPairs, 152 NumberOfFragments, 407 HoareAnnotationTreeSize, 129 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 41 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 399 NumberOfCodeBlocks, 399 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 491 ConstructedInterpolants, 0 QuantifiedInterpolants, 1120 SizeOfPredicates, 7 NumberOfNonLiveVariables, 911 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 259/291 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 8095]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6263]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 8925]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7577]: Loop Invariant Derived loop invariant: ((((!(c_str == 0) && str == 0) && !(str == 0)) && str == 0) && !(\result == 0)) || (c_str == 0 && c_str == 0) - InvariantResult [Line: 6807]: Loop Invariant Derived loop invariant: ((!(str == 0) && (\old(max_size) == max_size || -16 + max_size == 0)) && !(\result == 0)) && !(\old(max_size) == 16) - InvariantResult [Line: 6819]: Loop Invariant Derived loop invariant: ((str == 0 && !(str == 0)) && str == 0) && !(\result == 0) RESULT: Ultimate proved your program to be correct! [2022-07-22 22:34:23,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 Result: TRUE