./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8e1c903 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/bin/uautomizer-IVEQpCNsaX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/bin/uautomizer-IVEQpCNsaX --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 7d8c1ced61af2c61b36782af6d28a32546abe33f0c852d8f862ae04f74aae5e5 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-f8e1c90 [2021-11-09 10:46:14,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 10:46:14,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 10:46:14,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 10:46:14,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 10:46:14,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 10:46:14,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 10:46:14,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 10:46:14,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 10:46:14,321 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 10:46:14,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 10:46:14,324 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 10:46:14,324 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 10:46:14,326 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 10:46:14,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 10:46:14,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 10:46:14,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 10:46:14,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 10:46:14,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 10:46:14,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 10:46:14,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 10:46:14,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 10:46:14,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 10:46:14,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 10:46:14,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 10:46:14,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 10:46:14,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 10:46:14,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 10:46:14,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 10:46:14,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 10:46:14,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 10:46:14,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 10:46:14,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 10:46:14,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 10:46:14,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 10:46:14,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 10:46:14,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 10:46:14,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 10:46:14,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 10:46:14,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 10:46:14,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 10:46:14,369 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-09 10:46:14,410 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 10:46:14,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 10:46:14,411 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 10:46:14,411 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 10:46:14,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 10:46:14,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 10:46:14,413 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 10:46:14,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 10:46:14,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 10:46:14,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 10:46:14,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-09 10:46:14,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-09 10:46:14,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-09 10:46:14,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 10:46:14,417 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 10:46:14,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-09 10:46:14,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 10:46:14,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 10:46:14,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-09 10:46:14,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 10:46:14,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 10:46:14,419 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-09 10:46:14,419 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-09 10:46:14,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 10:46:14,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-09 10:46:14,420 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-09 10:46:14,420 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-09 10:46:14,420 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-09 10:46:14,420 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 10:46:14,422 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/bin/uautomizer-IVEQpCNsaX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/bin/uautomizer-IVEQpCNsaX 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 -> 7d8c1ced61af2c61b36782af6d28a32546abe33f0c852d8f862ae04f74aae5e5 [2021-11-09 10:46:14,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 10:46:14,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 10:46:14,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 10:46:14,739 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 10:46:14,741 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 10:46:14,742 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2021-11-09 10:46:14,844 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/bin/uautomizer-IVEQpCNsaX/data/84d222c91/ce7afbc30e134eeb959462892d0ac1b0/FLAGc281921c5 [2021-11-09 10:46:15,839 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 10:46:15,840 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2021-11-09 10:46:15,903 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/bin/uautomizer-IVEQpCNsaX/data/84d222c91/ce7afbc30e134eeb959462892d0ac1b0/FLAGc281921c5 [2021-11-09 10:46:16,232 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/bin/uautomizer-IVEQpCNsaX/data/84d222c91/ce7afbc30e134eeb959462892d0ac1b0 [2021-11-09 10:46:16,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 10:46:16,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 10:46:16,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 10:46:16,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 10:46:16,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 10:46:16,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:46:16" (1/1) ... [2021-11-09 10:46:16,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@496cc415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:46:16, skipping insertion in model container [2021-11-09 10:46:16,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:46:16" (1/1) ... [2021-11-09 10:46:16,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 10:46:16,411 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 10:46:16,741 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4491,4504] [2021-11-09 10:46:16,749 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4551,4564] [2021-11-09 10:46:16,780 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-09 10:46:16,788 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-09 10:46:17,970 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:17,971 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:17,972 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:17,973 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:17,974 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:17,988 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:17,990 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:17,992 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:17,993 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:18,492 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-09 10:46:18,494 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-09 10:46:18,495 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-09 10:46:18,497 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-09 10:46:18,498 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-09 10:46:18,499 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-09 10:46:18,500 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-09 10:46:18,501 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-09 10:46:18,501 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-09 10:46:18,502 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-09 10:46:18,694 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-09 10:46:18,768 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:18,768 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:18,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 10:46:18,987 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 10:46:19,042 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4491,4504] [2021-11-09 10:46:19,063 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4551,4564] [2021-11-09 10:46:19,066 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-09 10:46:19,067 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-09 10:46:19,139 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:19,140 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:19,141 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:19,141 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:19,142 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:19,151 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:19,152 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:19,153 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:19,154 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:19,195 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-09 10:46:19,196 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-09 10:46:19,197 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-09 10:46:19,198 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-09 10:46:19,200 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-09 10:46:19,201 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-09 10:46:19,201 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-09 10:46:19,202 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-09 10:46:19,203 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-09 10:46:19,204 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-09 10:46:19,230 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-09 10:46:19,307 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:19,307 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-09 10:46:19,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 10:46:19,658 INFO L208 MainTranslator]: Completed translation [2021-11-09 10:46:19,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:46:19 WrapperNode [2021-11-09 10:46:19,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 10:46:19,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 10:46:19,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 10:46:19,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 10:46:19,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:46:19" (1/1) ... [2021-11-09 10:46:19,849 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:46:19" (1/1) ... [2021-11-09 10:46:19,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 10:46:19,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 10:46:19,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 10:46:19,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 10:46:19,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:46:19" (1/1) ... [2021-11-09 10:46:19,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:46:19" (1/1) ... [2021-11-09 10:46:20,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:46:19" (1/1) ... [2021-11-09 10:46:20,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:46:19" (1/1) ... [2021-11-09 10:46:20,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:46:19" (1/1) ... [2021-11-09 10:46:20,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:46:19" (1/1) ... [2021-11-09 10:46:20,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:46:19" (1/1) ... [2021-11-09 10:46:20,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 10:46:20,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 10:46:20,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 10:46:20,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 10:46:20,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:46:19" (1/1) ... [2021-11-09 10:46:20,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 10:46:20,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 10:46:20,153 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-09 10:46:20,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-09 10:46:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-09 10:46:20,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-09 10:46:20,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-09 10:46:20,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-09 10:46:20,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 10:46:20,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 10:46:20,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 10:46:20,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-09 10:46:20,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-09 10:46:20,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-09 10:46:20,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-09 10:46:32,061 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 10:46:32,062 INFO L299 CfgBuilder]: Removed 50 assume(true) statements. [2021-11-09 10:46:32,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:46:32 BoogieIcfgContainer [2021-11-09 10:46:32,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 10:46:32,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-09 10:46:32,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-09 10:46:32,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-09 10:46:32,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:46:16" (1/3) ... [2021-11-09 10:46:32,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65105138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:46:32, skipping insertion in model container [2021-11-09 10:46:32,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:46:19" (2/3) ... [2021-11-09 10:46:32,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65105138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:46:32, skipping insertion in model container [2021-11-09 10:46:32,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:46:32" (3/3) ... [2021-11-09 10:46:32,090 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_init_harness.i [2021-11-09 10:46:32,096 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-09 10:46:32,096 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-09 10:46:32,189 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-09 10:46:32,202 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-09 10:46:32,203 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-09 10:46:32,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 84 states have internal predecessors, (114), 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-09 10:46:32,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-09 10:46:32,235 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:46:32,236 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:46:32,236 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:46:32,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:46:32,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1714787328, now seen corresponding path program 1 times [2021-11-09 10:46:32,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:46:32,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425443522] [2021-11-09 10:46:32,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:46:32,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:46:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:46:33,025 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-09 10:46:33,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:46:33,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425443522] [2021-11-09 10:46:33,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425443522] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:46:33,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:46:33,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-09 10:46:33,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647643002] [2021-11-09 10:46:33,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-09 10:46:33,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:46:33,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-09 10:46:33,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-09 10:46:33,050 INFO L87 Difference]: Start difference. First operand has 85 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 84 states have internal predecessors, (114), 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-09 10:46:33,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:46:33,073 INFO L93 Difference]: Finished difference Result 166 states and 223 transitions. [2021-11-09 10:46:33,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-09 10:46:33,074 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2021-11-09 10:46:33,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:46:33,083 INFO L225 Difference]: With dead ends: 166 [2021-11-09 10:46:33,083 INFO L226 Difference]: Without dead ends: 79 [2021-11-09 10:46:33,086 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-09 10:46:33,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-11-09 10:46:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-11-09 10:46:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 78 states have internal predecessors, (97), 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-09 10:46:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2021-11-09 10:46:33,123 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 15 [2021-11-09 10:46:33,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:46:33,124 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2021-11-09 10:46:33,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-09 10:46:33,124 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2021-11-09 10:46:33,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-09 10:46:33,125 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:46:33,126 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:46:33,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-09 10:46:33,126 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:46:33,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:46:33,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1972952766, now seen corresponding path program 1 times [2021-11-09 10:46:33,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:46:33,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932896260] [2021-11-09 10:46:33,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:46:33,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:46:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:46:33,889 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-09 10:46:33,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:46:33,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932896260] [2021-11-09 10:46:33,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932896260] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:46:33,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:46:33,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 10:46:33,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619459729] [2021-11-09 10:46:33,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 10:46:33,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:46:33,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 10:46:33,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-09 10:46:33,893 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-09 10:46:34,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:46:34,145 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2021-11-09 10:46:34,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 10:46:34,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2021-11-09 10:46:34,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:46:34,148 INFO L225 Difference]: With dead ends: 117 [2021-11-09 10:46:34,148 INFO L226 Difference]: Without dead ends: 79 [2021-11-09 10:46:34,149 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-09 10:46:34,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-11-09 10:46:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-11-09 10:46:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 78 states have internal predecessors, (95), 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-09 10:46:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2021-11-09 10:46:34,177 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 15 [2021-11-09 10:46:34,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:46:34,178 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2021-11-09 10:46:34,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-09 10:46:34,179 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2021-11-09 10:46:34,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-09 10:46:34,183 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:46:34,184 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 10:46:34,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-09 10:46:34,185 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:46:34,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:46:34,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1369831661, now seen corresponding path program 1 times [2021-11-09 10:46:34,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:46:34,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286833574] [2021-11-09 10:46:34,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:46:34,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:46:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:46:34,986 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-09 10:46:34,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:46:34,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286833574] [2021-11-09 10:46:34,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286833574] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:46:34,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:46:34,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-09 10:46:34,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128868690] [2021-11-09 10:46:34,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 10:46:34,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:46:34,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 10:46:34,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-09 10:46:34,989 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-09 10:46:35,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:46:35,482 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2021-11-09 10:46:35,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-09 10:46:35,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 21 [2021-11-09 10:46:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:46:35,486 INFO L225 Difference]: With dead ends: 124 [2021-11-09 10:46:35,486 INFO L226 Difference]: Without dead ends: 120 [2021-11-09 10:46:35,487 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-09 10:46:35,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-11-09 10:46:35,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 87. [2021-11-09 10:46:35,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 86 states have internal predecessors, (103), 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-09 10:46:35,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2021-11-09 10:46:35,514 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 21 [2021-11-09 10:46:35,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:46:35,515 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2021-11-09 10:46:35,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-09 10:46:35,515 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2021-11-09 10:46:35,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-09 10:46:35,518 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:46:35,519 INFO L513 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] [2021-11-09 10:46:35,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-09 10:46:35,519 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:46:35,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:46:35,521 INFO L85 PathProgramCache]: Analyzing trace with hash -692640299, now seen corresponding path program 1 times [2021-11-09 10:46:35,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:46:35,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892484777] [2021-11-09 10:46:35,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:46:35,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:46:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:46:35,810 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-09 10:46:35,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:46:35,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892484777] [2021-11-09 10:46:35,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892484777] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:46:35,811 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:46:35,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 10:46:35,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548195655] [2021-11-09 10:46:35,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 10:46:35,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:46:35,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 10:46:35,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:46:35,814 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-09 10:46:35,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:46:35,857 INFO L93 Difference]: Finished difference Result 124 states and 146 transitions. [2021-11-09 10:46:35,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 10:46:35,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2021-11-09 10:46:35,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:46:35,859 INFO L225 Difference]: With dead ends: 124 [2021-11-09 10:46:35,860 INFO L226 Difference]: Without dead ends: 88 [2021-11-09 10:46:35,861 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 10:46:35,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-11-09 10:46:35,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-11-09 10:46:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 87 states have internal predecessors, (104), 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-09 10:46:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2021-11-09 10:46:35,873 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 25 [2021-11-09 10:46:35,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:46:35,873 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2021-11-09 10:46:35,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-09 10:46:35,874 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2021-11-09 10:46:35,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-09 10:46:35,875 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:46:35,876 INFO L513 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] [2021-11-09 10:46:35,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-09 10:46:35,877 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:46:35,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:46:35,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1893417011, now seen corresponding path program 1 times [2021-11-09 10:46:35,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:46:35,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830065975] [2021-11-09 10:46:35,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:46:35,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:46:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:46:40,867 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-09 10:46:40,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:46:40,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830065975] [2021-11-09 10:46:40,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830065975] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:46:40,868 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:46:40,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-09 10:46:40,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624491963] [2021-11-09 10:46:40,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-09 10:46:40,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:46:40,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-09 10:46:40,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-09 10:46:40,870 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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-09 10:46:46,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:46:46,116 INFO L93 Difference]: Finished difference Result 206 states and 244 transitions. [2021-11-09 10:46:46,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-09 10:46:46,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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 25 [2021-11-09 10:46:46,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:46:46,119 INFO L225 Difference]: With dead ends: 206 [2021-11-09 10:46:46,119 INFO L226 Difference]: Without dead ends: 157 [2021-11-09 10:46:46,120 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-11-09 10:46:46,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-11-09 10:46:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 98. [2021-11-09 10:46:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 97 states have internal predecessors, (118), 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-09 10:46:46,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2021-11-09 10:46:46,143 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 25 [2021-11-09 10:46:46,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:46:46,143 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2021-11-09 10:46:46,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 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-09 10:46:46,144 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2021-11-09 10:46:46,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-09 10:46:46,145 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:46:46,145 INFO L513 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] [2021-11-09 10:46:46,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-09 10:46:46,146 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:46:46,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:46:46,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1635251573, now seen corresponding path program 1 times [2021-11-09 10:46:46,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:46:46,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323034783] [2021-11-09 10:46:46,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:46:46,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:46:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:46:46,742 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-09 10:46:46,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:46:46,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323034783] [2021-11-09 10:46:46,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323034783] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:46:46,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:46:46,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 10:46:46,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983006444] [2021-11-09 10:46:46,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 10:46:46,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:46:46,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 10:46:46,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:46:46,746 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-09 10:46:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:46:49,208 INFO L93 Difference]: Finished difference Result 173 states and 208 transitions. [2021-11-09 10:46:49,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 10:46:49,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2021-11-09 10:46:49,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:46:49,211 INFO L225 Difference]: With dead ends: 173 [2021-11-09 10:46:49,211 INFO L226 Difference]: Without dead ends: 118 [2021-11-09 10:46:49,212 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-09 10:46:49,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-09 10:46:49,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2021-11-09 10:46:49,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.2577319587628866) internal successors, (122), 101 states have internal predecessors, (122), 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-09 10:46:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2021-11-09 10:46:49,223 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 25 [2021-11-09 10:46:49,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:46:49,224 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2021-11-09 10:46:49,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-09 10:46:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2021-11-09 10:46:49,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-09 10:46:49,226 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:46:49,227 INFO L513 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] [2021-11-09 10:46:49,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-09 10:46:49,227 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:46:49,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:46:49,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1648598473, now seen corresponding path program 1 times [2021-11-09 10:46:49,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:46:49,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124216243] [2021-11-09 10:46:49,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:46:49,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:46:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:46:49,876 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-09 10:46:49,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:46:49,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124216243] [2021-11-09 10:46:49,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124216243] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:46:49,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:46:49,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 10:46:49,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499902056] [2021-11-09 10:46:49,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 10:46:49,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:46:49,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 10:46:49,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:46:49,880 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-09 10:46:54,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:46:54,583 INFO L93 Difference]: Finished difference Result 205 states and 240 transitions. [2021-11-09 10:46:54,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 10:46:54,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2021-11-09 10:46:54,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:46:54,585 INFO L225 Difference]: With dead ends: 205 [2021-11-09 10:46:54,586 INFO L226 Difference]: Without dead ends: 157 [2021-11-09 10:46:54,586 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-09 10:46:54,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-11-09 10:46:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2021-11-09 10:46:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.2666666666666666) internal successors, (133), 109 states have internal predecessors, (133), 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-09 10:46:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2021-11-09 10:46:54,594 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 25 [2021-11-09 10:46:54,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:46:54,595 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2021-11-09 10:46:54,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-09 10:46:54,596 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2021-11-09 10:46:54,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-09 10:46:54,597 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:46:54,598 INFO L513 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] [2021-11-09 10:46:54,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-09 10:46:54,598 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:46:54,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:46:54,599 INFO L85 PathProgramCache]: Analyzing trace with hash 968540103, now seen corresponding path program 1 times [2021-11-09 10:46:54,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:46:54,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999016400] [2021-11-09 10:46:54,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:46:54,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:46:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:46:55,146 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-09 10:46:55,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:46:55,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999016400] [2021-11-09 10:46:55,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999016400] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:46:55,147 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:46:55,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 10:46:55,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742515028] [2021-11-09 10:46:55,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 10:46:55,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:46:55,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 10:46:55,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:46:55,149 INFO L87 Difference]: Start difference. First operand 110 states and 133 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-09 10:46:57,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:46:57,662 INFO L93 Difference]: Finished difference Result 168 states and 200 transitions. [2021-11-09 10:46:57,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 10:46:57,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2021-11-09 10:46:57,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:46:57,664 INFO L225 Difference]: With dead ends: 168 [2021-11-09 10:46:57,664 INFO L226 Difference]: Without dead ends: 119 [2021-11-09 10:46:57,665 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-09 10:46:57,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-09 10:46:57,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2021-11-09 10:46:57,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.2616822429906542) internal successors, (135), 111 states have internal predecessors, (135), 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-09 10:46:57,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2021-11-09 10:46:57,676 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 25 [2021-11-09 10:46:57,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:46:57,676 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2021-11-09 10:46:57,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-09 10:46:57,677 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2021-11-09 10:46:57,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-09 10:46:57,678 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:46:57,679 INFO L513 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] [2021-11-09 10:46:57,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-09 10:46:57,679 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:46:57,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:46:57,680 INFO L85 PathProgramCache]: Analyzing trace with hash 895707603, now seen corresponding path program 1 times [2021-11-09 10:46:57,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:46:57,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633229033] [2021-11-09 10:46:57,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:46:57,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:46:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:46:58,010 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-09 10:46:58,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:46:58,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633229033] [2021-11-09 10:46:58,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633229033] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:46:58,011 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:46:58,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 10:46:58,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104083883] [2021-11-09 10:46:58,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 10:46:58,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:46:58,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 10:46:58,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 10:46:58,013 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-09 10:46:58,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:46:58,072 INFO L93 Difference]: Finished difference Result 153 states and 183 transitions. [2021-11-09 10:46:58,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 10:46:58,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2021-11-09 10:46:58,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:46:58,074 INFO L225 Difference]: With dead ends: 153 [2021-11-09 10:46:58,074 INFO L226 Difference]: Without dead ends: 112 [2021-11-09 10:46:58,075 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:46:58,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-11-09 10:46:58,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2021-11-09 10:46:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.2476190476190476) internal successors, (131), 109 states have internal predecessors, (131), 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-09 10:46:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2021-11-09 10:46:58,083 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 25 [2021-11-09 10:46:58,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:46:58,083 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2021-11-09 10:46:58,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-09 10:46:58,084 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2021-11-09 10:46:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-09 10:46:58,086 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:46:58,086 INFO L513 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] [2021-11-09 10:46:58,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-09 10:46:58,086 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:46:58,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:46:58,087 INFO L85 PathProgramCache]: Analyzing trace with hash -123775902, now seen corresponding path program 1 times [2021-11-09 10:46:58,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:46:58,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608426942] [2021-11-09 10:46:58,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:46:58,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:46:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:46:58,744 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-09 10:46:58,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:46:58,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608426942] [2021-11-09 10:46:58,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608426942] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:46:58,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:46:58,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-09 10:46:58,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69456332] [2021-11-09 10:46:58,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-09 10:46:58,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:46:58,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-09 10:46:58,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-09 10:46:58,747 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-09 10:46:59,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:46:59,562 INFO L93 Difference]: Finished difference Result 169 states and 197 transitions. [2021-11-09 10:46:59,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-09 10:46:59,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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 27 [2021-11-09 10:46:59,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:46:59,565 INFO L225 Difference]: With dead ends: 169 [2021-11-09 10:46:59,565 INFO L226 Difference]: Without dead ends: 165 [2021-11-09 10:46:59,566 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-11-09 10:46:59,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-11-09 10:46:59,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 114. [2021-11-09 10:46:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.238532110091743) internal successors, (135), 113 states have internal predecessors, (135), 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-09 10:46:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2021-11-09 10:46:59,574 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 27 [2021-11-09 10:46:59,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:46:59,575 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2021-11-09 10:46:59,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-09 10:46:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2021-11-09 10:46:59,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-09 10:46:59,577 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:46:59,577 INFO L513 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] [2021-11-09 10:46:59,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-09 10:46:59,578 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:46:59,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:46:59,579 INFO L85 PathProgramCache]: Analyzing trace with hash -933122528, now seen corresponding path program 1 times [2021-11-09 10:46:59,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:46:59,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844148909] [2021-11-09 10:46:59,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:46:59,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:46:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:47:00,035 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-09 10:47:00,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:47:00,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844148909] [2021-11-09 10:47:00,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844148909] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:47:00,036 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:47:00,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 10:47:00,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533782803] [2021-11-09 10:47:00,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 10:47:00,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:47:00,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 10:47:00,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 10:47:00,038 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-09 10:47:02,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:47:02,344 INFO L93 Difference]: Finished difference Result 169 states and 197 transitions. [2021-11-09 10:47:02,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 10:47:02,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2021-11-09 10:47:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:47:02,349 INFO L225 Difference]: With dead ends: 169 [2021-11-09 10:47:02,350 INFO L226 Difference]: Without dead ends: 117 [2021-11-09 10:47:02,350 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:47:02,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-09 10:47:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2021-11-09 10:47:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 112 states have internal predecessors, (133), 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-09 10:47:02,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2021-11-09 10:47:02,358 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 27 [2021-11-09 10:47:02,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:47:02,358 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2021-11-09 10:47:02,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-09 10:47:02,359 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2021-11-09 10:47:02,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-09 10:47:02,360 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:47:02,361 INFO L513 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] [2021-11-09 10:47:02,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-09 10:47:02,361 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:47:02,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:47:02,362 INFO L85 PathProgramCache]: Analyzing trace with hash 192748585, now seen corresponding path program 1 times [2021-11-09 10:47:02,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:47:02,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215742078] [2021-11-09 10:47:02,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:47:02,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:47:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:47:05,339 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-09 10:47:05,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:47:05,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215742078] [2021-11-09 10:47:05,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215742078] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:47:05,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:47:05,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-09 10:47:05,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377506008] [2021-11-09 10:47:05,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 10:47:05,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:47:05,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 10:47:05,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-09 10:47:05,342 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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-09 10:47:07,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:47:07,847 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2021-11-09 10:47:07,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 10:47:07,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 36 [2021-11-09 10:47:07,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:47:07,850 INFO L225 Difference]: With dead ends: 113 [2021-11-09 10:47:07,850 INFO L226 Difference]: Without dead ends: 111 [2021-11-09 10:47:07,851 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-09 10:47:07,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-11-09 10:47:07,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-11-09 10:47:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.2242990654205608) internal successors, (131), 110 states have internal predecessors, (131), 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-09 10:47:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2021-11-09 10:47:07,861 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 36 [2021-11-09 10:47:07,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:47:07,861 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2021-11-09 10:47:07,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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-09 10:47:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2021-11-09 10:47:07,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-09 10:47:07,863 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:47:07,863 INFO L513 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] [2021-11-09 10:47:07,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-09 10:47:07,864 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:47:07,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:47:07,865 INFO L85 PathProgramCache]: Analyzing trace with hash 547927563, now seen corresponding path program 1 times [2021-11-09 10:47:07,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:47:07,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260112593] [2021-11-09 10:47:07,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:47:07,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:47:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:47:08,480 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-09 10:47:08,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:47:08,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260112593] [2021-11-09 10:47:08,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260112593] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:47:08,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:47:08,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-09 10:47:08,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645150059] [2021-11-09 10:47:08,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 10:47:08,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:47:08,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 10:47:08,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-09 10:47:08,483 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-09 10:47:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:47:10,931 INFO L93 Difference]: Finished difference Result 111 states and 131 transitions. [2021-11-09 10:47:10,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 10:47:10,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 38 [2021-11-09 10:47:10,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:47:10,933 INFO L225 Difference]: With dead ends: 111 [2021-11-09 10:47:10,933 INFO L226 Difference]: Without dead ends: 109 [2021-11-09 10:47:10,933 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-09 10:47:10,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-11-09 10:47:10,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-11-09 10:47:10,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 106 states have (on average 1.2169811320754718) internal successors, (129), 108 states have internal predecessors, (129), 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-09 10:47:10,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2021-11-09 10:47:10,940 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 38 [2021-11-09 10:47:10,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:47:10,940 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2021-11-09 10:47:10,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-09 10:47:10,940 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2021-11-09 10:47:10,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-09 10:47:10,941 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:47:10,941 INFO L513 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] [2021-11-09 10:47:10,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-09 10:47:10,942 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:47:10,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:47:10,942 INFO L85 PathProgramCache]: Analyzing trace with hash 718836703, now seen corresponding path program 1 times [2021-11-09 10:47:10,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:47:10,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883377355] [2021-11-09 10:47:10,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:47:10,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:47:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:47:11,542 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-09 10:47:11,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:47:11,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883377355] [2021-11-09 10:47:11,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883377355] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:47:11,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:47:11,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-09 10:47:11,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908727085] [2021-11-09 10:47:11,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-09 10:47:11,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:47:11,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-09 10:47:11,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-09 10:47:11,545 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-09 10:47:16,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:47:16,340 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2021-11-09 10:47:16,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 10:47:16,341 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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 38 [2021-11-09 10:47:16,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:47:16,343 INFO L225 Difference]: With dead ends: 140 [2021-11-09 10:47:16,343 INFO L226 Difference]: Without dead ends: 125 [2021-11-09 10:47:16,344 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-11-09 10:47:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-11-09 10:47:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2021-11-09 10:47:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 108 states have (on average 1.212962962962963) internal successors, (131), 110 states have internal predecessors, (131), 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-09 10:47:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2021-11-09 10:47:16,353 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 38 [2021-11-09 10:47:16,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:47:16,354 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2021-11-09 10:47:16,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-09 10:47:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2021-11-09 10:47:16,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-09 10:47:16,355 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:47:16,356 INFO L513 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] [2021-11-09 10:47:16,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-09 10:47:16,356 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:47:16,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:47:16,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1398895073, now seen corresponding path program 1 times [2021-11-09 10:47:16,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:47:16,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023261200] [2021-11-09 10:47:16,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:47:16,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:47:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:47:19,643 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-09 10:47:19,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:47:19,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023261200] [2021-11-09 10:47:19,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023261200] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:47:19,644 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:47:19,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-09 10:47:19,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905115158] [2021-11-09 10:47:19,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-09 10:47:19,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:47:19,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-09 10:47:19,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-11-09 10:47:19,646 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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-09 10:47:27,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:47:27,198 INFO L93 Difference]: Finished difference Result 194 states and 225 transitions. [2021-11-09 10:47:27,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-09 10:47:27,199 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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 38 [2021-11-09 10:47:27,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:47:27,201 INFO L225 Difference]: With dead ends: 194 [2021-11-09 10:47:27,201 INFO L226 Difference]: Without dead ends: 165 [2021-11-09 10:47:27,201 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2021-11-09 10:47:27,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-11-09 10:47:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 126. [2021-11-09 10:47:27,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 123 states have (on average 1.2113821138211383) internal successors, (149), 125 states have internal predecessors, (149), 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-09 10:47:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2021-11-09 10:47:27,211 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 38 [2021-11-09 10:47:27,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:47:27,212 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2021-11-09 10:47:27,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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-09 10:47:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2021-11-09 10:47:27,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-09 10:47:27,213 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:47:27,213 INFO L513 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] [2021-11-09 10:47:27,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-09 10:47:27,214 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:47:27,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:47:27,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1657060511, now seen corresponding path program 1 times [2021-11-09 10:47:27,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:47:27,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339772159] [2021-11-09 10:47:27,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:47:27,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:47:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:47:27,725 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-09 10:47:27,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:47:27,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339772159] [2021-11-09 10:47:27,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339772159] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:47:27,726 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:47:27,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-09 10:47:27,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529185695] [2021-11-09 10:47:27,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-09 10:47:27,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:47:27,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-09 10:47:27,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-09 10:47:27,728 INFO L87 Difference]: Start difference. First operand 126 states and 149 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-09 10:47:34,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:47:34,664 INFO L93 Difference]: Finished difference Result 180 states and 207 transitions. [2021-11-09 10:47:34,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 10:47:34,665 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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 38 [2021-11-09 10:47:34,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:47:34,666 INFO L225 Difference]: With dead ends: 180 [2021-11-09 10:47:34,666 INFO L226 Difference]: Without dead ends: 150 [2021-11-09 10:47:34,667 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-09 10:47:34,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-11-09 10:47:34,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 126. [2021-11-09 10:47:34,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 123 states have (on average 1.1951219512195121) internal successors, (147), 125 states have internal predecessors, (147), 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-09 10:47:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2021-11-09 10:47:34,676 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 38 [2021-11-09 10:47:34,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:47:34,677 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2021-11-09 10:47:34,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-09 10:47:34,677 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2021-11-09 10:47:34,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-09 10:47:34,678 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:47:34,678 INFO L513 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] [2021-11-09 10:47:34,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-09 10:47:34,679 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:47:34,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:47:34,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1490309383, now seen corresponding path program 1 times [2021-11-09 10:47:34,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:47:34,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153232164] [2021-11-09 10:47:34,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:47:34,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:47:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:47:35,008 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-09 10:47:35,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:47:35,009 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153232164] [2021-11-09 10:47:35,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153232164] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:47:35,009 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:47:35,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 10:47:35,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788028872] [2021-11-09 10:47:35,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 10:47:35,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:47:35,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 10:47:35,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:47:35,011 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-09 10:47:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:47:35,138 INFO L93 Difference]: Finished difference Result 407 states and 474 transitions. [2021-11-09 10:47:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 10:47:35,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 38 [2021-11-09 10:47:35,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:47:35,142 INFO L225 Difference]: With dead ends: 407 [2021-11-09 10:47:35,142 INFO L226 Difference]: Without dead ends: 315 [2021-11-09 10:47:35,143 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-09 10:47:35,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-11-09 10:47:35,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 129. [2021-11-09 10:47:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 128 states have internal predecessors, (150), 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-09 10:47:35,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2021-11-09 10:47:35,159 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 38 [2021-11-09 10:47:35,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:47:35,159 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2021-11-09 10:47:35,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-09 10:47:35,159 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2021-11-09 10:47:35,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-09 10:47:35,160 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:47:35,161 INFO L513 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] [2021-11-09 10:47:35,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-09 10:47:35,161 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:47:35,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:47:35,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1722457971, now seen corresponding path program 1 times [2021-11-09 10:47:35,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:47:35,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446360682] [2021-11-09 10:47:35,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:47:35,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:47:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:47:38,538 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-09 10:47:38,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:47:38,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446360682] [2021-11-09 10:47:38,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446360682] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:47:38,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:47:38,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-09 10:47:38,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650549337] [2021-11-09 10:47:38,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-09 10:47:38,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:47:38,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-09 10:47:38,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-09 10:47:38,541 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 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-09 10:47:41,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:47:41,169 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2021-11-09 10:47:41,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 10:47:41,169 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 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 40 [2021-11-09 10:47:41,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:47:41,170 INFO L225 Difference]: With dead ends: 129 [2021-11-09 10:47:41,171 INFO L226 Difference]: Without dead ends: 111 [2021-11-09 10:47:41,171 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-09 10:47:41,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-11-09 10:47:41,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-11-09 10:47:41,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 109 states have (on average 1.165137614678899) internal successors, (127), 110 states have internal predecessors, (127), 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-09 10:47:41,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 127 transitions. [2021-11-09 10:47:41,182 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 127 transitions. Word has length 40 [2021-11-09 10:47:41,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:47:41,183 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 127 transitions. [2021-11-09 10:47:41,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 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-09 10:47:41,183 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2021-11-09 10:47:41,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-09 10:47:41,184 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:47:41,184 INFO L513 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] [2021-11-09 10:47:41,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-09 10:47:41,185 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:47:41,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:47:41,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1882862420, now seen corresponding path program 1 times [2021-11-09 10:47:41,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:47:41,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105589867] [2021-11-09 10:47:41,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:47:41,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:47:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:47:41,711 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-09 10:47:41,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:47:41,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105589867] [2021-11-09 10:47:41,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105589867] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:47:41,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:47:41,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-09 10:47:41,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783645623] [2021-11-09 10:47:41,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-09 10:47:41,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:47:41,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-09 10:47:41,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-09 10:47:41,714 INFO L87 Difference]: Start difference. First operand 111 states and 127 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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-09 10:47:46,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:47:46,266 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2021-11-09 10:47:46,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 10:47:46,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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 40 [2021-11-09 10:47:46,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:47:46,268 INFO L225 Difference]: With dead ends: 118 [2021-11-09 10:47:46,268 INFO L226 Difference]: Without dead ends: 87 [2021-11-09 10:47:46,269 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-09 10:47:46,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-11-09 10:47:46,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-11-09 10:47:46,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 85 states have (on average 1.1176470588235294) internal successors, (95), 86 states have internal predecessors, (95), 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-09 10:47:46,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-11-09 10:47:46,276 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 40 [2021-11-09 10:47:46,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:47:46,276 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-11-09 10:47:46,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 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-09 10:47:46,277 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-11-09 10:47:46,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-09 10:47:46,278 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:47:46,278 INFO L513 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] [2021-11-09 10:47:46,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-09 10:47:46,278 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:47:46,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:47:46,279 INFO L85 PathProgramCache]: Analyzing trace with hash -147813803, now seen corresponding path program 1 times [2021-11-09 10:47:46,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:47:46,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027794666] [2021-11-09 10:47:46,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:47:46,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:47:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:47:46,557 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-09 10:47:46,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:47:46,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027794666] [2021-11-09 10:47:46,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027794666] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:47:46,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:47:46,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 10:47:46,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90356270] [2021-11-09 10:47:46,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 10:47:46,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:47:46,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 10:47:46,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 10:47:46,560 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-09 10:47:46,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:47:46,661 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2021-11-09 10:47:46,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 10:47:46,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2021-11-09 10:47:46,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:47:46,664 INFO L225 Difference]: With dead ends: 168 [2021-11-09 10:47:46,664 INFO L226 Difference]: Without dead ends: 118 [2021-11-09 10:47:46,664 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:47:46,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-09 10:47:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 87. [2021-11-09 10:47:46,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 86 states have internal predecessors, (94), 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-09 10:47:46,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2021-11-09 10:47:46,679 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 40 [2021-11-09 10:47:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:47:46,679 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2021-11-09 10:47:46,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-09 10:47:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2021-11-09 10:47:46,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-09 10:47:46,683 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:47:46,683 INFO L513 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] [2021-11-09 10:47:46,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-09 10:47:46,684 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:47:46,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:47:46,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1440534099, now seen corresponding path program 1 times [2021-11-09 10:47:46,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:47:46,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090046378] [2021-11-09 10:47:46,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:47:46,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:47:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:47:47,253 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-09 10:47:47,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:47:47,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090046378] [2021-11-09 10:47:47,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090046378] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:47:47,255 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:47:47,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-09 10:47:47,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534480230] [2021-11-09 10:47:47,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-09 10:47:47,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:47:47,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-09 10:47:47,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-09 10:47:47,258 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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-09 10:47:50,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:47:50,316 INFO L93 Difference]: Finished difference Result 184 states and 193 transitions. [2021-11-09 10:47:50,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-09 10:47:50,317 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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 40 [2021-11-09 10:47:50,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:47:50,318 INFO L225 Difference]: With dead ends: 184 [2021-11-09 10:47:50,318 INFO L226 Difference]: Without dead ends: 113 [2021-11-09 10:47:50,319 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2021-11-09 10:47:50,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-09 10:47:50,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 82. [2021-11-09 10:47:50,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 1.075) internal successors, (86), 81 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-09 10:47:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2021-11-09 10:47:50,328 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 40 [2021-11-09 10:47:50,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:47:50,328 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2021-11-09 10:47:50,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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-09 10:47:50,329 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2021-11-09 10:47:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-09 10:47:50,330 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:47:50,330 INFO L513 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] [2021-11-09 10:47:50,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-09 10:47:50,331 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:47:50,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:47:50,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2110548711, now seen corresponding path program 1 times [2021-11-09 10:47:50,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:47:50,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830133511] [2021-11-09 10:47:50,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:47:50,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:47:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:47:56,265 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-09 10:47:56,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:47:56,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830133511] [2021-11-09 10:47:56,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830133511] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:47:56,267 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:47:56,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-09 10:47:56,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277113025] [2021-11-09 10:47:56,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-09 10:47:56,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:47:56,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-09 10:47:56,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-11-09 10:47:56,271 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 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-09 10:48:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:04,147 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2021-11-09 10:48:04,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-09 10:48:04,148 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 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 41 [2021-11-09 10:48:04,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:04,149 INFO L225 Difference]: With dead ends: 141 [2021-11-09 10:48:04,149 INFO L226 Difference]: Without dead ends: 99 [2021-11-09 10:48:04,150 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2021-11-09 10:48:04,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-11-09 10:48:04,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2021-11-09 10:48:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 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-09 10:48:04,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2021-11-09 10:48:04,158 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 41 [2021-11-09 10:48:04,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:04,159 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2021-11-09 10:48:04,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 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-09 10:48:04,159 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2021-11-09 10:48:04,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-09 10:48:04,160 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:04,160 INFO L513 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] [2021-11-09 10:48:04,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-09 10:48:04,161 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:48:04,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:04,162 INFO L85 PathProgramCache]: Analyzing trace with hash -976974734, now seen corresponding path program 1 times [2021-11-09 10:48:04,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:04,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687871137] [2021-11-09 10:48:04,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:04,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:07,408 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-09 10:48:07,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:07,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687871137] [2021-11-09 10:48:07,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687871137] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:07,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:07,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-09 10:48:07,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891856307] [2021-11-09 10:48:07,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-09 10:48:07,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:07,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-09 10:48:07,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-09 10:48:07,410 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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-09 10:48:12,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:12,182 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2021-11-09 10:48:12,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-09 10:48:12,183 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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 44 [2021-11-09 10:48:12,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:12,184 INFO L225 Difference]: With dead ends: 99 [2021-11-09 10:48:12,184 INFO L226 Difference]: Without dead ends: 61 [2021-11-09 10:48:12,184 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-11-09 10:48:12,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-09 10:48:12,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-11-09 10:48:12,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 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-09 10:48:12,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2021-11-09 10:48:12,190 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 44 [2021-11-09 10:48:12,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:12,191 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2021-11-09 10:48:12,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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-09 10:48:12,191 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2021-11-09 10:48:12,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-09 10:48:12,192 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:12,192 INFO L513 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] [2021-11-09 10:48:12,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-09 10:48:12,192 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:48:12,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:12,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1720530582, now seen corresponding path program 1 times [2021-11-09 10:48:12,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:12,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922857115] [2021-11-09 10:48:12,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:12,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:12,394 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-09 10:48:12,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:12,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922857115] [2021-11-09 10:48:12,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922857115] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:12,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:12,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 10:48:12,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97512288] [2021-11-09 10:48:12,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 10:48:12,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:12,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 10:48:12,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 10:48:12,397 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-09 10:48:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:12,485 INFO L93 Difference]: Finished difference Result 92 states and 91 transitions. [2021-11-09 10:48:12,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 10:48:12,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2021-11-09 10:48:12,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:12,487 INFO L225 Difference]: With dead ends: 92 [2021-11-09 10:48:12,487 INFO L226 Difference]: Without dead ends: 61 [2021-11-09 10:48:12,487 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 10:48:12,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-09 10:48:12,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-11-09 10:48:12,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.0) internal successors, (60), 60 states have internal predecessors, (60), 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-09 10:48:12,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 60 transitions. [2021-11-09 10:48:12,494 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 60 transitions. Word has length 60 [2021-11-09 10:48:12,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:12,494 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 60 transitions. [2021-11-09 10:48:12,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-09 10:48:12,495 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 60 transitions. [2021-11-09 10:48:12,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-09 10:48:12,495 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 10:48:12,496 INFO L513 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] [2021-11-09 10:48:12,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-09 10:48:12,496 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-09 10:48:12,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 10:48:12,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1872836840, now seen corresponding path program 1 times [2021-11-09 10:48:12,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 10:48:12,497 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736218177] [2021-11-09 10:48:12,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 10:48:12,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 10:48:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 10:48:16,891 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-09 10:48:16,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 10:48:16,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736218177] [2021-11-09 10:48:16,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736218177] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 10:48:16,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 10:48:16,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-09 10:48:16,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801577752] [2021-11-09 10:48:16,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-09 10:48:16,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 10:48:16,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-09 10:48:16,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-09 10:48:16,893 INFO L87 Difference]: Start difference. First operand 61 states and 60 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 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-09 10:48:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 10:48:25,833 INFO L93 Difference]: Finished difference Result 61 states and 60 transitions. [2021-11-09 10:48:25,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-09 10:48:25,834 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 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 60 [2021-11-09 10:48:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 10:48:25,835 INFO L225 Difference]: With dead ends: 61 [2021-11-09 10:48:25,835 INFO L226 Difference]: Without dead ends: 0 [2021-11-09 10:48:25,835 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-11-09 10:48:25,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-09 10:48:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-09 10:48:25,836 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-09 10:48:25,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-09 10:48:25,836 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2021-11-09 10:48:25,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 10:48:25,836 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-09 10:48:25,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 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-09 10:48:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-09 10:48:25,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-09 10:48:25,839 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:25,840 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:25,840 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:25,840 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:25,841 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 10:48:25,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-09 10:48:25,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-09 10:48:25,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:48:25,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:48:25,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:48:25,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:48:25,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:48:25,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:48:25,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:48:25,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:48:25,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:48:26,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:48:26,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:48:26,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 10:48:30,290 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-09 10:48:30,290 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-09 10:48:30,290 INFO L860 garLoopResultBuilder]: At program point L8757(line 8757) the Hoare annotation is: true [2021-11-09 10:48:30,290 INFO L857 garLoopResultBuilder]: For program point L8741(lines 8741 8756) no Hoare annotation was computed. [2021-11-09 10:48:30,291 INFO L857 garLoopResultBuilder]: For program point L6894(lines 6894 6896) no Hoare annotation was computed. [2021-11-09 10:48:30,291 INFO L853 garLoopResultBuilder]: At program point L6894-3(lines 6893 6897) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) (.cse5 (not (= (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616)) ULTIMATE.start_aws_byte_buf_init_~capacity))) (.cse6 (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|)) (.cse7 (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|)) (.cse8 (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset))) (or (and .cse0 .cse1 (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0) .cse2 .cse3 .cse4 (= |ULTIMATE.start_can_fail_malloc_#res.base| 0) .cse5 .cse6 .cse7 .cse8 (<= |~#s_can_fail_allocator_static~0.offset| 0)) (and .cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1) .cse1 (<= ULTIMATE.start_bounded_malloc_~size (+ (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616)) 36028797018963967)) .cse2 (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_buf_init_~capacity) .cse3 .cse4 (= ULTIMATE.start_aws_mem_acquire_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_can_fail_malloc_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |~#s_can_fail_allocator_static~0.offset|) .cse5 .cse6 .cse7 .cse8))) [2021-11-09 10:48:30,291 INFO L857 garLoopResultBuilder]: For program point L6894-2(lines 6894 6896) no Hoare annotation was computed. [2021-11-09 10:48:30,292 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-09 10:48:30,292 INFO L857 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-09 10:48:30,292 INFO L857 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-09 10:48:30,292 INFO L857 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-09 10:48:30,292 INFO L857 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-09 10:48:30,293 INFO L857 garLoopResultBuilder]: For program point L7159-1(line 7159) no Hoare annotation was computed. [2021-11-09 10:48:30,293 INFO L857 garLoopResultBuilder]: For program point L7159(lines 7159 7162) no Hoare annotation was computed. [2021-11-09 10:48:30,293 INFO L857 garLoopResultBuilder]: For program point L7159-4(lines 7159 7160) no Hoare annotation was computed. [2021-11-09 10:48:30,293 INFO L857 garLoopResultBuilder]: For program point L7159-3(line 7159) no Hoare annotation was computed. [2021-11-09 10:48:30,293 INFO L857 garLoopResultBuilder]: For program point L6928-2(lines 6928 6930) no Hoare annotation was computed. [2021-11-09 10:48:30,294 INFO L857 garLoopResultBuilder]: For program point L7159-9(lines 7159 7162) no Hoare annotation was computed. [2021-11-09 10:48:30,294 INFO L857 garLoopResultBuilder]: For program point L6928(lines 6928 6930) no Hoare annotation was computed. [2021-11-09 10:48:30,294 INFO L857 garLoopResultBuilder]: For program point L7159-7(lines 7159 7162) no Hoare annotation was computed. [2021-11-09 10:48:30,294 INFO L857 garLoopResultBuilder]: For program point L7159-6(lines 7159 7160) no Hoare annotation was computed. [2021-11-09 10:48:30,294 INFO L857 garLoopResultBuilder]: For program point L7159-13(lines 7159 7162) no Hoare annotation was computed. [2021-11-09 10:48:30,295 INFO L853 garLoopResultBuilder]: At program point L7159-12(lines 7157 7163) the Hoare annotation is: (let ((.cse20 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse10 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|)) (.cse18 (select .cse20 (+ 16 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (.cse19 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 24))) (let ((.cse0 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) .cse19))) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|)) (.cse3 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base)) (.cse4 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse5 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 .cse18)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base)) (.cse7 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) (.cse8 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse9 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse11 (= (select .cse20 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0)) (.cse12 (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|)) (.cse13 (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|)) (.cse14 (= (select .cse10 .cse19) ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) (.cse15 (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) (.cse16 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse17 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0) .cse7 .cse8 .cse9 (= (select .cse10 8) 0) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 8))) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= .cse18 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse18) 18446744073709551616)))) .cse9 (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |~#s_can_fail_allocator_static~0.offset|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))))) [2021-11-09 10:48:30,295 INFO L857 garLoopResultBuilder]: For program point L7159-11(lines 7159 7162) no Hoare annotation was computed. [2021-11-09 10:48:30,295 INFO L857 garLoopResultBuilder]: For program point L7159-17(lines 7159 7160) no Hoare annotation was computed. [2021-11-09 10:48:30,296 INFO L857 garLoopResultBuilder]: For program point L7159-16(line 7159) no Hoare annotation was computed. [2021-11-09 10:48:30,296 INFO L857 garLoopResultBuilder]: For program point L7159-14(line 7159) no Hoare annotation was computed. [2021-11-09 10:48:30,296 INFO L857 garLoopResultBuilder]: For program point L7159-20(lines 7159 7162) no Hoare annotation was computed. [2021-11-09 10:48:30,296 INFO L857 garLoopResultBuilder]: For program point L7159-19(lines 7159 7160) no Hoare annotation was computed. [2021-11-09 10:48:30,297 INFO L853 garLoopResultBuilder]: At program point L7159-25(lines 7157 7163) the Hoare annotation is: (let ((.cse1 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse0 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 24))) (and (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) .cse0)) (<= 1 |#StackHeapBarrier|) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 (select .cse1 (+ 16 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (= (select .cse1 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) .cse0) ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-11-09 10:48:30,297 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-09 10:48:30,297 INFO L857 garLoopResultBuilder]: For program point L7159-24(lines 7159 7162) no Hoare annotation was computed. [2021-11-09 10:48:30,297 INFO L857 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-09 10:48:30,297 INFO L857 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-09 10:48:30,298 INFO L857 garLoopResultBuilder]: For program point L7159-22(lines 7159 7162) no Hoare annotation was computed. [2021-11-09 10:48:30,298 INFO L857 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-09 10:48:30,298 INFO L857 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-09 10:48:30,298 INFO L857 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-09 10:48:30,299 INFO L853 garLoopResultBuilder]: At program point L7127(lines 7110 7128) the Hoare annotation is: (let ((.cse18 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse16 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|)) (.cse10 (select .cse18 (+ 16 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (.cse17 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 24))) (let ((.cse0 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) .cse17))) (.cse2 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|)) (.cse3 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base)) (.cse4 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 .cse10)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base)) (.cse9 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) (.cse11 (= (select .cse18 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0)) (.cse13 (= (select .cse16 .cse17) ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) (.cse14 (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse5 (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0))) (.cse7 (= ULTIMATE.start_aws_byte_buf_init_~buf.offset 0)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0)) (.cse12 (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse10 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse10) 18446744073709551616)))) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |~#s_can_fail_allocator_static~0.offset|) .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (select .cse16 8) 0) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 8))) .cse11 .cse12 .cse13 .cse14 .cse15 (<= |~#s_can_fail_allocator_static~0.offset| 0)) (and .cse1 .cse5 (<= (+ |ULTIMATE.start_aws_byte_buf_init_#res| 1) 0) .cse7 .cse8 .cse12))))) [2021-11-09 10:48:30,299 INFO L857 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-09 10:48:30,299 INFO L857 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-09 10:48:30,299 INFO L857 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-09 10:48:30,299 INFO L857 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-09 10:48:30,300 INFO L857 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-09 10:48:30,300 INFO L853 garLoopResultBuilder]: At program point L6880(lines 6876 6881) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (<= ULTIMATE.start_bounded_malloc_~size (+ (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616)) 36028797018963967)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_mem_acquire_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_can_fail_malloc_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |~#s_can_fail_allocator_static~0.offset|) (not (= (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616)) ULTIMATE.start_aws_byte_buf_init_~capacity)) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) [2021-11-09 10:48:30,300 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-09 10:48:30,300 INFO L857 garLoopResultBuilder]: For program point L7162(line 7162) no Hoare annotation was computed. [2021-11-09 10:48:30,301 INFO L857 garLoopResultBuilder]: For program point L7162-4(line 7162) no Hoare annotation was computed. [2021-11-09 10:48:30,301 INFO L857 garLoopResultBuilder]: For program point L7162-3(line 7162) no Hoare annotation was computed. [2021-11-09 10:48:30,301 INFO L857 garLoopResultBuilder]: For program point L7162-2(line 7162) no Hoare annotation was computed. [2021-11-09 10:48:30,301 INFO L857 garLoopResultBuilder]: For program point L7162-8(line 7162) no Hoare annotation was computed. [2021-11-09 10:48:30,302 INFO L853 garLoopResultBuilder]: At program point L6931(lines 6922 6932) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) (.cse5 (not (= (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616)) ULTIMATE.start_aws_byte_buf_init_~capacity))) (.cse6 (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|)) (.cse7 (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|)) (.cse8 (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset))) (or (and .cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1) .cse1 (<= ULTIMATE.start_bounded_malloc_~size (+ (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616)) 36028797018963967)) .cse2 (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_buf_init_~capacity) .cse3 .cse4 (= ULTIMATE.start_aws_mem_acquire_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_can_fail_malloc_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |~#s_can_fail_allocator_static~0.offset|) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= ULTIMATE.start_aws_mem_acquire_~mem~0.offset 0) .cse2 .cse3 .cse4 (= |ULTIMATE.start_aws_mem_acquire_#res.base| 0) .cse5 .cse6 (= ULTIMATE.start_aws_mem_acquire_~mem~0.base 0) .cse7 (= |ULTIMATE.start_aws_mem_acquire_#res.offset| 0) .cse8 (<= |~#s_can_fail_allocator_static~0.offset| 0)))) [2021-11-09 10:48:30,302 INFO L857 garLoopResultBuilder]: For program point L7162-6(line 7162) no Hoare annotation was computed. [2021-11-09 10:48:30,302 INFO L857 garLoopResultBuilder]: For program point L7162-12(line 7162) no Hoare annotation was computed. [2021-11-09 10:48:30,302 INFO L857 garLoopResultBuilder]: For program point L7162-11(line 7162) no Hoare annotation was computed. [2021-11-09 10:48:30,302 INFO L857 garLoopResultBuilder]: For program point L7162-9(line 7162) no Hoare annotation was computed. [2021-11-09 10:48:30,303 INFO L857 garLoopResultBuilder]: For program point L7162-15(line 7162) no Hoare annotation was computed. [2021-11-09 10:48:30,303 INFO L857 garLoopResultBuilder]: For program point L7162-13(line 7162) no Hoare annotation was computed. [2021-11-09 10:48:30,303 INFO L857 garLoopResultBuilder]: For program point L7162-17(line 7162) no Hoare annotation was computed. [2021-11-09 10:48:30,303 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-09 10:48:30,303 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-09 10:48:30,304 INFO L857 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-09 10:48:30,304 INFO L857 garLoopResultBuilder]: For program point L210-1(lines 7114 7116) no Hoare annotation was computed. [2021-11-09 10:48:30,304 INFO L857 garLoopResultBuilder]: For program point L8749(lines 8749 8755) no Hoare annotation was computed. [2021-11-09 10:48:30,304 INFO L857 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-09 10:48:30,304 INFO L857 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-11-09 10:48:30,305 INFO L857 garLoopResultBuilder]: For program point L8749-2(lines 8749 8755) no Hoare annotation was computed. [2021-11-09 10:48:30,305 INFO L857 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-11-09 10:48:30,305 INFO L857 garLoopResultBuilder]: For program point L7114-1(lines 7114 7116) no Hoare annotation was computed. [2021-11-09 10:48:30,305 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-09 10:48:30,305 INFO L857 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-09 10:48:30,306 INFO L857 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-09 10:48:30,306 INFO L857 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-09 10:48:30,306 INFO L857 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-11-09 10:48:30,306 INFO L857 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-11-09 10:48:30,306 INFO L853 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_mem_acquire_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_can_fail_malloc_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |~#s_can_fail_allocator_static~0.offset|) (not (= (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616)) ULTIMATE.start_aws_byte_buf_init_~capacity)) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) [2021-11-09 10:48:30,307 INFO L853 garLoopResultBuilder]: At program point L6884-1(lines 6883 6885) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_mem_acquire_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |~#s_can_fail_allocator_static~0.offset|) (not (= (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616)) ULTIMATE.start_aws_byte_buf_init_~capacity)) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) [2021-11-09 10:48:30,307 INFO L853 garLoopResultBuilder]: At program point L6884(lines 6883 6885) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0) (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|)) [2021-11-09 10:48:30,307 INFO L857 garLoopResultBuilder]: For program point L7099(lines 7099 7101) no Hoare annotation was computed. [2021-11-09 10:48:30,307 INFO L857 garLoopResultBuilder]: For program point L7117-2(lines 7117 7121) no Hoare annotation was computed. [2021-11-09 10:48:30,307 INFO L857 garLoopResultBuilder]: For program point L7117(lines 7117 7118) no Hoare annotation was computed. [2021-11-09 10:48:30,308 INFO L853 garLoopResultBuilder]: At program point L6919(lines 6917 6920) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_mem_acquire_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |~#s_can_fail_allocator_static~0.offset|) (not (= (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616)) ULTIMATE.start_aws_byte_buf_init_~capacity)) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) [2021-11-09 10:48:30,308 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-09 10:48:30,308 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-09 10:48:30,308 INFO L853 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= ULTIMATE.start_aws_mem_acquire_~mem~0.offset 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity) (not (= (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616)) ULTIMATE.start_aws_byte_buf_init_~capacity)) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (= ULTIMATE.start_aws_mem_acquire_~mem~0.base 0) (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2021-11-09 10:48:30,312 INFO L731 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, 1, 1, 1] [2021-11-09 10:48:30,313 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-09 10:48:30,347 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:30,348 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:30,348 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:30,349 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:30,349 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:30,349 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:30,352 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:30,352 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:30,353 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:30,353 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:30,353 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:30,354 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:30,365 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:30,366 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:30,366 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:30,367 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:30,367 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:30,367 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:30,370 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:30,370 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:30,371 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:30,371 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:30,372 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:30,372 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:30,374 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:30,375 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:30,376 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:30,376 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:30,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:48:30 BoogieIcfgContainer [2021-11-09 10:48:30,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-09 10:48:30,380 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-09 10:48:30,380 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-09 10:48:30,380 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-09 10:48:30,380 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:46:32" (3/4) ... [2021-11-09 10:48:30,388 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-09 10:48:30,418 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 125 nodes and edges [2021-11-09 10:48:30,420 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2021-11-09 10:48:30,422 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2021-11-09 10:48:30,424 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-09 10:48:30,426 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-09 10:48:30,428 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-09 10:48:30,430 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-09 10:48:30,432 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-09 10:48:30,478 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((allocator == #memory_$Pointer$[buf][buf + 24] && 1 <= unknown-#StackHeapBarrier-unknown) && buf == buf) && allocator == allocator) && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && !(buf == 0)) && buf == buf) && buf == 0) && buf == 0) && capacity == capacity) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616)) && buf == s_can_fail_allocator_static) && unknown-#memory_int-unknown[buf][buf] == 0) && 2 <= buf) && #memory_$Pointer$[buf][buf + 24] == allocator) && allocator == allocator) && buf == buf) || ((((((((((((((((((allocator == #memory_$Pointer$[buf][buf + 24] && 1 <= unknown-#StackHeapBarrier-unknown) && buf == buf) && allocator == allocator) && 0 <= s_can_fail_allocator_static) && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && !(buf == 0)) && buf == buf) && buf == 0) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][8] == 0) && 0 == #memory_$Pointer$[buf][buf + 8]) && unknown-#memory_int-unknown[buf][buf] == 0) && 2 <= buf) && #memory_$Pointer$[buf][buf + 24] == allocator) && allocator == allocator) && buf == buf) && s_can_fail_allocator_static <= 0)) || (((((1 <= unknown-#StackHeapBarrier-unknown && !(buf == 0)) && \result + 1 <= 0) && buf == 0) && buf == 0) && 2 <= buf) [2021-11-09 10:48:30,479 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((allocator == #memory_$Pointer$[buf][buf + 24] && 1 <= unknown-#StackHeapBarrier-unknown) && buf == buf) && allocator == allocator) && 0 <= s_can_fail_allocator_static) && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && buf == buf) && buf == 0) && capacity == capacity) && \result <= 1) && 1 <= \result) && #memory_$Pointer$[buf][8] == 0) && 0 == #memory_$Pointer$[buf][buf + 8]) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && 2 <= buf) && #memory_$Pointer$[buf][buf + 24] == allocator) && allocator == allocator) && buf == buf) && s_can_fail_allocator_static <= 0) || ((((((((((((((((((allocator == #memory_$Pointer$[buf][buf + 24] && 1 <= unknown-#StackHeapBarrier-unknown) && buf == buf) && allocator == allocator) && 0 <= s_can_fail_allocator_static) && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && buf == buf) && capacity == capacity) && \result <= 1) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616)) && 1 <= \result) && buf == s_can_fail_allocator_static) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && 2 <= buf) && #memory_$Pointer$[buf][buf + 24] == allocator) && allocator == allocator) && buf == buf) && s_can_fail_allocator_static <= 0) [2021-11-09 10:48:30,479 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((1 <= unknown-#StackHeapBarrier-unknown && allocator == allocator) && 0 <= s_can_fail_allocator_static) && \result == 0) && buf == buf) && buf == 0) && capacity == capacity) && \result == 0) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && buf == buf) && 2 <= buf) && allocator == allocator) && s_can_fail_allocator_static <= 0) || ((((((((((((((1 <= unknown-#StackHeapBarrier-unknown && cond == 1) && allocator == allocator) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && buf == buf) && size == capacity) && buf == 0) && capacity == capacity) && size == capacity) && size == capacity) && buf == s_can_fail_allocator_static) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && buf == buf) && 2 <= buf) && allocator == allocator) [2021-11-09 10:48:30,479 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((allocator == #memory_$Pointer$[buf][buf + 24] && 1 <= unknown-#StackHeapBarrier-unknown) && buf == buf) && allocator == allocator) && 0 <= s_can_fail_allocator_static) && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && buf == buf) && buf == 0) && capacity == capacity) && \result <= 1) && 1 <= \result) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && 2 <= buf) && #memory_$Pointer$[buf][buf + 24] == allocator) && allocator == allocator) && buf == buf) && s_can_fail_allocator_static <= 0 [2021-11-09 10:48:30,479 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((1 <= unknown-#StackHeapBarrier-unknown && cond == 1) && allocator == allocator) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && buf == buf) && size == capacity) && buf == 0) && capacity == capacity) && size == capacity) && size == capacity) && buf == s_can_fail_allocator_static) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && buf == buf) && 2 <= buf) && allocator == allocator) || ((((((((((((((1 <= unknown-#StackHeapBarrier-unknown && allocator == allocator) && 0 <= s_can_fail_allocator_static) && mem == 0) && buf == buf) && buf == 0) && capacity == capacity) && \result == 0) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && buf == buf) && mem == 0) && 2 <= buf) && \result == 0) && allocator == allocator) && s_can_fail_allocator_static <= 0) [2021-11-09 10:48:31,496 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/bin/uautomizer-IVEQpCNsaX/witness.graphml [2021-11-09 10:48:31,496 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-09 10:48:31,498 INFO L168 Benchmark]: Toolchain (without parser) took 135259.95 ms. Allocated memory was 117.4 MB in the beginning and 513.8 MB in the end (delta: 396.4 MB). Free memory was 77.1 MB in the beginning and 303.4 MB in the end (delta: -226.3 MB). Peak memory consumption was 350.4 MB. Max. memory is 16.1 GB. [2021-11-09 10:48:31,498 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 86.0 MB. Free memory was 42.5 MB in the beginning and 42.5 MB in the end (delta: 44.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 10:48:31,499 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3419.03 ms. Allocated memory was 117.4 MB in the beginning and 176.2 MB in the end (delta: 58.7 MB). Free memory was 76.8 MB in the beginning and 108.2 MB in the end (delta: -31.4 MB). Peak memory consumption was 66.3 MB. Max. memory is 16.1 GB. [2021-11-09 10:48:31,499 INFO L168 Benchmark]: Boogie Procedure Inliner took 306.89 ms. Allocated memory is still 176.2 MB. Free memory was 108.2 MB in the beginning and 96.5 MB in the end (delta: 11.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-09 10:48:31,500 INFO L168 Benchmark]: Boogie Preprocessor took 128.71 ms. Allocated memory is still 176.2 MB. Free memory was 96.5 MB in the beginning and 88.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-09 10:48:31,500 INFO L168 Benchmark]: RCFGBuilder took 11968.40 ms. Allocated memory was 176.2 MB in the beginning and 314.6 MB in the end (delta: 138.4 MB). Free memory was 88.5 MB in the beginning and 72.9 MB in the end (delta: 15.6 MB). Peak memory consumption was 163.2 MB. Max. memory is 16.1 GB. [2021-11-09 10:48:31,501 INFO L168 Benchmark]: TraceAbstraction took 118297.92 ms. Allocated memory was 314.6 MB in the beginning and 513.8 MB in the end (delta: 199.2 MB). Free memory was 72.9 MB in the beginning and 206.8 MB in the end (delta: -133.9 MB). Peak memory consumption was 64.2 MB. Max. memory is 16.1 GB. [2021-11-09 10:48:31,501 INFO L168 Benchmark]: Witness Printer took 1116.83 ms. Allocated memory is still 513.8 MB. Free memory was 206.8 MB in the beginning and 303.4 MB in the end (delta: -96.6 MB). Peak memory consumption was 84.0 MB. Max. memory is 16.1 GB. [2021-11-09 10:48:31,503 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.31 ms. Allocated memory is still 86.0 MB. Free memory was 42.5 MB in the beginning and 42.5 MB in the end (delta: 44.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 3419.03 ms. Allocated memory was 117.4 MB in the beginning and 176.2 MB in the end (delta: 58.7 MB). Free memory was 76.8 MB in the beginning and 108.2 MB in the end (delta: -31.4 MB). Peak memory consumption was 66.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 306.89 ms. Allocated memory is still 176.2 MB. Free memory was 108.2 MB in the beginning and 96.5 MB in the end (delta: 11.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 128.71 ms. Allocated memory is still 176.2 MB. Free memory was 96.5 MB in the beginning and 88.5 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 11968.40 ms. Allocated memory was 176.2 MB in the beginning and 314.6 MB in the end (delta: 138.4 MB). Free memory was 88.5 MB in the beginning and 72.9 MB in the end (delta: 15.6 MB). Peak memory consumption was 163.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 118297.92 ms. Allocated memory was 314.6 MB in the beginning and 513.8 MB in the end (delta: 199.2 MB). Free memory was 72.9 MB in the beginning and 206.8 MB in the end (delta: -133.9 MB). Peak memory consumption was 64.2 MB. Max. memory is 16.1 GB. * Witness Printer took 1116.83 ms. Allocated memory is still 513.8 MB. Free memory was 206.8 MB in the beginning and 303.4 MB in the end (delta: -96.6 MB). Peak memory consumption was 84.0 MB. Max. memory is 16.1 GB. * 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$.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$.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$.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$.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$.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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, 85 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 118.1s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 75.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2041 SDtfs, 3577 SDslu, 5024 SDs, 0 SdLazy, 1605 SolverSat, 163 SolverUnsat, 30 SolverUnknown, 0 SolverNotchecked, 66.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=17, InterpolantAutomatonStates: 179, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 575 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 32 NumberOfFragments, 928 HoareAnnotationTreeSize, 12 FomulaSimplifications, 180948 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 12 FomulaSimplificationsInter, 22288 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 27.2s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 846 NumberOfCodeBlocks, 846 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 821 ConstructedInterpolants, 0 QuantifiedInterpolants, 5333 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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 5 specifications checked. All of them hold - InvariantResult [Line: 6883]: Loop Invariant Derived loop invariant: (((((((((1 <= unknown-#StackHeapBarrier-unknown && allocator == allocator) && buf == buf) && buf == 0) && capacity == capacity) && size == capacity) && buf == s_can_fail_allocator_static) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && buf == buf) && 2 <= buf) && allocator == allocator - InvariantResult [Line: 6876]: Loop Invariant Derived loop invariant: (((((((((((((1 <= unknown-#StackHeapBarrier-unknown && cond == 1) && allocator == allocator) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && buf == buf) && size == capacity) && buf == 0) && capacity == capacity) && size == capacity) && size == capacity) && buf == s_can_fail_allocator_static) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && buf == buf) && 2 <= buf) && allocator == allocator - InvariantResult [Line: 7157]: Loop Invariant [2021-11-09 10:48:31,519 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:31,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:31,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:31,521 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:31,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:31,524 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:31,526 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:31,526 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:31,526 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:31,526 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:31,526 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:31,527 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((allocator == #memory_$Pointer$[buf][buf + 24] && 1 <= unknown-#StackHeapBarrier-unknown) && buf == buf) && allocator == allocator) && 0 <= s_can_fail_allocator_static) && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && buf == buf) && buf == 0) && capacity == capacity) && \result <= 1) && 1 <= \result) && #memory_$Pointer$[buf][8] == 0) && 0 == #memory_$Pointer$[buf][buf + 8]) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && 2 <= buf) && #memory_$Pointer$[buf][buf + 24] == allocator) && allocator == allocator) && buf == buf) && s_can_fail_allocator_static <= 0) || ((((((((((((((((((allocator == #memory_$Pointer$[buf][buf + 24] && 1 <= unknown-#StackHeapBarrier-unknown) && buf == buf) && allocator == allocator) && 0 <= s_can_fail_allocator_static) && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && buf == buf) && capacity == capacity) && \result <= 1) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616)) && 1 <= \result) && buf == s_can_fail_allocator_static) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && 2 <= buf) && #memory_$Pointer$[buf][buf + 24] == allocator) && allocator == allocator) && buf == buf) && s_can_fail_allocator_static <= 0) - InvariantResult [Line: 6893]: Loop Invariant Derived loop invariant: ((((((((((((1 <= unknown-#StackHeapBarrier-unknown && allocator == allocator) && 0 <= s_can_fail_allocator_static) && \result == 0) && buf == buf) && buf == 0) && capacity == capacity) && \result == 0) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && buf == buf) && 2 <= buf) && allocator == allocator) && s_can_fail_allocator_static <= 0) || ((((((((((((((1 <= unknown-#StackHeapBarrier-unknown && cond == 1) && allocator == allocator) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && buf == buf) && size == capacity) && buf == 0) && capacity == capacity) && size == capacity) && size == capacity) && buf == s_can_fail_allocator_static) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && buf == buf) && 2 <= buf) && allocator == allocator) - InvariantResult [Line: 6883]: Loop Invariant Derived loop invariant: ((1 <= unknown-#StackHeapBarrier-unknown && s_can_fail_allocator_static == 0) && buf == 0) && 2 <= buf - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((((((((((1 <= unknown-#StackHeapBarrier-unknown && allocator == allocator) && 0 <= s_can_fail_allocator_static) && mem == 0) && buf == buf) && buf == 0) && capacity == capacity) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && buf == buf) && mem == 0) && 2 <= buf) && allocator == allocator) && s_can_fail_allocator_static <= 0 - InvariantResult [Line: 6922]: Loop Invariant Derived loop invariant: ((((((((((((((1 <= unknown-#StackHeapBarrier-unknown && cond == 1) && allocator == allocator) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && buf == buf) && size == capacity) && buf == 0) && capacity == capacity) && size == capacity) && size == capacity) && buf == s_can_fail_allocator_static) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && buf == buf) && 2 <= buf) && allocator == allocator) || ((((((((((((((1 <= unknown-#StackHeapBarrier-unknown && allocator == allocator) && 0 <= s_can_fail_allocator_static) && mem == 0) && buf == buf) && buf == 0) && capacity == capacity) && \result == 0) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && buf == buf) && mem == 0) && 2 <= buf) && \result == 0) && allocator == allocator) && s_can_fail_allocator_static <= 0) - InvariantResult [Line: 6917]: Loop Invariant Derived loop invariant: (((((((((1 <= unknown-#StackHeapBarrier-unknown && allocator == allocator) && buf == buf) && buf == 0) && capacity == capacity) && size == capacity) && buf == s_can_fail_allocator_static) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && buf == buf) && 2 <= buf) && allocator == allocator - InvariantResult [Line: 7110]: Loop Invariant [2021-11-09 10:48:31,530 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:31,530 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:31,530 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:31,530 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:31,531 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:31,531 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:31,532 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:31,532 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:31,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:31,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:31,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:31,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((allocator == #memory_$Pointer$[buf][buf + 24] && 1 <= unknown-#StackHeapBarrier-unknown) && buf == buf) && allocator == allocator) && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && !(buf == 0)) && buf == buf) && buf == 0) && buf == 0) && capacity == capacity) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616)) && buf == s_can_fail_allocator_static) && unknown-#memory_int-unknown[buf][buf] == 0) && 2 <= buf) && #memory_$Pointer$[buf][buf + 24] == allocator) && allocator == allocator) && buf == buf) || ((((((((((((((((((allocator == #memory_$Pointer$[buf][buf + 24] && 1 <= unknown-#StackHeapBarrier-unknown) && buf == buf) && allocator == allocator) && 0 <= s_can_fail_allocator_static) && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && !(buf == 0)) && buf == buf) && buf == 0) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][8] == 0) && 0 == #memory_$Pointer$[buf][buf + 8]) && unknown-#memory_int-unknown[buf][buf] == 0) && 2 <= buf) && #memory_$Pointer$[buf][buf + 24] == allocator) && allocator == allocator) && buf == buf) && s_can_fail_allocator_static <= 0)) || (((((1 <= unknown-#StackHeapBarrier-unknown && !(buf == 0)) && \result + 1 <= 0) && buf == 0) && buf == 0) && 2 <= buf) - InvariantResult [Line: 7157]: Loop Invariant [2021-11-09 10:48:31,535 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:31,535 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-09 10:48:31,536 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-09 10:48:31,536 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((allocator == #memory_$Pointer$[buf][buf + 24] && 1 <= unknown-#StackHeapBarrier-unknown) && buf == buf) && allocator == allocator) && 0 <= s_can_fail_allocator_static) && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && buf == buf) && buf == 0) && capacity == capacity) && \result <= 1) && 1 <= \result) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && 2 <= buf) && #memory_$Pointer$[buf][buf + 24] == allocator) && allocator == allocator) && buf == buf) && s_can_fail_allocator_static <= 0 - InvariantResult [Line: 8757]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((((((((1 <= unknown-#StackHeapBarrier-unknown && allocator == allocator) && buf == buf) && buf == 0) && capacity == capacity) && size == capacity) && size == capacity) && buf == s_can_fail_allocator_static) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && buf == buf) && 2 <= buf) && allocator == allocator RESULT: Ultimate proved your program to be correct! [2021-11-09 10:48:31,621 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63329a8e-9877-455f-abb7-20fca31df446/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE