./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c36dfa3b 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_table_remove_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 97e90b5866c6e9df01c589395fdbbe46254bc553e4330f2a669b393b022bbd71 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-03 23:14:07,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 23:14:07,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 23:14:07,710 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 23:14:07,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 23:14:07,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 23:14:07,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 23:14:07,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 23:14:07,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 23:14:07,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 23:14:07,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 23:14:07,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 23:14:07,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 23:14:07,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 23:14:07,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 23:14:07,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 23:14:07,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 23:14:07,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 23:14:07,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 23:14:07,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 23:14:07,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 23:14:07,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 23:14:07,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 23:14:07,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 23:14:07,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 23:14:07,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 23:14:07,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 23:14:07,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 23:14:07,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 23:14:07,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 23:14:07,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 23:14:07,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 23:14:07,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 23:14:07,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 23:14:07,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 23:14:07,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 23:14:07,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 23:14:07,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 23:14:07,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 23:14:07,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 23:14:07,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 23:14:07,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-03 23:14:07,795 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 23:14:07,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 23:14:07,796 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-03 23:14:07,796 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-03 23:14:07,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 23:14:07,797 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 23:14:07,798 INFO L138 SettingsManager]: * Use SBE=true [2021-11-03 23:14:07,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 23:14:07,798 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 23:14:07,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 23:14:07,799 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 23:14:07,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 23:14:07,800 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 23:14:07,800 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 23:14:07,800 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 23:14:07,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 23:14:07,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 23:14:07,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-03 23:14:07,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 23:14:07,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 23:14:07,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 23:14:07,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 23:14:07,802 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 23:14:07,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-03 23:14:07,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 23:14:07,802 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-03 23:14:07,802 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-03 23:14:07,803 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 23:14:07,803 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 23:14:07,803 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 -> 97e90b5866c6e9df01c589395fdbbe46254bc553e4330f2a669b393b022bbd71 [2021-11-03 23:14:08,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 23:14:08,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 23:14:08,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 23:14:08,104 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 23:14:08,105 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 23:14:08,106 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i [2021-11-03 23:14:08,155 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0aef4293/0b5654c832c34544964329b581269d82/FLAG74828c11f [2021-11-03 23:14:08,909 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 23:14:08,910 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_remove_harness.i [2021-11-03 23:14:08,950 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0aef4293/0b5654c832c34544964329b581269d82/FLAG74828c11f [2021-11-03 23:14:09,184 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0aef4293/0b5654c832c34544964329b581269d82 [2021-11-03 23:14:09,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 23:14:09,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 23:14:09,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 23:14:09,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 23:14:09,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 23:14:09,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 11:14:09" (1/1) ... [2021-11-03 23:14:09,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6827d352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:09, skipping insertion in model container [2021-11-03 23:14:09,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 11:14:09" (1/1) ... [2021-11-03 23:14:09,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 23:14:09,311 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 23:14:09,553 WARN L228 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_table_remove_harness.i[4495,4508] [2021-11-03 23:14:09,560 WARN L228 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_table_remove_harness.i[4555,4568] [2021-11-03 23:14:09,580 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-03 23:14:09,585 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-03 23:14:10,174 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:10,177 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:10,178 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:10,178 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:10,179 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:10,189 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:10,192 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:10,196 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:10,196 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:10,197 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:10,198 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:10,199 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:10,199 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:10,499 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-03 23:14:10,500 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-03 23:14:10,502 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-03 23:14:10,503 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-03 23:14:10,504 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-03 23:14:10,505 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-03 23:14:10,505 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-03 23:14:10,514 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-03 23:14:10,516 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-03 23:14:10,517 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-03 23:14:10,683 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-03 23:14:10,986 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:10,987 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,015 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,017 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,026 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,026 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,047 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,049 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,051 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,051 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,052 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,052 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,052 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,101 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 23:14:11,139 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 23:14:11,159 WARN L228 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_table_remove_harness.i[4495,4508] [2021-11-03 23:14:11,160 WARN L228 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_table_remove_harness.i[4555,4568] [2021-11-03 23:14:11,165 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-03 23:14:11,165 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-03 23:14:11,192 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,193 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,193 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,193 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,194 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,202 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,203 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,203 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,203 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,204 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,204 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,205 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,205 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,262 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-03 23:14:11,262 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-03 23:14:11,263 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-03 23:14:11,263 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-03 23:14:11,264 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-03 23:14:11,264 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-03 23:14:11,264 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-03 23:14:11,265 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-03 23:14:11,265 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-03 23:14:11,265 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-03 23:14:11,292 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-03 23:14:11,363 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,364 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,369 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,369 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,371 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,372 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,382 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,383 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,384 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,384 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,384 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,385 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,385 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-03 23:14:11,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 23:14:11,591 INFO L208 MainTranslator]: Completed translation [2021-11-03 23:14:11,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:11 WrapperNode [2021-11-03 23:14:11,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 23:14:11,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 23:14:11,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 23:14:11,593 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 23:14:11,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:11" (1/1) ... [2021-11-03 23:14:11,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:11" (1/1) ... [2021-11-03 23:14:11,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 23:14:11,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 23:14:11,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 23:14:11,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 23:14:11,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:11" (1/1) ... [2021-11-03 23:14:11,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:11" (1/1) ... [2021-11-03 23:14:11,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:11" (1/1) ... [2021-11-03 23:14:11,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:11" (1/1) ... [2021-11-03 23:14:11,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:11" (1/1) ... [2021-11-03 23:14:11,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:11" (1/1) ... [2021-11-03 23:14:11,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:11" (1/1) ... [2021-11-03 23:14:11,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 23:14:11,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 23:14:11,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 23:14:11,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 23:14:11,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:11" (1/1) ... [2021-11-03 23:14:11,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 23:14:11,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 23:14:11,971 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) [2021-11-03 23:14:11,993 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 [2021-11-03 23:14:12,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-03 23:14:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-03 23:14:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-03 23:14:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-03 23:14:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 23:14:12,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 23:14:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_uaddl_overflow [2021-11-03 23:14:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 23:14:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-11-03 23:14:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-03 23:14:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-03 23:14:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 23:14:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-03 23:14:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-03 23:14:12,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 23:14:17,402 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##298: assume !true; [2021-11-03 23:14:17,402 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##253: assume !true; [2021-11-03 23:14:17,402 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##283: assume !true; [2021-11-03 23:14:17,403 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##215: assume !true; [2021-11-03 23:14:17,403 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume !true; [2021-11-03 23:14:17,403 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##190: assume !true; [2021-11-03 23:14:17,403 INFO L757 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume !true; [2021-11-03 23:14:17,416 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 23:14:17,417 INFO L299 CfgBuilder]: Removed 328 assume(true) statements. [2021-11-03 23:14:17,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 11:14:17 BoogieIcfgContainer [2021-11-03 23:14:17,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 23:14:17,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 23:14:17,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 23:14:17,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 23:14:17,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 11:14:09" (1/3) ... [2021-11-03 23:14:17,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62728bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 11:14:17, skipping insertion in model container [2021-11-03 23:14:17,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 11:14:11" (2/3) ... [2021-11-03 23:14:17,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62728bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 11:14:17, skipping insertion in model container [2021-11-03 23:14:17,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 11:14:17" (3/3) ... [2021-11-03 23:14:17,428 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_remove_harness.i [2021-11-03 23:14:17,432 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 23:14:17,432 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2021-11-03 23:14:17,505 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 23:14:17,510 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 23:14:17,510 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-11-03 23:14:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 365 states, 343 states have (on average 1.4577259475218658) internal successors, (500), 364 states have internal predecessors, (500), 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) [2021-11-03 23:14:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-03 23:14:17,560 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:14:17,561 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:14:17,567 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:14:17,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:14:17,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2037186818, now seen corresponding path program 1 times [2021-11-03 23:14:17,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:14:17,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099239938] [2021-11-03 23:14:17,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:14:17,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:14:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:14:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:14:18,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:14:18,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099239938] [2021-11-03 23:14:18,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099239938] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:14:18,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:14:18,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 23:14:18,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530823415] [2021-11-03 23:14:18,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:14:18,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-03 23:14:18,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:14:18,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-03 23:14:18,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 23:14:18,311 INFO L87 Difference]: Start difference. First operand has 365 states, 343 states have (on average 1.4577259475218658) internal successors, (500), 364 states have internal predecessors, (500), 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) Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 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) [2021-11-03 23:14:20,391 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:14:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:14:22,261 INFO L93 Difference]: Finished difference Result 725 states and 994 transitions. [2021-11-03 23:14:22,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-03 23:14:22,263 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-11-03 23:14:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:14:22,272 INFO L225 Difference]: With dead ends: 725 [2021-11-03 23:14:22,272 INFO L226 Difference]: Without dead ends: 357 [2021-11-03 23:14:22,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.03ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 23:14:22,277 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3498.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.30ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3851.31ms IncrementalHoareTripleChecker+Time [2021-11-03 23:14:22,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 434 Unknown, 0 Unchecked, 6.30ms Time], IncrementalHoareTripleChecker [0 Valid, 433 Invalid, 1 Unknown, 0 Unchecked, 3851.31ms Time] [2021-11-03 23:14:22,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-11-03 23:14:22,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2021-11-03 23:14:22,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 336 states have (on average 1.2648809523809523) internal successors, (425), 356 states have internal predecessors, (425), 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) [2021-11-03 23:14:22,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 425 transitions. [2021-11-03 23:14:22,348 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 425 transitions. Word has length 74 [2021-11-03 23:14:22,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:14:22,349 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 425 transitions. [2021-11-03 23:14:22,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 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) [2021-11-03 23:14:22,349 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 425 transitions. [2021-11-03 23:14:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-03 23:14:22,353 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:14:22,353 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:14:22,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 23:14:22,354 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:14:22,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:14:22,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1272180544, now seen corresponding path program 1 times [2021-11-03 23:14:22,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:14:22,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243669426] [2021-11-03 23:14:22,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:14:22,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:14:22,463 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 23:14:22,464 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [649514758] [2021-11-03 23:14:22,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:14:22,464 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 23:14:22,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 23:14:22,466 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) [2021-11-03 23:14:22,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-03 23:14:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:14:23,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 2650 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-03 23:14:23,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 23:14:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:14:23,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-03 23:14:23,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:14:23,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243669426] [2021-11-03 23:14:23,812 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 23:14:23,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649514758] [2021-11-03 23:14:23,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649514758] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:14:23,813 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:14:23,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 23:14:23,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871850192] [2021-11-03 23:14:23,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:14:23,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 23:14:23,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:14:23,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 23:14:23,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 23:14:23,815 INFO L87 Difference]: Start difference. First operand 357 states and 425 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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) [2021-11-03 23:14:25,867 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:14:33,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:14:33,239 INFO L93 Difference]: Finished difference Result 1037 states and 1236 transitions. [2021-11-03 23:14:33,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 23:14:33,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-11-03 23:14:33,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:14:33,244 INFO L225 Difference]: With dead ends: 1037 [2021-11-03 23:14:33,244 INFO L226 Difference]: Without dead ends: 702 [2021-11-03 23:14:33,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 102.10ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-03 23:14:33,246 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 819 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 2493 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8547.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 37.53ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2493 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9197.70ms IncrementalHoareTripleChecker+Time [2021-11-03 23:14:33,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [819 Valid, 0 Invalid, 2496 Unknown, 0 Unchecked, 37.53ms Time], IncrementalHoareTripleChecker [2 Valid, 2493 Invalid, 1 Unknown, 0 Unchecked, 9197.70ms Time] [2021-11-03 23:14:33,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2021-11-03 23:14:33,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 360. [2021-11-03 23:14:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 339 states have (on average 1.2625368731563422) internal successors, (428), 359 states have internal predecessors, (428), 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) [2021-11-03 23:14:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 428 transitions. [2021-11-03 23:14:33,262 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 428 transitions. Word has length 74 [2021-11-03 23:14:33,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:14:33,262 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 428 transitions. [2021-11-03 23:14:33,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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) [2021-11-03 23:14:33,263 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 428 transitions. [2021-11-03 23:14:33,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-03 23:14:33,264 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:14:33,264 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:14:33,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-03 23:14:33,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 23:14:33,480 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:14:33,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:14:33,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1002787932, now seen corresponding path program 1 times [2021-11-03 23:14:33,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:14:33,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229632689] [2021-11-03 23:14:33,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:14:33,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:14:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:14:34,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:14:34,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:14:34,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229632689] [2021-11-03 23:14:34,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229632689] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:14:34,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:14:34,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 23:14:34,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418506201] [2021-11-03 23:14:34,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:14:34,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 23:14:34,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:14:34,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 23:14:34,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-03 23:14:34,104 INFO L87 Difference]: Start difference. First operand 360 states and 428 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) [2021-11-03 23:14:36,154 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:14:42,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:14:42,248 INFO L93 Difference]: Finished difference Result 688 states and 819 transitions. [2021-11-03 23:14:42,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-03 23:14:42,249 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-03 23:14:42,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:14:42,251 INFO L225 Difference]: With dead ends: 688 [2021-11-03 23:14:42,251 INFO L226 Difference]: Without dead ends: 366 [2021-11-03 23:14:42,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 371.38ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-11-03 23:14:42,252 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 484 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 2092 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7221.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 27.47ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2092 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7796.10ms IncrementalHoareTripleChecker+Time [2021-11-03 23:14:42,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [484 Valid, 0 Invalid, 2100 Unknown, 0 Unchecked, 27.47ms Time], IncrementalHoareTripleChecker [7 Valid, 2092 Invalid, 1 Unknown, 0 Unchecked, 7796.10ms Time] [2021-11-03 23:14:42,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-11-03 23:14:42,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 362. [2021-11-03 23:14:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 341 states have (on average 1.2609970674486803) internal successors, (430), 361 states have internal predecessors, (430), 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) [2021-11-03 23:14:42,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 430 transitions. [2021-11-03 23:14:42,269 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 430 transitions. Word has length 76 [2021-11-03 23:14:42,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:14:42,270 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 430 transitions. [2021-11-03 23:14:42,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) [2021-11-03 23:14:42,271 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 430 transitions. [2021-11-03 23:14:42,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-03 23:14:42,272 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:14:42,272 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:14:42,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 23:14:42,273 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:14:42,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:14:42,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1878806938, now seen corresponding path program 1 times [2021-11-03 23:14:42,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:14:42,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696113217] [2021-11-03 23:14:42,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:14:42,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:14:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:14:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:14:42,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:14:42,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696113217] [2021-11-03 23:14:42,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696113217] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:14:42,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:14:42,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 23:14:42,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340051311] [2021-11-03 23:14:42,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:14:42,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 23:14:42,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:14:42,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 23:14:42,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 23:14:42,571 INFO L87 Difference]: Start difference. First operand 362 states and 430 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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) [2021-11-03 23:14:44,610 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:14:47,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:14:47,346 INFO L93 Difference]: Finished difference Result 687 states and 817 transitions. [2021-11-03 23:14:47,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 23:14:47,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-03 23:14:47,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:14:47,348 INFO L225 Difference]: With dead ends: 687 [2021-11-03 23:14:47,348 INFO L226 Difference]: Without dead ends: 360 [2021-11-03 23:14:47,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.31ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 23:14:47,350 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 395 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4376.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.63ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4685.76ms IncrementalHoareTripleChecker+Time [2021-11-03 23:14:47,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 0 Invalid, 845 Unknown, 0 Unchecked, 5.63ms Time], IncrementalHoareTripleChecker [10 Valid, 834 Invalid, 1 Unknown, 0 Unchecked, 4685.76ms Time] [2021-11-03 23:14:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-11-03 23:14:47,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2021-11-03 23:14:47,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 339 states have (on average 1.247787610619469) internal successors, (423), 359 states have internal predecessors, (423), 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) [2021-11-03 23:14:47,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 423 transitions. [2021-11-03 23:14:47,360 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 423 transitions. Word has length 76 [2021-11-03 23:14:47,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:14:47,361 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 423 transitions. [2021-11-03 23:14:47,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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) [2021-11-03 23:14:47,361 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 423 transitions. [2021-11-03 23:14:47,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-03 23:14:47,362 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:14:47,362 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:14:47,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 23:14:47,363 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:14:47,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:14:47,363 INFO L85 PathProgramCache]: Analyzing trace with hash -9036255, now seen corresponding path program 1 times [2021-11-03 23:14:47,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:14:47,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707630762] [2021-11-03 23:14:47,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:14:47,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:14:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:14:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:14:47,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:14:47,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707630762] [2021-11-03 23:14:47,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707630762] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:14:47,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:14:47,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 23:14:47,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475392517] [2021-11-03 23:14:47,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:14:47,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 23:14:47,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:14:47,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 23:14:47,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 23:14:47,776 INFO L87 Difference]: Start difference. First operand 360 states and 423 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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) [2021-11-03 23:14:49,826 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:14:56,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:14:56,496 INFO L93 Difference]: Finished difference Result 933 states and 1092 transitions. [2021-11-03 23:14:56,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 23:14:56,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-11-03 23:14:56,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:14:56,499 INFO L225 Difference]: With dead ends: 933 [2021-11-03 23:14:56,499 INFO L226 Difference]: Without dead ends: 610 [2021-11-03 23:14:56,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 318.58ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-03 23:14:56,500 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 400 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7757.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.81ms SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8398.59ms IncrementalHoareTripleChecker+Time [2021-11-03 23:14:56,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 0 Invalid, 2366 Unknown, 0 Unchecked, 18.81ms Time], IncrementalHoareTripleChecker [40 Valid, 2325 Invalid, 1 Unknown, 0 Unchecked, 8398.59ms Time] [2021-11-03 23:14:56,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-11-03 23:14:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 360. [2021-11-03 23:14:56,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 339 states have (on average 1.2300884955752212) internal successors, (417), 359 states have internal predecessors, (417), 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) [2021-11-03 23:14:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 417 transitions. [2021-11-03 23:14:56,514 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 417 transitions. Word has length 78 [2021-11-03 23:14:56,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:14:56,514 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 417 transitions. [2021-11-03 23:14:56,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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) [2021-11-03 23:14:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 417 transitions. [2021-11-03 23:14:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-03 23:14:56,516 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:14:56,516 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:14:56,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 23:14:56,516 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:14:56,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:14:56,517 INFO L85 PathProgramCache]: Analyzing trace with hash -377399152, now seen corresponding path program 1 times [2021-11-03 23:14:56,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:14:56,517 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413069775] [2021-11-03 23:14:56,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:14:56,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:14:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:14:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:14:57,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:14:57,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413069775] [2021-11-03 23:14:57,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413069775] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:14:57,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:14:57,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 23:14:57,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149112714] [2021-11-03 23:14:57,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:14:57,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 23:14:57,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:14:57,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 23:14:57,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 23:14:57,059 INFO L87 Difference]: Start difference. First operand 360 states and 417 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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) [2021-11-03 23:14:59,112 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:15:03,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:15:03,796 INFO L93 Difference]: Finished difference Result 761 states and 886 transitions. [2021-11-03 23:15:03,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 23:15:03,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-03 23:15:03,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:15:03,799 INFO L225 Difference]: With dead ends: 761 [2021-11-03 23:15:03,799 INFO L226 Difference]: Without dead ends: 483 [2021-11-03 23:15:03,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.76ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 23:15:03,800 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 144 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6042.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.09ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6624.46ms IncrementalHoareTripleChecker+Time [2021-11-03 23:15:03,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 0 Invalid, 1474 Unknown, 0 Unchecked, 10.09ms Time], IncrementalHoareTripleChecker [16 Valid, 1457 Invalid, 1 Unknown, 0 Unchecked, 6624.46ms Time] [2021-11-03 23:15:03,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2021-11-03 23:15:03,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 360. [2021-11-03 23:15:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 339 states have (on average 1.2153392330383481) internal successors, (412), 359 states have internal predecessors, (412), 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) [2021-11-03 23:15:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 412 transitions. [2021-11-03 23:15:03,813 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 412 transitions. Word has length 79 [2021-11-03 23:15:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:15:03,813 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 412 transitions. [2021-11-03 23:15:03,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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) [2021-11-03 23:15:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 412 transitions. [2021-11-03 23:15:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-03 23:15:03,818 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:15:03,818 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:15:03,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 23:15:03,819 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:15:03,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:15:03,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1543999980, now seen corresponding path program 1 times [2021-11-03 23:15:03,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:15:03,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336547520] [2021-11-03 23:15:03,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:15:03,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:15:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:15:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:15:04,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:15:04,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336547520] [2021-11-03 23:15:04,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336547520] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:15:04,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:15:04,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 23:15:04,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175144834] [2021-11-03 23:15:04,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:15:04,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 23:15:04,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:15:04,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 23:15:04,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-03 23:15:04,580 INFO L87 Difference]: Start difference. First operand 360 states and 412 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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) [2021-11-03 23:15:06,620 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:15:14,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:15:14,013 INFO L93 Difference]: Finished difference Result 996 states and 1146 transitions. [2021-11-03 23:15:14,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 23:15:14,013 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-11-03 23:15:14,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:15:14,017 INFO L225 Difference]: With dead ends: 996 [2021-11-03 23:15:14,017 INFO L226 Difference]: Without dead ends: 691 [2021-11-03 23:15:14,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 692.14ms TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2021-11-03 23:15:14,019 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1295 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 2453 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8212.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 26.85ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2453 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8817.69ms IncrementalHoareTripleChecker+Time [2021-11-03 23:15:14,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1295 Valid, 0 Invalid, 2484 Unknown, 0 Unchecked, 26.85ms Time], IncrementalHoareTripleChecker [30 Valid, 2453 Invalid, 1 Unknown, 0 Unchecked, 8817.69ms Time] [2021-11-03 23:15:14,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2021-11-03 23:15:14,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 360. [2021-11-03 23:15:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 339 states have (on average 1.2123893805309736) internal successors, (411), 359 states have internal predecessors, (411), 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) [2021-11-03 23:15:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 411 transitions. [2021-11-03 23:15:14,035 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 411 transitions. Word has length 80 [2021-11-03 23:15:14,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:15:14,036 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 411 transitions. [2021-11-03 23:15:14,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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) [2021-11-03 23:15:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 411 transitions. [2021-11-03 23:15:14,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-03 23:15:14,036 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:15:14,036 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:15:14,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 23:15:14,037 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:15:14,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:15:14,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1149957487, now seen corresponding path program 1 times [2021-11-03 23:15:14,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:15:14,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258199044] [2021-11-03 23:15:14,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:15:14,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:15:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:15:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:15:14,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:15:14,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258199044] [2021-11-03 23:15:14,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258199044] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:15:14,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:15:14,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 23:15:14,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755417409] [2021-11-03 23:15:14,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:15:14,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 23:15:14,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:15:14,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 23:15:14,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-03 23:15:14,736 INFO L87 Difference]: Start difference. First operand 360 states and 411 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 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) [2021-11-03 23:15:16,785 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:15:23,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:15:23,485 INFO L93 Difference]: Finished difference Result 894 states and 1021 transitions. [2021-11-03 23:15:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-03 23:15:23,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-11-03 23:15:23,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:15:23,488 INFO L225 Difference]: With dead ends: 894 [2021-11-03 23:15:23,488 INFO L226 Difference]: Without dead ends: 614 [2021-11-03 23:15:23,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 613.08ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-11-03 23:15:23,490 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 813 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 2124 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7467.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.49ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2124 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8206.27ms IncrementalHoareTripleChecker+Time [2021-11-03 23:15:23,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [813 Valid, 0 Invalid, 2155 Unknown, 0 Unchecked, 16.49ms Time], IncrementalHoareTripleChecker [30 Valid, 2124 Invalid, 1 Unknown, 0 Unchecked, 8206.27ms Time] [2021-11-03 23:15:23,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-11-03 23:15:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 360. [2021-11-03 23:15:23,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 339 states have (on average 1.2094395280235988) internal successors, (410), 359 states have internal predecessors, (410), 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) [2021-11-03 23:15:23,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 410 transitions. [2021-11-03 23:15:23,506 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 410 transitions. Word has length 83 [2021-11-03 23:15:23,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:15:23,507 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 410 transitions. [2021-11-03 23:15:23,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 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) [2021-11-03 23:15:23,507 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 410 transitions. [2021-11-03 23:15:23,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-03 23:15:23,508 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:15:23,508 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:15:23,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 23:15:23,508 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:15:23,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:15:23,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1308976112, now seen corresponding path program 1 times [2021-11-03 23:15:23,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:15:23,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473792197] [2021-11-03 23:15:23,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:15:23,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:15:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:15:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:15:23,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:15:23,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473792197] [2021-11-03 23:15:23,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473792197] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:15:23,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:15:23,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 23:15:23,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300634847] [2021-11-03 23:15:23,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:15:23,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 23:15:23,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:15:23,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 23:15:23,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 23:15:23,964 INFO L87 Difference]: Start difference. First operand 360 states and 410 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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) [2021-11-03 23:15:26,060 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:15:28,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:15:28,738 INFO L93 Difference]: Finished difference Result 360 states and 410 transitions. [2021-11-03 23:15:28,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 23:15:28,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-11-03 23:15:28,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:15:28,740 INFO L225 Difference]: With dead ends: 360 [2021-11-03 23:15:28,740 INFO L226 Difference]: Without dead ends: 358 [2021-11-03 23:15:28,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.00ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 23:15:28,741 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4244.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.03ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4724.31ms IncrementalHoareTripleChecker+Time [2021-11-03 23:15:28,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 0 Invalid, 801 Unknown, 0 Unchecked, 3.03ms Time], IncrementalHoareTripleChecker [0 Valid, 800 Invalid, 1 Unknown, 0 Unchecked, 4724.31ms Time] [2021-11-03 23:15:28,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-11-03 23:15:28,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2021-11-03 23:15:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 338 states have (on average 1.2071005917159763) internal successors, (408), 357 states have internal predecessors, (408), 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) [2021-11-03 23:15:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 408 transitions. [2021-11-03 23:15:28,756 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 408 transitions. Word has length 86 [2021-11-03 23:15:28,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:15:28,756 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 408 transitions. [2021-11-03 23:15:28,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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) [2021-11-03 23:15:28,756 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 408 transitions. [2021-11-03 23:15:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-03 23:15:28,757 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:15:28,757 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:15:28,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 23:15:28,757 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:15:28,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:15:28,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1181997534, now seen corresponding path program 1 times [2021-11-03 23:15:28,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:15:28,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376029362] [2021-11-03 23:15:28,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:15:28,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:15:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:15:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:15:29,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:15:29,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376029362] [2021-11-03 23:15:29,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376029362] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:15:29,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:15:29,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 23:15:29,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333083431] [2021-11-03 23:15:29,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:15:29,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 23:15:29,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:15:29,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 23:15:29,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 23:15:29,253 INFO L87 Difference]: Start difference. First operand 358 states and 408 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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) [2021-11-03 23:15:31,403 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:15:37,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:15:37,404 INFO L93 Difference]: Finished difference Result 682 states and 793 transitions. [2021-11-03 23:15:37,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 23:15:37,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-03 23:15:37,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:15:37,407 INFO L225 Difference]: With dead ends: 682 [2021-11-03 23:15:37,407 INFO L226 Difference]: Without dead ends: 680 [2021-11-03 23:15:37,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 74.51ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 23:15:37,408 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 502 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7223.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.11ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7999.70ms IncrementalHoareTripleChecker+Time [2021-11-03 23:15:37,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [502 Valid, 0 Invalid, 1760 Unknown, 0 Unchecked, 10.11ms Time], IncrementalHoareTripleChecker [3 Valid, 1756 Invalid, 1 Unknown, 0 Unchecked, 7999.70ms Time] [2021-11-03 23:15:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2021-11-03 23:15:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 356. [2021-11-03 23:15:37,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 337 states have (on average 1.2047477744807122) internal successors, (406), 355 states have internal predecessors, (406), 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) [2021-11-03 23:15:37,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 406 transitions. [2021-11-03 23:15:37,428 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 406 transitions. Word has length 93 [2021-11-03 23:15:37,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:15:37,429 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 406 transitions. [2021-11-03 23:15:37,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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) [2021-11-03 23:15:37,429 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 406 transitions. [2021-11-03 23:15:37,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-03 23:15:37,430 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:15:37,430 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:15:37,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-03 23:15:37,430 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:15:37,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:15:37,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1345920245, now seen corresponding path program 1 times [2021-11-03 23:15:37,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:15:37,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266136002] [2021-11-03 23:15:37,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:15:37,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:15:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:15:37,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:15:37,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:15:37,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266136002] [2021-11-03 23:15:37,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266136002] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:15:37,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:15:37,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 23:15:37,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402843637] [2021-11-03 23:15:37,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:15:37,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 23:15:37,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:15:37,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 23:15:37,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 23:15:37,750 INFO L87 Difference]: Start difference. First operand 356 states and 406 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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) [2021-11-03 23:15:39,789 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:15:43,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:15:43,874 INFO L93 Difference]: Finished difference Result 890 states and 1021 transitions. [2021-11-03 23:15:43,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 23:15:43,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-03 23:15:43,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:15:43,882 INFO L225 Difference]: With dead ends: 890 [2021-11-03 23:15:43,882 INFO L226 Difference]: Without dead ends: 639 [2021-11-03 23:15:43,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 113.94ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-03 23:15:43,883 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1227 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5458.24ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.46ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5951.71ms IncrementalHoareTripleChecker+Time [2021-11-03 23:15:43,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1227 Valid, 0 Invalid, 1265 Unknown, 0 Unchecked, 9.46ms Time], IncrementalHoareTripleChecker [0 Valid, 1264 Invalid, 1 Unknown, 0 Unchecked, 5951.71ms Time] [2021-11-03 23:15:43,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-11-03 23:15:43,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 388. [2021-11-03 23:15:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 369 states have (on average 1.1924119241192412) internal successors, (440), 387 states have internal predecessors, (440), 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) [2021-11-03 23:15:43,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 440 transitions. [2021-11-03 23:15:43,905 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 440 transitions. Word has length 99 [2021-11-03 23:15:43,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:15:43,905 INFO L470 AbstractCegarLoop]: Abstraction has 388 states and 440 transitions. [2021-11-03 23:15:43,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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) [2021-11-03 23:15:43,906 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 440 transitions. [2021-11-03 23:15:43,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-03 23:15:43,907 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:15:43,907 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:15:43,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-03 23:15:43,907 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:15:43,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:15:43,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1937929801, now seen corresponding path program 1 times [2021-11-03 23:15:43,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:15:43,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618164516] [2021-11-03 23:15:43,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:15:43,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:15:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:15:44,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:15:44,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:15:44,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618164516] [2021-11-03 23:15:44,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618164516] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:15:44,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:15:44,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 23:15:44,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213791735] [2021-11-03 23:15:44,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:15:44,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 23:15:44,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:15:44,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 23:15:44,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-03 23:15:44,501 INFO L87 Difference]: Start difference. First operand 388 states and 440 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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) [2021-11-03 23:15:46,564 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:15:53,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:15:53,701 INFO L93 Difference]: Finished difference Result 994 states and 1144 transitions. [2021-11-03 23:15:53,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 23:15:53,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-03 23:15:53,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:15:53,704 INFO L225 Difference]: With dead ends: 994 [2021-11-03 23:15:53,704 INFO L226 Difference]: Without dead ends: 755 [2021-11-03 23:15:53,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 461.90ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-11-03 23:15:53,705 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1430 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7912.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1430 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.98ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8809.24ms IncrementalHoareTripleChecker+Time [2021-11-03 23:15:53,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1430 Valid, 0 Invalid, 2281 Unknown, 0 Unchecked, 16.98ms Time], IncrementalHoareTripleChecker [0 Valid, 2280 Invalid, 1 Unknown, 0 Unchecked, 8809.24ms Time] [2021-11-03 23:15:53,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2021-11-03 23:15:53,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 402. [2021-11-03 23:15:53,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 383 states have (on average 1.195822454308094) internal successors, (458), 401 states have internal predecessors, (458), 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) [2021-11-03 23:15:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 458 transitions. [2021-11-03 23:15:53,727 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 458 transitions. Word has length 99 [2021-11-03 23:15:53,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:15:53,728 INFO L470 AbstractCegarLoop]: Abstraction has 402 states and 458 transitions. [2021-11-03 23:15:53,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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) [2021-11-03 23:15:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 458 transitions. [2021-11-03 23:15:53,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-03 23:15:53,729 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:15:53,729 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:15:53,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-03 23:15:53,730 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:15:53,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:15:53,730 INFO L85 PathProgramCache]: Analyzing trace with hash -36019472, now seen corresponding path program 1 times [2021-11-03 23:15:53,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:15:53,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993902359] [2021-11-03 23:15:53,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:15:53,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:15:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:15:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:15:53,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:15:53,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993902359] [2021-11-03 23:15:53,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993902359] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:15:53,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:15:53,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 23:15:53,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552584464] [2021-11-03 23:15:53,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:15:53,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 23:15:53,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:15:53,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 23:15:53,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 23:15:53,989 INFO L87 Difference]: Start difference. First operand 402 states and 458 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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) [2021-11-03 23:15:56,466 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:15:58,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:15:58,754 INFO L93 Difference]: Finished difference Result 534 states and 609 transitions. [2021-11-03 23:15:58,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 23:15:58,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-11-03 23:15:58,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:15:58,756 INFO L225 Difference]: With dead ends: 534 [2021-11-03 23:15:58,756 INFO L226 Difference]: Without dead ends: 402 [2021-11-03 23:15:58,756 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.78ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 23:15:58,757 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 286 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4137.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.75ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4699.11ms IncrementalHoareTripleChecker+Time [2021-11-03 23:15:58,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 0 Invalid, 514 Unknown, 0 Unchecked, 2.75ms Time], IncrementalHoareTripleChecker [1 Valid, 512 Invalid, 1 Unknown, 0 Unchecked, 4699.11ms Time] [2021-11-03 23:15:58,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2021-11-03 23:15:58,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2021-11-03 23:15:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 383 states have (on average 1.1906005221932114) internal successors, (456), 401 states have internal predecessors, (456), 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) [2021-11-03 23:15:58,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 456 transitions. [2021-11-03 23:15:58,781 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 456 transitions. Word has length 100 [2021-11-03 23:15:58,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:15:58,781 INFO L470 AbstractCegarLoop]: Abstraction has 402 states and 456 transitions. [2021-11-03 23:15:58,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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) [2021-11-03 23:15:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 456 transitions. [2021-11-03 23:15:58,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-03 23:15:58,783 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:15:58,783 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:15:58,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-03 23:15:58,783 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:15:58,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:15:58,784 INFO L85 PathProgramCache]: Analyzing trace with hash 222145966, now seen corresponding path program 1 times [2021-11-03 23:15:58,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:15:58,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812639586] [2021-11-03 23:15:58,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:15:58,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:16:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:16:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:16:03,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:16:03,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812639586] [2021-11-03 23:16:03,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812639586] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:16:03,806 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:16:03,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-11-03 23:16:03,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851959121] [2021-11-03 23:16:03,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:16:03,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-11-03 23:16:03,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:16:03,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-11-03 23:16:03,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2021-11-03 23:16:03,808 INFO L87 Difference]: Start difference. First operand 402 states and 456 transitions. Second operand has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 26 states have internal predecessors, (100), 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) [2021-11-03 23:16:06,408 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:16:42,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:16:42,299 INFO L93 Difference]: Finished difference Result 858 states and 972 transitions. [2021-11-03 23:16:42,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-11-03 23:16:42,300 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 26 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-11-03 23:16:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:16:42,302 INFO L225 Difference]: With dead ends: 858 [2021-11-03 23:16:42,302 INFO L226 Difference]: Without dead ends: 805 [2021-11-03 23:16:42,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 16119.37ms TimeCoverageRelationStatistics Valid=783, Invalid=4329, Unknown=0, NotChecked=0, Total=5112 [2021-11-03 23:16:42,304 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 4014 mSDsluCounter, 5670 mSDsCounter, 0 mSdLazyCounter, 7767 mSolverCounterSat, 163 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22420.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4014 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 80.25ms SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 7767 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24350.52ms IncrementalHoareTripleChecker+Time [2021-11-03 23:16:42,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4014 Valid, 0 Invalid, 7931 Unknown, 0 Unchecked, 80.25ms Time], IncrementalHoareTripleChecker [163 Valid, 7767 Invalid, 1 Unknown, 0 Unchecked, 24350.52ms Time] [2021-11-03 23:16:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2021-11-03 23:16:42,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 468. [2021-11-03 23:16:42,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 449 states have (on average 1.2026726057906458) internal successors, (540), 467 states have internal predecessors, (540), 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) [2021-11-03 23:16:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 540 transitions. [2021-11-03 23:16:42,341 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 540 transitions. Word has length 100 [2021-11-03 23:16:42,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:16:42,341 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 540 transitions. [2021-11-03 23:16:42,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 26 states have internal predecessors, (100), 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) [2021-11-03 23:16:42,342 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 540 transitions. [2021-11-03 23:16:42,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-03 23:16:42,343 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:16:42,343 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:16:42,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-03 23:16:42,343 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:16:42,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:16:42,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1997153328, now seen corresponding path program 1 times [2021-11-03 23:16:42,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:16:42,344 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358482846] [2021-11-03 23:16:42,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:16:42,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:16:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:16:42,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:16:42,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:16:42,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358482846] [2021-11-03 23:16:42,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358482846] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:16:42,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:16:42,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 23:16:42,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109122093] [2021-11-03 23:16:42,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:16:42,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 23:16:42,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:16:42,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 23:16:42,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 23:16:42,763 INFO L87 Difference]: Start difference. First operand 468 states and 540 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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) [2021-11-03 23:16:45,474 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:16:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:16:49,226 INFO L93 Difference]: Finished difference Result 537 states and 615 transitions. [2021-11-03 23:16:49,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 23:16:49,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-11-03 23:16:49,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:16:49,228 INFO L225 Difference]: With dead ends: 537 [2021-11-03 23:16:49,229 INFO L226 Difference]: Without dead ends: 468 [2021-11-03 23:16:49,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 150.17ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-03 23:16:49,229 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 621 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5506.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.98ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6287.26ms IncrementalHoareTripleChecker+Time [2021-11-03 23:16:49,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [621 Valid, 0 Invalid, 881 Unknown, 0 Unchecked, 7.98ms Time], IncrementalHoareTripleChecker [13 Valid, 867 Invalid, 1 Unknown, 0 Unchecked, 6287.26ms Time] [2021-11-03 23:16:49,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-11-03 23:16:49,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2021-11-03 23:16:49,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 449 states have (on average 1.1959910913140313) internal successors, (537), 467 states have internal predecessors, (537), 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) [2021-11-03 23:16:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 537 transitions. [2021-11-03 23:16:49,266 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 537 transitions. Word has length 100 [2021-11-03 23:16:49,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:16:49,266 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 537 transitions. [2021-11-03 23:16:49,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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) [2021-11-03 23:16:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 537 transitions. [2021-11-03 23:16:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-03 23:16:49,267 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:16:49,267 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:16:49,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-03 23:16:49,268 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:16:49,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:16:49,268 INFO L85 PathProgramCache]: Analyzing trace with hash 472650346, now seen corresponding path program 1 times [2021-11-03 23:16:49,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:16:49,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069718736] [2021-11-03 23:16:49,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:16:49,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:16:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:16:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:16:54,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:16:54,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069718736] [2021-11-03 23:16:54,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069718736] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:16:54,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:16:54,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-11-03 23:16:54,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856617656] [2021-11-03 23:16:54,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:16:54,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-03 23:16:54,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:16:54,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-03 23:16:54,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2021-11-03 23:16:54,270 INFO L87 Difference]: Start difference. First operand 468 states and 537 transitions. Second operand has 25 states, 25 states have (on average 4.0) internal successors, (100), 25 states have internal predecessors, (100), 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) [2021-11-03 23:16:56,768 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:17:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:17:33,327 INFO L93 Difference]: Finished difference Result 751 states and 865 transitions. [2021-11-03 23:17:33,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-03 23:17:33,328 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.0) internal successors, (100), 25 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-11-03 23:17:33,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:17:33,330 INFO L225 Difference]: With dead ends: 751 [2021-11-03 23:17:33,330 INFO L226 Difference]: Without dead ends: 698 [2021-11-03 23:17:33,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 10017.33ms TimeCoverageRelationStatistics Valid=373, Invalid=2177, Unknown=0, NotChecked=0, Total=2550 [2021-11-03 23:17:33,331 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 2114 mSDsluCounter, 7308 mSDsCounter, 0 mSdLazyCounter, 9555 mSolverCounterSat, 107 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27948.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 93.30ms SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 9555 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30502.68ms IncrementalHoareTripleChecker+Time [2021-11-03 23:17:33,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2114 Valid, 0 Invalid, 9663 Unknown, 0 Unchecked, 93.30ms Time], IncrementalHoareTripleChecker [107 Valid, 9555 Invalid, 1 Unknown, 0 Unchecked, 30502.68ms Time] [2021-11-03 23:17:33,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2021-11-03 23:17:33,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 468. [2021-11-03 23:17:33,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 449 states have (on average 1.1959910913140313) internal successors, (537), 467 states have internal predecessors, (537), 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) [2021-11-03 23:17:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 537 transitions. [2021-11-03 23:17:33,373 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 537 transitions. Word has length 100 [2021-11-03 23:17:33,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:17:33,374 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 537 transitions. [2021-11-03 23:17:33,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.0) internal successors, (100), 25 states have internal predecessors, (100), 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) [2021-11-03 23:17:33,374 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 537 transitions. [2021-11-03 23:17:33,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-03 23:17:33,375 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:17:33,375 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:17:33,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-03 23:17:33,376 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:17:33,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:17:33,376 INFO L85 PathProgramCache]: Analyzing trace with hash -807213332, now seen corresponding path program 1 times [2021-11-03 23:17:33,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:17:33,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510335730] [2021-11-03 23:17:33,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:17:33,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:17:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:17:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:17:33,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:17:33,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510335730] [2021-11-03 23:17:33,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510335730] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:17:33,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:17:33,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 23:17:33,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525595129] [2021-11-03 23:17:33,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:17:33,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 23:17:33,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:17:33,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 23:17:33,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 23:17:33,696 INFO L87 Difference]: Start difference. First operand 468 states and 537 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2021-11-03 23:17:36,119 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:17:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:17:41,583 INFO L93 Difference]: Finished difference Result 890 states and 1016 transitions. [2021-11-03 23:17:41,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 23:17:41,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-11-03 23:17:41,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:17:41,585 INFO L225 Difference]: With dead ends: 890 [2021-11-03 23:17:41,585 INFO L226 Difference]: Without dead ends: 629 [2021-11-03 23:17:41,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 79.92ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 23:17:41,588 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 279 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6846.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.77ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7731.29ms IncrementalHoareTripleChecker+Time [2021-11-03 23:17:41,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 0 Invalid, 1700 Unknown, 0 Unchecked, 7.77ms Time], IncrementalHoareTripleChecker [1 Valid, 1698 Invalid, 1 Unknown, 0 Unchecked, 7731.29ms Time] [2021-11-03 23:17:41,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-11-03 23:17:41,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 408. [2021-11-03 23:17:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 389 states have (on average 1.179948586118252) internal successors, (459), 407 states have internal predecessors, (459), 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) [2021-11-03 23:17:41,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 459 transitions. [2021-11-03 23:17:41,628 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 459 transitions. Word has length 100 [2021-11-03 23:17:41,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:17:41,629 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 459 transitions. [2021-11-03 23:17:41,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2021-11-03 23:17:41,629 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 459 transitions. [2021-11-03 23:17:41,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-03 23:17:41,630 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:17:41,630 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:17:41,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-03 23:17:41,631 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:17:41,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:17:41,632 INFO L85 PathProgramCache]: Analyzing trace with hash -804465422, now seen corresponding path program 1 times [2021-11-03 23:17:41,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:17:41,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223448281] [2021-11-03 23:17:41,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:17:41,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:17:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:17:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:17:42,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:17:42,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223448281] [2021-11-03 23:17:42,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223448281] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:17:42,059 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:17:42,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 23:17:42,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999492859] [2021-11-03 23:17:42,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:17:42,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 23:17:42,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:17:42,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 23:17:42,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-03 23:17:42,061 INFO L87 Difference]: Start difference. First operand 408 states and 459 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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) [2021-11-03 23:17:44,985 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:17:52,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:17:52,100 INFO L93 Difference]: Finished difference Result 970 states and 1094 transitions. [2021-11-03 23:17:52,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 23:17:52,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-11-03 23:17:52,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:17:52,102 INFO L225 Difference]: With dead ends: 970 [2021-11-03 23:17:52,102 INFO L226 Difference]: Without dead ends: 764 [2021-11-03 23:17:52,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 298.30ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-03 23:17:52,103 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 920 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 2106 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8575.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.84ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2106 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9747.74ms IncrementalHoareTripleChecker+Time [2021-11-03 23:17:52,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [920 Valid, 0 Invalid, 2129 Unknown, 0 Unchecked, 11.84ms Time], IncrementalHoareTripleChecker [22 Valid, 2106 Invalid, 1 Unknown, 0 Unchecked, 9747.74ms Time] [2021-11-03 23:17:52,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2021-11-03 23:17:52,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 408. [2021-11-03 23:17:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 389 states have (on average 1.1748071979434447) internal successors, (457), 407 states have internal predecessors, (457), 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) [2021-11-03 23:17:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 457 transitions. [2021-11-03 23:17:52,134 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 457 transitions. Word has length 101 [2021-11-03 23:17:52,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:17:52,135 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 457 transitions. [2021-11-03 23:17:52,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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) [2021-11-03 23:17:52,135 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 457 transitions. [2021-11-03 23:17:52,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-03 23:17:52,136 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:17:52,136 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:17:52,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-03 23:17:52,136 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:17:52,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:17:52,137 INFO L85 PathProgramCache]: Analyzing trace with hash 833160721, now seen corresponding path program 1 times [2021-11-03 23:17:52,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:17:52,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780185797] [2021-11-03 23:17:52,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:17:52,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:17:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:17:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:17:54,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:17:54,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780185797] [2021-11-03 23:17:54,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780185797] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:17:54,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:17:54,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 23:17:54,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015370245] [2021-11-03 23:17:54,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:17:54,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 23:17:54,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:17:54,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 23:17:54,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 23:17:54,617 INFO L87 Difference]: Start difference. First operand 408 states and 457 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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) [2021-11-03 23:17:57,416 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:18:01,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:18:01,571 INFO L93 Difference]: Finished difference Result 791 states and 885 transitions. [2021-11-03 23:18:01,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 23:18:01,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-11-03 23:18:01,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:18:01,573 INFO L225 Difference]: With dead ends: 791 [2021-11-03 23:18:01,573 INFO L226 Difference]: Without dead ends: 408 [2021-11-03 23:18:01,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 68.66ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 23:18:01,574 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5978.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.96ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6847.96ms IncrementalHoareTripleChecker+Time [2021-11-03 23:18:01,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 1188 Unknown, 0 Unchecked, 4.96ms Time], IncrementalHoareTripleChecker [1 Valid, 1186 Invalid, 1 Unknown, 0 Unchecked, 6847.96ms Time] [2021-11-03 23:18:01,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-11-03 23:18:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 405. [2021-11-03 23:18:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 386 states have (on average 1.1709844559585492) internal successors, (452), 404 states have internal predecessors, (452), 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) [2021-11-03 23:18:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 452 transitions. [2021-11-03 23:18:01,603 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 452 transitions. Word has length 102 [2021-11-03 23:18:01,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:18:01,603 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 452 transitions. [2021-11-03 23:18:01,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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) [2021-11-03 23:18:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 452 transitions. [2021-11-03 23:18:01,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-03 23:18:01,604 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:18:01,604 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:18:01,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-03 23:18:01,604 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:18:01,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:18:01,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1635368156, now seen corresponding path program 1 times [2021-11-03 23:18:01,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:18:01,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713410701] [2021-11-03 23:18:01,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:18:01,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:18:01,666 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 23:18:01,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1010672120] [2021-11-03 23:18:01,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:18:01,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 23:18:01,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 23:18:01,671 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) [2021-11-03 23:18:01,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-03 23:26:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:26:27,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 3082 conjuncts, 194 conjunts are in the unsatisfiable core [2021-11-03 23:26:27,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 23:26:29,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-03 23:26:30,271 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-11-03 23:26:30,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-11-03 23:26:31,759 INFO L354 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2021-11-03 23:26:31,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 50 [2021-11-03 23:26:31,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2021-11-03 23:26:31,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-03 23:26:32,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-03 23:26:32,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2021-11-03 23:26:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:26:33,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-03 23:26:33,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:26:33,505 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713410701] [2021-11-03 23:26:33,505 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 23:26:33,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010672120] [2021-11-03 23:26:33,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010672120] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:26:33,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:26:33,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-11-03 23:26:33,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704543680] [2021-11-03 23:26:33,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:26:33,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-11-03 23:26:33,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:26:33,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-03 23:26:33,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2021-11-03 23:26:33,508 INFO L87 Difference]: Start difference. First operand 405 states and 452 transitions. Second operand has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 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) [2021-11-03 23:26:36,278 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:26:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:26:58,103 INFO L93 Difference]: Finished difference Result 796 states and 889 transitions. [2021-11-03 23:26:58,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-03 23:26:58,105 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-11-03 23:26:58,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:26:58,106 INFO L225 Difference]: With dead ends: 796 [2021-11-03 23:26:58,106 INFO L226 Difference]: Without dead ends: 410 [2021-11-03 23:26:58,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 5343.08ms TimeCoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2021-11-03 23:26:58,107 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 5554 mSDsCounter, 0 mSdLazyCounter, 5757 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19116.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 43.63ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 5757 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1605 IncrementalHoareTripleChecker+Unchecked, 21744.58ms IncrementalHoareTripleChecker+Time [2021-11-03 23:26:58,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 7376 Unknown, 0 Unchecked, 43.63ms Time], IncrementalHoareTripleChecker [13 Valid, 5757 Invalid, 1 Unknown, 1605 Unchecked, 21744.58ms Time] [2021-11-03 23:26:58,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-11-03 23:26:58,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2021-11-03 23:26:58,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 391 states have (on average 1.1687979539641944) internal successors, (457), 409 states have internal predecessors, (457), 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) [2021-11-03 23:26:58,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 457 transitions. [2021-11-03 23:26:58,146 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 457 transitions. Word has length 105 [2021-11-03 23:26:58,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:26:58,147 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 457 transitions. [2021-11-03 23:26:58,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 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) [2021-11-03 23:26:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 457 transitions. [2021-11-03 23:26:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-03 23:26:58,148 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:26:58,148 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:26:58,371 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forcibly destroying the process [2021-11-03 23:26:58,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-03 23:26:58,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-11-03 23:26:58,411 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:26:58,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:26:58,412 INFO L85 PathProgramCache]: Analyzing trace with hash 32214024, now seen corresponding path program 1 times [2021-11-03 23:26:58,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:26:58,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923862002] [2021-11-03 23:26:58,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:26:58,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:26:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:26:58,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:26:58,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:26:58,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923862002] [2021-11-03 23:26:58,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923862002] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:26:58,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:26:58,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 23:26:58,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404787054] [2021-11-03 23:26:58,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:26:58,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 23:26:58,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:26:58,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 23:26:58,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-03 23:26:58,766 INFO L87 Difference]: Start difference. First operand 410 states and 457 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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) [2021-11-03 23:27:00,994 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:27:05,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:27:05,471 INFO L93 Difference]: Finished difference Result 798 states and 890 transitions. [2021-11-03 23:27:05,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 23:27:05,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-11-03 23:27:05,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:27:05,472 INFO L225 Difference]: With dead ends: 798 [2021-11-03 23:27:05,472 INFO L226 Difference]: Without dead ends: 403 [2021-11-03 23:27:05,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 154.73ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-03 23:27:05,473 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 381 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 1589 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5904.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.79ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1589 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6543.18ms IncrementalHoareTripleChecker+Time [2021-11-03 23:27:05,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 0 Invalid, 1591 Unknown, 0 Unchecked, 6.79ms Time], IncrementalHoareTripleChecker [1 Valid, 1589 Invalid, 1 Unknown, 0 Unchecked, 6543.18ms Time] [2021-11-03 23:27:05,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-11-03 23:27:05,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2021-11-03 23:27:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 384 states have (on average 1.1666666666666667) internal successors, (448), 402 states have internal predecessors, (448), 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) [2021-11-03 23:27:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 448 transitions. [2021-11-03 23:27:05,504 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 448 transitions. Word has length 107 [2021-11-03 23:27:05,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:27:05,504 INFO L470 AbstractCegarLoop]: Abstraction has 403 states and 448 transitions. [2021-11-03 23:27:05,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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) [2021-11-03 23:27:05,504 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 448 transitions. [2021-11-03 23:27:05,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-03 23:27:05,505 INFO L506 BasicCegarLoop]: Found error trace [2021-11-03 23:27:05,505 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:27:05,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-03 23:27:05,505 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 18 more)] === [2021-11-03 23:27:05,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 23:27:05,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1035013888, now seen corresponding path program 1 times [2021-11-03 23:27:05,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-03 23:27:05,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540513830] [2021-11-03 23:27:05,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:27:05,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 23:27:05,554 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-03 23:27:05,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1163605527] [2021-11-03 23:27:05,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 23:27:05,554 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 23:27:05,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-03 23:27:05,556 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) [2021-11-03 23:27:05,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-03 23:27:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 23:27:06,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 3091 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-03 23:27:06,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 23:27:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 23:27:06,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-03 23:27:06,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-03 23:27:06,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540513830] [2021-11-03 23:27:06,717 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 23:27:06,717 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163605527] [2021-11-03 23:27:06,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163605527] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 23:27:06,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 23:27:06,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 23:27:06,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76576315] [2021-11-03 23:27:06,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-03 23:27:06,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 23:27:06,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-03 23:27:06,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 23:27:06,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-03 23:27:06,718 INFO L87 Difference]: Start difference. First operand 403 states and 448 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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) [2021-11-03 23:27:09,605 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-03 23:27:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 23:27:10,431 INFO L93 Difference]: Finished difference Result 403 states and 448 transitions. [2021-11-03 23:27:10,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 23:27:10,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-11-03 23:27:10,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 23:27:10,431 INFO L225 Difference]: With dead ends: 403 [2021-11-03 23:27:10,431 INFO L226 Difference]: Without dead ends: 0 [2021-11-03 23:27:10,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 134.84ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-03 23:27:10,432 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3070.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.31ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3631.51ms IncrementalHoareTripleChecker+Time [2021-11-03 23:27:10,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 81 Unknown, 0 Unchecked, 0.31ms Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 1 Unknown, 0 Unchecked, 3631.51ms Time] [2021-11-03 23:27:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-03 23:27:10,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-03 23:27:10,433 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) [2021-11-03 23:27:10,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-03 23:27:10,433 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2021-11-03 23:27:10,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 23:27:10,434 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-03 23:27:10,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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) [2021-11-03 23:27:10,434 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-03 23:27:10,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-03 23:27:10,437 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (20 of 21 remaining) [2021-11-03 23:27:10,437 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (19 of 21 remaining) [2021-11-03 23:27:10,437 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (18 of 21 remaining) [2021-11-03 23:27:10,437 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (17 of 21 remaining) [2021-11-03 23:27:10,438 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (16 of 21 remaining) [2021-11-03 23:27:10,438 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (15 of 21 remaining) [2021-11-03 23:27:10,438 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (14 of 21 remaining) [2021-11-03 23:27:10,438 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (13 of 21 remaining) [2021-11-03 23:27:10,438 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (12 of 21 remaining) [2021-11-03 23:27:10,438 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (11 of 21 remaining) [2021-11-03 23:27:10,439 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (10 of 21 remaining) [2021-11-03 23:27:10,439 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (9 of 21 remaining) [2021-11-03 23:27:10,439 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (8 of 21 remaining) [2021-11-03 23:27:10,439 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (7 of 21 remaining) [2021-11-03 23:27:10,439 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (6 of 21 remaining) [2021-11-03 23:27:10,439 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (5 of 21 remaining) [2021-11-03 23:27:10,440 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (4 of 21 remaining) [2021-11-03 23:27:10,440 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (3 of 21 remaining) [2021-11-03 23:27:10,440 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (2 of 21 remaining) [2021-11-03 23:27:10,440 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (1 of 21 remaining) [2021-11-03 23:27:10,440 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (0 of 21 remaining) [2021-11-03 23:27:10,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-03 23:27:10,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 23:27:10,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-03 23:27:10,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:10,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 23:27:15,454 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,455 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,455 INFO L858 garLoopResultBuilder]: For program point L9682(lines 9682 9684) no Hoare annotation was computed. [2021-11-03 23:27:15,455 INFO L858 garLoopResultBuilder]: For program point L9682-2(lines 9682 9684) no Hoare annotation was computed. [2021-11-03 23:27:15,455 INFO L854 garLoopResultBuilder]: At program point L9154-5(line 9154) the Hoare annotation is: false [2021-11-03 23:27:15,456 INFO L854 garLoopResultBuilder]: At program point L9154-2(line 9154) the Hoare annotation is: false [2021-11-03 23:27:15,456 INFO L854 garLoopResultBuilder]: At program point L6843(lines 6837 6844) the Hoare annotation is: false [2021-11-03 23:27:15,456 INFO L854 garLoopResultBuilder]: At program point L238(line 238) the Hoare annotation is: false [2021-11-03 23:27:15,456 INFO L854 garLoopResultBuilder]: At program point L238-1(line 238) the Hoare annotation is: false [2021-11-03 23:27:15,456 INFO L854 garLoopResultBuilder]: At program point L238-2(line 238) the Hoare annotation is: false [2021-11-03 23:27:15,456 INFO L854 garLoopResultBuilder]: At program point L238-3(line 238) the Hoare annotation is: false [2021-11-03 23:27:15,456 INFO L854 garLoopResultBuilder]: At program point L7373(lines 7369 7374) the Hoare annotation is: false [2021-11-03 23:27:15,457 INFO L854 garLoopResultBuilder]: At program point L238-4(line 238) the Hoare annotation is: false [2021-11-03 23:27:15,457 INFO L854 garLoopResultBuilder]: At program point L9157(lines 9157 9161) the Hoare annotation is: false [2021-11-03 23:27:15,457 INFO L854 garLoopResultBuilder]: At program point L238-5(line 238) the Hoare annotation is: false [2021-11-03 23:27:15,457 INFO L854 garLoopResultBuilder]: At program point L238-6(line 238) the Hoare annotation is: false [2021-11-03 23:27:15,457 INFO L854 garLoopResultBuilder]: At program point L2617(lines 2613 2621) the Hoare annotation is: (let ((.cse0 (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1)) (.cse1 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse2 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0)) (.cse3 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0))) (.cse4 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse5 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)))) (or (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) .cse0 (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4) .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 0)) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) .cse4 (= (+ (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) 29629528) (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) .cse5) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) .cse0 (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res| 1) 0) (<= (+ |ULTIMATE.start_aws_add_size_checked_#res| 1) 0) .cse1 .cse2 .cse3 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse4 .cse5))) [2021-11-03 23:27:15,457 INFO L854 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: false [2021-11-03 23:27:15,457 INFO L854 garLoopResultBuilder]: At program point L239-1(line 239) the Hoare annotation is: false [2021-11-03 23:27:15,457 INFO L854 garLoopResultBuilder]: At program point L239-2(line 239) the Hoare annotation is: false [2021-11-03 23:27:15,457 INFO L854 garLoopResultBuilder]: At program point L239-3(line 239) the Hoare annotation is: false [2021-11-03 23:27:15,457 INFO L854 garLoopResultBuilder]: At program point L239-4(line 239) the Hoare annotation is: false [2021-11-03 23:27:15,457 INFO L854 garLoopResultBuilder]: At program point L239-5(line 239) the Hoare annotation is: false [2021-11-03 23:27:15,457 INFO L854 garLoopResultBuilder]: At program point L9621(lines 9621 9659) the Hoare annotation is: false [2021-11-03 23:27:15,458 INFO L858 garLoopResultBuilder]: For program point L9160-3(line 9160) no Hoare annotation was computed. [2021-11-03 23:27:15,458 INFO L858 garLoopResultBuilder]: For program point L10019(lines 10019 10023) no Hoare annotation was computed. [2021-11-03 23:27:15,458 INFO L854 garLoopResultBuilder]: At program point L9160-5(line 9160) the Hoare annotation is: false [2021-11-03 23:27:15,458 INFO L858 garLoopResultBuilder]: For program point L10019-1(lines 10019 10023) no Hoare annotation was computed. [2021-11-03 23:27:15,458 INFO L858 garLoopResultBuilder]: For program point L9160-1(line 9160) no Hoare annotation was computed. [2021-11-03 23:27:15,458 INFO L858 garLoopResultBuilder]: For program point L10019-6(lines 10019 10023) no Hoare annotation was computed. [2021-11-03 23:27:15,458 INFO L858 garLoopResultBuilder]: For program point L10019-7(lines 10019 10023) no Hoare annotation was computed. [2021-11-03 23:27:15,458 INFO L858 garLoopResultBuilder]: For program point L10019-8(lines 10019 10023) no Hoare annotation was computed. [2021-11-03 23:27:15,459 INFO L858 garLoopResultBuilder]: For program point L10019-9(lines 10019 10023) no Hoare annotation was computed. [2021-11-03 23:27:15,459 INFO L858 garLoopResultBuilder]: For program point L10019-2(lines 10019 10023) no Hoare annotation was computed. [2021-11-03 23:27:15,459 INFO L858 garLoopResultBuilder]: For program point L10019-3(lines 10019 10023) no Hoare annotation was computed. [2021-11-03 23:27:15,459 INFO L858 garLoopResultBuilder]: For program point L10019-4(lines 10019 10023) no Hoare annotation was computed. [2021-11-03 23:27:15,459 INFO L858 garLoopResultBuilder]: For program point L10019-5(lines 10019 10023) no Hoare annotation was computed. [2021-11-03 23:27:15,459 INFO L858 garLoopResultBuilder]: For program point L10019-14(lines 10019 10023) no Hoare annotation was computed. [2021-11-03 23:27:15,459 INFO L858 garLoopResultBuilder]: For program point L10019-10(lines 10019 10023) no Hoare annotation was computed. [2021-11-03 23:27:15,459 INFO L858 garLoopResultBuilder]: For program point L10019-11(lines 10019 10023) no Hoare annotation was computed. [2021-11-03 23:27:15,460 INFO L858 garLoopResultBuilder]: For program point L10019-12(lines 10019 10023) no Hoare annotation was computed. [2021-11-03 23:27:15,460 INFO L858 garLoopResultBuilder]: For program point L10019-13(lines 10019 10023) no Hoare annotation was computed. [2021-11-03 23:27:15,460 INFO L858 garLoopResultBuilder]: For program point L9690(lines 9690 9693) no Hoare annotation was computed. [2021-11-03 23:27:15,460 INFO L858 garLoopResultBuilder]: For program point L9690-1(lines 9690 9693) no Hoare annotation was computed. [2021-11-03 23:27:15,460 INFO L858 garLoopResultBuilder]: For program point L9624(line 9624) no Hoare annotation was computed. [2021-11-03 23:27:15,460 INFO L858 garLoopResultBuilder]: For program point L9624-2(line 9624) no Hoare annotation was computed. [2021-11-03 23:27:15,460 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,461 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,461 INFO L854 garLoopResultBuilder]: At program point L9692-2(line 9692) the Hoare annotation is: false [2021-11-03 23:27:15,461 INFO L854 garLoopResultBuilder]: At program point L6852-1(line 6852) the Hoare annotation is: false [2021-11-03 23:27:15,461 INFO L854 garLoopResultBuilder]: At program point L6852(line 6852) the Hoare annotation is: false [2021-11-03 23:27:15,461 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,461 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,461 INFO L854 garLoopResultBuilder]: At program point L9100(lines 9100 9116) the Hoare annotation is: false [2021-11-03 23:27:15,462 INFO L854 garLoopResultBuilder]: At program point L9365-2(lines 9365 9399) the Hoare annotation is: false [2021-11-03 23:27:15,462 INFO L858 garLoopResultBuilder]: For program point L9365-3(lines 9365 9399) no Hoare annotation was computed. [2021-11-03 23:27:15,462 INFO L858 garLoopResultBuilder]: For program point L9697(lines 9697 9706) no Hoare annotation was computed. [2021-11-03 23:27:15,462 INFO L854 garLoopResultBuilder]: At program point L250(lines 248 251) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (or (= |ULTIMATE.start___CPROVER_overflow_plus_#res| 1) (= |ULTIMATE.start___CPROVER_overflow_plus_#res| 0)) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1) (or (= |ULTIMATE.start_aws_is_power_of_two_#res| 1) (= |ULTIMATE.start_aws_is_power_of_two_#res| 0)) (= (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset|)) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (not (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 4) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (= ULTIMATE.start_aws_add_u64_checked_~r.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (exists ((|ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| Int)) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) 0))) (and (= .cse0 (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) (= .cse0 ULTIMATE.start_aws_add_u64_checked_~a)))) (= (+ 29629528 ULTIMATE.start_aws_add_u64_checked_~b) 0) (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= ULTIMATE.start_aws_add_u64_checked_~r.base |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0)) [2021-11-03 23:27:15,462 INFO L858 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-11-03 23:27:15,462 INFO L858 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-11-03 23:27:15,463 INFO L854 garLoopResultBuilder]: At program point L2630(lines 2626 2631) the Hoare annotation is: (and (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 4) (or (and (not (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 0)) (= |ULTIMATE.start_aws_is_power_of_two_#res| 1)) (= |ULTIMATE.start_aws_is_power_of_two_#res| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) [2021-11-03 23:27:15,463 INFO L854 garLoopResultBuilder]: At program point L2630-2(lines 2626 2631) the Hoare annotation is: false [2021-11-03 23:27:15,463 INFO L854 garLoopResultBuilder]: At program point L2630-1(lines 2626 2631) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|))) (let ((.cse1 (select (select |#memory_int| .cse0) 40))) (and |ULTIMATE.start_aws_hash_table_is_valid_#t~short1477| |ULTIMATE.start_aws_hash_table_is_valid_#t~short1480| (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= .cse0 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (<= .cse1 4) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (<= (mod (+ 18446744073679922088 (* .cse1 24)) 18446744073709551616) 36028797018963967) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) 0)))) [2021-11-03 23:27:15,463 INFO L858 garLoopResultBuilder]: For program point L2498(lines 2498 2499) no Hoare annotation was computed. [2021-11-03 23:27:15,463 INFO L854 garLoopResultBuilder]: At program point L2630-4(lines 2626 2631) the Hoare annotation is: false [2021-11-03 23:27:15,463 INFO L854 garLoopResultBuilder]: At program point L2630-3(lines 2626 2631) the Hoare annotation is: false [2021-11-03 23:27:15,464 INFO L854 garLoopResultBuilder]: At program point L2630-6(lines 2626 2631) the Hoare annotation is: false [2021-11-03 23:27:15,464 INFO L854 garLoopResultBuilder]: At program point L2630-5(lines 2626 2631) the Hoare annotation is: false [2021-11-03 23:27:15,464 INFO L854 garLoopResultBuilder]: At program point L2630-8(lines 2626 2631) the Hoare annotation is: false [2021-11-03 23:27:15,464 INFO L854 garLoopResultBuilder]: At program point L2630-7(lines 2626 2631) the Hoare annotation is: false [2021-11-03 23:27:15,464 INFO L854 garLoopResultBuilder]: At program point L2630-10(lines 2626 2631) the Hoare annotation is: false [2021-11-03 23:27:15,464 INFO L854 garLoopResultBuilder]: At program point L2630-9(lines 2626 2631) the Hoare annotation is: false [2021-11-03 23:27:15,464 INFO L854 garLoopResultBuilder]: At program point L2630-12(lines 2626 2631) the Hoare annotation is: false [2021-11-03 23:27:15,465 INFO L854 garLoopResultBuilder]: At program point L2630-11(lines 2626 2631) the Hoare annotation is: false [2021-11-03 23:27:15,465 INFO L854 garLoopResultBuilder]: At program point L2630-14(lines 2626 2631) the Hoare annotation is: false [2021-11-03 23:27:15,465 INFO L854 garLoopResultBuilder]: At program point L2630-13(lines 2626 2631) the Hoare annotation is: false [2021-11-03 23:27:15,465 INFO L854 garLoopResultBuilder]: At program point L2630-15(lines 2626 2631) the Hoare annotation is: false [2021-11-03 23:27:15,465 INFO L858 garLoopResultBuilder]: For program point L9700(lines 9700 9702) no Hoare annotation was computed. [2021-11-03 23:27:15,465 INFO L858 garLoopResultBuilder]: For program point L9700-2(lines 9700 9702) no Hoare annotation was computed. [2021-11-03 23:27:15,465 INFO L854 garLoopResultBuilder]: At program point L9635-2(lines 9635 9654) the Hoare annotation is: false [2021-11-03 23:27:15,466 INFO L854 garLoopResultBuilder]: At program point L2501(lines 2497 2502) the Hoare annotation is: (let ((.cse0 (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1)) (.cse7 (= |ULTIMATE.start_aws_is_power_of_two_#res| 1)) (.cse8 (= |ULTIMATE.start_aws_is_power_of_two_#res| 0)) (.cse1 (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4)) (.cse2 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse3 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0)) (.cse4 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0))) (.cse6 (not (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 0))) (.cse5 (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 4)) (.cse9 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|)) (.cse13 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse12 (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (.cse10 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse11 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)))) (or (and (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res| 1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse5 (or (and .cse6 .cse7) .cse8) .cse9 .cse10 .cse11 (or .cse12 (and .cse13 .cse6))) (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) .cse0 (or .cse7 .cse8) (= (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset|)) .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse9 (or .cse13 .cse12) (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) .cse10 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base) .cse11 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0)))) [2021-11-03 23:27:15,466 INFO L858 garLoopResultBuilder]: For program point L9372(lines 9372 9375) no Hoare annotation was computed. [2021-11-03 23:27:15,466 INFO L854 garLoopResultBuilder]: At program point L255(lines 253 256) the Hoare annotation is: (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1) (or (= |ULTIMATE.start_aws_is_power_of_two_#res| 1) (= |ULTIMATE.start_aws_is_power_of_two_#res| 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4) (= ULTIMATE.start_aws_mul_u64_checked_~b 24) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| ULTIMATE.start_aws_mul_u64_checked_~r.offset) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (not (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 4) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (or (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 ULTIMATE.start_aws_mul_u64_checked_~a) (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (= ULTIMATE.start_aws_mul_u64_checked_~r.base |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0)) [2021-11-03 23:27:15,466 INFO L858 garLoopResultBuilder]: For program point L10165-1(lines 10165 10169) no Hoare annotation was computed. [2021-11-03 23:27:15,466 INFO L858 garLoopResultBuilder]: For program point L9703-2(lines 9697 9706) no Hoare annotation was computed. [2021-11-03 23:27:15,466 INFO L858 garLoopResultBuilder]: For program point L9703(lines 9703 9705) no Hoare annotation was computed. [2021-11-03 23:27:15,467 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-03 23:27:15,467 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,467 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,467 INFO L858 garLoopResultBuilder]: For program point L10167-1(lines 10167 10168) no Hoare annotation was computed. [2021-11-03 23:27:15,467 INFO L858 garLoopResultBuilder]: For program point L9639(lines 9639 9641) no Hoare annotation was computed. [2021-11-03 23:27:15,467 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,467 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,468 INFO L858 garLoopResultBuilder]: For program point L9112(lines 9112 9114) no Hoare annotation was computed. [2021-11-03 23:27:15,468 INFO L858 garLoopResultBuilder]: For program point L9377(line 9377) no Hoare annotation was computed. [2021-11-03 23:27:15,468 INFO L858 garLoopResultBuilder]: For program point L9377-2(lines 9377 9380) no Hoare annotation was computed. [2021-11-03 23:27:15,468 INFO L854 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: false [2021-11-03 23:27:15,468 INFO L854 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: false [2021-11-03 23:27:15,468 INFO L858 garLoopResultBuilder]: For program point L10171(lines 10171 10185) no Hoare annotation was computed. [2021-11-03 23:27:15,468 INFO L858 garLoopResultBuilder]: For program point L10171-1(lines 10171 10185) no Hoare annotation was computed. [2021-11-03 23:27:15,468 INFO L854 garLoopResultBuilder]: At program point L9709-2(line 9709) the Hoare annotation is: false [2021-11-03 23:27:15,469 INFO L858 garLoopResultBuilder]: For program point L9709-3(line 9709) no Hoare annotation was computed. [2021-11-03 23:27:15,469 INFO L854 garLoopResultBuilder]: At program point L262(line 262) the Hoare annotation is: false [2021-11-03 23:27:15,469 INFO L854 garLoopResultBuilder]: At program point L262-1(line 262) the Hoare annotation is: false [2021-11-03 23:27:15,469 INFO L858 garLoopResultBuilder]: For program point L10172(lines 10172 10178) no Hoare annotation was computed. [2021-11-03 23:27:15,469 INFO L858 garLoopResultBuilder]: For program point L9115-1(lines 9100 9116) no Hoare annotation was computed. [2021-11-03 23:27:15,469 INFO L858 garLoopResultBuilder]: For program point L10172-2(lines 10172 10178) no Hoare annotation was computed. [2021-11-03 23:27:15,469 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-03 23:27:15,470 INFO L854 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: false [2021-11-03 23:27:15,470 INFO L858 garLoopResultBuilder]: For program point L-1-2(line -1) no Hoare annotation was computed. [2021-11-03 23:27:15,470 INFO L858 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed. [2021-11-03 23:27:15,470 INFO L854 garLoopResultBuilder]: At program point L-1-5(line -1) the Hoare annotation is: false [2021-11-03 23:27:15,470 INFO L858 garLoopResultBuilder]: For program point L-1-6(line -1) no Hoare annotation was computed. [2021-11-03 23:27:15,470 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,470 INFO L858 garLoopResultBuilder]: For program point L-1-8(line -1) no Hoare annotation was computed. [2021-11-03 23:27:15,470 INFO L854 garLoopResultBuilder]: At program point L-1-9(line -1) the Hoare annotation is: false [2021-11-03 23:27:15,471 INFO L858 garLoopResultBuilder]: For program point L10175-2(line 10175) no Hoare annotation was computed. [2021-11-03 23:27:15,471 INFO L858 garLoopResultBuilder]: For program point L10175(line 10175) no Hoare annotation was computed. [2021-11-03 23:27:15,471 INFO L858 garLoopResultBuilder]: For program point L9647(lines 9647 9649) no Hoare annotation was computed. [2021-11-03 23:27:15,471 INFO L854 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (and (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 4) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) [2021-11-03 23:27:15,471 INFO L854 garLoopResultBuilder]: At program point L266-1(line 266) the Hoare annotation is: false [2021-11-03 23:27:15,471 INFO L854 garLoopResultBuilder]: At program point L7402(lines 7399 7403) the Hoare annotation is: false [2021-11-03 23:27:15,471 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,472 INFO L858 garLoopResultBuilder]: For program point L6809(lines 6809 6819) no Hoare annotation was computed. [2021-11-03 23:27:15,472 INFO L858 garLoopResultBuilder]: For program point L10180(line 10180) no Hoare annotation was computed. [2021-11-03 23:27:15,472 INFO L858 garLoopResultBuilder]: For program point L10180-2(lines 10180 10182) no Hoare annotation was computed. [2021-11-03 23:27:15,472 INFO L854 garLoopResultBuilder]: At program point L7406(lines 7405 7407) the Hoare annotation is: false [2021-11-03 23:27:15,472 INFO L858 garLoopResultBuilder]: For program point L9388(lines 9388 9396) no Hoare annotation was computed. [2021-11-03 23:27:15,472 INFO L858 garLoopResultBuilder]: For program point L7341-3(lines 7341 7343) no Hoare annotation was computed. [2021-11-03 23:27:15,472 INFO L858 garLoopResultBuilder]: For program point L7341-2(lines 7341 7343) no Hoare annotation was computed. [2021-11-03 23:27:15,472 INFO L858 garLoopResultBuilder]: For program point L7341(lines 7341 7343) no Hoare annotation was computed. [2021-11-03 23:27:15,473 INFO L858 garLoopResultBuilder]: For program point L9125(lines 9125 9129) no Hoare annotation was computed. [2021-11-03 23:27:15,473 INFO L858 garLoopResultBuilder]: For program point L9125-1(lines 9125 9129) no Hoare annotation was computed. [2021-11-03 23:27:15,473 INFO L858 garLoopResultBuilder]: For program point L7341-6(lines 7341 7343) no Hoare annotation was computed. [2021-11-03 23:27:15,473 INFO L858 garLoopResultBuilder]: For program point L7341-5(lines 7341 7343) no Hoare annotation was computed. [2021-11-03 23:27:15,473 INFO L858 garLoopResultBuilder]: For program point L7341-8(lines 7341 7343) no Hoare annotation was computed. [2021-11-03 23:27:15,473 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,473 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,474 INFO L854 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (< (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (exists ((|ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| Int)) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) 0))) (and (= (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (+ 29629528 .cse0)) (<= (mod .cse0 18446744073709551616) 36028797018963967)))) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|))) [2021-11-03 23:27:15,474 INFO L854 garLoopResultBuilder]: At program point L7344-2(lines 7331 7345) the Hoare annotation is: false [2021-11-03 23:27:15,474 INFO L854 garLoopResultBuilder]: At program point L7344-1(lines 7331 7345) the Hoare annotation is: false [2021-11-03 23:27:15,474 INFO L854 garLoopResultBuilder]: At program point L7344(lines 7331 7345) the Hoare annotation is: false [2021-11-03 23:27:15,474 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,474 INFO L858 garLoopResultBuilder]: For program point L9657(line 9657) no Hoare annotation was computed. [2021-11-03 23:27:15,474 INFO L858 garLoopResultBuilder]: For program point L9657-1(lines 9621 9659) no Hoare annotation was computed. [2021-11-03 23:27:15,475 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,475 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,475 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,475 INFO L858 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,475 INFO L858 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,475 INFO L858 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,475 INFO L858 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,475 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,476 INFO L858 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,476 INFO L858 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,476 INFO L858 garLoopResultBuilder]: For program point L210-9(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,476 INFO L858 garLoopResultBuilder]: For program point L210-10(lines 10165 10166) no Hoare annotation was computed. [2021-11-03 23:27:15,476 INFO L858 garLoopResultBuilder]: For program point L210-11(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,476 INFO L858 garLoopResultBuilder]: For program point L210-12(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,476 INFO L858 garLoopResultBuilder]: For program point L210-13(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,476 INFO L858 garLoopResultBuilder]: For program point L210-14(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,477 INFO L858 garLoopResultBuilder]: For program point L210-15(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,477 INFO L858 garLoopResultBuilder]: For program point L210-16(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,477 INFO L858 garLoopResultBuilder]: For program point L210-17(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,477 INFO L858 garLoopResultBuilder]: For program point L210-18(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,477 INFO L858 garLoopResultBuilder]: For program point L210-19(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,477 INFO L858 garLoopResultBuilder]: For program point L210-20(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,477 INFO L858 garLoopResultBuilder]: For program point L9658(line 9658) no Hoare annotation was computed. [2021-11-03 23:27:15,478 INFO L858 garLoopResultBuilder]: For program point L210-21(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,478 INFO L858 garLoopResultBuilder]: For program point L210-22(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,478 INFO L858 garLoopResultBuilder]: For program point L210-23(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,478 INFO L858 garLoopResultBuilder]: For program point L210-24(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,478 INFO L858 garLoopResultBuilder]: For program point L210-25(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,478 INFO L858 garLoopResultBuilder]: For program point L210-26(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,478 INFO L858 garLoopResultBuilder]: For program point L210-27(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,478 INFO L858 garLoopResultBuilder]: For program point L210-28(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,479 INFO L858 garLoopResultBuilder]: For program point L210-29(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,479 INFO L858 garLoopResultBuilder]: For program point L9658-2(line 9658) no Hoare annotation was computed. [2021-11-03 23:27:15,479 INFO L858 garLoopResultBuilder]: For program point L210-30(lines 210 212) no Hoare annotation was computed. [2021-11-03 23:27:15,479 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,479 INFO L858 garLoopResultBuilder]: For program point L9658-4(lines 9621 9659) no Hoare annotation was computed. [2021-11-03 23:27:15,479 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,479 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,479 INFO L861 garLoopResultBuilder]: At program point L10187(line 10187) the Hoare annotation is: true [2021-11-03 23:27:15,480 INFO L858 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,480 INFO L858 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,480 INFO L858 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,480 INFO L858 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,480 INFO L858 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,480 INFO L858 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,480 INFO L858 garLoopResultBuilder]: For program point L211-18(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,481 INFO L854 garLoopResultBuilder]: At program point L2590(lines 2586 2594) the Hoare annotation is: (let ((.cse0 (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1)) (.cse7 (= |ULTIMATE.start_aws_is_power_of_two_#res| 1)) (.cse8 (= |ULTIMATE.start_aws_is_power_of_two_#res| 0)) (.cse1 (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4)) (.cse2 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse3 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0)) (.cse4 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0))) (.cse6 (not (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 0))) (.cse5 (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 4)) (.cse9 (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|)) (.cse13 (= ULTIMATE.start_assume_abort_if_not_~cond 1)) (.cse12 (= ULTIMATE.start_assume_abort_if_not_~cond 0)) (.cse10 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse11 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)))) (or (and (<= (+ |ULTIMATE.start_aws_mul_u64_checked_#res| 1) 0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse5 (<= (+ |ULTIMATE.start_aws_mul_size_checked_#res| 1) 0) (or (and .cse6 .cse7) .cse8) .cse9 .cse10 .cse11 (or .cse12 (and .cse13 .cse6))) (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) .cse0 (or .cse7 .cse8) (= (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0) (select (select |#memory_int| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base|) |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset|)) .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse9 (or .cse13 .cse12) (= ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.offset |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) .cse10 (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base| ULTIMATE.start_hash_table_state_required_bytes_~required_bytes.base) .cse11 (= |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.offset| 0)))) [2021-11-03 23:27:15,481 INFO L858 garLoopResultBuilder]: For program point L211-20(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,481 INFO L858 garLoopResultBuilder]: For program point L211-22(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,481 INFO L858 garLoopResultBuilder]: For program point L211-24(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,481 INFO L858 garLoopResultBuilder]: For program point L211-26(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,481 INFO L858 garLoopResultBuilder]: For program point L211-28(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,481 INFO L858 garLoopResultBuilder]: For program point L211-30(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,482 INFO L858 garLoopResultBuilder]: For program point L211-32(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,482 INFO L858 garLoopResultBuilder]: For program point L211-34(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,482 INFO L858 garLoopResultBuilder]: For program point L9131(lines 9131 9139) no Hoare annotation was computed. [2021-11-03 23:27:15,482 INFO L858 garLoopResultBuilder]: For program point L211-36(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,482 INFO L858 garLoopResultBuilder]: For program point L10122(lines 10122 10124) no Hoare annotation was computed. [2021-11-03 23:27:15,482 INFO L858 garLoopResultBuilder]: For program point L9131-1(lines 9131 9139) no Hoare annotation was computed. [2021-11-03 23:27:15,482 INFO L858 garLoopResultBuilder]: For program point L9329(lines 9329 9335) no Hoare annotation was computed. [2021-11-03 23:27:15,482 INFO L858 garLoopResultBuilder]: For program point L211-38(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,483 INFO L858 garLoopResultBuilder]: For program point L211-40(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,483 INFO L858 garLoopResultBuilder]: For program point L211-42(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,483 INFO L854 garLoopResultBuilder]: At program point L6951(lines 6950 6952) the Hoare annotation is: false [2021-11-03 23:27:15,483 INFO L858 garLoopResultBuilder]: For program point L211-44(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,483 INFO L858 garLoopResultBuilder]: For program point L211-46(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,483 INFO L858 garLoopResultBuilder]: For program point L211-48(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,483 INFO L858 garLoopResultBuilder]: For program point L211-50(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,484 INFO L858 garLoopResultBuilder]: For program point L211-52(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,484 INFO L858 garLoopResultBuilder]: For program point L211-54(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,484 INFO L858 garLoopResultBuilder]: For program point L211-56(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,484 INFO L858 garLoopResultBuilder]: For program point L211-58(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,484 INFO L858 garLoopResultBuilder]: For program point L211-60(line 211) no Hoare annotation was computed. [2021-11-03 23:27:15,484 INFO L858 garLoopResultBuilder]: For program point L9330(lines 9330 9332) no Hoare annotation was computed. [2021-11-03 23:27:15,484 INFO L858 garLoopResultBuilder]: For program point L9330-2(lines 9330 9332) no Hoare annotation was computed. [2021-11-03 23:27:15,485 INFO L854 garLoopResultBuilder]: At program point L9661(lines 9661 9710) the Hoare annotation is: false [2021-11-03 23:27:15,485 INFO L854 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 0)))) (and (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (<= ULTIMATE.start_ensure_allocated_hash_table_~max_table_entries 4) (or (and .cse0 (= |ULTIMATE.start_aws_is_power_of_two_#res| 1)) (= |ULTIMATE.start_aws_is_power_of_two_#res| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)) (or (= ULTIMATE.start_assume_abort_if_not_~cond 0) (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) .cse0)))) [2021-11-03 23:27:15,485 INFO L854 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|))) [2021-11-03 23:27:15,485 INFO L858 garLoopResultBuilder]: For program point L10126(lines 10126 10128) no Hoare annotation was computed. [2021-11-03 23:27:15,485 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-03 23:27:15,485 INFO L854 garLoopResultBuilder]: At program point L7287-1(lines 7280 7288) the Hoare annotation is: false [2021-11-03 23:27:15,485 INFO L854 garLoopResultBuilder]: At program point L7287(lines 7280 7288) the Hoare annotation is: false [2021-11-03 23:27:15,486 INFO L854 garLoopResultBuilder]: At program point L10062-1(lines 10017 10064) the Hoare annotation is: false [2021-11-03 23:27:15,486 INFO L854 garLoopResultBuilder]: At program point L10062-2(lines 10017 10064) the Hoare annotation is: false [2021-11-03 23:27:15,486 INFO L854 garLoopResultBuilder]: At program point L10062-3(lines 10017 10064) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) [2021-11-03 23:27:15,486 INFO L854 garLoopResultBuilder]: At program point L10062-4(lines 10017 10064) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) [2021-11-03 23:27:15,486 INFO L854 garLoopResultBuilder]: At program point L10062(lines 10017 10064) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|))) (let ((.cse1 (select (select |#memory_int| .cse0) 40))) (and |ULTIMATE.start_aws_hash_table_is_valid_#t~short1477| |ULTIMATE.start_aws_hash_table_is_valid_#t~short1480| (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= .cse0 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (<= .cse1 4) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (<= (mod (+ 18446744073679922088 (* .cse1 24)) 18446744073709551616) 36028797018963967) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) 0)))) [2021-11-03 23:27:15,486 INFO L854 garLoopResultBuilder]: At program point L10062-9(lines 10017 10064) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) [2021-11-03 23:27:15,487 INFO L854 garLoopResultBuilder]: At program point L10062-10(lines 10017 10064) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) [2021-11-03 23:27:15,487 INFO L854 garLoopResultBuilder]: At program point L10062-11(lines 10017 10064) the Hoare annotation is: false [2021-11-03 23:27:15,487 INFO L854 garLoopResultBuilder]: At program point L10062-12(lines 10017 10064) the Hoare annotation is: false [2021-11-03 23:27:15,487 INFO L854 garLoopResultBuilder]: At program point L10062-5(lines 10017 10064) the Hoare annotation is: false [2021-11-03 23:27:15,487 INFO L854 garLoopResultBuilder]: At program point L10062-6(lines 10017 10064) the Hoare annotation is: (and (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) [2021-11-03 23:27:15,487 INFO L854 garLoopResultBuilder]: At program point L10062-7(lines 10017 10064) the Hoare annotation is: false [2021-11-03 23:27:15,487 INFO L854 garLoopResultBuilder]: At program point L10062-8(lines 10017 10064) the Hoare annotation is: false [2021-11-03 23:27:15,488 INFO L858 garLoopResultBuilder]: For program point L9402(lines 9402 9404) no Hoare annotation was computed. [2021-11-03 23:27:15,488 INFO L854 garLoopResultBuilder]: At program point L10062-13(lines 10017 10064) the Hoare annotation is: false [2021-11-03 23:27:15,488 INFO L854 garLoopResultBuilder]: At program point L10062-14(lines 10017 10064) the Hoare annotation is: false [2021-11-03 23:27:15,488 INFO L858 garLoopResultBuilder]: For program point L9402-2(lines 9402 9404) no Hoare annotation was computed. [2021-11-03 23:27:15,488 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,488 INFO L854 garLoopResultBuilder]: At program point L10130(lines 10119 10131) the Hoare annotation is: (let ((.cse0 (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1)) (.cse1 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse2 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0)) (.cse3 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0))) (.cse4 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse5 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)))) (or (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) .cse0 (<= (+ |ULTIMATE.start_hash_table_state_required_bytes_#res| 1) 0) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4) .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 0)) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) .cse4 (= (+ (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) 29629528) (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) .cse5))) [2021-11-03 23:27:15,488 INFO L858 garLoopResultBuilder]: For program point L9337(line 9337) no Hoare annotation was computed. [2021-11-03 23:27:15,489 INFO L858 garLoopResultBuilder]: For program point L9337-2(lines 9337 9343) no Hoare annotation was computed. [2021-11-03 23:27:15,489 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,489 INFO L858 garLoopResultBuilder]: For program point L9338(lines 9338 9340) no Hoare annotation was computed. [2021-11-03 23:27:15,489 INFO L854 garLoopResultBuilder]: At program point L7356-1(lines 7348 7357) the Hoare annotation is: false [2021-11-03 23:27:15,489 INFO L854 garLoopResultBuilder]: At program point L7356(lines 7348 7357) the Hoare annotation is: false [2021-11-03 23:27:15,489 INFO L858 garLoopResultBuilder]: For program point L9338-2(lines 9338 9340) no Hoare annotation was computed. [2021-11-03 23:27:15,489 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,490 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,490 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,490 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,490 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,490 INFO L858 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,490 INFO L858 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,490 INFO L854 garLoopResultBuilder]: At program point L9141(lines 9121 9142) the Hoare annotation is: false [2021-11-03 23:27:15,491 INFO L858 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,491 INFO L854 garLoopResultBuilder]: At program point L9141-1(lines 9121 9142) the Hoare annotation is: false [2021-11-03 23:27:15,491 INFO L858 garLoopResultBuilder]: For program point L10132(lines 10132 10186) no Hoare annotation was computed. [2021-11-03 23:27:15,491 INFO L858 garLoopResultBuilder]: For program point L222-7(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,491 INFO L858 garLoopResultBuilder]: For program point L222-8(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,491 INFO L858 garLoopResultBuilder]: For program point L222-9(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,491 INFO L858 garLoopResultBuilder]: For program point L222-10(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,491 INFO L858 garLoopResultBuilder]: For program point L222-11(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,492 INFO L858 garLoopResultBuilder]: For program point L222-12(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,492 INFO L858 garLoopResultBuilder]: For program point L222-13(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,492 INFO L858 garLoopResultBuilder]: For program point L222-14(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,492 INFO L858 garLoopResultBuilder]: For program point L222-15(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,492 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,492 INFO L858 garLoopResultBuilder]: For program point L222-16(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,492 INFO L858 garLoopResultBuilder]: For program point L222-17(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,493 INFO L858 garLoopResultBuilder]: For program point L222-18(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,493 INFO L858 garLoopResultBuilder]: For program point L222-19(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,493 INFO L858 garLoopResultBuilder]: For program point L222-20(lines 222 224) no Hoare annotation was computed. [2021-11-03 23:27:15,493 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,493 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,493 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,493 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,494 INFO L854 garLoopResultBuilder]: At program point L9406(lines 9348 9407) the Hoare annotation is: false [2021-11-03 23:27:15,494 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,494 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,494 INFO L858 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,494 INFO L858 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,494 INFO L858 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,494 INFO L858 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,494 INFO L858 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,495 INFO L858 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,495 INFO L858 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,495 INFO L858 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,495 INFO L858 garLoopResultBuilder]: For program point L223-21(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,495 INFO L858 garLoopResultBuilder]: For program point L223-22(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,495 INFO L858 garLoopResultBuilder]: For program point L223-24(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,495 INFO L858 garLoopResultBuilder]: For program point L223-25(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,495 INFO L858 garLoopResultBuilder]: For program point L223-27(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,496 INFO L858 garLoopResultBuilder]: For program point L223-28(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,496 INFO L858 garLoopResultBuilder]: For program point L223-30(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,496 INFO L858 garLoopResultBuilder]: For program point L223-31(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,496 INFO L858 garLoopResultBuilder]: For program point L223-33(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,496 INFO L858 garLoopResultBuilder]: For program point L223-34(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,496 INFO L858 garLoopResultBuilder]: For program point L223-36(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,496 INFO L858 garLoopResultBuilder]: For program point L223-37(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,496 INFO L858 garLoopResultBuilder]: For program point L223-39(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,497 INFO L858 garLoopResultBuilder]: For program point L223-40(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,497 INFO L858 garLoopResultBuilder]: For program point L223-42(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,497 INFO L858 garLoopResultBuilder]: For program point L223-43(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,497 INFO L858 garLoopResultBuilder]: For program point L223-45(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,497 INFO L858 garLoopResultBuilder]: For program point L223-46(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,497 INFO L858 garLoopResultBuilder]: For program point L223-48(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,497 INFO L858 garLoopResultBuilder]: For program point L223-49(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,497 INFO L858 garLoopResultBuilder]: For program point L223-51(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,498 INFO L858 garLoopResultBuilder]: For program point L223-52(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,498 INFO L858 garLoopResultBuilder]: For program point L223-54(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,498 INFO L858 garLoopResultBuilder]: For program point L223-55(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,498 INFO L858 garLoopResultBuilder]: For program point L223-57(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,498 INFO L858 garLoopResultBuilder]: For program point L223-58(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,498 INFO L858 garLoopResultBuilder]: For program point L223-60(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,498 INFO L858 garLoopResultBuilder]: For program point L223-61(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,498 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-03 23:27:15,499 INFO L858 garLoopResultBuilder]: For program point L10136(lines 10136 10138) no Hoare annotation was computed. [2021-11-03 23:27:15,499 INFO L858 garLoopResultBuilder]: For program point L10136-2(lines 10136 10138) no Hoare annotation was computed. [2021-11-03 23:27:15,499 INFO L854 garLoopResultBuilder]: At program point L6833(lines 6831 6834) the Hoare annotation is: false [2021-11-03 23:27:15,499 INFO L854 garLoopResultBuilder]: At program point L9147(lines 9147 9155) the Hoare annotation is: false [2021-11-03 23:27:15,499 INFO L854 garLoopResultBuilder]: At program point L9147-1(lines 9147 9155) the Hoare annotation is: false [2021-11-03 23:27:15,499 INFO L854 garLoopResultBuilder]: At program point L9345(lines 9321 9346) the Hoare annotation is: false [2021-11-03 23:27:15,499 INFO L858 garLoopResultBuilder]: For program point L10139(lines 10139 10141) no Hoare annotation was computed. [2021-11-03 23:27:15,499 INFO L858 garLoopResultBuilder]: For program point L10139-2(lines 10139 10141) no Hoare annotation was computed. [2021-11-03 23:27:15,500 INFO L858 garLoopResultBuilder]: For program point L2542(lines 2542 2543) no Hoare annotation was computed. [2021-11-03 23:27:15,500 INFO L858 garLoopResultBuilder]: For program point L10008-3(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,500 INFO L858 garLoopResultBuilder]: For program point L10008-5(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,500 INFO L854 garLoopResultBuilder]: At program point L10008-6(lines 10006 10009) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|))) (let ((.cse1 (select (select |#memory_int| .cse0) 40))) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) (= (select |#valid| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= .cse0 ULTIMATE.start_hash_table_state_is_valid_~map.base) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_is_valid_#res| 0) (<= .cse1 4) (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0) (= |ULTIMATE.start_hash_table_state_is_valid_#res| 0) (= ULTIMATE.start_hash_table_state_is_valid_~size_at_least_two~0 0) (<= (mod (+ 18446744073679922088 (* .cse1 24)) 18446744073709551616) 36028797018963967) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0)) (< (+ .cse0 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) 0)))) [2021-11-03 23:27:15,500 INFO L858 garLoopResultBuilder]: For program point L10008(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,500 INFO L858 garLoopResultBuilder]: For program point L10008-2(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,500 INFO L858 garLoopResultBuilder]: For program point L10008-12(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,501 INFO L854 garLoopResultBuilder]: At program point L10008-13(lines 10006 10009) the Hoare annotation is: (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) 0)) [2021-11-03 23:27:15,501 INFO L858 garLoopResultBuilder]: For program point L10008-14(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,501 INFO L858 garLoopResultBuilder]: For program point L10008-7(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,501 INFO L858 garLoopResultBuilder]: For program point L10008-9(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,501 INFO L858 garLoopResultBuilder]: For program point L10008-10(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,501 INFO L858 garLoopResultBuilder]: For program point L10008-19(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,501 INFO L854 garLoopResultBuilder]: At program point L10008-20(lines 10006 10009) the Hoare annotation is: (and (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_hash_table_remove_~map.base) ULTIMATE.start_aws_hash_table_remove_~map.offset) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (or (not (= ULTIMATE.start_hash_table_state_is_valid_~map.offset 0)) (not (= ULTIMATE.start_hash_table_state_is_valid_~map.base 0))) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_aws_hash_table_is_valid_~map.base) (= ULTIMATE.start_aws_hash_table_is_valid_~map.offset |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_hash_table_remove_~map.base) ULTIMATE.start_aws_hash_table_remove_~map.offset) 0) (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0)) (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset|) 0)) [2021-11-03 23:27:15,502 INFO L858 garLoopResultBuilder]: For program point L10008-21(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,502 INFO L858 garLoopResultBuilder]: For program point L10008-16(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,502 INFO L858 garLoopResultBuilder]: For program point L10008-17(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,502 INFO L854 garLoopResultBuilder]: At program point L10008-27(lines 10006 10009) the Hoare annotation is: false [2021-11-03 23:27:15,502 INFO L858 garLoopResultBuilder]: For program point L10008-28(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,502 INFO L858 garLoopResultBuilder]: For program point L10008-30(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,502 INFO L858 garLoopResultBuilder]: For program point L10008-23(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,502 INFO L858 garLoopResultBuilder]: For program point L10008-24(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,503 INFO L858 garLoopResultBuilder]: For program point L10008-26(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,503 INFO L858 garLoopResultBuilder]: For program point L10008-35(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,503 INFO L858 garLoopResultBuilder]: For program point L10008-37(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,503 INFO L858 garLoopResultBuilder]: For program point L10008-38(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,503 INFO L858 garLoopResultBuilder]: For program point L10008-31(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,503 INFO L858 garLoopResultBuilder]: For program point L10008-33(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,503 INFO L854 garLoopResultBuilder]: At program point L10008-34(lines 10006 10009) the Hoare annotation is: false [2021-11-03 23:27:15,503 INFO L858 garLoopResultBuilder]: For program point L10008-40(line 10008) no Hoare annotation was computed. [2021-11-03 23:27:15,504 INFO L854 garLoopResultBuilder]: At program point L10008-41(lines 10006 10009) the Hoare annotation is: false [2021-11-03 23:27:15,504 INFO L858 garLoopResultBuilder]: For program point L9085(lines 9104 9109) no Hoare annotation was computed. [2021-11-03 23:27:15,504 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-03 23:27:15,504 INFO L854 garLoopResultBuilder]: At program point L2545(lines 2541 2546) the Hoare annotation is: (let ((.cse0 (= (select (store |#valid| |ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base| 0) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) 1)) (.cse1 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| ULTIMATE.start_ensure_allocated_hash_table_~map.offset)) (.cse2 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.offset| 0)) (.cse3 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| 0))) (.cse4 (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| ULTIMATE.start_ensure_allocated_hash_table_~map.base)) (.cse5 (not (= |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|)))) (or (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) .cse0 (<= (+ |ULTIMATE.start_aws_add_u64_checked_#res| 1) 0) .cse1 .cse2 .cse3 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse4 .cse5) (and (= |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset| 0) .cse0 (<= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 4) .cse1 .cse2 .cse3 (not (= ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0 0)) (< |#StackHeapBarrier| |ULTIMATE.start_aws_hash_table_remove_harness_~#map~0.base|) .cse4 (= (+ (select (select |#memory_int| |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base|) |ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.offset|) 29629528) (* 24 ULTIMATE.start_ensure_allocated_hash_table_~num_entries~0)) .cse5))) [2021-11-03 23:27:15,507 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 23:27:15,508 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 23:27:15,523 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,525 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:27:15,525 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,526 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,526 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,526 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,526 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:27:15,528 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,528 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:27:15,529 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,529 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:27:15,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,534 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,534 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,534 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:27:15,535 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,535 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,535 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,535 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,535 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:27:15,537 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-11-03 23:27:15,537 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-11-03 23:27:15,537 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-11-03 23:27:15,538 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-11-03 23:27:15,539 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,539 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,539 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,539 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,539 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:27:15,540 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,540 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,540 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,540 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,541 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:27:15,541 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:27:15,542 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,542 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,542 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:27:15,542 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:27:15,543 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,543 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:15,543 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:27:15,544 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-03 23:27:15,545 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-03 23:27:15,545 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-03 23:27:15,545 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-03 23:27:15,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 11:27:15 BoogieIcfgContainer [2021-11-03 23:27:15,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 23:27:15,547 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 23:27:15,547 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 23:27:15,547 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 23:27:15,548 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 11:14:17" (3/4) ... [2021-11-03 23:27:15,550 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-03 23:27:15,581 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 298 nodes and edges [2021-11-03 23:27:15,584 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 101 nodes and edges [2021-11-03 23:27:15,586 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2021-11-03 23:27:15,589 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-11-03 23:27:15,591 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-03 23:27:15,594 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-03 23:27:15,596 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-03 23:27:15,599 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-03 23:27:15,622 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((num_entries <= 4 && \valid[map] == 1) && map == map) && map == 0) && !(map == 0)) && max_table_entries <= 4) && ((!(num_entries == 0) && \result == 1) || \result == 0)) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && map == map [2021-11-03 23:27:15,622 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0 [2021-11-03 23:27:15,622 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\result + 1 <= 0 && \valid[elemsize := 0][map] == 1) && num_entries <= 4) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && max_table_entries <= 4) && ((!(num_entries == 0) && \result == 1) || \result == 0)) && unknown-#StackHeapBarrier-unknown < map) && map == map) && !(map == required_bytes)) && (cond == 0 || (cond == 1 && !(num_entries == 0)))) || ((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && num_entries <= 4) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && required_bytes == required_bytes) && !(map == required_bytes)) && elemsize == 0) [2021-11-03 23:27:15,622 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\result + 1 <= 0 && \valid[elemsize := 0][map] == 1) && num_entries <= 4) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && max_table_entries <= 4) && \result + 1 <= 0) && ((!(num_entries == 0) && \result == 1) || \result == 0)) && unknown-#StackHeapBarrier-unknown < map) && map == map) && !(map == required_bytes)) && (cond == 0 || (cond == 1 && !(num_entries == 0)))) || ((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && num_entries <= 4) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && required_bytes == required_bytes) && !(map == required_bytes)) && elemsize == 0) [2021-11-03 23:27:15,623 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((\valid[elemsize := 0][map] == 1 && num_entries <= 4) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && max_table_entries <= 4) && ((!(num_entries == 0) && \result == 1) || \result == 0)) && unknown-#StackHeapBarrier-unknown < map) && map == map) && !(map == required_bytes)) && (cond == 0 || (cond == 1 && !(num_entries == 0))) [2021-11-03 23:27:15,623 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((unknown-#StackHeapBarrier-unknown + 1 <= map && \valid[map] == 1) && \result + 1 <= 0) && map == map) && map == 0) && !(map == 0)) && map == map) && !(map == required_bytes)) || ((((((((((required_bytes == 0 && num_entries <= 4) && \valid[map] == 1) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && unknown-#StackHeapBarrier-unknown < map) && map == map) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && !(map == required_bytes)) [2021-11-03 23:27:15,623 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((required_bytes == 0 && (\result == 1 || \result == 0)) && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && num_entries <= 4) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && r == required_bytes) && (cond == 1 || cond == 0)) && (\exists ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base : int :: unknown-#memory_int-unknown[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base][0] == 24 * num_entries && unknown-#memory_int-unknown[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base][0] == a)) && 29629528 + b == 0) && required_bytes == required_bytes) && map == map) && required_bytes == required_bytes) && !(map == required_bytes)) && r == required_bytes) && elemsize == 0 [2021-11-03 23:27:15,623 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((unknown-#StackHeapBarrier-unknown + 1 <= map && \result == 0) && !(\result == 0)) && num_entries <= 4) && \valid[map] == 1) && map == map) && map == 0) && !(map == 0)) && \result + 1 < map) && (\exists ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base : int :: 24 * num_entries == 29629528 + unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] && unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] % 18446744073709551616 <= 36028797018963967)) && map == map) && !(map == required_bytes) [2021-11-03 23:27:15,624 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((unknown-#StackHeapBarrier-unknown + 1 <= map && \valid[elemsize := 0][map] == 1) && \result + 1 <= 0) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && map == map) && !(map == required_bytes)) || ((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && num_entries <= 4) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && unknown-#StackHeapBarrier-unknown < map) && map == map) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && !(map == required_bytes)) [2021-11-03 23:27:15,624 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && num_entries <= 4) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && unknown-#StackHeapBarrier-unknown < map) && map == map) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && !(map == required_bytes)) || (((((((((unknown-#StackHeapBarrier-unknown + 1 <= map && \valid[elemsize := 0][map] == 1) && \result + 1 <= 0) && \result + 1 <= 0) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && map == map) && !(map == required_bytes)) [2021-11-03 23:27:15,624 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((unknown-#StackHeapBarrier-unknown + 1 <= map && \valid[elemsize := 0][map] == 1) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && map == map) && !(map == required_bytes) [2021-11-03 23:27:15,624 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((aux-map && map->p_impl-aux && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && unknown-#StackHeapBarrier-unknown + 1 <= map) && !(\result == 0)) && map == map) && map == map) && \valid[map] == 1) && map == map) && #memory_$Pointer$[map][map] == map) && map == 0) && !(map == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] <= 4) && map == 0) && \result == 0) && size_at_least_two == 0) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] * 24) % 18446744073709551616 <= 36028797018963967) && map == map) && !(map == 0)) && #memory_$Pointer$[map][map] + 1 < map) && #memory_$Pointer$[map][map] == 0 [2021-11-03 23:27:15,625 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((unknown-#StackHeapBarrier-unknown + 1 <= map && !(\result == 0)) && map == map) && map == map) && \valid[map] == 1) && map == map) && #memory_$Pointer$[map][map] == map) && map == 0) && !(map == 0)) && \result == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] <= 4) && map == 0) && \result == 0) && size_at_least_two == 0) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] * 24) % 18446744073709551616 <= 36028797018963967) && map == map) && !(map == 0)) && #memory_$Pointer$[map][map] + 1 < map) && #memory_$Pointer$[map][map] == 0 [2021-11-03 23:27:15,625 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((aux-map && map->p_impl-aux && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && unknown-#StackHeapBarrier-unknown + 1 <= map) && !(\result == 0)) && map == map) && map == map) && \valid[map] == 1) && map == map) && #memory_$Pointer$[map][map] == map) && map == 0) && !(map == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] <= 4) && map == 0) && size_at_least_two == 0) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] * 24) % 18446744073709551616 <= 36028797018963967) && map == map) && !(map == 0)) && #memory_$Pointer$[map][map] + 1 < map) && #memory_$Pointer$[map][map] == 0 [2021-11-03 23:27:15,626 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((#memory_$Pointer$[map][map] == 0 && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map == map) && map == map) && map == map) && !(map == 0)) && map == map) && #memory_$Pointer$[map][map] == 0 [2021-11-03 23:27:15,627 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((#memory_$Pointer$[map][map] == 0 && #memory_$Pointer$[map][map] == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map == map) && map == map) && map == map) && #memory_$Pointer$[map][map] == 0) && !(map == 0)) && map == map) && #memory_$Pointer$[map][map] == 0 [2021-11-03 23:27:15,627 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\result == 0) && map == map) && !(map == 0)) && \result == 0) && map == map [2021-11-03 23:27:15,628 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\result == 0) && map == map) && !(map == 0)) && \result == 0) && map == map [2021-11-03 23:27:15,629 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\result == 0) && map == map) && !(map == 0)) && \result == 0) && map == map [2021-11-03 23:27:15,630 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\result == 0) && map == map) && !(map == 0)) && \result == 0) && map == map [2021-11-03 23:27:15,631 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\result == 0) && map == map) && !(map == 0)) && \result == 0) && map == map [2021-11-03 23:27:16,213 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-03 23:27:16,214 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 23:27:16,214 INFO L158 Benchmark]: Toolchain (without parser) took 787026.67ms. Allocated memory was 115.3MB in the beginning and 423.6MB in the end (delta: 308.3MB). Free memory was 88.7MB in the beginning and 149.9MB in the end (delta: -61.2MB). Peak memory consumption was 327.6MB. Max. memory is 16.1GB. [2021-11-03 23:27:16,214 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 81.8MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-03 23:27:16,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2401.98ms. Allocated memory was 115.3MB in the beginning and 201.3MB in the end (delta: 86.0MB). Free memory was 88.7MB in the beginning and 107.0MB in the end (delta: -18.3MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. [2021-11-03 23:27:16,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 214.91ms. Allocated memory is still 201.3MB. Free memory was 107.0MB in the beginning and 138.7MB in the end (delta: -31.7MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2021-11-03 23:27:16,215 INFO L158 Benchmark]: Boogie Preprocessor took 134.25ms. Allocated memory is still 201.3MB. Free memory was 138.7MB in the beginning and 123.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-03 23:27:16,215 INFO L158 Benchmark]: RCFGBuilder took 5476.24ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 123.0MB in the beginning and 171.7MB in the end (delta: -48.7MB). Peak memory consumption was 205.3MB. Max. memory is 16.1GB. [2021-11-03 23:27:16,216 INFO L158 Benchmark]: TraceAbstraction took 778125.78ms. Allocated memory was 352.3MB in the beginning and 423.6MB in the end (delta: 71.3MB). Free memory was 171.7MB in the beginning and 193.2MB in the end (delta: -21.5MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2021-11-03 23:27:16,216 INFO L158 Benchmark]: Witness Printer took 667.02ms. Allocated memory is still 423.6MB. Free memory was 193.2MB in the beginning and 149.9MB in the end (delta: 43.3MB). Peak memory consumption was 125.1MB. Max. memory is 16.1GB. [2021-11-03 23:27:16,217 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.19ms. Allocated memory is still 81.8MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2401.98ms. Allocated memory was 115.3MB in the beginning and 201.3MB in the end (delta: 86.0MB). Free memory was 88.7MB in the beginning and 107.0MB in the end (delta: -18.3MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 214.91ms. Allocated memory is still 201.3MB. Free memory was 107.0MB in the beginning and 138.7MB in the end (delta: -31.7MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 134.25ms. Allocated memory is still 201.3MB. Free memory was 138.7MB in the beginning and 123.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 5476.24ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 123.0MB in the beginning and 171.7MB in the end (delta: -48.7MB). Peak memory consumption was 205.3MB. Max. memory is 16.1GB. * TraceAbstraction took 778125.78ms. Allocated memory was 352.3MB in the beginning and 423.6MB in the end (delta: 71.3MB). Free memory was 171.7MB in the beginning and 193.2MB in the end (delta: -21.5MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. * Witness Printer took 667.02ms. Allocated memory is still 423.6MB. Free memory was 193.2MB in the beginning and 149.9MB in the end (delta: 43.3MB). Peak memory consumption was 125.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms 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 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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 1 procedures, 365 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 778021.65ms, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 38.26ms, AutomataDifference: 237014.26ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 4790.54ms, InitialAbstractionConstructionTime: 36.44ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 22 mSolverCounterUnknown, 16221 SdHoareTripleChecker+Valid, 207148.66ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16221 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 187470.97ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1605 IncrementalHoareTripleChecker+Unchecked, 35651 mSDsCounter, 460 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51428 IncrementalHoareTripleChecker+Invalid, 53515 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 460 mSolverCounterUnsat, 0 mSDtfsCounter, 51428 mSolverCounterSat, 448.33ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 571 GetRequests, 301 SyntacticMatches, 2 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2208 ImplicationChecksByTransitivity, 35260.90ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=468occurred in iteration=14, InterpolantAutomatonStates: 230, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 536.62ms AutomataMinimizationTime, 22 MinimizatonAttempts, 3379 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 102 LocationsWithAnnotation, 102 PreInvPairs, 130 NumberOfFragments, 1557 HoareAnnotationTreeSize, 102 FomulaSimplifications, 629 FormulaSimplificationTreeSizeReduction, 78.35ms HoareSimplificationTime, 102 FomulaSimplificationsInter, 187 FormulaSimplificationTreeSizeReductionInter, 4693.79ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 717.99ms SsaConstructionTime, 514516.44ms SatisfiabilityAnalysisTime, 18520.96ms InterpolantComputationTime, 2019 NumberOfCodeBlocks, 2019 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1997 ConstructedInterpolants, 5 QuantifiedInterpolants, 8593 SizeOfPredicates, 107 NumberOfNonLiveVariables, 8823 ConjunctsInSsa, 206 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 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 21 specifications checked. All of them hold - InvariantResult [Line: 2613]: Loop Invariant Derived loop invariant: ((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && num_entries <= 4) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && unknown-#StackHeapBarrier-unknown < map) && map == map) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && !(map == required_bytes)) || (((((((((unknown-#StackHeapBarrier-unknown + 1 <= map && \valid[elemsize := 0][map] == 1) && \result + 1 <= 0) && \result + 1 <= 0) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && map == map) && !(map == required_bytes)) - InvariantResult [Line: 10187]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7331]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10006]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7369]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7280]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10006]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (((((\valid[map] == 1 && map == map) && map == 0) && !(map == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && map == map - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: ((((((unknown-#StackHeapBarrier-unknown + 1 <= map && \valid[elemsize := 0][map] == 1) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && map == map) && !(map == required_bytes) - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: ((((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && num_entries <= 4) && b == 24) && elemsize == r) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && num_entries == a) && required_bytes == required_bytes) && !(map == required_bytes)) && r == elemsize) && elemsize == 0 - InvariantResult [Line: 10006]: Loop Invariant [2021-11-03 23:27:16,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:27:16,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((unknown-#StackHeapBarrier-unknown + 1 <= map && !(\result == 0)) && map == map) && map == map) && \valid[map] == 1) && map == map) && #memory_$Pointer$[map][map] == map) && map == 0) && !(map == 0)) && \result == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] <= 4) && map == 0) && \result == 0) && size_at_least_two == 0) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] * 24) % 18446744073709551616 <= 36028797018963967) && map == map) && !(map == 0)) && #memory_$Pointer$[map][map] + 1 < map) && #memory_$Pointer$[map][map] == 0 - InvariantResult [Line: 9709]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9621]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10006]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7348]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9365]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9147]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9147]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9100]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9692]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10119]: Loop Invariant Derived loop invariant: (((((((unknown-#StackHeapBarrier-unknown + 1 <= map && \valid[map] == 1) && \result + 1 <= 0) && map == map) && map == 0) && !(map == 0)) && map == map) && !(map == required_bytes)) || ((((((((((required_bytes == 0 && num_entries <= 4) && \valid[map] == 1) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && unknown-#StackHeapBarrier-unknown < map) && map == map) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && !(map == required_bytes)) - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7280]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7399]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10006]: Loop Invariant [2021-11-03 23:27:16,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:27:16,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((#memory_$Pointer$[map][map] == 0 && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map == map) && map == map) && map == map) && !(map == 0)) && map == map) && #memory_$Pointer$[map][map] == 0 - InvariantResult [Line: 9348]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9121]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7331]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9635]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2541]: Loop Invariant Derived loop invariant: ((((((((unknown-#StackHeapBarrier-unknown + 1 <= map && \valid[elemsize := 0][map] == 1) && \result + 1 <= 0) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && map == map) && !(map == required_bytes)) || ((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && num_entries <= 4) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && unknown-#StackHeapBarrier-unknown < map) && map == map) && unknown-#memory_int-unknown[required_bytes][required_bytes] + 29629528 == 24 * num_entries) && !(map == required_bytes)) - InvariantResult [Line: 6852]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7348]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: ((((((((((((\result + 1 <= 0 && \valid[elemsize := 0][map] == 1) && num_entries <= 4) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && max_table_entries <= 4) && ((!(num_entries == 0) && \result == 1) || \result == 0)) && unknown-#StackHeapBarrier-unknown < map) && map == map) && !(map == required_bytes)) && (cond == 0 || (cond == 1 && !(num_entries == 0)))) || ((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && num_entries <= 4) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && required_bytes == required_bytes) && !(map == required_bytes)) && elemsize == 0) - InvariantResult [Line: 9154]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9160]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: (((!(\result == 0) && map == map) && !(map == 0)) && \result == 0) && map == map - InvariantResult [Line: 6837]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: (((!(\result == 0) && map == map) && !(map == 0)) && \result == 0) && map == map - InvariantResult [Line: 9321]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9661]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: ((((((((((\valid[elemsize := 0][map] == 1 && num_entries <= 4) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && max_table_entries <= 4) && ((!(num_entries == 0) && \result == 1) || \result == 0)) && unknown-#StackHeapBarrier-unknown < map) && map == map) && !(map == required_bytes)) && (cond == 0 || (cond == 1 && !(num_entries == 0))) - InvariantResult [Line: 2626]: Loop Invariant [2021-11-03 23:27:16,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:27:16,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,277 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((aux-map && map->p_impl-aux && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && unknown-#StackHeapBarrier-unknown + 1 <= map) && !(\result == 0)) && map == map) && map == map) && \valid[map] == 1) && map == map) && #memory_$Pointer$[map][map] == map) && map == 0) && !(map == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] <= 4) && map == 0) && size_at_least_two == 0) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] * 24) % 18446744073709551616 <= 36028797018963967) && map == map) && !(map == 0)) && #memory_$Pointer$[map][map] + 1 < map) && #memory_$Pointer$[map][map] == 0 - InvariantResult [Line: 248]: Loop Invariant [2021-11-03 23:27:16,278 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-11-03 23:27:16,279 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-11-03 23:27:16,279 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] [2021-11-03 23:27:16,280 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((required_bytes == 0 && (\result == 1 || \result == 0)) && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && num_entries <= 4) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && r == required_bytes) && (cond == 1 || cond == 0)) && (\exists ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base : int :: unknown-#memory_int-unknown[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base][0] == 24 * num_entries && unknown-#memory_int-unknown[ULTIMATE.start_hash_table_state_required_bytes_~#elemsize~0.base][0] == a)) && 29629528 + b == 0) && required_bytes == required_bytes) && map == map) && required_bytes == required_bytes) && !(map == required_bytes)) && r == required_bytes) && elemsize == 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: ((((((((num_entries <= 4 && \valid[map] == 1) && map == map) && map == 0) && !(map == 0)) && max_table_entries <= 4) && ((!(num_entries == 0) && \result == 1) || \result == 0)) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && map == map - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6852]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant [2021-11-03 23:27:16,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,281 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,282 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,282 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,282 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:27:16,283 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,286 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,287 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,287 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,287 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((aux-map && map->p_impl-aux && aux-map && map->p_impl && hash_table_state_is_valid(map->p_impl)-aux) && unknown-#StackHeapBarrier-unknown + 1 <= map) && !(\result == 0)) && map == map) && map == map) && \valid[map] == 1) && map == map) && #memory_$Pointer$[map][map] == map) && map == 0) && !(map == 0)) && unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] <= 4) && map == 0) && \result == 0) && size_at_least_two == 0) && (18446744073679922088 + unknown-#memory_int-unknown[#memory_$Pointer$[map][map]][40] * 24) % 18446744073709551616 <= 36028797018963967) && map == map) && !(map == 0)) && #memory_$Pointer$[map][map] + 1 < map) && #memory_$Pointer$[map][map] == 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: (((!(\result == 0) && map == map) && !(map == 0)) && \result == 0) && map == map - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9154]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6950]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9121]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10006]: Loop Invariant [2021-11-03 23:27:16,289 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:27:16,289 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,289 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,289 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:27:16,290 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-03 23:27:16,290 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,290 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-03 23:27:16,290 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((#memory_$Pointer$[map][map] == 0 && #memory_$Pointer$[map][map] == 0) && !(\result == 0)) && (!(map == 0) || !(map == 0))) && map == map) && map == map) && map == map) && #memory_$Pointer$[map][map] == 0) && !(map == 0)) && map == map) && #memory_$Pointer$[map][map] == 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: (((!(\result == 0) && map == map) && !(map == 0)) && \result == 0) && map == map - InvariantResult [Line: 9157]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2586]: Loop Invariant Derived loop invariant: (((((((((((((\result + 1 <= 0 && \valid[elemsize := 0][map] == 1) && num_entries <= 4) && map == map) && map == 0) && !(map == 0)) && \result + 1 <= 0) && max_table_entries <= 4) && \result + 1 <= 0) && ((!(num_entries == 0) && \result == 1) || \result == 0)) && unknown-#StackHeapBarrier-unknown < map) && map == map) && !(map == required_bytes)) && (cond == 0 || (cond == 1 && !(num_entries == 0)))) || ((((((((((((((((required_bytes == 0 && \valid[elemsize := 0][map] == 1) && (\result == 1 || \result == 0)) && 24 * num_entries == unknown-#memory_int-unknown[elemsize][elemsize]) && num_entries <= 4) && map == map) && map == 0) && !(map == 0)) && !(num_entries == 0)) && max_table_entries <= 4) && unknown-#StackHeapBarrier-unknown < map) && (cond == 1 || cond == 0)) && required_bytes == required_bytes) && map == map) && required_bytes == required_bytes) && !(map == required_bytes)) && elemsize == 0) - InvariantResult [Line: 6943]: Loop Invariant [2021-11-03 23:27:16,292 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-03 23:27:16,292 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-03 23:27:16,293 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] [2021-11-03 23:27:16,293 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base,QUANTIFIED] Derived loop invariant: ((((((((((unknown-#StackHeapBarrier-unknown + 1 <= map && \result == 0) && !(\result == 0)) && num_entries <= 4) && \valid[map] == 1) && map == map) && map == 0) && !(map == 0)) && \result + 1 < map) && (\exists ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base : int :: 24 * num_entries == 29629528 + unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] && unknown-#memory_int-unknown[ULTIMATE.start_ensure_allocated_hash_table_~#required_bytes~0.base][0] % 18446744073709551616 <= 36028797018963967)) && map == map) && !(map == required_bytes) - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: (((!(\result == 0) && map == map) && !(map == 0)) && \result == 0) && map == map - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7405]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 10017]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6831]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2626]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7331]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2021-11-03 23:27:16,511 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-03 23:27:16,564 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE