./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_iter_delete_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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_hash_iter_delete_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 7608d8aa64807891206ad38b93db31434f261f46ffbbb3a8b8a4940e4ab5ce81 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:46:38,476 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:46:38,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:46:38,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:46:38,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:46:38,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:46:38,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:46:38,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:46:38,519 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:46:38,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:46:38,521 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:46:38,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:46:38,524 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:46:38,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:46:38,528 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:46:38,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:46:38,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:46:38,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:46:38,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:46:38,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:46:38,538 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:46:38,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:46:38,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:46:38,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:46:38,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:46:38,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:46:38,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:46:38,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:46:38,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:46:38,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:46:38,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:46:38,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:46:38,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:46:38,550 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:46:38,551 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:46:38,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:46:38,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:46:38,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:46:38,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:46:38,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:46:38,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:46:38,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:46:38,555 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 22:46:38,574 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:46:38,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:46:38,575 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:46:38,575 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:46:38,576 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:46:38,576 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:46:38,576 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:46:38,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:46:38,576 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:46:38,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:46:38,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:46:38,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:46:38,578 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:46:38,578 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:46:38,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:46:38,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:46:38,578 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:46:38,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:46:38,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:46:38,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:46:38,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:46:38,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:46:38,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:46:38,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:46:38,579 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:46:38,579 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:46:38,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:46:38,580 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:46:38,580 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:46:38,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:46:38,580 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 -> 7608d8aa64807891206ad38b93db31434f261f46ffbbb3a8b8a4940e4ab5ce81 [2022-07-13 22:46:38,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:46:38,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:46:38,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:46:38,804 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:46:38,805 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:46:38,805 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_iter_delete_harness.i [2022-07-13 22:46:38,855 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb2a136e7/1580d8db52d144379ed5f6a30b0e2eac/FLAG2493bef07 [2022-07-13 22:46:39,488 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:46:39,489 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_iter_delete_harness.i [2022-07-13 22:46:39,516 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb2a136e7/1580d8db52d144379ed5f6a30b0e2eac/FLAG2493bef07 [2022-07-13 22:46:39,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb2a136e7/1580d8db52d144379ed5f6a30b0e2eac [2022-07-13 22:46:39,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:46:39,888 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:46:39,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:46:39,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:46:39,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:46:39,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:46:39" (1/1) ... [2022-07-13 22:46:39,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16ff8959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:46:39, skipping insertion in model container [2022-07-13 22:46:39,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:46:39" (1/1) ... [2022-07-13 22:46:39,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:46:39,995 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:46:40,154 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_hash_iter_delete_harness.i[4494,4507] [2022-07-13 22:46:40,160 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_hash_iter_delete_harness.i[4554,4567] [2022-07-13 22:46:40,694 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:40,694 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:40,695 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:40,695 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:40,696 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:40,706 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:40,706 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:40,708 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:40,708 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:40,709 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:40,710 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:40,710 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:40,710 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:40,935 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:46:40,936 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:46:40,936 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:46:40,937 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:46:40,938 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:46:40,938 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:46:40,938 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:46:40,939 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:46:40,939 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:46:40,939 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:46:41,063 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:46:41,292 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,293 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,304 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,307 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,311 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,312 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,327 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,328 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,329 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,329 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,330 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,330 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,330 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:46:41,390 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:46:41,407 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_hash_iter_delete_harness.i[4494,4507] [2022-07-13 22:46:41,408 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_hash_iter_delete_harness.i[4554,4567] [2022-07-13 22:46:41,436 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,436 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,437 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,437 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,437 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,443 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,443 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,444 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,444 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,444 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,445 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,446 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,446 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,465 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:46:41,466 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:46:41,466 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:46:41,467 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:46:41,467 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:46:41,467 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:46:41,468 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:46:41,468 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:46:41,468 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:46:41,468 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:46:41,487 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:46:41,582 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,582 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,586 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,586 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,588 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,588 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,596 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,596 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,596 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,597 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,597 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,597 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,598 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:46:41,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:46:41,781 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:46:41,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:46:41 WrapperNode [2022-07-13 22:46:41,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:46:41,783 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:46:41,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:46:41,783 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:46:41,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:46:41" (1/1) ... [2022-07-13 22:46:41,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:46:41" (1/1) ... [2022-07-13 22:46:41,920 INFO L137 Inliner]: procedures = 774, calls = 2460, calls flagged for inlining = 66, calls inlined = 11, statements flattened = 732 [2022-07-13 22:46:41,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:46:41,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:46:41,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:46:41,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:46:41,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:46:41" (1/1) ... [2022-07-13 22:46:41,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:46:41" (1/1) ... [2022-07-13 22:46:41,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:46:41" (1/1) ... [2022-07-13 22:46:41,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:46:41" (1/1) ... [2022-07-13 22:46:41,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:46:41" (1/1) ... [2022-07-13 22:46:41,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:46:41" (1/1) ... [2022-07-13 22:46:41,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:46:41" (1/1) ... [2022-07-13 22:46:42,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:46:42,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:46:42,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:46:42,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:46:42,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:46:41" (1/1) ... [2022-07-13 22:46:42,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:46:42,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:46:42,039 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-13 22:46:42,047 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-13 22:46:42,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-13 22:46:42,067 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-13 22:46:42,068 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-13 22:46:42,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:46:42,068 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-13 22:46:42,069 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-13 22:46:42,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:46:42,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:46:42,069 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-07-13 22:46:42,069 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-07-13 22:46:42,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:46:42,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:46:42,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:46:42,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:46:42,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:46:42,070 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-13 22:46:42,070 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-13 22:46:42,070 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-07-13 22:46:42,070 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-07-13 22:46:42,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-13 22:46:42,070 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-13 22:46:42,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:46:42,071 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-07-13 22:46:42,071 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-07-13 22:46:42,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 22:46:42,071 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-13 22:46:42,071 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-13 22:46:42,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:46:42,072 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-07-13 22:46:42,072 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-07-13 22:46:42,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:46:42,072 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-07-13 22:46:42,072 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-07-13 22:46:42,072 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-13 22:46:42,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-13 22:46:42,072 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:46:42,073 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:46:42,073 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_iter_is_valid [2022-07-13 22:46:42,073 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_iter_is_valid [2022-07-13 22:46:42,073 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-07-13 22:46:42,073 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-07-13 22:46:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:46:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-07-13 22:46:42,076 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-07-13 22:46:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-07-13 22:46:42,076 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-07-13 22:46:42,076 INFO L130 BoogieDeclarations]: Found specification of procedure s_remove_entry [2022-07-13 22:46:42,077 INFO L138 BoogieDeclarations]: Found implementation of procedure s_remove_entry [2022-07-13 22:46:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_iter_delete [2022-07-13 22:46:42,077 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_iter_delete [2022-07-13 22:46:42,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:46:42,387 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:46:42,389 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:46:42,573 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !true; [2022-07-13 22:46:42,573 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !true; [2022-07-13 22:46:43,119 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:46:43,129 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:46:43,129 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-07-13 22:46:43,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:46:43 BoogieIcfgContainer [2022-07-13 22:46:43,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:46:43,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:46:43,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:46:43,135 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:46:43,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:46:39" (1/3) ... [2022-07-13 22:46:43,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253f97d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:46:43, skipping insertion in model container [2022-07-13 22:46:43,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:46:41" (2/3) ... [2022-07-13 22:46:43,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253f97d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:46:43, skipping insertion in model container [2022-07-13 22:46:43,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:46:43" (3/3) ... [2022-07-13 22:46:43,137 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_iter_delete_harness.i [2022-07-13 22:46:43,149 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:46:43,149 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:46:43,206 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:46:43,216 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@47ef4dd9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@10d02f98 [2022-07-13 22:46:43,216 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:46:43,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 137 states have (on average 1.2627737226277371) internal successors, (173), 136 states have internal predecessors, (173), 54 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2022-07-13 22:46:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-13 22:46:43,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:46:43,243 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:46:43,244 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:46:43,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:46:43,248 INFO L85 PathProgramCache]: Analyzing trace with hash 778506499, now seen corresponding path program 1 times [2022-07-13 22:46:43,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:46:43,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905459591] [2022-07-13 22:46:43,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:43,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:46:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:43,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:46:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:43,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:46:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:43,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:46:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:43,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:46:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:43,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:46:43,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:46:43,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905459591] [2022-07-13 22:46:43,705 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-07-13 22:46:43,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48261977] [2022-07-13 22:46:43,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:43,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:46:43,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:46:43,707 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-13 22:46:43,708 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-13 22:46:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:44,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 2544 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 22:46:44,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:46:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2022-07-13 22:46:44,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:46:44,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48261977] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:46:44,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:46:44,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 22:46:44,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008435498] [2022-07-13 22:46:44,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:46:44,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 22:46:44,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:46:44,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 22:46:44,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:46:44,184 INFO L87 Difference]: Start difference. First operand has 210 states, 137 states have (on average 1.2627737226277371) internal successors, (173), 136 states have internal predecessors, (173), 54 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-13 22:46:44,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:46:44,210 INFO L93 Difference]: Finished difference Result 415 states and 583 transitions. [2022-07-13 22:46:44,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 22:46:44,213 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 201 [2022-07-13 22:46:44,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:46:44,219 INFO L225 Difference]: With dead ends: 415 [2022-07-13 22:46:44,219 INFO L226 Difference]: Without dead ends: 205 [2022-07-13 22:46:44,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:46:44,230 INFO L413 NwaCegarLoop]: 273 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, 273 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-13 22:46:44,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:46:44,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-13 22:46:44,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-07-13 22:46:44,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 131 states have (on average 1.2290076335877862) internal successors, (161), 132 states have internal predecessors, (161), 54 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2022-07-13 22:46:44,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 268 transitions. [2022-07-13 22:46:44,272 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 268 transitions. Word has length 201 [2022-07-13 22:46:44,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:46:44,272 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 268 transitions. [2022-07-13 22:46:44,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-13 22:46:44,273 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 268 transitions. [2022-07-13 22:46:44,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-13 22:46:44,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:46:44,275 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:46:44,303 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-13 22:46:44,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-07-13 22:46:44,492 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:46:44,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:46:44,492 INFO L85 PathProgramCache]: Analyzing trace with hash -309437507, now seen corresponding path program 1 times [2022-07-13 22:46:44,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:46:44,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711920498] [2022-07-13 22:46:44,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:44,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:46:44,560 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 22:46:44,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1638562862] [2022-07-13 22:46:44,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:44,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:46:44,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:46:44,562 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:46:44,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 22:46:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:44,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 2544 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 22:46:44,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:46:45,037 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2022-07-13 22:46:45,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:46:45,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:46:45,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711920498] [2022-07-13 22:46:45,039 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 22:46:45,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638562862] [2022-07-13 22:46:45,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638562862] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:46:45,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:46:45,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:46:45,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375727227] [2022-07-13 22:46:45,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:46:45,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:46:45,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:46:45,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:46:45,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:46:45,046 INFO L87 Difference]: Start difference. First operand 205 states and 268 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-13 22:46:45,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:46:45,097 INFO L93 Difference]: Finished difference Result 373 states and 491 transitions. [2022-07-13 22:46:45,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:46:45,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) Word has length 201 [2022-07-13 22:46:45,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:46:45,106 INFO L225 Difference]: With dead ends: 373 [2022-07-13 22:46:45,106 INFO L226 Difference]: Without dead ends: 210 [2022-07-13 22:46:45,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:46:45,110 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 2 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:46:45,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1055 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:46:45,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-13 22:46:45,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-07-13 22:46:45,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 135 states have (on average 1.2222222222222223) internal successors, (165), 136 states have internal predecessors, (165), 54 states have call successors, (54), 19 states have call predecessors, (54), 20 states have return successors, (54), 54 states have call predecessors, (54), 53 states have call successors, (54) [2022-07-13 22:46:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 273 transitions. [2022-07-13 22:46:45,132 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 273 transitions. Word has length 201 [2022-07-13 22:46:45,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:46:45,134 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 273 transitions. [2022-07-13 22:46:45,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-13 22:46:45,135 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 273 transitions. [2022-07-13 22:46:45,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-13 22:46:45,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:46:45,136 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:46:45,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 22:46:45,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-07-13 22:46:45,343 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:46:45,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:46:45,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2085577371, now seen corresponding path program 1 times [2022-07-13 22:46:45,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:46:45,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554362137] [2022-07-13 22:46:45,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:45,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:46:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:46:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:46:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:46:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:46:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:46:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:46:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:46:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:46:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:46:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:46:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:46:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:46:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 22:46:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 22:46:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:46:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 22:46:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:46:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 22:46:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 22:46:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 22:46:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 22:46:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 22:46:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-13 22:46:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-13 22:46:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 22:46:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-13 22:46:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-13 22:46:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-13 22:46:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-13 22:46:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-13 22:46:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2022-07-13 22:46:45,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:46:45,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554362137] [2022-07-13 22:46:45,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554362137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:46:45,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:46:45,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 22:46:45,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195248675] [2022-07-13 22:46:45,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:46:45,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 22:46:45,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:46:45,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 22:46:45,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:46:45,863 INFO L87 Difference]: Start difference. First operand 210 states and 273 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 10 states have internal predecessors, (76), 4 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2022-07-13 22:46:47,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:46:47,045 INFO L93 Difference]: Finished difference Result 378 states and 499 transitions. [2022-07-13 22:46:47,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 22:46:47,045 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 10 states have internal predecessors, (76), 4 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) Word has length 207 [2022-07-13 22:46:47,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:46:47,048 INFO L225 Difference]: With dead ends: 378 [2022-07-13 22:46:47,048 INFO L226 Difference]: Without dead ends: 229 [2022-07-13 22:46:47,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2022-07-13 22:46:47,049 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 380 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:46:47,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 630 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-13 22:46:47,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-13 22:46:47,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 215. [2022-07-13 22:46:47,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 139 states have (on average 1.223021582733813) internal successors, (170), 141 states have internal predecessors, (170), 54 states have call successors, (54), 19 states have call predecessors, (54), 21 states have return successors, (55), 54 states have call predecessors, (55), 53 states have call successors, (55) [2022-07-13 22:46:47,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 279 transitions. [2022-07-13 22:46:47,068 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 279 transitions. Word has length 207 [2022-07-13 22:46:47,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:46:47,068 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 279 transitions. [2022-07-13 22:46:47,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 10 states have internal predecessors, (76), 4 states have call successors, (36), 5 states have call predecessors, (36), 3 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2022-07-13 22:46:47,069 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 279 transitions. [2022-07-13 22:46:47,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-13 22:46:47,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:46:47,070 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:46:47,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 22:46:47,071 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:46:47,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:46:47,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1668960419, now seen corresponding path program 1 times [2022-07-13 22:46:47,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:46:47,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98384384] [2022-07-13 22:46:47,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:47,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:46:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:46:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:46:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:46:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:46:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:46:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:46:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:46:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:46:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:46:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:46:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:46:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:46:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 22:46:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 22:46:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:46:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 22:46:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:46:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 22:46:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 22:46:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 22:46:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 22:46:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 22:46:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-13 22:46:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-13 22:46:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 22:46:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-13 22:46:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-13 22:46:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-13 22:46:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-13 22:46:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-13 22:46:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:47,435 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2022-07-13 22:46:47,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:46:47,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98384384] [2022-07-13 22:46:47,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98384384] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:46:47,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:46:47,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:46:47,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328667710] [2022-07-13 22:46:47,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:46:47,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:46:47,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:46:47,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:46:47,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:46:47,437 INFO L87 Difference]: Start difference. First operand 215 states and 279 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-13 22:46:48,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:46:48,033 INFO L93 Difference]: Finished difference Result 385 states and 507 transitions. [2022-07-13 22:46:48,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:46:48,034 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 207 [2022-07-13 22:46:48,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:46:48,035 INFO L225 Difference]: With dead ends: 385 [2022-07-13 22:46:48,035 INFO L226 Difference]: Without dead ends: 231 [2022-07-13 22:46:48,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:46:48,037 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 266 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:46:48,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 401 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 22:46:48,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-13 22:46:48,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 217. [2022-07-13 22:46:48,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 140 states have (on average 1.2214285714285715) internal successors, (171), 142 states have internal predecessors, (171), 55 states have call successors, (55), 19 states have call predecessors, (55), 21 states have return successors, (56), 55 states have call predecessors, (56), 54 states have call successors, (56) [2022-07-13 22:46:48,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 282 transitions. [2022-07-13 22:46:48,048 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 282 transitions. Word has length 207 [2022-07-13 22:46:48,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:46:48,049 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 282 transitions. [2022-07-13 22:46:48,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-13 22:46:48,049 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 282 transitions. [2022-07-13 22:46:48,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-13 22:46:48,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:46:48,051 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:46:48,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 22:46:48,052 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:46:48,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:46:48,052 INFO L85 PathProgramCache]: Analyzing trace with hash -336287017, now seen corresponding path program 1 times [2022-07-13 22:46:48,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:46:48,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894816188] [2022-07-13 22:46:48,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:48,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:46:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:46:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:46:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:46:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:46:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:46:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:46:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:46:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:46:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:46:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:46:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:46:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:46:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 22:46:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 22:46:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 22:46:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:46:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:46:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 22:46:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 22:46:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 22:46:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 22:46:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 22:46:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 22:46:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-13 22:46:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-13 22:46:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-13 22:46:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-13 22:46:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-13 22:46:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-13 22:46:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-13 22:46:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-13 22:46:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,400 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2022-07-13 22:46:48,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:46:48,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894816188] [2022-07-13 22:46:48,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894816188] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:46:48,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715574766] [2022-07-13 22:46:48,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:48,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:46:48,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:46:48,402 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:46:48,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 22:46:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:48,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 2572 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-13 22:46:48,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:46:49,647 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset)))) (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= (select (select |c_#memory_$Pointer$.base| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset) 0)))) is different from true [2022-07-13 22:46:55,493 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2022-07-13 22:46:55,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:46:55,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715574766] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:46:55,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:46:55,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-07-13 22:46:55,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791617622] [2022-07-13 22:46:55,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:46:55,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:46:55,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:46:55,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:46:55,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=175, Unknown=3, NotChecked=26, Total=240 [2022-07-13 22:46:55,496 INFO L87 Difference]: Start difference. First operand 217 states and 282 transitions. Second operand has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (34), 2 states have call predecessors, (34), 3 states have call successors, (34) [2022-07-13 22:46:55,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:46:55,688 INFO L93 Difference]: Finished difference Result 378 states and 504 transitions. [2022-07-13 22:46:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:46:55,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (34), 2 states have call predecessors, (34), 3 states have call successors, (34) Word has length 213 [2022-07-13 22:46:55,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:46:55,690 INFO L225 Difference]: With dead ends: 378 [2022-07-13 22:46:55,690 INFO L226 Difference]: Without dead ends: 220 [2022-07-13 22:46:55,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=51, Invalid=222, Unknown=3, NotChecked=30, Total=306 [2022-07-13 22:46:55,691 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 5 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 399 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:46:55,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1429 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 399 Unchecked, 0.1s Time] [2022-07-13 22:46:55,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-13 22:46:55,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2022-07-13 22:46:55,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 142 states have (on average 1.2183098591549295) internal successors, (173), 143 states have internal predecessors, (173), 55 states have call successors, (55), 20 states have call predecessors, (55), 21 states have return successors, (56), 55 states have call predecessors, (56), 54 states have call successors, (56) [2022-07-13 22:46:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 284 transitions. [2022-07-13 22:46:55,701 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 284 transitions. Word has length 213 [2022-07-13 22:46:55,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:46:55,702 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 284 transitions. [2022-07-13 22:46:55,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (34), 2 states have call predecessors, (34), 3 states have call successors, (34) [2022-07-13 22:46:55,702 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 284 transitions. [2022-07-13 22:46:55,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-07-13 22:46:55,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:46:55,705 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:46:55,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 22:46:55,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:46:55,915 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:46:55,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:46:55,916 INFO L85 PathProgramCache]: Analyzing trace with hash 54254165, now seen corresponding path program 1 times [2022-07-13 22:46:55,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:46:55,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752425970] [2022-07-13 22:46:55,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:55,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:46:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:46:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:46:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:46:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:46:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:46:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:46:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:46:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:46:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:46:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:46:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:46:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:46:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:46:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:46:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:46:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:46:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 22:46:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 22:46:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 22:46:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 22:46:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 22:46:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-13 22:46:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-13 22:46:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-13 22:46:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-13 22:46:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-13 22:46:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-13 22:46:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 22:46:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-13 22:46:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-13 22:46:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-13 22:46:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-13 22:46:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2022-07-13 22:46:56,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:46:56,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752425970] [2022-07-13 22:46:56,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752425970] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:46:56,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463142879] [2022-07-13 22:46:56,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:56,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:46:56,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:46:56,398 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:46:56,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 22:46:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:56,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 2602 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 22:46:56,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:46:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-07-13 22:46:56,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:46:56,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463142879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:46:56,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:46:56,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 10 [2022-07-13 22:46:56,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544189022] [2022-07-13 22:46:56,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:46:56,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:46:56,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:46:56,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:46:56,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:46:56,836 INFO L87 Difference]: Start difference. First operand 219 states and 284 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-13 22:46:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:46:56,949 INFO L93 Difference]: Finished difference Result 355 states and 466 transitions. [2022-07-13 22:46:56,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:46:56,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 218 [2022-07-13 22:46:56,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:46:56,954 INFO L225 Difference]: With dead ends: 355 [2022-07-13 22:46:56,954 INFO L226 Difference]: Without dead ends: 221 [2022-07-13 22:46:56,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:46:56,957 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 2 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:46:56,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1182 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:46:56,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-13 22:46:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-07-13 22:46:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 143 states have (on average 1.2167832167832169) internal successors, (174), 145 states have internal predecessors, (174), 55 states have call successors, (55), 20 states have call predecessors, (55), 22 states have return successors, (59), 55 states have call predecessors, (59), 54 states have call successors, (59) [2022-07-13 22:46:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 288 transitions. [2022-07-13 22:46:56,973 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 288 transitions. Word has length 218 [2022-07-13 22:46:56,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:46:56,974 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 288 transitions. [2022-07-13 22:46:56,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-13 22:46:56,975 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 288 transitions. [2022-07-13 22:46:56,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2022-07-13 22:46:56,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:46:56,977 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:46:57,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 22:46:57,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:46:57,198 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:46:57,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:46:57,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1846575800, now seen corresponding path program 1 times [2022-07-13 22:46:57,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:46:57,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541151292] [2022-07-13 22:46:57,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:57,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:46:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:46:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:46:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:46:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-13 22:46:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-13 22:46:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:46:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:46:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:46:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:46:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:46:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:46:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:46:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:46:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:46:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:46:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:46:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:46:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 22:46:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 22:46:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 22:46:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 22:46:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 22:46:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-13 22:46:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-13 22:46:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-13 22:46:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-13 22:46:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 22:46:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-13 22:46:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-13 22:46:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-13 22:46:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-13 22:46:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-13 22:46:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-13 22:46:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-13 22:46:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2022-07-13 22:46:57,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:46:57,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541151292] [2022-07-13 22:46:57,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541151292] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:46:57,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714030592] [2022-07-13 22:46:57,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:46:57,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:46:57,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:46:57,560 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:46:57,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 22:46:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:46:57,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 2660 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 22:46:57,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:46:58,142 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 364 proven. 47 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2022-07-13 22:46:58,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:46:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2022-07-13 22:46:58,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714030592] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:46:58,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:46:58,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-07-13 22:46:58,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566349243] [2022-07-13 22:46:58,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:46:58,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 22:46:58,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:46:58,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 22:46:58,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:46:58,323 INFO L87 Difference]: Start difference. First operand 221 states and 288 transitions. Second operand has 15 states, 15 states have (on average 12.466666666666667) internal successors, (187), 12 states have internal predecessors, (187), 9 states have call successors, (95), 6 states have call predecessors, (95), 5 states have return successors, (89), 9 states have call predecessors, (89), 9 states have call successors, (89) [2022-07-13 22:46:58,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:46:58,813 INFO L93 Difference]: Finished difference Result 280 states and 360 transitions. [2022-07-13 22:46:58,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:46:58,814 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 12.466666666666667) internal successors, (187), 12 states have internal predecessors, (187), 9 states have call successors, (95), 6 states have call predecessors, (95), 5 states have return successors, (89), 9 states have call predecessors, (89), 9 states have call successors, (89) Word has length 230 [2022-07-13 22:46:58,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:46:58,814 INFO L225 Difference]: With dead ends: 280 [2022-07-13 22:46:58,814 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 22:46:58,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:46:58,815 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 190 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:46:58,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 720 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:46:58,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 22:46:58,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 22:46:58,816 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-13 22:46:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 22:46:58,816 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 230 [2022-07-13 22:46:58,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:46:58,816 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 22:46:58,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.466666666666667) internal successors, (187), 12 states have internal predecessors, (187), 9 states have call successors, (95), 6 states have call predecessors, (95), 5 states have return successors, (89), 9 states have call predecessors, (89), 9 states have call successors, (89) [2022-07-13 22:46:58,817 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 22:46:58,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 22:46:58,819 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 22:46:58,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 22:46:59,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:46:59,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 22:46:59,546 INFO L899 garLoopResultBuilder]: For program point L6944-1(lines 6944 6946) no Hoare annotation was computed. [2022-07-13 22:46:59,546 INFO L895 garLoopResultBuilder]: At program point L6944(lines 6944 6946) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-13 22:46:59,546 INFO L895 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6943 6948) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-13 22:46:59,547 INFO L899 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6943 6948) no Hoare annotation was computed. [2022-07-13 22:46:59,547 INFO L899 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6943 6948) no Hoare annotation was computed. [2022-07-13 22:46:59,547 INFO L899 garLoopResultBuilder]: For program point L9990-5(line 9990) no Hoare annotation was computed. [2022-07-13 22:46:59,547 INFO L899 garLoopResultBuilder]: For program point L9990-7(line 9990) no Hoare annotation was computed. [2022-07-13 22:46:59,547 INFO L902 garLoopResultBuilder]: At program point aws_hash_table_is_validENTRY(lines 9988 9991) the Hoare annotation is: true [2022-07-13 22:46:59,547 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validEXIT(lines 9988 9991) no Hoare annotation was computed. [2022-07-13 22:46:59,547 INFO L899 garLoopResultBuilder]: For program point L9990-2(line 9990) no Hoare annotation was computed. [2022-07-13 22:46:59,547 INFO L899 garLoopResultBuilder]: For program point L9990-3(line 9990) no Hoare annotation was computed. [2022-07-13 22:46:59,547 INFO L895 garLoopResultBuilder]: At program point L9990-4(line 9990) the Hoare annotation is: (let ((.cse0 (or (= (select (select |#memory_$Pointer$.base| |aws_hash_table_is_valid_#in~map.base|) |aws_hash_table_is_valid_#in~map.offset|) 0) |aws_hash_table_is_valid_#t~short1284|)) (.cse1 (= aws_hash_table_is_valid_~map.offset |aws_hash_table_is_valid_#in~map.offset|)) (.cse2 (= |aws_hash_table_is_valid_#in~map.base| aws_hash_table_is_valid_~map.base))) (or (and (<= |aws_hash_table_is_valid_#in~map.base| 0) .cse0 (<= 0 |aws_hash_table_is_valid_#in~map.base|) .cse1 .cse2) (let ((.cse7 (= (select (select |#memory_$Pointer$.base| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset) 0)) (.cse4 (= 0 (select (select |#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset)))) (let ((.cse3 (or (not .cse7) (not .cse4)))) (and (or (and .cse3 |aws_hash_table_is_valid_#t~short1284|) (and (not |aws_hash_table_is_valid_#t~short1284|) .cse4)) .cse0 (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (let ((.cse6 (select (select |#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset)) (.cse5 (select (select |#memory_$Pointer$.base| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset))) (and (or (not (= .cse5 0)) (not (= 0 .cse6))) (= |aws_hash_table_is_valid_#t~mem1282.offset| .cse6) (= .cse5 |aws_hash_table_is_valid_#t~mem1282.base|)))) .cse1 .cse2 (or (and (not |aws_hash_table_is_valid_#t~short1281|) .cse7 .cse4) (and .cse3 |aws_hash_table_is_valid_#t~short1281|))))) (not (< 0 |#StackHeapBarrier|)))) [2022-07-13 22:46:59,547 INFO L899 garLoopResultBuilder]: For program point aws_hash_table_is_validFINAL(lines 9988 9991) no Hoare annotation was computed. [2022-07-13 22:46:59,547 INFO L899 garLoopResultBuilder]: For program point L9990(line 9990) no Hoare annotation was computed. [2022-07-13 22:46:59,547 INFO L902 garLoopResultBuilder]: At program point L9140(line 9140) the Hoare annotation is: true [2022-07-13 22:46:59,547 INFO L902 garLoopResultBuilder]: At program point L9140-1(line 9140) the Hoare annotation is: true [2022-07-13 22:46:59,547 INFO L899 garLoopResultBuilder]: For program point L9140-2(line 9140) no Hoare annotation was computed. [2022-07-13 22:46:59,548 INFO L902 garLoopResultBuilder]: At program point L9640-3(line 9640) the Hoare annotation is: true [2022-07-13 22:46:59,548 INFO L899 garLoopResultBuilder]: For program point L9640-4(line 9640) no Hoare annotation was computed. [2022-07-13 22:46:59,548 INFO L902 garLoopResultBuilder]: At program point L9640-5(lines 9603 9641) the Hoare annotation is: true [2022-07-13 22:46:59,548 INFO L899 garLoopResultBuilder]: For program point L9640-6(lines 9603 9641) no Hoare annotation was computed. [2022-07-13 22:46:59,548 INFO L899 garLoopResultBuilder]: For program point L9640(line 9640) no Hoare annotation was computed. [2022-07-13 22:46:59,548 INFO L899 garLoopResultBuilder]: For program point L9640-1(line 9640) no Hoare annotation was computed. [2022-07-13 22:46:59,548 INFO L902 garLoopResultBuilder]: At program point L9604(line 9604) the Hoare annotation is: true [2022-07-13 22:46:59,548 INFO L902 garLoopResultBuilder]: At program point L9604-1(line 9604) the Hoare annotation is: true [2022-07-13 22:46:59,548 INFO L899 garLoopResultBuilder]: For program point L9604-2(line 9604) no Hoare annotation was computed. [2022-07-13 22:46:59,548 INFO L899 garLoopResultBuilder]: For program point L9629(lines 9629 9631) no Hoare annotation was computed. [2022-07-13 22:46:59,548 INFO L899 garLoopResultBuilder]: For program point L9142-1(line 9142) no Hoare annotation was computed. [2022-07-13 22:46:59,548 INFO L899 garLoopResultBuilder]: For program point L9621(lines 9621 9623) no Hoare annotation was computed. [2022-07-13 22:46:59,549 INFO L902 garLoopResultBuilder]: At program point L9142-2(line 9142) the Hoare annotation is: true [2022-07-13 22:46:59,549 INFO L899 garLoopResultBuilder]: For program point L9142-3(line 9142) no Hoare annotation was computed. [2022-07-13 22:46:59,549 INFO L902 garLoopResultBuilder]: At program point L9142-5(line 9142) the Hoare annotation is: true [2022-07-13 22:46:59,549 INFO L899 garLoopResultBuilder]: For program point L9142-6(line 9142) no Hoare annotation was computed. [2022-07-13 22:46:59,549 INFO L902 garLoopResultBuilder]: At program point s_remove_entryENTRY(lines 9603 9641) the Hoare annotation is: true [2022-07-13 22:46:59,549 INFO L902 garLoopResultBuilder]: At program point L9617-2(lines 9617 9636) the Hoare annotation is: true [2022-07-13 22:46:59,549 INFO L902 garLoopResultBuilder]: At program point L9142-8(line 9142) the Hoare annotation is: true [2022-07-13 22:46:59,549 INFO L902 garLoopResultBuilder]: At program point L9605(line 9605) the Hoare annotation is: true [2022-07-13 22:46:59,549 INFO L899 garLoopResultBuilder]: For program point L9605-1(line 9605) no Hoare annotation was computed. [2022-07-13 22:46:59,549 INFO L902 garLoopResultBuilder]: At program point L9139(lines 9139 9143) the Hoare annotation is: true [2022-07-13 22:46:59,549 INFO L899 garLoopResultBuilder]: For program point s_remove_entryEXIT(lines 9603 9641) no Hoare annotation was computed. [2022-07-13 22:46:59,549 INFO L902 garLoopResultBuilder]: At program point L9639-2(lines 9603 9641) the Hoare annotation is: true [2022-07-13 22:46:59,549 INFO L902 garLoopResultBuilder]: At program point L9606-2(line 9606) the Hoare annotation is: true [2022-07-13 22:46:59,549 INFO L899 garLoopResultBuilder]: For program point L9606-3(line 9606) no Hoare annotation was computed. [2022-07-13 22:46:59,550 INFO L899 garLoopResultBuilder]: For program point L9639(line 9639) no Hoare annotation was computed. [2022-07-13 22:46:59,550 INFO L899 garLoopResultBuilder]: For program point L9606(line 9606) no Hoare annotation was computed. [2022-07-13 22:46:59,550 INFO L899 garLoopResultBuilder]: For program point L9639-1(line 9639) no Hoare annotation was computed. [2022-07-13 22:46:59,550 INFO L899 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2022-07-13 22:46:59,550 INFO L899 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2022-07-13 22:46:59,550 INFO L902 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2022-07-13 22:46:59,551 INFO L902 garLoopResultBuilder]: At program point L10108(line 10108) the Hoare annotation is: true [2022-07-13 22:46:59,551 INFO L895 garLoopResultBuilder]: At program point hash_table_state_required_bytesENTRY(lines 10101 10113) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (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)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-07-13 22:46:59,551 INFO L899 garLoopResultBuilder]: For program point L10108-1(line 10108) no Hoare annotation was computed. [2022-07-13 22:46:59,551 INFO L899 garLoopResultBuilder]: For program point L10108-2(lines 10108 10110) no Hoare annotation was computed. [2022-07-13 22:46:59,551 INFO L895 garLoopResultBuilder]: At program point L10104(line 10104) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (= ~tl_last_error~0 |old(~tl_last_error~0)|)) [2022-07-13 22:46:59,551 INFO L899 garLoopResultBuilder]: For program point L10104-1(line 10104) no Hoare annotation was computed. [2022-07-13 22:46:59,552 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesEXIT(lines 10101 10113) no Hoare annotation was computed. [2022-07-13 22:46:59,552 INFO L899 garLoopResultBuilder]: For program point L10104-2(lines 10104 10106) no Hoare annotation was computed. [2022-07-13 22:46:59,552 INFO L899 garLoopResultBuilder]: For program point hash_table_state_required_bytesFINAL(lines 10101 10113) no Hoare annotation was computed. [2022-07-13 22:46:59,552 INFO L899 garLoopResultBuilder]: For program point L10075(lines 10075 10088) no Hoare annotation was computed. [2022-07-13 22:46:59,552 INFO L899 garLoopResultBuilder]: For program point L10079(line 10079) no Hoare annotation was computed. [2022-07-13 22:46:59,552 INFO L899 garLoopResultBuilder]: For program point L10069(lines 10069 10073) no Hoare annotation was computed. [2022-07-13 22:46:59,552 INFO L902 garLoopResultBuilder]: At program point aws_hash_iter_is_validENTRY(lines 10052 10093) the Hoare annotation is: true [2022-07-13 22:46:59,552 INFO L899 garLoopResultBuilder]: For program point L10059(lines 10059 10063) no Hoare annotation was computed. [2022-07-13 22:46:59,552 INFO L899 garLoopResultBuilder]: For program point L10082(lines 10082 10083) no Hoare annotation was computed. [2022-07-13 22:46:59,552 INFO L899 garLoopResultBuilder]: For program point L10076(line 10076) no Hoare annotation was computed. [2022-07-13 22:46:59,553 INFO L899 garLoopResultBuilder]: For program point L10082-2(lines 10082 10083) no Hoare annotation was computed. [2022-07-13 22:46:59,553 INFO L899 garLoopResultBuilder]: For program point aws_hash_iter_is_validEXIT(lines 10052 10093) no Hoare annotation was computed. [2022-07-13 22:46:59,553 INFO L895 garLoopResultBuilder]: At program point L10064(line 10064) the Hoare annotation is: (or (and (= |aws_hash_iter_is_valid_#in~iter.base| 0) (= aws_hash_iter_is_valid_~iter.base |aws_hash_iter_is_valid_#in~iter.base|)) (not (< 0 |#StackHeapBarrier|))) [2022-07-13 22:46:59,553 INFO L899 garLoopResultBuilder]: For program point L10064-1(lines 10064 10068) no Hoare annotation was computed. [2022-07-13 22:46:59,553 INFO L899 garLoopResultBuilder]: For program point L10085(line 10085) no Hoare annotation was computed. [2022-07-13 22:46:59,553 INFO L899 garLoopResultBuilder]: For program point L10087-2(line 10087) no Hoare annotation was computed. [2022-07-13 22:46:59,553 INFO L899 garLoopResultBuilder]: For program point aws_hash_iter_is_validFINAL(lines 10052 10093) no Hoare annotation was computed. [2022-07-13 22:46:59,553 INFO L899 garLoopResultBuilder]: For program point L10087(line 10087) no Hoare annotation was computed. [2022-07-13 22:46:59,553 INFO L899 garLoopResultBuilder]: For program point L10054(lines 10054 10058) no Hoare annotation was computed. [2022-07-13 22:46:59,553 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedEXIT(lines 2586 2594) no Hoare annotation was computed. [2022-07-13 22:46:59,554 INFO L899 garLoopResultBuilder]: For program point L2498-1(lines 2498 2499) no Hoare annotation was computed. [2022-07-13 22:46:59,554 INFO L899 garLoopResultBuilder]: For program point aws_mul_size_checkedFINAL(lines 2586 2594) no Hoare annotation was computed. [2022-07-13 22:46:59,554 INFO L895 garLoopResultBuilder]: At program point aws_mul_size_checkedENTRY(lines 2586 2594) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (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)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-07-13 22:46:59,554 INFO L902 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: true [2022-07-13 22:46:59,554 INFO L895 garLoopResultBuilder]: At program point L2498(line 2498) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (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)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-07-13 22:46:59,554 INFO L899 garLoopResultBuilder]: For program point L2499-1(line 2499) no Hoare annotation was computed. [2022-07-13 22:46:59,554 INFO L895 garLoopResultBuilder]: At program point L2499(line 2499) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (= ~tl_last_error~0 |old(~tl_last_error~0)|)) [2022-07-13 22:46:59,554 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-07-13 22:46:59,554 INFO L902 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-07-13 22:46:59,555 INFO L899 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-07-13 22:46:59,555 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2022-07-13 22:46:59,555 INFO L902 garLoopResultBuilder]: At program point ##fun~$Pointer$~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2022-07-13 22:46:59,555 INFO L899 garLoopResultBuilder]: For program point ##fun~$Pointer$~TO~VOIDFINAL(line -1) no Hoare annotation was computed. [2022-07-13 22:46:59,555 INFO L899 garLoopResultBuilder]: For program point L6852(line 6852) no Hoare annotation was computed. [2022-07-13 22:46:59,555 INFO L895 garLoopResultBuilder]: At program point __CPROVER_overflow_plusENTRY(lines 248 251) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-13 22:46:59,555 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusFINAL(lines 248 251) no Hoare annotation was computed. [2022-07-13 22:46:59,555 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_plusEXIT(lines 248 251) no Hoare annotation was computed. [2022-07-13 22:46:59,555 INFO L902 garLoopResultBuilder]: At program point hash_table_state_is_validENTRY(lines 9999 10046) the Hoare annotation is: true [2022-07-13 22:46:59,556 INFO L902 garLoopResultBuilder]: At program point L10027(line 10027) the Hoare annotation is: true [2022-07-13 22:46:59,556 INFO L899 garLoopResultBuilder]: For program point L10027-1(line 10027) no Hoare annotation was computed. [2022-07-13 22:46:59,556 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validEXIT(lines 9999 10046) no Hoare annotation was computed. [2022-07-13 22:46:59,556 INFO L899 garLoopResultBuilder]: For program point L10001(lines 10001 10005) no Hoare annotation was computed. [2022-07-13 22:46:59,556 INFO L899 garLoopResultBuilder]: For program point hash_table_state_is_validFINAL(lines 9999 10046) no Hoare annotation was computed. [2022-07-13 22:46:59,556 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2022-07-13 22:46:59,556 INFO L902 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2022-07-13 22:46:59,556 INFO L902 garLoopResultBuilder]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2022-07-13 22:46:59,556 INFO L899 garLoopResultBuilder]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2022-07-13 22:46:59,556 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-13 22:46:59,557 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-13 22:46:59,557 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-13 22:46:59,557 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-13 22:46:59,557 INFO L895 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (= ~tl_last_error~0 |old(~tl_last_error~0)|)) [2022-07-13 22:46:59,557 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2022-07-13 22:46:59,557 INFO L899 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2022-07-13 22:46:59,557 INFO L899 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2022-07-13 22:46:59,557 INFO L895 garLoopResultBuilder]: At program point __CPROVER_overflow_multENTRY(lines 253 256) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-07-13 22:46:59,557 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multEXIT(lines 253 256) no Hoare annotation was computed. [2022-07-13 22:46:59,558 INFO L899 garLoopResultBuilder]: For program point __CPROVER_overflow_multFINAL(lines 253 256) no Hoare annotation was computed. [2022-07-13 22:46:59,558 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoFINAL(lines 2626 2631) no Hoare annotation was computed. [2022-07-13 22:46:59,558 INFO L899 garLoopResultBuilder]: For program point aws_is_power_of_twoEXIT(lines 2626 2631) no Hoare annotation was computed. [2022-07-13 22:46:59,558 INFO L902 garLoopResultBuilder]: At program point aws_is_power_of_twoENTRY(lines 2626 2631) the Hoare annotation is: true [2022-07-13 22:46:59,558 INFO L902 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: true [2022-07-13 22:46:59,558 INFO L895 garLoopResultBuilder]: At program point aws_add_size_checkedENTRY(lines 2613 2621) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (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)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-07-13 22:46:59,558 INFO L895 garLoopResultBuilder]: At program point L2542(line 2542) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (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)|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|))) [2022-07-13 22:46:59,558 INFO L899 garLoopResultBuilder]: For program point L2543-1(line 2543) no Hoare annotation was computed. [2022-07-13 22:46:59,558 INFO L895 garLoopResultBuilder]: At program point L2543(line 2543) the Hoare annotation is: (or (not (< 0 |#StackHeapBarrier|)) (= ~tl_last_error~0 |old(~tl_last_error~0)|)) [2022-07-13 22:46:59,558 INFO L899 garLoopResultBuilder]: For program point L2542-1(lines 2542 2543) no Hoare annotation was computed. [2022-07-13 22:46:59,559 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedFINAL(lines 2613 2621) no Hoare annotation was computed. [2022-07-13 22:46:59,559 INFO L899 garLoopResultBuilder]: For program point aws_add_size_checkedEXIT(lines 2613 2621) no Hoare annotation was computed. [2022-07-13 22:46:59,559 INFO L899 garLoopResultBuilder]: For program point L9883(lines 9883 9885) no Hoare annotation was computed. [2022-07-13 22:46:59,559 INFO L902 garLoopResultBuilder]: At program point L9887(line 9887) the Hoare annotation is: true [2022-07-13 22:46:59,559 INFO L899 garLoopResultBuilder]: For program point L9887-1(line 9887) no Hoare annotation was computed. [2022-07-13 22:46:59,559 INFO L899 garLoopResultBuilder]: For program point L9883-2(lines 9883 9885) no Hoare annotation was computed. [2022-07-13 22:46:59,559 INFO L902 garLoopResultBuilder]: At program point L9900(line 9900) the Hoare annotation is: true [2022-07-13 22:46:59,559 INFO L899 garLoopResultBuilder]: For program point L9900-1(line 9900) no Hoare annotation was computed. [2022-07-13 22:46:59,559 INFO L899 garLoopResultBuilder]: For program point L9892(line 9892) no Hoare annotation was computed. [2022-07-13 22:46:59,560 INFO L899 garLoopResultBuilder]: For program point L9892-2(lines 9892 9894) no Hoare annotation was computed. [2022-07-13 22:46:59,560 INFO L902 garLoopResultBuilder]: At program point L9884(line 9884) the Hoare annotation is: true [2022-07-13 22:46:59,560 INFO L899 garLoopResultBuilder]: For program point aws_hash_iter_deleteFINAL(lines 9871 9904) no Hoare annotation was computed. [2022-07-13 22:46:59,560 INFO L899 garLoopResultBuilder]: For program point L9884-1(line 9884) no Hoare annotation was computed. [2022-07-13 22:46:59,560 INFO L899 garLoopResultBuilder]: For program point L9892-4(lines 9892 9894) no Hoare annotation was computed. [2022-07-13 22:46:59,560 INFO L902 garLoopResultBuilder]: At program point L9876(line 9876) the Hoare annotation is: true [2022-07-13 22:46:59,560 INFO L902 garLoopResultBuilder]: At program point L9876-1(line 9876) the Hoare annotation is: true [2022-07-13 22:46:59,560 INFO L899 garLoopResultBuilder]: For program point L9876-2(line 9876) no Hoare annotation was computed. [2022-07-13 22:46:59,560 INFO L902 garLoopResultBuilder]: At program point aws_hash_iter_deleteENTRY(lines 9871 9904) the Hoare annotation is: true [2022-07-13 22:46:59,560 INFO L899 garLoopResultBuilder]: For program point aws_hash_iter_deleteEXIT(lines 9871 9904) no Hoare annotation was computed. [2022-07-13 22:46:59,561 INFO L902 garLoopResultBuilder]: At program point L9877(line 9877) the Hoare annotation is: true [2022-07-13 22:46:59,561 INFO L899 garLoopResultBuilder]: For program point L9877-1(line 9877) no Hoare annotation was computed. [2022-07-13 22:46:59,561 INFO L899 garLoopResultBuilder]: For program point L9882(lines 9882 9889) no Hoare annotation was computed. [2022-07-13 22:46:59,561 INFO L899 garLoopResultBuilder]: For program point L9886(lines 9886 9888) no Hoare annotation was computed. [2022-07-13 22:46:59,561 INFO L902 garLoopResultBuilder]: At program point L9874(line 9874) the Hoare annotation is: true [2022-07-13 22:46:59,561 INFO L899 garLoopResultBuilder]: For program point L9882-1(lines 9882 9889) no Hoare annotation was computed. [2022-07-13 22:46:59,561 INFO L899 garLoopResultBuilder]: For program point L9903-2(line 9903) no Hoare annotation was computed. [2022-07-13 22:46:59,561 INFO L899 garLoopResultBuilder]: For program point L9874-1(line 9874) no Hoare annotation was computed. [2022-07-13 22:46:59,561 INFO L902 garLoopResultBuilder]: At program point L9903(line 9903) the Hoare annotation is: true [2022-07-13 22:46:59,562 INFO L902 garLoopResultBuilder]: At program point L9903-1(line 9903) the Hoare annotation is: true [2022-07-13 22:46:59,562 INFO L902 garLoopResultBuilder]: At program point L9891(line 9891) the Hoare annotation is: true [2022-07-13 22:46:59,562 INFO L899 garLoopResultBuilder]: For program point L9891-1(line 9891) no Hoare annotation was computed. [2022-07-13 22:46:59,562 INFO L899 garLoopResultBuilder]: For program point L6815-1(line 6815) no Hoare annotation was computed. [2022-07-13 22:46:59,562 INFO L895 garLoopResultBuilder]: At program point L6815(line 6815) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:46:59,562 INFO L895 garLoopResultBuilder]: At program point L6811-1(line 6811) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:46:59,562 INFO L895 garLoopResultBuilder]: At program point L6811(line 6811) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:46:59,562 INFO L899 garLoopResultBuilder]: For program point L6815-3(line 6815) no Hoare annotation was computed. [2022-07-13 22:46:59,562 INFO L895 garLoopResultBuilder]: At program point L6815-2(line 6815) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:46:59,563 INFO L899 garLoopResultBuilder]: For program point L6840-1(line 6840) no Hoare annotation was computed. [2022-07-13 22:46:59,563 INFO L895 garLoopResultBuilder]: At program point L6840(line 6840) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) 0)) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:46:59,563 INFO L895 garLoopResultBuilder]: At program point L10131(line 10131) the Hoare annotation is: false [2022-07-13 22:46:59,563 INFO L899 garLoopResultBuilder]: For program point L10131-1(line 10131) no Hoare annotation was computed. [2022-07-13 22:46:59,563 INFO L895 garLoopResultBuilder]: At program point L10127(line 10127) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (< 1 |ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:46:59,563 INFO L899 garLoopResultBuilder]: For program point L10127-1(line 10127) no Hoare annotation was computed. [2022-07-13 22:46:59,563 INFO L895 garLoopResultBuilder]: At program point L10119-2(line 10119) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) 0)) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:46:59,563 INFO L899 garLoopResultBuilder]: For program point L10119-3(line 10119) no Hoare annotation was computed. [2022-07-13 22:46:59,563 INFO L899 garLoopResultBuilder]: For program point L10119(line 10119) no Hoare annotation was computed. [2022-07-13 22:46:59,564 INFO L899 garLoopResultBuilder]: For program point L6816-1(line 6816) no Hoare annotation was computed. [2022-07-13 22:46:59,564 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 22:46:59,564 INFO L895 garLoopResultBuilder]: At program point L6816(line 6816) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:46:59,564 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 22:46:59,564 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 22:46:59,564 INFO L899 garLoopResultBuilder]: For program point L6812-1(line 6812) no Hoare annotation was computed. [2022-07-13 22:46:59,564 INFO L895 garLoopResultBuilder]: At program point L6812(line 6812) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:46:59,564 INFO L895 garLoopResultBuilder]: At program point L10132(line 10132) the Hoare annotation is: false [2022-07-13 22:46:59,564 INFO L899 garLoopResultBuilder]: For program point L6841-1(line 6841) no Hoare annotation was computed. [2022-07-13 22:46:59,565 INFO L895 garLoopResultBuilder]: At program point L10132-1(line 10132) the Hoare annotation is: false [2022-07-13 22:46:59,565 INFO L895 garLoopResultBuilder]: At program point L6841(line 6841) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) 0)) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:46:59,565 INFO L899 garLoopResultBuilder]: For program point L10132-2(line 10132) no Hoare annotation was computed. [2022-07-13 22:46:59,565 INFO L895 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:46:59,565 INFO L895 garLoopResultBuilder]: At program point L10128(line 10128) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (< 1 |ULTIMATE.start_aws_hash_iter_delete_harness_~#iter~2#1.base|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:46:59,565 INFO L895 garLoopResultBuilder]: At program point L10128-1(line 10128) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= 0 |ULTIMATE.start_aws_hash_iter_delete_harness_#t~ret1341#1|) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|)) [2022-07-13 22:46:59,565 INFO L899 garLoopResultBuilder]: For program point L10128-2(line 10128) no Hoare annotation was computed. [2022-07-13 22:46:59,565 INFO L899 garLoopResultBuilder]: For program point L10120-3(line 10120) no Hoare annotation was computed. [2022-07-13 22:46:59,565 INFO L899 garLoopResultBuilder]: For program point L10120(line 10120) no Hoare annotation was computed. [2022-07-13 22:46:59,566 INFO L895 garLoopResultBuilder]: At program point L10120-2(line 10120) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) 0)) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:46:59,566 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 22:46:59,566 INFO L899 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2022-07-13 22:46:59,566 INFO L895 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:46:59,566 INFO L895 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:46:59,566 INFO L899 garLoopResultBuilder]: For program point L6839-1(line 6839) no Hoare annotation was computed. [2022-07-13 22:46:59,566 INFO L895 garLoopResultBuilder]: At program point L6839(line 6839) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) 0)) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:46:59,566 INFO L899 garLoopResultBuilder]: For program point L6810-1(line 6810) no Hoare annotation was computed. [2022-07-13 22:46:59,566 INFO L895 garLoopResultBuilder]: At program point L10130(line 10130) the Hoare annotation is: false [2022-07-13 22:46:59,566 INFO L902 garLoopResultBuilder]: At program point L10134(line 10134) the Hoare annotation is: true [2022-07-13 22:46:59,567 INFO L895 garLoopResultBuilder]: At program point L10122(line 10122) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:46:59,567 INFO L895 garLoopResultBuilder]: At program point L10130-1(line 10130) the Hoare annotation is: false [2022-07-13 22:46:59,567 INFO L899 garLoopResultBuilder]: For program point L10130-2(line 10130) no Hoare annotation was computed. [2022-07-13 22:46:59,567 INFO L895 garLoopResultBuilder]: At program point L10118-1(line 10118) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) 0)) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:46:59,567 INFO L899 garLoopResultBuilder]: For program point L10118-2(line 10118) no Hoare annotation was computed. [2022-07-13 22:46:59,567 INFO L899 garLoopResultBuilder]: For program point L10114(lines 10114 10133) no Hoare annotation was computed. [2022-07-13 22:46:59,567 INFO L899 garLoopResultBuilder]: For program point L10122-1(line 10122) no Hoare annotation was computed. [2022-07-13 22:46:59,567 INFO L895 garLoopResultBuilder]: At program point L10118(line 10118) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| 0)) (= |ULTIMATE.start_ensure_allocated_hash_table_~map#1.offset| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base|) |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.offset|) 0)) (= |ULTIMATE.start_aws_hash_iter_delete_harness_~#map~0#1.base| |ULTIMATE.start_ensure_allocated_hash_table_~map#1.base|) (< 0 |#StackHeapBarrier|)) [2022-07-13 22:46:59,567 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-13 22:46:59,568 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-13 22:46:59,568 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-13 22:46:59,568 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-13 22:46:59,568 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-13 22:46:59,568 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-13 22:46:59,570 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:46:59,572 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 22:46:59,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 10:46:59 BoogieIcfgContainer [2022-07-13 22:46:59,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 22:46:59,582 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 22:46:59,582 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 22:46:59,582 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 22:46:59,583 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:46:43" (3/4) ... [2022-07-13 22:46:59,584 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 22:46:59,588 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2022-07-13 22:46:59,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_table_is_valid [2022-07-13 22:46:59,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_is_valid [2022-07-13 22:46:59,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2022-07-13 22:46:59,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure s_remove_entry [2022-07-13 22:46:59,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2022-07-13 22:46:59,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_table_state_required_bytes [2022-07-13 22:46:59,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-13 22:46:59,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2022-07-13 22:46:59,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_mult [2022-07-13 22:46:59,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_is_power_of_two [2022-07-13 22:46:59,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_iter_is_valid [2022-07-13 22:46:59,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_add_size_checked [2022-07-13 22:46:59,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mul_size_checked [2022-07-13 22:46:59,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-07-13 22:46:59,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2022-07-13 22:46:59,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_hash_iter_delete [2022-07-13 22:46:59,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-13 22:46:59,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __CPROVER_overflow_plus [2022-07-13 22:46:59,600 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 159 nodes and edges [2022-07-13 22:46:59,601 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 75 nodes and edges [2022-07-13 22:46:59,602 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-07-13 22:46:59,603 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-13 22:46:59,604 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-13 22:46:59,604 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-13 22:46:59,605 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 22:46:59,606 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 22:46:59,942 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 22:46:59,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 22:46:59,943 INFO L158 Benchmark]: Toolchain (without parser) took 20055.29ms. Allocated memory was 98.6MB in the beginning and 270.5MB in the end (delta: 172.0MB). Free memory was 49.4MB in the beginning and 28.5MB in the end (delta: 20.9MB). Peak memory consumption was 195.2MB. Max. memory is 16.1GB. [2022-07-13 22:46:59,943 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 22:46:59,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1893.80ms. Allocated memory was 98.6MB in the beginning and 184.5MB in the end (delta: 86.0MB). Free memory was 49.2MB in the beginning and 124.1MB in the end (delta: -74.9MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. [2022-07-13 22:46:59,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 138.22ms. Allocated memory is still 184.5MB. Free memory was 124.1MB in the beginning and 112.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 22:46:59,944 INFO L158 Benchmark]: Boogie Preprocessor took 89.69ms. Allocated memory is still 184.5MB. Free memory was 112.6MB in the beginning and 104.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 22:46:59,944 INFO L158 Benchmark]: RCFGBuilder took 1119.94ms. Allocated memory is still 184.5MB. Free memory was 104.2MB in the beginning and 113.9MB in the end (delta: -9.7MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2022-07-13 22:46:59,944 INFO L158 Benchmark]: TraceAbstraction took 16448.38ms. Allocated memory was 184.5MB in the beginning and 270.5MB in the end (delta: 86.0MB). Free memory was 112.9MB in the beginning and 153.3MB in the end (delta: -40.4MB). Peak memory consumption was 153.7MB. Max. memory is 16.1GB. [2022-07-13 22:46:59,944 INFO L158 Benchmark]: Witness Printer took 360.61ms. Allocated memory is still 270.5MB. Free memory was 153.3MB in the beginning and 28.5MB in the end (delta: 124.8MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. [2022-07-13 22:46:59,945 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.14ms. Allocated memory is still 98.6MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1893.80ms. Allocated memory was 98.6MB in the beginning and 184.5MB in the end (delta: 86.0MB). Free memory was 49.2MB in the beginning and 124.1MB in the end (delta: -74.9MB). Peak memory consumption was 86.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 138.22ms. Allocated memory is still 184.5MB. Free memory was 124.1MB in the beginning and 112.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.69ms. Allocated memory is still 184.5MB. Free memory was 112.6MB in the beginning and 104.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1119.94ms. Allocated memory is still 184.5MB. Free memory was 104.2MB in the beginning and 113.9MB in the end (delta: -9.7MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. * TraceAbstraction took 16448.38ms. Allocated memory was 184.5MB in the beginning and 270.5MB in the end (delta: 86.0MB). Free memory was 112.9MB in the beginning and 153.3MB in the end (delta: -40.4MB). Peak memory consumption was 153.7MB. Max. memory is 16.1GB. * Witness Printer took 360.61ms. Allocated memory is still 270.5MB. Free memory was 153.3MB in the beginning and 28.5MB in the end (delta: 124.8MB). Peak memory consumption was 125.8MB. 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 20 procedures, 210 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 7, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 897 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 845 mSDsluCounter, 5690 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 399 IncrementalHoareTripleChecker+Unchecked, 4112 mSDsCounter, 516 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3006 IncrementalHoareTripleChecker+Invalid, 3921 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 516 mSolverCounterUnsat, 1578 mSDtfsCounter, 3006 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1697 GetRequests, 1618 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=6, InterpolantAutomatonStates: 55, 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, 7 MinimizatonAttempts, 29 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 82 LocationsWithAnnotation, 605 PreInvPairs, 631 NumberOfFragments, 759 HoareAnnotationTreeSize, 605 FomulaSimplifications, 35 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 82 FomulaSimplificationsInter, 417 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 2339 NumberOfCodeBlocks, 2339 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2357 ConstructedInterpolants, 5 QuantifiedInterpolants, 3559 SizeOfPredicates, 15 NumberOfNonLiveVariables, 12922 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 7655/7737 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: 6831]: Loop Invariant Derived loop invariant: ((!(map == 0) && map == map) && map == map) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 9139]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6837]: Loop Invariant Derived loop invariant: ((!(map == 0) && map == map) && map == map) && 0 < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 10134]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9142]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9617]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-13 22:46:59,985 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