./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 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/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_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa --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.2-hotfix-svcomp22-839c364 [2021-12-07 01:42:52,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 01:42:52,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 01:42:52,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 01:42:52,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 01:42:52,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 01:42:52,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 01:42:52,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 01:42:52,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 01:42:52,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 01:42:52,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 01:42:52,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 01:42:52,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 01:42:52,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 01:42:52,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 01:42:52,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 01:42:52,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 01:42:52,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 01:42:52,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 01:42:52,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 01:42:52,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 01:42:52,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 01:42:52,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 01:42:52,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 01:42:52,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 01:42:52,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 01:42:52,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 01:42:52,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 01:42:52,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 01:42:52,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 01:42:52,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 01:42:52,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 01:42:52,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 01:42:52,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 01:42:52,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 01:42:52,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 01:42:52,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 01:42:52,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 01:42:52,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 01:42:52,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 01:42:52,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 01:42:52,238 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-07 01:42:52,261 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 01:42:52,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 01:42:52,261 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 01:42:52,262 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 01:42:52,262 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 01:42:52,262 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 01:42:52,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 01:42:52,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 01:42:52,263 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 01:42:52,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 01:42:52,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 01:42:52,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 01:42:52,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 01:42:52,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 01:42:52,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 01:42:52,265 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 01:42:52,265 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 01:42:52,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 01:42:52,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 01:42:52,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 01:42:52,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 01:42:52,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:42:52,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 01:42:52,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 01:42:52,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 01:42:52,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 01:42:52,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 01:42:52,267 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 01:42:52,267 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 01:42:52,267 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 01:42:52,267 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 01:42:52,267 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_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/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_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa 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-12-07 01:42:52,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 01:42:52,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 01:42:52,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 01:42:52,475 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 01:42:52,476 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 01:42:52,477 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2021-12-07 01:42:52,526 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/data/cc57667da/70f0175ce71d41daa844be24e7dfd50d/FLAG76cb759fb [2021-12-07 01:42:53,116 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 01:42:53,117 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2021-12-07 01:42:53,138 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/data/cc57667da/70f0175ce71d41daa844be24e7dfd50d/FLAG76cb759fb [2021-12-07 01:42:53,574 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/data/cc57667da/70f0175ce71d41daa844be24e7dfd50d [2021-12-07 01:42:53,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 01:42:53,580 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 01:42:53,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 01:42:53,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 01:42:53,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 01:42:53,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:42:53" (1/1) ... [2021-12-07 01:42:53,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d2007cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:53, skipping insertion in model container [2021-12-07 01:42:53,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:42:53" (1/1) ... [2021-12-07 01:42:53,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 01:42:53,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 01:42:53,875 WARN L230 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_b259cb95-7650-47a4-ba2d-39384f907a8f/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4491,4504] [2021-12-07 01:42:53,880 WARN L230 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_b259cb95-7650-47a4-ba2d-39384f907a8f/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4551,4564] [2021-12-07 01:42:54,548 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:54,549 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:54,550 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:54,550 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:54,552 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:54,564 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:54,565 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:54,566 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:54,566 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:54,858 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-07 01:42:54,859 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-07 01:42:54,860 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-07 01:42:54,860 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-07 01:42:54,861 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-07 01:42:54,862 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-07 01:42:54,862 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-07 01:42:54,863 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-07 01:42:54,863 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-07 01:42:54,864 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-07 01:42:55,010 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-07 01:42:55,061 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:55,061 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:55,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:42:55,141 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 01:42:55,150 WARN L230 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_b259cb95-7650-47a4-ba2d-39384f907a8f/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4491,4504] [2021-12-07 01:42:55,151 WARN L230 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_b259cb95-7650-47a4-ba2d-39384f907a8f/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4551,4564] [2021-12-07 01:42:55,175 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:55,176 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:55,176 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:55,176 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:55,177 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:55,181 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:55,181 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:55,182 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:55,182 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:55,205 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-07 01:42:55,206 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-07 01:42:55,206 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-07 01:42:55,207 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-07 01:42:55,208 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-07 01:42:55,208 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-07 01:42:55,208 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-07 01:42:55,208 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-07 01:42:55,209 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-07 01:42:55,209 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-07 01:42:55,224 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-07 01:42:55,262 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:55,263 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-07 01:42:55,281 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:42:55,418 INFO L208 MainTranslator]: Completed translation [2021-12-07 01:42:55,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:55 WrapperNode [2021-12-07 01:42:55,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 01:42:55,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 01:42:55,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 01:42:55,420 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 01:42:55,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:55" (1/1) ... [2021-12-07 01:42:55,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:55" (1/1) ... [2021-12-07 01:42:55,542 INFO L137 Inliner]: procedures = 690, calls = 2496, calls flagged for inlining = 54, calls inlined = 5, statements flattened = 779 [2021-12-07 01:42:55,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 01:42:55,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 01:42:55,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 01:42:55,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 01:42:55,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:55" (1/1) ... [2021-12-07 01:42:55,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:55" (1/1) ... [2021-12-07 01:42:55,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:55" (1/1) ... [2021-12-07 01:42:55,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:55" (1/1) ... [2021-12-07 01:42:55,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:55" (1/1) ... [2021-12-07 01:42:55,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:55" (1/1) ... [2021-12-07 01:42:55,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:55" (1/1) ... [2021-12-07 01:42:55,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 01:42:55,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 01:42:55,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 01:42:55,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 01:42:55,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:55" (1/1) ... [2021-12-07 01:42:55,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:42:55,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:42:55,639 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 01:42:55,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 01:42:55,669 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2021-12-07 01:42:55,670 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2021-12-07 01:42:55,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-07 01:42:55,670 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-07 01:42:55,670 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-07 01:42:55,670 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2021-12-07 01:42:55,670 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2021-12-07 01:42:55,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-07 01:42:55,671 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2021-12-07 01:42:55,671 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2021-12-07 01:42:55,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-07 01:42:55,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-07 01:42:55,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-07 01:42:55,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 01:42:55,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-07 01:42:55,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 01:42:55,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 01:42:55,672 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-07 01:42:55,672 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-07 01:42:55,672 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_malloc [2021-12-07 01:42:55,672 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_malloc [2021-12-07 01:42:55,672 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-07 01:42:55,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-07 01:42:55,673 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_acquire [2021-12-07 01:42:55,673 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_acquire [2021-12-07 01:42:55,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-07 01:42:55,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-07 01:42:55,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-07 01:42:55,673 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-12-07 01:42:55,673 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-12-07 01:42:55,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-07 01:42:55,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 01:42:55,839 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 01:42:55,840 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 01:42:56,698 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 01:42:56,705 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 01:42:56,705 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-07 01:42:56,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:42:56 BoogieIcfgContainer [2021-12-07 01:42:56,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 01:42:56,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 01:42:56,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 01:42:56,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 01:42:56,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:42:53" (1/3) ... [2021-12-07 01:42:56,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a1995c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:42:56, skipping insertion in model container [2021-12-07 01:42:56,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:55" (2/3) ... [2021-12-07 01:42:56,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a1995c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:42:56, skipping insertion in model container [2021-12-07 01:42:56,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:42:56" (3/3) ... [2021-12-07 01:42:56,714 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_init_harness.i [2021-12-07 01:42:56,719 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 01:42:56,719 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-07 01:42:56,757 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 01:42:56,762 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-12-07 01:42:56,762 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-07 01:42:56,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 68 states have internal predecessors, (83), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-12-07 01:42:56,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-07 01:42:56,784 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:42:56,784 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:42:56,785 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:42:56,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:42:56,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1013294361, now seen corresponding path program 1 times [2021-12-07 01:42:56,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:42:56,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965391008] [2021-12-07 01:42:56,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:42:56,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:42:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:57,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:42:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:57,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:42:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:57,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:42:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:57,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:42:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:42:57,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:42:57,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965391008] [2021-12-07 01:42:57,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965391008] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:42:57,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:42:57,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:42:57,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63492986] [2021-12-07 01:42:57,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:42:57,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-07 01:42:57,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:42:57,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-07 01:42:57,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-07 01:42:57,260 INFO L87 Difference]: Start difference. First operand has 99 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 68 states have internal predecessors, (83), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-07 01:42:57,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:42:57,293 INFO L93 Difference]: Finished difference Result 193 states and 252 transitions. [2021-12-07 01:42:57,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-07 01:42:57,295 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-12-07 01:42:57,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:42:57,303 INFO L225 Difference]: With dead ends: 193 [2021-12-07 01:42:57,304 INFO L226 Difference]: Without dead ends: 93 [2021-12-07 01:42:57,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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-12-07 01:42:57,311 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:42:57,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:42:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-07 01:42:57,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-12-07 01:42:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 63 states have internal predecessors, (75), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-07 01:42:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2021-12-07 01:42:57,357 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 31 [2021-12-07 01:42:57,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:42:57,359 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2021-12-07 01:42:57,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-07 01:42:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2021-12-07 01:42:57,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-07 01:42:57,362 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:42:57,362 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:42:57,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 01:42:57,363 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:42:57,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:42:57,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1912179751, now seen corresponding path program 1 times [2021-12-07 01:42:57,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:42:57,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142213902] [2021-12-07 01:42:57,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:42:57,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:42:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:57,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:42:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:57,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:42:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:57,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:42:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:57,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:42:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:42:57,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:42:57,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142213902] [2021-12-07 01:42:57,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142213902] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:42:57,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:42:57,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:42:57,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031806710] [2021-12-07 01:42:57,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:42:57,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:42:57,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:42:57,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:42:57,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:42:57,583 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-07 01:42:57,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:42:57,638 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2021-12-07 01:42:57,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:42:57,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-12-07 01:42:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:42:57,641 INFO L225 Difference]: With dead ends: 147 [2021-12-07 01:42:57,641 INFO L226 Difference]: Without dead ends: 110 [2021-12-07 01:42:57,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-12-07 01:42:57,643 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 9 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:42:57,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 340 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:42:57,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-07 01:42:57,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2021-12-07 01:42:57,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.2) internal successors, (78), 66 states have internal predecessors, (78), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-07 01:42:57,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2021-12-07 01:42:57,654 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 31 [2021-12-07 01:42:57,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:42:57,655 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2021-12-07 01:42:57,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-07 01:42:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2021-12-07 01:42:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-07 01:42:57,656 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:42:57,656 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:42:57,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-07 01:42:57,656 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:42:57,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:42:57,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2124622107, now seen corresponding path program 1 times [2021-12-07 01:42:57,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:42:57,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225929274] [2021-12-07 01:42:57,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:42:57,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:42:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:57,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:42:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:57,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:42:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:57,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:42:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:57,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:42:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:57,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:42:57,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:42:57,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225929274] [2021-12-07 01:42:57,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225929274] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:42:57,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:42:57,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 01:42:57,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293789041] [2021-12-07 01:42:57,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:42:57,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:42:57,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:42:57,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:42:57,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:42:57,860 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-07 01:42:57,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:42:57,922 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2021-12-07 01:42:57,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:42:57,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2021-12-07 01:42:57,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:42:57,924 INFO L225 Difference]: With dead ends: 134 [2021-12-07 01:42:57,924 INFO L226 Difference]: Without dead ends: 96 [2021-12-07 01:42:57,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:42:57,925 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 46 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:42:57,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 464 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:42:57,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-07 01:42:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-12-07 01:42:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.1846153846153846) internal successors, (77), 66 states have internal predecessors, (77), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-07 01:42:57,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2021-12-07 01:42:57,934 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 31 [2021-12-07 01:42:57,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:42:57,935 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2021-12-07 01:42:57,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-07 01:42:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2021-12-07 01:42:57,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-07 01:42:57,936 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:42:57,936 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:42:57,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-07 01:42:57,937 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:42:57,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:42:57,937 INFO L85 PathProgramCache]: Analyzing trace with hash 966724818, now seen corresponding path program 1 times [2021-12-07 01:42:57,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:42:57,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128164024] [2021-12-07 01:42:57,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:42:57,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:42:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:42:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:42:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:42:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:42:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:42:58,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:42:58,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128164024] [2021-12-07 01:42:58,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128164024] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:42:58,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:42:58,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:42:58,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451790446] [2021-12-07 01:42:58,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:42:58,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:42:58,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:42:58,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:42:58,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:42:58,071 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-07 01:42:58,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:42:58,093 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2021-12-07 01:42:58,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:42:58,093 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2021-12-07 01:42:58,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:42:58,095 INFO L225 Difference]: With dead ends: 141 [2021-12-07 01:42:58,095 INFO L226 Difference]: Without dead ends: 106 [2021-12-07 01:42:58,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-12-07 01:42:58,096 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 29 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:42:58,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 320 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:42:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-07 01:42:58,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2021-12-07 01:42:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2021-12-07 01:42:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2021-12-07 01:42:58,104 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 37 [2021-12-07 01:42:58,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:42:58,105 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2021-12-07 01:42:58,105 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-07 01:42:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2021-12-07 01:42:58,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-07 01:42:58,106 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:42:58,106 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:42:58,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-07 01:42:58,106 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:42:58,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:42:58,107 INFO L85 PathProgramCache]: Analyzing trace with hash 265660240, now seen corresponding path program 1 times [2021-12-07 01:42:58,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:42:58,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393960966] [2021-12-07 01:42:58,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:42:58,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:42:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:42:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:42:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:42:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:42:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:42:58,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:42:58,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393960966] [2021-12-07 01:42:58,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393960966] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:42:58,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:42:58,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:42:58,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603402698] [2021-12-07 01:42:58,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:42:58,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:42:58,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:42:58,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:42:58,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:42:58,326 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-07 01:42:58,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:42:58,381 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2021-12-07 01:42:58,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 01:42:58,382 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2021-12-07 01:42:58,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:42:58,384 INFO L225 Difference]: With dead ends: 110 [2021-12-07 01:42:58,385 INFO L226 Difference]: Without dead ends: 108 [2021-12-07 01:42:58,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:42:58,386 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 22 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:42:58,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 733 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:42:58,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-07 01:42:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2021-12-07 01:42:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 75 states have internal predecessors, (85), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2021-12-07 01:42:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2021-12-07 01:42:58,398 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 37 [2021-12-07 01:42:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:42:58,398 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2021-12-07 01:42:58,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-07 01:42:58,399 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2021-12-07 01:42:58,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-07 01:42:58,400 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:42:58,401 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:42:58,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-07 01:42:58,401 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:42:58,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:42:58,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1062822234, now seen corresponding path program 1 times [2021-12-07 01:42:58,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:42:58,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604377978] [2021-12-07 01:42:58,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:42:58,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:42:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:42:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:42:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:42:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:42:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:42:58,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:42:58,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604377978] [2021-12-07 01:42:58,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604377978] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:42:58,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:42:58,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:42:58,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497721421] [2021-12-07 01:42:58,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:42:58,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:42:58,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:42:58,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:42:58,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:42:58,645 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-07 01:42:58,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:42:58,860 INFO L93 Difference]: Finished difference Result 184 states and 229 transitions. [2021-12-07 01:42:58,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:42:58,860 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-07 01:42:58,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:42:58,862 INFO L225 Difference]: With dead ends: 184 [2021-12-07 01:42:58,862 INFO L226 Difference]: Without dead ends: 143 [2021-12-07 01:42:58,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:42:58,863 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 78 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:42:58,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 634 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:42:58,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-07 01:42:58,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 121. [2021-12-07 01:42:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 86 states have (on average 1.186046511627907) internal successors, (102), 89 states have internal predecessors, (102), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2021-12-07 01:42:58,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2021-12-07 01:42:58,876 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 41 [2021-12-07 01:42:58,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:42:58,877 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2021-12-07 01:42:58,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-07 01:42:58,877 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2021-12-07 01:42:58,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-07 01:42:58,879 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:42:58,879 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:42:58,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-07 01:42:58,880 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:42:58,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:42:58,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1952281384, now seen corresponding path program 1 times [2021-12-07 01:42:58,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:42:58,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455577336] [2021-12-07 01:42:58,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:42:58,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:42:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:42:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:42:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:59,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:42:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:59,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:42:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:59,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:42:59,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:42:59,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455577336] [2021-12-07 01:42:59,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455577336] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:42:59,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:42:59,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:42:59,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061338816] [2021-12-07 01:42:59,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:42:59,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:42:59,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:42:59,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:42:59,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:42:59,092 INFO L87 Difference]: Start difference. First operand 121 states and 146 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-07 01:42:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:42:59,285 INFO L93 Difference]: Finished difference Result 210 states and 261 transitions. [2021-12-07 01:42:59,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 01:42:59,286 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2021-12-07 01:42:59,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:42:59,287 INFO L225 Difference]: With dead ends: 210 [2021-12-07 01:42:59,287 INFO L226 Difference]: Without dead ends: 155 [2021-12-07 01:42:59,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-12-07 01:42:59,288 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 56 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:42:59,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 623 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:42:59,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-07 01:42:59,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 123. [2021-12-07 01:42:59,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 91 states have internal predecessors, (105), 21 states have call successors, (21), 11 states have call predecessors, (21), 13 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2021-12-07 01:42:59,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2021-12-07 01:42:59,300 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 41 [2021-12-07 01:42:59,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:42:59,300 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2021-12-07 01:42:59,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-07 01:42:59,301 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2021-12-07 01:42:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-07 01:42:59,302 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:42:59,302 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:42:59,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-07 01:42:59,302 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:42:59,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:42:59,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1694115946, now seen corresponding path program 1 times [2021-12-07 01:42:59,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:42:59,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641752429] [2021-12-07 01:42:59,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:42:59,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:42:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:59,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:42:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:59,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:42:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:59,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:42:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:59,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:42:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:59,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:42:59,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:42:59,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641752429] [2021-12-07 01:42:59,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641752429] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:42:59,646 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:42:59,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-07 01:42:59,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508814302] [2021-12-07 01:42:59,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:42:59,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-07 01:42:59,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:42:59,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-07 01:42:59,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-12-07 01:42:59,648 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-07 01:43:00,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:00,008 INFO L93 Difference]: Finished difference Result 212 states and 270 transitions. [2021-12-07 01:43:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:43:00,008 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2021-12-07 01:43:00,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:00,009 INFO L225 Difference]: With dead ends: 212 [2021-12-07 01:43:00,009 INFO L226 Difference]: Without dead ends: 155 [2021-12-07 01:43:00,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2021-12-07 01:43:00,010 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 237 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:00,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 578 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:43:00,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-07 01:43:00,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 137. [2021-12-07 01:43:00,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 100 states have (on average 1.21) internal successors, (121), 105 states have internal predecessors, (121), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (27), 20 states have call predecessors, (27), 21 states have call successors, (27) [2021-12-07 01:43:00,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2021-12-07 01:43:00,026 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 41 [2021-12-07 01:43:00,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:00,026 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2021-12-07 01:43:00,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-07 01:43:00,027 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2021-12-07 01:43:00,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-07 01:43:00,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:00,028 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:00,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-07 01:43:00,028 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:00,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:00,029 INFO L85 PathProgramCache]: Analyzing trace with hash -267360230, now seen corresponding path program 1 times [2021-12-07 01:43:00,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:00,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675014428] [2021-12-07 01:43:00,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:00,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:00,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:43:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:00,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:43:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:00,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:43:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:00,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:43:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:43:00,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:00,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675014428] [2021-12-07 01:43:00,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675014428] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:00,199 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:00,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:43:00,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405323994] [2021-12-07 01:43:00,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:00,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:43:00,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:00,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:43:00,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:43:00,200 INFO L87 Difference]: Start difference. First operand 137 states and 170 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-07 01:43:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:00,293 INFO L93 Difference]: Finished difference Result 225 states and 287 transitions. [2021-12-07 01:43:00,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:43:00,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2021-12-07 01:43:00,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:00,295 INFO L225 Difference]: With dead ends: 225 [2021-12-07 01:43:00,295 INFO L226 Difference]: Without dead ends: 156 [2021-12-07 01:43:00,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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-12-07 01:43:00,297 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 30 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:00,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 340 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:00,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-07 01:43:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 138. [2021-12-07 01:43:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 101 states have (on average 1.198019801980198) internal successors, (121), 106 states have internal predecessors, (121), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (27), 20 states have call predecessors, (27), 21 states have call successors, (27) [2021-12-07 01:43:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2021-12-07 01:43:00,310 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 41 [2021-12-07 01:43:00,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:00,311 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2021-12-07 01:43:00,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-07 01:43:00,311 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2021-12-07 01:43:00,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-07 01:43:00,312 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:00,312 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:00,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-07 01:43:00,312 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:00,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:00,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1627279489, now seen corresponding path program 1 times [2021-12-07 01:43:00,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:00,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014819781] [2021-12-07 01:43:00,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:00,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:00,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:43:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:00,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:43:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:00,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:43:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:00,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:43:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:00,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:43:00,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:00,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014819781] [2021-12-07 01:43:00,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014819781] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:00,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:00,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 01:43:00,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177424159] [2021-12-07 01:43:00,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:00,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 01:43:00,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:00,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 01:43:00,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:43:00,491 INFO L87 Difference]: Start difference. First operand 138 states and 170 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-07 01:43:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:00,568 INFO L93 Difference]: Finished difference Result 164 states and 199 transitions. [2021-12-07 01:43:00,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:43:00,568 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2021-12-07 01:43:00,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:00,570 INFO L225 Difference]: With dead ends: 164 [2021-12-07 01:43:00,570 INFO L226 Difference]: Without dead ends: 162 [2021-12-07 01:43:00,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-12-07 01:43:00,572 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 26 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:00,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 934 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:43:00,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-07 01:43:00,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2021-12-07 01:43:00,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 114 states have internal predecessors, (128), 22 states have call successors, (22), 11 states have call predecessors, (22), 15 states have return successors, (29), 20 states have call predecessors, (29), 21 states have call successors, (29) [2021-12-07 01:43:00,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 179 transitions. [2021-12-07 01:43:00,585 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 179 transitions. Word has length 43 [2021-12-07 01:43:00,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:00,585 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 179 transitions. [2021-12-07 01:43:00,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-07 01:43:00,585 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2021-12-07 01:43:00,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-07 01:43:00,586 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:00,586 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:00,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-07 01:43:00,587 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:00,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:00,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1966623229, now seen corresponding path program 1 times [2021-12-07 01:43:00,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:00,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115063354] [2021-12-07 01:43:00,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:00,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:00,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:43:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:00,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:43:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:00,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:43:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:00,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:43:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:00,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:43:00,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:00,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115063354] [2021-12-07 01:43:00,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115063354] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:00,797 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:00,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 01:43:00,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747912036] [2021-12-07 01:43:00,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:00,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 01:43:00,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:00,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 01:43:00,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:43:00,798 INFO L87 Difference]: Start difference. First operand 146 states and 179 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-07 01:43:00,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:00,948 INFO L93 Difference]: Finished difference Result 250 states and 311 transitions. [2021-12-07 01:43:00,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:43:00,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2021-12-07 01:43:00,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:00,949 INFO L225 Difference]: With dead ends: 250 [2021-12-07 01:43:00,949 INFO L226 Difference]: Without dead ends: 172 [2021-12-07 01:43:00,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:43:00,951 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 44 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:00,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 459 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:00,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-12-07 01:43:00,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 139. [2021-12-07 01:43:00,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 102 states have (on average 1.196078431372549) internal successors, (122), 107 states have internal predecessors, (122), 22 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2021-12-07 01:43:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 170 transitions. [2021-12-07 01:43:00,961 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 170 transitions. Word has length 43 [2021-12-07 01:43:00,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:00,961 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 170 transitions. [2021-12-07 01:43:00,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-07 01:43:00,961 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 170 transitions. [2021-12-07 01:43:00,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-07 01:43:00,962 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:00,962 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:00,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-07 01:43:00,962 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:00,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:00,963 INFO L85 PathProgramCache]: Analyzing trace with hash 598348136, now seen corresponding path program 1 times [2021-12-07 01:43:00,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:00,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888547470] [2021-12-07 01:43:00,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:00,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:43:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:43:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:43:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:43:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 01:43:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-07 01:43:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-07 01:43:01,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:01,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888547470] [2021-12-07 01:43:01,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888547470] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:01,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:01,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:43:01,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420795542] [2021-12-07 01:43:01,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:01,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:43:01,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:01,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:43:01,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:43:01,141 INFO L87 Difference]: Start difference. First operand 139 states and 170 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-07 01:43:01,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:01,186 INFO L93 Difference]: Finished difference Result 151 states and 184 transitions. [2021-12-07 01:43:01,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 01:43:01,187 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2021-12-07 01:43:01,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:01,188 INFO L225 Difference]: With dead ends: 151 [2021-12-07 01:43:01,188 INFO L226 Difference]: Without dead ends: 149 [2021-12-07 01:43:01,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:43:01,189 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 22 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:01,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 748 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:43:01,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-07 01:43:01,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2021-12-07 01:43:01,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 114 states have internal predecessors, (128), 23 states have call successors, (23), 12 states have call predecessors, (23), 16 states have return successors, (30), 21 states have call predecessors, (30), 22 states have call successors, (30) [2021-12-07 01:43:01,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 181 transitions. [2021-12-07 01:43:01,201 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 181 transitions. Word has length 57 [2021-12-07 01:43:01,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:01,201 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 181 transitions. [2021-12-07 01:43:01,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-07 01:43:01,201 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 181 transitions. [2021-12-07 01:43:01,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-07 01:43:01,202 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:01,203 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:01,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-07 01:43:01,203 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:01,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:01,203 INFO L85 PathProgramCache]: Analyzing trace with hash 803127154, now seen corresponding path program 1 times [2021-12-07 01:43:01,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:01,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432166134] [2021-12-07 01:43:01,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:01,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:43:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:43:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:43:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:43:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 01:43:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-07 01:43:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 01:43:01,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:01,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432166134] [2021-12-07 01:43:01,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432166134] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:01,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:01,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 01:43:01,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807329657] [2021-12-07 01:43:01,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:01,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 01:43:01,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:01,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 01:43:01,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:43:01,448 INFO L87 Difference]: Start difference. First operand 148 states and 181 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-07 01:43:01,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:01,623 INFO L93 Difference]: Finished difference Result 191 states and 238 transitions. [2021-12-07 01:43:01,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 01:43:01,624 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 61 [2021-12-07 01:43:01,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:01,625 INFO L225 Difference]: With dead ends: 191 [2021-12-07 01:43:01,625 INFO L226 Difference]: Without dead ends: 178 [2021-12-07 01:43:01,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-12-07 01:43:01,626 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 130 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:01,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 611 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:01,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-07 01:43:01,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2021-12-07 01:43:01,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.173913043478261) internal successors, (135), 123 states have internal predecessors, (135), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (36), 21 states have call predecessors, (36), 23 states have call successors, (36) [2021-12-07 01:43:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2021-12-07 01:43:01,637 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 61 [2021-12-07 01:43:01,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:01,637 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2021-12-07 01:43:01,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-07 01:43:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2021-12-07 01:43:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-07 01:43:01,638 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:01,638 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:01,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-07 01:43:01,638 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:01,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:01,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2082990832, now seen corresponding path program 1 times [2021-12-07 01:43:01,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:01,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2391565] [2021-12-07 01:43:01,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:01,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:43:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:43:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:43:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:43:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 01:43:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-07 01:43:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 01:43:01,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:01,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2391565] [2021-12-07 01:43:01,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2391565] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:01,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:01,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 01:43:01,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921042184] [2021-12-07 01:43:01,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:01,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 01:43:01,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:01,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 01:43:01,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:43:01,833 INFO L87 Difference]: Start difference. First operand 157 states and 195 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-07 01:43:02,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:02,025 INFO L93 Difference]: Finished difference Result 204 states and 252 transitions. [2021-12-07 01:43:02,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 01:43:02,026 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 61 [2021-12-07 01:43:02,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:02,027 INFO L225 Difference]: With dead ends: 204 [2021-12-07 01:43:02,027 INFO L226 Difference]: Without dead ends: 191 [2021-12-07 01:43:02,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-12-07 01:43:02,028 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 66 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:02,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 762 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:43:02,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-07 01:43:02,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 157. [2021-12-07 01:43:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 115 states have (on average 1.173913043478261) internal successors, (135), 123 states have internal predecessors, (135), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (36), 21 states have call predecessors, (36), 23 states have call successors, (36) [2021-12-07 01:43:02,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 195 transitions. [2021-12-07 01:43:02,036 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 195 transitions. Word has length 61 [2021-12-07 01:43:02,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:02,037 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 195 transitions. [2021-12-07 01:43:02,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-07 01:43:02,037 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 195 transitions. [2021-12-07 01:43:02,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-07 01:43:02,038 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:02,038 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:02,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-07 01:43:02,038 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:02,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:02,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1953811026, now seen corresponding path program 1 times [2021-12-07 01:43:02,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:02,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473841869] [2021-12-07 01:43:02,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:02,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:02,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:43:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:02,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:43:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:02,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:43:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:02,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:43:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:02,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 01:43:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:02,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-07 01:43:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:02,408 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-07 01:43:02,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:02,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473841869] [2021-12-07 01:43:02,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473841869] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:02,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854208388] [2021-12-07 01:43:02,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:02,409 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:02,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:02,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:02,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-07 01:43:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:02,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 2459 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-07 01:43:02,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-07 01:43:03,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:03,749 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-07 01:43:03,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-12-07 01:43:03,755 INFO L354 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2021-12-07 01:43:03,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2021-12-07 01:43:03,852 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-07 01:43:03,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2021-12-07 01:43:03,858 INFO L354 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2021-12-07 01:43:03,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2021-12-07 01:43:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 01:43:03,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854208388] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:03,906 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:03,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 12] total 31 [2021-12-07 01:43:03,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670629001] [2021-12-07 01:43:03,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:03,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-07 01:43:03,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:03,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-07 01:43:03,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2021-12-07 01:43:03,908 INFO L87 Difference]: Start difference. First operand 157 states and 195 transitions. Second operand has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 8 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2021-12-07 01:43:04,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:04,868 INFO L93 Difference]: Finished difference Result 288 states and 345 transitions. [2021-12-07 01:43:04,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-07 01:43:04,868 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 8 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 61 [2021-12-07 01:43:04,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:04,869 INFO L225 Difference]: With dead ends: 288 [2021-12-07 01:43:04,869 INFO L226 Difference]: Without dead ends: 234 [2021-12-07 01:43:04,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 113 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=313, Invalid=1849, Unknown=0, NotChecked=0, Total=2162 [2021-12-07 01:43:04,871 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 382 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:04,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [388 Valid, 1795 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 769 Invalid, 0 Unknown, 174 Unchecked, 0.5s Time] [2021-12-07 01:43:04,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-12-07 01:43:04,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 207. [2021-12-07 01:43:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 153 states have (on average 1.1568627450980393) internal successors, (177), 162 states have internal predecessors, (177), 31 states have call successors, (31), 16 states have call predecessors, (31), 22 states have return successors, (43), 28 states have call predecessors, (43), 29 states have call successors, (43) [2021-12-07 01:43:04,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 251 transitions. [2021-12-07 01:43:04,881 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 251 transitions. Word has length 61 [2021-12-07 01:43:04,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:04,881 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 251 transitions. [2021-12-07 01:43:04,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.2) internal successors, (96), 31 states have internal predecessors, (96), 8 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2021-12-07 01:43:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 251 transitions. [2021-12-07 01:43:04,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-07 01:43:04,888 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:04,889 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:04,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-07 01:43:05,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-07 01:43:05,090 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:05,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:05,091 INFO L85 PathProgramCache]: Analyzing trace with hash 151989603, now seen corresponding path program 1 times [2021-12-07 01:43:05,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:05,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044324716] [2021-12-07 01:43:05,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:05,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:43:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:43:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:43:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:43:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 01:43:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-07 01:43:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-07 01:43:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-07 01:43:05,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:05,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044324716] [2021-12-07 01:43:05,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044324716] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:05,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:05,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 01:43:05,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839673535] [2021-12-07 01:43:05,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:05,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 01:43:05,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:05,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 01:43:05,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:43:05,338 INFO L87 Difference]: Start difference. First operand 207 states and 251 transitions. Second operand has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-07 01:43:05,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:05,511 INFO L93 Difference]: Finished difference Result 225 states and 272 transitions. [2021-12-07 01:43:05,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 01:43:05,511 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2021-12-07 01:43:05,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:05,513 INFO L225 Difference]: With dead ends: 225 [2021-12-07 01:43:05,513 INFO L226 Difference]: Without dead ends: 223 [2021-12-07 01:43:05,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-12-07 01:43:05,514 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 39 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:05,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 596 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:05,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-12-07 01:43:05,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2021-12-07 01:43:05,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 160 states have (on average 1.15) internal successors, (184), 169 states have internal predecessors, (184), 34 states have call successors, (34), 18 states have call predecessors, (34), 24 states have return successors, (46), 31 states have call predecessors, (46), 32 states have call successors, (46) [2021-12-07 01:43:05,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 264 transitions. [2021-12-07 01:43:05,526 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 264 transitions. Word has length 63 [2021-12-07 01:43:05,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:05,526 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 264 transitions. [2021-12-07 01:43:05,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-07 01:43:05,527 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 264 transitions. [2021-12-07 01:43:05,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-07 01:43:05,528 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:05,528 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:05,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-07 01:43:05,528 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:05,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:05,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1802659993, now seen corresponding path program 1 times [2021-12-07 01:43:05,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:05,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261957859] [2021-12-07 01:43:05,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:05,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:43:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:43:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:43:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:43:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 01:43:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-07 01:43:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-07 01:43:05,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:05,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261957859] [2021-12-07 01:43:05,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261957859] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:05,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:05,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 01:43:05,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389664768] [2021-12-07 01:43:05,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:05,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 01:43:05,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:05,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 01:43:05,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:43:05,748 INFO L87 Difference]: Start difference. First operand 219 states and 264 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-07 01:43:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:05,823 INFO L93 Difference]: Finished difference Result 247 states and 294 transitions. [2021-12-07 01:43:05,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:43:05,823 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2021-12-07 01:43:05,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:05,825 INFO L225 Difference]: With dead ends: 247 [2021-12-07 01:43:05,825 INFO L226 Difference]: Without dead ends: 245 [2021-12-07 01:43:05,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-12-07 01:43:05,826 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 26 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:05,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 955 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:43:05,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-12-07 01:43:05,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 227. [2021-12-07 01:43:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 167 states have (on average 1.1437125748502994) internal successors, (191), 177 states have internal predecessors, (191), 34 states have call successors, (34), 18 states have call predecessors, (34), 25 states have return successors, (47), 31 states have call predecessors, (47), 32 states have call successors, (47) [2021-12-07 01:43:05,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 272 transitions. [2021-12-07 01:43:05,838 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 272 transitions. Word has length 63 [2021-12-07 01:43:05,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:05,839 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 272 transitions. [2021-12-07 01:43:05,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-07 01:43:05,839 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 272 transitions. [2021-12-07 01:43:05,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-07 01:43:05,840 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:05,840 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:05,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-07 01:43:05,840 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:05,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:05,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1791242725, now seen corresponding path program 1 times [2021-12-07 01:43:05,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:05,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565524592] [2021-12-07 01:43:05,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:05,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:43:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:43:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:43:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:43:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 01:43:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:05,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-07 01:43:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 01:43:06,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:06,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565524592] [2021-12-07 01:43:06,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565524592] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:06,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:06,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 01:43:06,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081133231] [2021-12-07 01:43:06,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:06,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 01:43:06,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:06,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 01:43:06,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:43:06,044 INFO L87 Difference]: Start difference. First operand 227 states and 272 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-07 01:43:06,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:06,219 INFO L93 Difference]: Finished difference Result 269 states and 317 transitions. [2021-12-07 01:43:06,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:43:06,219 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 63 [2021-12-07 01:43:06,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:06,221 INFO L225 Difference]: With dead ends: 269 [2021-12-07 01:43:06,221 INFO L226 Difference]: Without dead ends: 231 [2021-12-07 01:43:06,221 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:43:06,222 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 51 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:06,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 612 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:06,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-12-07 01:43:06,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 214. [2021-12-07 01:43:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 157 states have (on average 1.1464968152866242) internal successors, (180), 165 states have internal predecessors, (180), 33 states have call successors, (33), 18 states have call predecessors, (33), 23 states have return successors, (43), 30 states have call predecessors, (43), 31 states have call successors, (43) [2021-12-07 01:43:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 256 transitions. [2021-12-07 01:43:06,237 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 256 transitions. Word has length 63 [2021-12-07 01:43:06,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:06,237 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 256 transitions. [2021-12-07 01:43:06,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-07 01:43:06,237 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 256 transitions. [2021-12-07 01:43:06,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-07 01:43:06,238 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:06,239 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:06,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-07 01:43:06,239 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:06,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:06,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1204360676, now seen corresponding path program 1 times [2021-12-07 01:43:06,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:06,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422831373] [2021-12-07 01:43:06,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:06,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:06,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:43:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:06,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:43:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:06,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:43:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:06,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:43:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:06,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 01:43:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:06,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-07 01:43:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:06,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-07 01:43:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:06,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-07 01:43:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-07 01:43:06,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:06,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422831373] [2021-12-07 01:43:06,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422831373] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:06,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:06,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:43:06,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920543047] [2021-12-07 01:43:06,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:06,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:43:06,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:06,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:43:06,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:43:06,458 INFO L87 Difference]: Start difference. First operand 214 states and 256 transitions. Second operand has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-07 01:43:06,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:06,572 INFO L93 Difference]: Finished difference Result 228 states and 270 transitions. [2021-12-07 01:43:06,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:43:06,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 69 [2021-12-07 01:43:06,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:06,574 INFO L225 Difference]: With dead ends: 228 [2021-12-07 01:43:06,574 INFO L226 Difference]: Without dead ends: 224 [2021-12-07 01:43:06,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:43:06,575 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 20 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:06,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 687 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-12-07 01:43:06,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2021-12-07 01:43:06,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 163 states have (on average 1.1349693251533743) internal successors, (185), 170 states have internal predecessors, (185), 34 states have call successors, (34), 20 states have call predecessors, (34), 24 states have return successors, (44), 31 states have call predecessors, (44), 32 states have call successors, (44) [2021-12-07 01:43:06,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 263 transitions. [2021-12-07 01:43:06,591 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 263 transitions. Word has length 69 [2021-12-07 01:43:06,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:06,591 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 263 transitions. [2021-12-07 01:43:06,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-07 01:43:06,592 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 263 transitions. [2021-12-07 01:43:06,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-07 01:43:06,593 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:06,593 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:06,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-07 01:43:06,593 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:06,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:06,594 INFO L85 PathProgramCache]: Analyzing trace with hash 348625887, now seen corresponding path program 1 times [2021-12-07 01:43:06,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:06,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32373814] [2021-12-07 01:43:06,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:06,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:06,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:43:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:06,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:43:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:06,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:43:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:06,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:43:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:06,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-07 01:43:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:06,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-07 01:43:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:06,960 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 01:43:06,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:06,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32373814] [2021-12-07 01:43:06,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32373814] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:06,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:06,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-07 01:43:06,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337070681] [2021-12-07 01:43:06,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:06,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-07 01:43:06,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:06,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-07 01:43:06,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-07 01:43:06,962 INFO L87 Difference]: Start difference. First operand 222 states and 263 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-07 01:43:07,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:07,382 INFO L93 Difference]: Finished difference Result 280 states and 334 transitions. [2021-12-07 01:43:07,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 01:43:07,382 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 67 [2021-12-07 01:43:07,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:07,384 INFO L225 Difference]: With dead ends: 280 [2021-12-07 01:43:07,384 INFO L226 Difference]: Without dead ends: 254 [2021-12-07 01:43:07,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2021-12-07 01:43:07,385 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 222 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:07,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 579 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:43:07,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-07 01:43:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 227. [2021-12-07 01:43:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 166 states have (on average 1.1325301204819278) internal successors, (188), 173 states have internal predecessors, (188), 36 states have call successors, (36), 20 states have call predecessors, (36), 24 states have return successors, (47), 33 states have call predecessors, (47), 34 states have call successors, (47) [2021-12-07 01:43:07,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 271 transitions. [2021-12-07 01:43:07,396 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 271 transitions. Word has length 67 [2021-12-07 01:43:07,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:07,397 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 271 transitions. [2021-12-07 01:43:07,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-07 01:43:07,397 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 271 transitions. [2021-12-07 01:43:07,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-07 01:43:07,398 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:07,398 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:07,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-07 01:43:07,398 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:07,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:07,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2139701523, now seen corresponding path program 1 times [2021-12-07 01:43:07,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:07,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112903716] [2021-12-07 01:43:07,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:07,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:07,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:43:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:07,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:43:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:07,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:43:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:07,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:43:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:07,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 01:43:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:07,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-07 01:43:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:07,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-07 01:43:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:07,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-07 01:43:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:07,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 01:43:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-07 01:43:07,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:07,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112903716] [2021-12-07 01:43:07,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112903716] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:07,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:07,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-07 01:43:07,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880825331] [2021-12-07 01:43:07,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:07,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 01:43:07,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:07,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 01:43:07,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:43:07,782 INFO L87 Difference]: Start difference. First operand 227 states and 271 transitions. Second operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 01:43:08,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:08,076 INFO L93 Difference]: Finished difference Result 235 states and 278 transitions. [2021-12-07 01:43:08,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 01:43:08,077 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 75 [2021-12-07 01:43:08,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:08,078 INFO L225 Difference]: With dead ends: 235 [2021-12-07 01:43:08,078 INFO L226 Difference]: Without dead ends: 154 [2021-12-07 01:43:08,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-12-07 01:43:08,079 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 158 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:08,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 674 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:43:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-07 01:43:08,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 140. [2021-12-07 01:43:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 100 states have (on average 1.17) internal successors, (117), 105 states have internal predecessors, (117), 24 states have call successors, (24), 12 states have call predecessors, (24), 15 states have return successors, (26), 22 states have call predecessors, (26), 22 states have call successors, (26) [2021-12-07 01:43:08,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 167 transitions. [2021-12-07 01:43:08,087 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 167 transitions. Word has length 75 [2021-12-07 01:43:08,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:08,087 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 167 transitions. [2021-12-07 01:43:08,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 5 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-07 01:43:08,087 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 167 transitions. [2021-12-07 01:43:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-12-07 01:43:08,088 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:08,088 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:08,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-07 01:43:08,088 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:08,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:08,089 INFO L85 PathProgramCache]: Analyzing trace with hash 35307555, now seen corresponding path program 1 times [2021-12-07 01:43:08,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:08,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932298961] [2021-12-07 01:43:08,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:08,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:43:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:43:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:43:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 01:43:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:43:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:43:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:43:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:43:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:43:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:43:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-07 01:43:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,292 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-07 01:43:08,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:08,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932298961] [2021-12-07 01:43:08,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932298961] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:08,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:08,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:43:08,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904970745] [2021-12-07 01:43:08,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:08,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:43:08,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:08,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:43:08,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:43:08,294 INFO L87 Difference]: Start difference. First operand 140 states and 167 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-07 01:43:08,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:08,517 INFO L93 Difference]: Finished difference Result 243 states and 292 transitions. [2021-12-07 01:43:08,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 01:43:08,518 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 79 [2021-12-07 01:43:08,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:08,518 INFO L225 Difference]: With dead ends: 243 [2021-12-07 01:43:08,519 INFO L226 Difference]: Without dead ends: 153 [2021-12-07 01:43:08,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-12-07 01:43:08,520 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 58 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:08,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 362 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:43:08,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-07 01:43:08,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2021-12-07 01:43:08,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 104 states have (on average 1.1634615384615385) internal successors, (121), 109 states have internal predecessors, (121), 24 states have call successors, (24), 12 states have call predecessors, (24), 16 states have return successors, (27), 23 states have call predecessors, (27), 22 states have call successors, (27) [2021-12-07 01:43:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 172 transitions. [2021-12-07 01:43:08,529 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 172 transitions. Word has length 79 [2021-12-07 01:43:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:08,530 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 172 transitions. [2021-12-07 01:43:08,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-07 01:43:08,530 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 172 transitions. [2021-12-07 01:43:08,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-07 01:43:08,531 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:08,531 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:08,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-07 01:43:08,531 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:08,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:08,532 INFO L85 PathProgramCache]: Analyzing trace with hash -277501736, now seen corresponding path program 1 times [2021-12-07 01:43:08,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:08,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031947841] [2021-12-07 01:43:08,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:08,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:43:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:43:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:43:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 01:43:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:43:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:43:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:43:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:43:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:43:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:43:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 01:43:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 01:43:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-07 01:43:08,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:08,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031947841] [2021-12-07 01:43:08,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031947841] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:08,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:08,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-07 01:43:08,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791306170] [2021-12-07 01:43:08,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:08,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 01:43:08,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:08,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 01:43:08,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:43:08,766 INFO L87 Difference]: Start difference. First operand 145 states and 172 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-07 01:43:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:09,163 INFO L93 Difference]: Finished difference Result 244 states and 298 transitions. [2021-12-07 01:43:09,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-07 01:43:09,163 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 85 [2021-12-07 01:43:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:09,164 INFO L225 Difference]: With dead ends: 244 [2021-12-07 01:43:09,164 INFO L226 Difference]: Without dead ends: 177 [2021-12-07 01:43:09,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-12-07 01:43:09,165 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 75 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:09,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 462 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:43:09,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-12-07 01:43:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 152. [2021-12-07 01:43:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 110 states have (on average 1.1636363636363636) internal successors, (128), 115 states have internal predecessors, (128), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (28), 24 states have call predecessors, (28), 22 states have call successors, (28) [2021-12-07 01:43:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 180 transitions. [2021-12-07 01:43:09,177 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 180 transitions. Word has length 85 [2021-12-07 01:43:09,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:09,177 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 180 transitions. [2021-12-07 01:43:09,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 7 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-07 01:43:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 180 transitions. [2021-12-07 01:43:09,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-12-07 01:43:09,178 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:09,179 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:09,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-07 01:43:09,179 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:09,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:09,179 INFO L85 PathProgramCache]: Analyzing trace with hash -58647018, now seen corresponding path program 1 times [2021-12-07 01:43:09,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:09,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192205333] [2021-12-07 01:43:09,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:09,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:43:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:43:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:43:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 01:43:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:43:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:43:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:43:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:43:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:43:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:43:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 01:43:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-07 01:43:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-07 01:43:09,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:09,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192205333] [2021-12-07 01:43:09,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192205333] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:09,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:09,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 01:43:09,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245250072] [2021-12-07 01:43:09,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:09,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 01:43:09,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:09,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 01:43:09,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:43:09,332 INFO L87 Difference]: Start difference. First operand 152 states and 180 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-07 01:43:09,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:09,532 INFO L93 Difference]: Finished difference Result 224 states and 264 transitions. [2021-12-07 01:43:09,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:43:09,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 85 [2021-12-07 01:43:09,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:09,540 INFO L225 Difference]: With dead ends: 224 [2021-12-07 01:43:09,540 INFO L226 Difference]: Without dead ends: 156 [2021-12-07 01:43:09,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:43:09,541 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 71 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:09,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 240 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:43:09,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-07 01:43:09,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2021-12-07 01:43:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 109 states have (on average 1.146788990825688) internal successors, (125), 114 states have internal predecessors, (125), 24 states have call successors, (24), 12 states have call predecessors, (24), 17 states have return successors, (28), 24 states have call predecessors, (28), 22 states have call successors, (28) [2021-12-07 01:43:09,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 177 transitions. [2021-12-07 01:43:09,552 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 177 transitions. Word has length 85 [2021-12-07 01:43:09,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:09,552 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 177 transitions. [2021-12-07 01:43:09,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-07 01:43:09,552 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 177 transitions. [2021-12-07 01:43:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-07 01:43:09,553 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:09,553 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:09,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-07 01:43:09,554 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:09,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2136981433, now seen corresponding path program 1 times [2021-12-07 01:43:09,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:09,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047283038] [2021-12-07 01:43:09,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:09,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:43:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:43:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:43:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 01:43:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:43:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:43:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:43:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:43:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:43:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:43:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-07 01:43:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-07 01:43:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,690 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-07 01:43:09,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:09,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047283038] [2021-12-07 01:43:09,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047283038] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:09,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:09,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 01:43:09,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869144151] [2021-12-07 01:43:09,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:09,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 01:43:09,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:09,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 01:43:09,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:43:09,691 INFO L87 Difference]: Start difference. First operand 151 states and 177 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-07 01:43:09,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:09,818 INFO L93 Difference]: Finished difference Result 211 states and 245 transitions. [2021-12-07 01:43:09,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:43:09,818 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2021-12-07 01:43:09,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:09,819 INFO L225 Difference]: With dead ends: 211 [2021-12-07 01:43:09,819 INFO L226 Difference]: Without dead ends: 100 [2021-12-07 01:43:09,819 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:43:09,820 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 63 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:09,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 231 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:09,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-07 01:43:09,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2021-12-07 01:43:09,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 71 states have internal predecessors, (74), 17 states have call successors, (17), 10 states have call predecessors, (17), 11 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2021-12-07 01:43:09,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2021-12-07 01:43:09,824 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 87 [2021-12-07 01:43:09,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:09,824 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2021-12-07 01:43:09,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-07 01:43:09,825 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2021-12-07 01:43:09,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-07 01:43:09,825 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:09,825 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:09,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-07 01:43:09,825 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:09,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:09,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1322477714, now seen corresponding path program 1 times [2021-12-07 01:43:09,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:09,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930935594] [2021-12-07 01:43:09,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:09,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:43:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:43:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:43:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 01:43:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:43:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:43:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:43:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:43:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:43:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:43:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:43:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:43:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-07 01:43:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-07 01:43:10,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:10,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930935594] [2021-12-07 01:43:10,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930935594] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:10,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:10,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-07 01:43:10,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635465456] [2021-12-07 01:43:10,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:10,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-07 01:43:10,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:10,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-07 01:43:10,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-07 01:43:10,221 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2021-12-07 01:43:10,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:10,575 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2021-12-07 01:43:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:43:10,576 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 90 [2021-12-07 01:43:10,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:10,576 INFO L225 Difference]: With dead ends: 152 [2021-12-07 01:43:10,576 INFO L226 Difference]: Without dead ends: 95 [2021-12-07 01:43:10,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2021-12-07 01:43:10,577 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 189 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:10,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 229 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:43:10,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-07 01:43:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-12-07 01:43:10,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 69 states have internal predecessors, (70), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-07 01:43:10,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2021-12-07 01:43:10,581 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 90 [2021-12-07 01:43:10,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:10,582 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2021-12-07 01:43:10,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 6 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2021-12-07 01:43:10,582 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2021-12-07 01:43:10,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-07 01:43:10,582 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:10,583 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:10,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-07 01:43:10,583 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:43:10,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:10,583 INFO L85 PathProgramCache]: Analyzing trace with hash -11289161, now seen corresponding path program 1 times [2021-12-07 01:43:10,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:10,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504817551] [2021-12-07 01:43:10,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:10,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-07 01:43:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-07 01:43:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 01:43:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-07 01:43:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:43:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:43:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 01:43:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-07 01:43:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-07 01:43:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:43:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-07 01:43:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 01:43:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-07 01:43:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-07 01:43:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:11,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-07 01:43:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-07 01:43:11,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:11,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504817551] [2021-12-07 01:43:11,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504817551] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:11,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159947500] [2021-12-07 01:43:11,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:11,110 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:11,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:11,111 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:11,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-07 01:43:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:11,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 2617 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-07 01:43:11,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-07 01:43:11,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:12,181 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-07 01:43:12,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2021-12-07 01:43:12,275 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-07 01:43:12,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2021-12-07 01:43:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-07 01:43:12,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159947500] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:12,365 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:12,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 10] total 31 [2021-12-07 01:43:12,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109370767] [2021-12-07 01:43:12,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:12,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-07 01:43:12,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:12,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-07 01:43:12,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2021-12-07 01:43:12,368 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 31 states, 31 states have (on average 4.516129032258065) internal successors, (140), 29 states have internal predecessors, (140), 9 states have call successors, (31), 5 states have call predecessors, (31), 7 states have return successors, (29), 9 states have call predecessors, (29), 8 states have call successors, (29) [2021-12-07 01:43:13,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:13,273 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2021-12-07 01:43:13,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-07 01:43:13,274 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.516129032258065) internal successors, (140), 29 states have internal predecessors, (140), 9 states have call successors, (31), 5 states have call predecessors, (31), 7 states have return successors, (29), 9 states have call predecessors, (29), 8 states have call successors, (29) Word has length 116 [2021-12-07 01:43:13,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:13,275 INFO L225 Difference]: With dead ends: 124 [2021-12-07 01:43:13,275 INFO L226 Difference]: Without dead ends: 0 [2021-12-07 01:43:13,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 239 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=305, Invalid=1857, Unknown=0, NotChecked=0, Total=2162 [2021-12-07 01:43:13,276 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 369 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:13,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 620 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 804 Invalid, 0 Unknown, 138 Unchecked, 0.5s Time] [2021-12-07 01:43:13,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-07 01:43:13,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-07 01:43:13,277 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-12-07 01:43:13,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-07 01:43:13,277 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2021-12-07 01:43:13,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:13,277 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-07 01:43:13,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.516129032258065) internal successors, (140), 29 states have internal predecessors, (140), 9 states have call successors, (31), 5 states have call predecessors, (31), 7 states have return successors, (29), 9 states have call predecessors, (29), 8 states have call successors, (29) [2021-12-07 01:43:13,278 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-07 01:43:13,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-07 01:43:13,280 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-07 01:43:13,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-07 01:43:13,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-07 01:43:13,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-07 01:43:15,224 INFO L854 garLoopResultBuilder]: At program point L6894(line 6894) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-07 01:43:15,224 INFO L854 garLoopResultBuilder]: At program point can_fail_mallocENTRY(lines 6893 6897) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-07 01:43:15,224 INFO L858 garLoopResultBuilder]: For program point L6896-1(line 6896) no Hoare annotation was computed. [2021-12-07 01:43:15,224 INFO L854 garLoopResultBuilder]: At program point L6896(line 6896) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-07 01:43:15,224 INFO L858 garLoopResultBuilder]: For program point L6894-3(lines 6894 6896) no Hoare annotation was computed. [2021-12-07 01:43:15,224 INFO L858 garLoopResultBuilder]: For program point L6894-1(lines 6894 6896) no Hoare annotation was computed. [2021-12-07 01:43:15,224 INFO L858 garLoopResultBuilder]: For program point can_fail_mallocFINAL(lines 6893 6897) no Hoare annotation was computed. [2021-12-07 01:43:15,224 INFO L858 garLoopResultBuilder]: For program point can_fail_mallocEXIT(lines 6893 6897) no Hoare annotation was computed. [2021-12-07 01:43:15,224 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6876 6881) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-07 01:43:15,224 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6876 6881) no Hoare annotation was computed. [2021-12-07 01:43:15,224 INFO L858 garLoopResultBuilder]: For program point L6877-1(lines 6877 6879) no Hoare annotation was computed. [2021-12-07 01:43:15,224 INFO L854 garLoopResultBuilder]: At program point L6877(lines 6877 6879) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-07 01:43:15,224 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6876 6881) no Hoare annotation was computed. [2021-12-07 01:43:15,224 INFO L854 garLoopResultBuilder]: At program point aws_mem_acquireENTRY(lines 6922 6932) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-07 01:43:15,224 INFO L858 garLoopResultBuilder]: For program point aws_mem_acquireEXIT(lines 6922 6932) no Hoare annotation was computed. [2021-12-07 01:43:15,225 INFO L858 garLoopResultBuilder]: For program point L6928-2(lines 6928 6930) no Hoare annotation was computed. [2021-12-07 01:43:15,225 INFO L858 garLoopResultBuilder]: For program point L6927(line 6927) no Hoare annotation was computed. [2021-12-07 01:43:15,225 INFO L858 garLoopResultBuilder]: For program point L6928(lines 6928 6930) no Hoare annotation was computed. [2021-12-07 01:43:15,225 INFO L858 garLoopResultBuilder]: For program point L6929-1(line 6929) no Hoare annotation was computed. [2021-12-07 01:43:15,225 INFO L854 garLoopResultBuilder]: At program point L6929(line 6929) the Hoare annotation is: (or (and (< 0 (+ aws_mem_acquire_~mem~0.offset 1)) (<= aws_mem_acquire_~mem~0.base 0) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (<= aws_mem_acquire_~mem~0.offset 0) (< 0 (+ aws_mem_acquire_~mem~0.base 1))) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-07 01:43:15,225 INFO L854 garLoopResultBuilder]: At program point L6923-1(line 6923) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-07 01:43:15,225 INFO L854 garLoopResultBuilder]: At program point L6923(line 6923) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-07 01:43:15,225 INFO L854 garLoopResultBuilder]: At program point L6925-1(line 6925) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-07 01:43:15,225 INFO L854 garLoopResultBuilder]: At program point L6925(line 6925) the Hoare annotation is: (or (and (= |old(#length)| |#length|) (= ~tl_last_error~0 |old(~tl_last_error~0)|) (= |old(#valid)| |#valid|)) (not (= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-07 01:43:15,225 INFO L858 garLoopResultBuilder]: For program point aws_mem_acquireFINAL(lines 6922 6932) no Hoare annotation was computed. [2021-12-07 01:43:15,225 INFO L858 garLoopResultBuilder]: For program point L6923-2(line 6923) no Hoare annotation was computed. [2021-12-07 01:43:15,225 INFO L858 garLoopResultBuilder]: For program point L7162(line 7162) no Hoare annotation was computed. [2021-12-07 01:43:15,225 INFO L858 garLoopResultBuilder]: For program point L7162-4(line 7162) no Hoare annotation was computed. [2021-12-07 01:43:15,225 INFO L858 garLoopResultBuilder]: For program point L7162-3(line 7162) no Hoare annotation was computed. [2021-12-07 01:43:15,225 INFO L858 garLoopResultBuilder]: For program point L7162-2(line 7162) no Hoare annotation was computed. [2021-12-07 01:43:15,225 INFO L858 garLoopResultBuilder]: For program point L7162-8(line 7162) no Hoare annotation was computed. [2021-12-07 01:43:15,226 INFO L861 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7157 7163) the Hoare annotation is: true [2021-12-07 01:43:15,226 INFO L858 garLoopResultBuilder]: For program point L7162-6(line 7162) no Hoare annotation was computed. [2021-12-07 01:43:15,226 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7157 7163) no Hoare annotation was computed. [2021-12-07 01:43:15,226 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7157 7163) no Hoare annotation was computed. [2021-12-07 01:43:15,226 INFO L858 garLoopResultBuilder]: For program point L7159-1(line 7159) no Hoare annotation was computed. [2021-12-07 01:43:15,226 INFO L858 garLoopResultBuilder]: For program point L7159(lines 7159 7162) no Hoare annotation was computed. [2021-12-07 01:43:15,226 INFO L858 garLoopResultBuilder]: For program point L7159-4(lines 7159 7160) no Hoare annotation was computed. [2021-12-07 01:43:15,226 INFO L858 garLoopResultBuilder]: For program point L7159-3(line 7159) no Hoare annotation was computed. [2021-12-07 01:43:15,226 INFO L858 garLoopResultBuilder]: For program point L7159-9(lines 7159 7162) no Hoare annotation was computed. [2021-12-07 01:43:15,226 INFO L858 garLoopResultBuilder]: For program point L7159-7(lines 7159 7162) no Hoare annotation was computed. [2021-12-07 01:43:15,226 INFO L858 garLoopResultBuilder]: For program point L7159-6(lines 7159 7160) no Hoare annotation was computed. [2021-12-07 01:43:15,226 INFO L858 garLoopResultBuilder]: For program point L7159-11(lines 7159 7162) no Hoare annotation was computed. [2021-12-07 01:43:15,226 INFO L858 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2021-12-07 01:43:15,226 INFO L858 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2021-12-07 01:43:15,226 INFO L861 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2021-12-07 01:43:15,226 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-07 01:43:15,226 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-07 01:43:15,227 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-07 01:43:15,227 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-07 01:43:15,227 INFO L854 garLoopResultBuilder]: At program point aws_raise_errorENTRY(lines 1988 1999) the Hoare annotation is: (or (= ~tl_last_error~0 |old(~tl_last_error~0)|) (not (<= |~#s_can_fail_allocator_static~0.offset| 0)) (not (<= 0 |~#s_can_fail_allocator_static~0.offset|))) [2021-12-07 01:43:15,227 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7101) no Hoare annotation was computed. [2021-12-07 01:43:15,227 INFO L858 garLoopResultBuilder]: For program point aws_raise_errorFINAL(lines 1988 1999) no Hoare annotation was computed. [2021-12-07 01:43:15,227 INFO L858 garLoopResultBuilder]: For program point aws_raise_errorEXIT(lines 1988 1999) no Hoare annotation was computed. [2021-12-07 01:43:15,227 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6883 6885) no Hoare annotation was computed. [2021-12-07 01:43:15,227 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6883 6885) no Hoare annotation was computed. [2021-12-07 01:43:15,227 INFO L861 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6883 6885) the Hoare annotation is: true [2021-12-07 01:43:15,227 INFO L858 garLoopResultBuilder]: For program point aws_allocator_is_validFINAL(lines 6917 6920) no Hoare annotation was computed. [2021-12-07 01:43:15,227 INFO L858 garLoopResultBuilder]: For program point L6919-1(line 6919) no Hoare annotation was computed. [2021-12-07 01:43:15,227 INFO L861 garLoopResultBuilder]: At program point L6919(line 6919) the Hoare annotation is: true [2021-12-07 01:43:15,227 INFO L861 garLoopResultBuilder]: At program point aws_allocator_is_validENTRY(lines 6917 6920) the Hoare annotation is: true [2021-12-07 01:43:15,227 INFO L858 garLoopResultBuilder]: For program point aws_allocator_is_validEXIT(lines 6917 6920) no Hoare annotation was computed. [2021-12-07 01:43:15,227 INFO L858 garLoopResultBuilder]: For program point L7117-2(lines 7117 7121) no Hoare annotation was computed. [2021-12-07 01:43:15,227 INFO L854 garLoopResultBuilder]: At program point L8752(line 8752) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24))) (and (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1150#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1150#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-07 01:43:15,228 INFO L858 garLoopResultBuilder]: For program point L8752-1(line 8752) no Hoare annotation was computed. [2021-12-07 01:43:15,228 INFO L858 garLoopResultBuilder]: For program point L7117(lines 7117 7118) no Hoare annotation was computed. [2021-12-07 01:43:15,228 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-07 01:43:15,228 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-07 01:43:15,228 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-07 01:43:15,228 INFO L854 garLoopResultBuilder]: At program point L7126(line 7126) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (let ((.cse0 (= (select .cse15 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse13 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse13)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (let ((.cse14 (select .cse15 (+ 16 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)))) (<= .cse14 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse14) 18446744073709551616))))) .cse10 .cse11 .cse12 .cse13)))) [2021-12-07 01:43:15,228 INFO L861 garLoopResultBuilder]: At program point L8757(line 8757) the Hoare annotation is: true [2021-12-07 01:43:15,228 INFO L858 garLoopResultBuilder]: For program point L7126-2(line 7126) no Hoare annotation was computed. [2021-12-07 01:43:15,228 INFO L854 garLoopResultBuilder]: At program point L7126-1(line 7126) the Hoare annotation is: (let ((.cse19 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse13 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (let ((.cse0 (= (select .cse13 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse2 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse4 (<= 1 |ULTIMATE.start_aws_byte_buf_init_#t~ret591#1|)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.base| 0))) (.cse7 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse19) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse9 (<= |ULTIMATE.start_aws_byte_buf_init_#t~ret591#1| 1)) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse19))) (.cse14 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse16 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse17 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (let ((.cse12 (select .cse13 (+ 16 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)))) (<= .cse12 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse12) 18446744073709551616))))) .cse14 .cse15 .cse16 .cse17) (let ((.cse18 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse18) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse18) 0) .cse17))))) [2021-12-07 01:43:15,228 INFO L858 garLoopResultBuilder]: For program point L8749(lines 8749 8755) no Hoare annotation was computed. [2021-12-07 01:43:15,228 INFO L858 garLoopResultBuilder]: For program point L8749-2(lines 8749 8755) no Hoare annotation was computed. [2021-12-07 01:43:15,228 INFO L854 garLoopResultBuilder]: At program point L8753(line 8753) the Hoare annotation is: (and (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1151#1| 0) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2021-12-07 01:43:15,228 INFO L858 garLoopResultBuilder]: For program point L8753-1(line 8753) no Hoare annotation was computed. [2021-12-07 01:43:15,228 INFO L858 garLoopResultBuilder]: For program point L8741(lines 8741 8756) no Hoare annotation was computed. [2021-12-07 01:43:15,229 INFO L858 garLoopResultBuilder]: For program point L7114-1(lines 7114 7116) no Hoare annotation was computed. [2021-12-07 01:43:15,229 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-07 01:43:15,229 INFO L854 garLoopResultBuilder]: At program point L7127(lines 7110 7128) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (let ((.cse0 (= (select .cse15 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16))) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse13 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse13)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (let ((.cse14 (select .cse15 (+ 16 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)))) (<= .cse14 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse14) 18446744073709551616))))) .cse10 .cse11 .cse12 .cse13) (and .cse3 .cse4 .cse5 .cse7 .cse8 (<= (+ |ULTIMATE.start_aws_byte_buf_init_#res#1| 1) 0) .cse10 .cse11 (not (= (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) .cse12 .cse13)))) [2021-12-07 01:43:15,229 INFO L854 garLoopResultBuilder]: At program point L8754(line 8754) the Hoare annotation is: (let ((.cse2 (div |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| 18446744073709551616)) (.cse3 (div |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1152#1| 18446744073709551616))) (let ((.cse1 (* 18446744073709551616 .cse3)) (.cse0 (+ (* 18446744073709551616 .cse2) |ULTIMATE.start_aws_byte_buf_init_harness_#t~mem1152#1|))) (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (< .cse0 (+ .cse1 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| 1)) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (<= .cse2 .cse3) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (<= (+ .cse1 |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1|) .cse0) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= |~#s_can_fail_allocator_static~0.offset| 0)))) [2021-12-07 01:43:15,229 INFO L854 garLoopResultBuilder]: At program point L8746(line 8746) the Hoare annotation is: (and (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) [2021-12-07 01:43:15,229 INFO L858 garLoopResultBuilder]: For program point L8754-1(line 8754) no Hoare annotation was computed. [2021-12-07 01:43:15,229 INFO L854 garLoopResultBuilder]: At program point L7111-1(line 7111) the Hoare annotation is: (and (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) [2021-12-07 01:43:15,229 INFO L854 garLoopResultBuilder]: At program point L7111(line 7111) the Hoare annotation is: (and (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) [2021-12-07 01:43:15,229 INFO L858 garLoopResultBuilder]: For program point L8746-1(line 8746) no Hoare annotation was computed. [2021-12-07 01:43:15,229 INFO L858 garLoopResultBuilder]: For program point L8751-2(line 8751) no Hoare annotation was computed. [2021-12-07 01:43:15,229 INFO L858 garLoopResultBuilder]: For program point L7116-1(line 7116) no Hoare annotation was computed. [2021-12-07 01:43:15,229 INFO L854 garLoopResultBuilder]: At program point L7116(line 7116) the Hoare annotation is: (and (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (< (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_init_~capacity#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) [2021-12-07 01:43:15,229 INFO L854 garLoopResultBuilder]: At program point L8751(line 8751) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24)) (.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|))) (let ((.cse0 (= (select .cse15 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|)))) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|)) (.cse6 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|)) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse16))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|)) (.cse13 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (let ((.cse2 (+ 8 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|))) (and .cse0 .cse1 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) .cse2) 0) .cse13)) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (let ((.cse14 (select .cse15 (+ 16 |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|)))) (<= .cse14 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse14) 18446744073709551616))))) .cse10 .cse11 .cse12 .cse13)))) [2021-12-07 01:43:15,230 INFO L854 garLoopResultBuilder]: At program point L8751-1(line 8751) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| 24))) (and (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) (+ 16 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset|))) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1#1| |ULTIMATE.start_aws_byte_buf_init_~capacity#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0) |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| |ULTIMATE.start_aws_byte_buf_init_~buf#1.base|) (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.base|) .cse0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3#1.offset| |ULTIMATE.start_aws_byte_buf_init_~buf#1.offset|) (= |ULTIMATE.start_aws_byte_buf_init_~allocator#1.base| |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.base|) (= |ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0#1.offset| |ULTIMATE.start_aws_byte_buf_init_~allocator#1.offset|) (<= 1 |ULTIMATE.start_aws_byte_buf_init_harness_#t~ret1149#1|) (<= |ULTIMATE.start_aws_byte_buf_init_harness_#t~ret1149#1| 1) (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-12-07 01:43:15,230 INFO L858 garLoopResultBuilder]: For program point L7112(lines 7110 7128) no Hoare annotation was computed. [2021-12-07 01:43:15,230 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-07 01:43:15,230 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-07 01:43:15,230 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-07 01:43:15,230 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-07 01:43:15,230 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-07 01:43:15,230 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-07 01:43:15,232 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:15,233 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-07 01:43:15,238 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:43:15,239 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:43:15,239 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:43:15,239 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:43:15,239 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:43:15,240 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:43:15,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:43:15,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:43:15,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:43:15,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:43:15,246 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:43:15,247 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:43:15,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:43:15 BoogieIcfgContainer [2021-12-07 01:43:15,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-07 01:43:15,250 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-07 01:43:15,250 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-07 01:43:15,250 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-07 01:43:15,250 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:42:56" (3/4) ... [2021-12-07 01:43:15,252 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-07 01:43:15,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_allocator_is_valid [2021-12-07 01:43:15,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_malloc [2021-12-07 01:43:15,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-07 01:43:15,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_mem_acquire [2021-12-07 01:43:15,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2021-12-07 01:43:15,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2021-12-07 01:43:15,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-07 01:43:15,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-07 01:43:15,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_raise_error [2021-12-07 01:43:15,257 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2021-12-07 01:43:15,268 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 123 nodes and edges [2021-12-07 01:43:15,270 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2021-12-07 01:43:15,271 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-12-07 01:43:15,272 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-07 01:43:15,273 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-07 01:43:15,274 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-07 01:43:15,275 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-07 01:43:15,276 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-07 01:43:15,299 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && #memory_$Pointer$[buf][8 + buf] == 0) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && buf == buf) && allocator == allocator) && allocator == allocator) && #memory_$Pointer$[buf][8 + buf] == 0) && s_can_fail_allocator_static <= 0) || (((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616)) && buf == buf) && allocator == allocator) && allocator == allocator) && s_can_fail_allocator_static <= 0)) || ((((((((((0 <= s_can_fail_allocator_static && buf == 0) && capacity == capacity) && buf == buf) && !(buf == 0)) && \result + 1 <= 0) && buf == buf) && allocator == allocator) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && allocator == allocator) && s_can_fail_allocator_static <= 0) [2021-12-07 01:43:15,988 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-07 01:43:15,988 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-07 01:43:15,988 INFO L158 Benchmark]: Toolchain (without parser) took 22408.34ms. Allocated memory was 94.4MB in the beginning and 293.6MB in the end (delta: 199.2MB). Free memory was 70.0MB in the beginning and 192.5MB in the end (delta: -122.4MB). Peak memory consumption was 221.6MB. Max. memory is 16.1GB. [2021-12-07 01:43:15,989 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 01:43:15,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1837.33ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 69.7MB in the beginning and 51.9MB in the end (delta: 17.7MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2021-12-07 01:43:15,989 INFO L158 Benchmark]: Boogie Procedure Inliner took 122.62ms. Allocated memory is still 115.3MB. Free memory was 51.4MB in the beginning and 40.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-07 01:43:15,989 INFO L158 Benchmark]: Boogie Preprocessor took 66.73ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 40.9MB in the beginning and 84.4MB in the end (delta: -43.5MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2021-12-07 01:43:15,989 INFO L158 Benchmark]: RCFGBuilder took 1096.74ms. Allocated memory is still 138.4MB. Free memory was 84.4MB in the beginning and 73.9MB in the end (delta: 10.5MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2021-12-07 01:43:15,990 INFO L158 Benchmark]: TraceAbstraction took 18540.71ms. Allocated memory was 138.4MB in the beginning and 293.6MB in the end (delta: 155.2MB). Free memory was 73.5MB in the beginning and 156.7MB in the end (delta: -83.1MB). Peak memory consumption was 168.3MB. Max. memory is 16.1GB. [2021-12-07 01:43:15,990 INFO L158 Benchmark]: Witness Printer took 738.21ms. Allocated memory is still 293.6MB. Free memory was 156.7MB in the beginning and 192.5MB in the end (delta: -35.8MB). Peak memory consumption was 108.0MB. Max. memory is 16.1GB. [2021-12-07 01:43:15,991 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.17ms. Allocated memory is still 94.4MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1837.33ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 69.7MB in the beginning and 51.9MB in the end (delta: 17.7MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 122.62ms. Allocated memory is still 115.3MB. Free memory was 51.4MB in the beginning and 40.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.73ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 40.9MB in the beginning and 84.4MB in the end (delta: -43.5MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1096.74ms. Allocated memory is still 138.4MB. Free memory was 84.4MB in the beginning and 73.9MB in the end (delta: 10.5MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. * TraceAbstraction took 18540.71ms. Allocated memory was 138.4MB in the beginning and 293.6MB in the end (delta: 155.2MB). Free memory was 73.5MB in the beginning and 156.7MB in the end (delta: -83.1MB). Peak memory consumption was 168.3MB. Max. memory is 16.1GB. * Witness Printer took 738.21ms. Allocated memory is still 293.6MB. Free memory was 156.7MB in the beginning and 192.5MB in the end (delta: -35.8MB). Peak memory consumption was 108.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.5s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2642 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2518 mSDsluCounter, 15709 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 312 IncrementalHoareTripleChecker+Unchecked, 12888 mSDsCounter, 671 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5617 IncrementalHoareTripleChecker+Invalid, 6600 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 671 mSolverCounterUnsat, 2821 mSDtfsCounter, 5617 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1063 GetRequests, 723 SyntacticMatches, 10 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1511 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=17, InterpolantAutomatonStates: 253, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 367 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 185 PreInvPairs, 212 NumberOfFragments, 1272 HoareAnnotationTreeSize, 185 FomulaSimplifications, 208 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 32 FomulaSimplificationsInter, 104312 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 1776 NumberOfCodeBlocks, 1776 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1922 ConstructedInterpolants, 38 QuantifiedInterpolants, 10337 SizeOfPredicates, 42 NumberOfNonLiveVariables, 5076 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 31 InterpolantComputations, 25 PerfectInterpolantSequences, 575/635 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7110]: Loop Invariant [2021-12-07 01:43:15,997 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:43:15,997 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:43:15,997 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:43:15,997 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:43:15,997 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:43:15,998 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:43:16,000 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:43:16,000 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:43:16,000 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-07 01:43:16,000 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:43:16,000 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-07 01:43:16,001 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && #memory_$Pointer$[buf][8 + buf] == 0) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && buf == buf) && allocator == allocator) && allocator == allocator) && #memory_$Pointer$[buf][8 + buf] == 0) && s_can_fail_allocator_static <= 0) || (((((((((((((unknown-#memory_int-unknown[buf][buf] == 0 && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && 0 <= s_can_fail_allocator_static) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][buf + 24] == allocator) && buf == buf) && !(buf == 0)) && allocator == #memory_$Pointer$[buf][buf + 24]) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616)) && buf == buf) && allocator == allocator) && allocator == allocator) && s_can_fail_allocator_static <= 0)) || ((((((((((0 <= s_can_fail_allocator_static && buf == 0) && capacity == capacity) && buf == buf) && !(buf == 0)) && \result + 1 <= 0) && buf == buf) && allocator == allocator) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && allocator == allocator) && s_can_fail_allocator_static <= 0) - InvariantResult [Line: 8757]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-12-07 01:43:16,026 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b259cb95-7650-47a4-ba2d-39384f907a8f/bin/uautomizer-DrprNOufMa/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