./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8d31f386 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8b4fcda3453818339317053afeb37e62d564e9a4 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.multireach-323-8d31f38 [2021-07-05 16:48:08,561 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-05 16:48:08,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-05 16:48:08,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-05 16:48:08,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-05 16:48:08,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-05 16:48:08,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-05 16:48:08,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-05 16:48:08,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-05 16:48:08,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-05 16:48:08,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-05 16:48:08,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-05 16:48:08,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-05 16:48:08,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-05 16:48:08,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-05 16:48:08,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-05 16:48:08,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-05 16:48:08,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-05 16:48:08,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-05 16:48:08,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-05 16:48:08,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-05 16:48:08,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-05 16:48:08,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-05 16:48:08,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-05 16:48:08,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-05 16:48:08,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-05 16:48:08,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-05 16:48:08,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-05 16:48:08,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-05 16:48:08,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-05 16:48:08,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-05 16:48:08,649 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-05 16:48:08,650 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-05 16:48:08,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-05 16:48:08,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-05 16:48:08,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-05 16:48:08,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-05 16:48:08,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-05 16:48:08,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-05 16:48:08,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-05 16:48:08,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-05 16:48:08,655 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-07-05 16:48:08,698 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-05 16:48:08,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-05 16:48:08,700 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-05 16:48:08,700 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-05 16:48:08,700 INFO L138 SettingsManager]: * Use SBE=true [2021-07-05 16:48:08,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-05 16:48:08,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-05 16:48:08,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-05 16:48:08,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-05 16:48:08,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-05 16:48:08,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-05 16:48:08,703 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-05 16:48:08,703 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-05 16:48:08,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-05 16:48:08,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-05 16:48:08,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-05 16:48:08,704 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-05 16:48:08,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-05 16:48:08,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-05 16:48:08,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-05 16:48:08,705 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-05 16:48:08,705 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-05 16:48:08,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-05 16:48:08,705 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-05 16:48:08,706 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-05 16:48:08,706 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b4fcda3453818339317053afeb37e62d564e9a4 [2021-07-05 16:48:09,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-05 16:48:09,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-05 16:48:09,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-05 16:48:09,065 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-05 16:48:09,065 INFO L275 PluginConnector]: CDTParser initialized [2021-07-05 16:48:09,066 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness.i [2021-07-05 16:48:09,126 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77cc3c7da/86461fce5d11493ba4ff4911398e1e45/FLAGe36a606d5 [2021-07-05 16:48:09,747 INFO L306 CDTParser]: Found 1 translation units. [2021-07-05 16:48:09,748 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness.i [2021-07-05 16:48:09,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77cc3c7da/86461fce5d11493ba4ff4911398e1e45/FLAGe36a606d5 [2021-07-05 16:48:09,920 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77cc3c7da/86461fce5d11493ba4ff4911398e1e45 [2021-07-05 16:48:09,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-05 16:48:09,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-05 16:48:09,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-05 16:48:09,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-05 16:48:09,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-05 16:48:09,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.07 04:48:09" (1/1) ... [2021-07-05 16:48:09,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@442f68a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 04:48:09, skipping insertion in model container [2021-07-05 16:48:09,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.07 04:48:09" (1/1) ... [2021-07-05 16:48:09,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-05 16:48:10,067 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-05 16:48:10,318 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness.i[4494,4507] [2021-07-05 16:48:10,324 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness.i[4554,4567] [2021-07-05 16:48:10,337 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-07-05 16:48:10,341 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-07-05 16:48:10,966 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:10,967 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:10,967 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:10,969 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:10,970 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:10,988 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:10,991 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:10,993 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:10,995 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:10,998 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:10,999 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,001 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,001 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,299 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-07-05 16:48:11,301 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-07-05 16:48:11,302 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-07-05 16:48:11,303 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-07-05 16:48:11,304 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-07-05 16:48:11,305 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-07-05 16:48:11,305 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-07-05 16:48:11,305 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-07-05 16:48:11,306 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-07-05 16:48:11,307 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-07-05 16:48:11,440 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-07-05 16:48:11,459 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,460 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,514 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,515 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-05 16:48:11,631 INFO L203 MainTranslator]: Completed pre-run [2021-07-05 16:48:11,651 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness.i[4494,4507] [2021-07-05 16:48:11,652 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_reserve_harness.i[4554,4567] [2021-07-05 16:48:11,655 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-07-05 16:48:11,655 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-07-05 16:48:11,696 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,700 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,701 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,702 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,702 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,707 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,709 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,710 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,711 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,712 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,712 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,713 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,713 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,747 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-07-05 16:48:11,754 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-07-05 16:48:11,755 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-07-05 16:48:11,756 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-07-05 16:48:11,756 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-07-05 16:48:11,757 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-07-05 16:48:11,757 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-07-05 16:48:11,758 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-07-05 16:48:11,758 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-07-05 16:48:11,758 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-07-05 16:48:11,794 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-07-05 16:48:11,813 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,814 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,849 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,849 WARN L1507 CHandler]: Possible shadowing of function index [2021-07-05 16:48:11,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-05 16:48:12,527 INFO L208 MainTranslator]: Completed translation [2021-07-05 16:48:12,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 04:48:12 WrapperNode [2021-07-05 16:48:12,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-05 16:48:12,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-05 16:48:12,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-05 16:48:12,529 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-05 16:48:12,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 04:48:12" (1/1) ... [2021-07-05 16:48:12,643 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 04:48:12" (1/1) ... [2021-07-05 16:48:12,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-05 16:48:12,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-05 16:48:12,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-05 16:48:12,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-05 16:48:12,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 04:48:12" (1/1) ... [2021-07-05 16:48:12,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 04:48:12" (1/1) ... [2021-07-05 16:48:12,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 04:48:12" (1/1) ... [2021-07-05 16:48:12,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 04:48:12" (1/1) ... [2021-07-05 16:48:12,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 04:48:12" (1/1) ... [2021-07-05 16:48:12,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 04:48:12" (1/1) ... [2021-07-05 16:48:12,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 04:48:12" (1/1) ... [2021-07-05 16:48:12,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-05 16:48:12,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-05 16:48:12,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-05 16:48:12,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-05 16:48:12,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 04:48:12" (1/1) ... [2021-07-05 16:48:12,817 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-05 16:48:12,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-05 16:48:12,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-07-05 16:48:12,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-07-05 16:48:12,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-05 16:48:12,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-07-05 16:48:12,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-07-05 16:48:12,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-07-05 16:48:12,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-05 16:48:12,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-05 16:48:12,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-05 16:48:12,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-07-05 16:48:12,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-07-05 16:48:12,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-05 16:48:12,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-05 16:48:21,018 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-05 16:48:21,019 INFO L299 CfgBuilder]: Removed 102 assume(true) statements. [2021-07-05 16:48:21,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.07 04:48:21 BoogieIcfgContainer [2021-07-05 16:48:21,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-05 16:48:21,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-05 16:48:21,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-05 16:48:21,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-05 16:48:21,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.07 04:48:09" (1/3) ... [2021-07-05 16:48:21,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75dd51e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.07 04:48:21, skipping insertion in model container [2021-07-05 16:48:21,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 04:48:12" (2/3) ... [2021-07-05 16:48:21,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75dd51e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.07 04:48:21, skipping insertion in model container [2021-07-05 16:48:21,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.07 04:48:21" (3/3) ... [2021-07-05 16:48:21,026 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_reserve_harness.i [2021-07-05 16:48:21,032 INFO L198 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-05 16:48:21,032 INFO L158 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2021-07-05 16:48:21,070 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 16:48:21,075 INFO L329 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 16:48:21,075 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 16:48:21,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 200 states have internal predecessors, (281), 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-07-05 16:48:21,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-07-05 16:48:21,095 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:48:21,096 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:48:21,096 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:48:21,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:48:21,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1001751012, now seen corresponding path program 1 times [2021-07-05 16:48:21,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:48:21,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86407865] [2021-07-05 16:48:21,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:48:21,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:48:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:48:21,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:21,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:21,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:21,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:21,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:48:21,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:48:21,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86407865] [2021-07-05 16:48:21,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86407865] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:48:21,654 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:48:21,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 16:48:21,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803932388] [2021-07-05 16:48:21,659 INFO L425 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-05 16:48:21,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:48:21,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-05 16:48:21,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-05 16:48:21,676 INFO L87 Difference]: Start difference. First operand has 201 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 200 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-07-05 16:48:21,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:48:21,721 INFO L93 Difference]: Finished difference Result 395 states and 553 transitions. [2021-07-05 16:48:21,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-05 16:48:21,723 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-07-05 16:48:21,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:48:21,730 INFO L225 Difference]: With dead ends: 395 [2021-07-05 16:48:21,731 INFO L226 Difference]: Without dead ends: 68 [2021-07-05 16:48:21,740 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-05 16:48:21,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-07-05 16:48:21,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-07-05 16:48:21,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 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-07-05 16:48:21,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 89 transitions. [2021-07-05 16:48:21,774 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 89 transitions. Word has length 23 [2021-07-05 16:48:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:48:21,775 INFO L442 AbstractCegarLoop]: Abstraction has 68 states and 89 transitions. [2021-07-05 16:48:21,775 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-07-05 16:48:21,780 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 89 transitions. [2021-07-05 16:48:21,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-07-05 16:48:21,782 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:48:21,782 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:48:21,782 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-05 16:48:21,782 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:48:21,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:48:21,785 INFO L82 PathProgramCache]: Analyzing trace with hash 768771474, now seen corresponding path program 1 times [2021-07-05 16:48:21,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:48:21,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464273203] [2021-07-05 16:48:21,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:48:21,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:48:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:48:22,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:22,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:22,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:22,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:48:22,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:22,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-07-05 16:48:22,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:22,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:22,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:48:22,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:48:22,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464273203] [2021-07-05 16:48:22,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464273203] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:48:22,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:48:22,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:48:22,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937438185] [2021-07-05 16:48:22,061 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:48:22,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:48:22,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:48:22,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:48:22,062 INFO L87 Difference]: Start difference. First operand 68 states and 89 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-07-05 16:48:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:48:22,100 INFO L93 Difference]: Finished difference Result 113 states and 147 transitions. [2021-07-05 16:48:22,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:48:22,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-07-05 16:48:22,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:48:22,102 INFO L225 Difference]: With dead ends: 113 [2021-07-05 16:48:22,102 INFO L226 Difference]: Without dead ends: 68 [2021-07-05 16:48:22,103 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:48:22,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-07-05 16:48:22,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-07-05 16:48:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 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-07-05 16:48:22,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2021-07-05 16:48:22,108 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 30 [2021-07-05 16:48:22,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:48:22,108 INFO L442 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2021-07-05 16:48:22,108 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-07-05 16:48:22,108 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2021-07-05 16:48:22,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-07-05 16:48:22,109 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:48:22,109 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:48:22,110 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-05 16:48:22,110 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:48:22,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:48:22,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1645100581, now seen corresponding path program 1 times [2021-07-05 16:48:22,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:48:22,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703995657] [2021-07-05 16:48:22,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:48:22,111 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:48:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:48:22,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:22,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:22,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:22,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:48:22,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:22,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:48:22,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:22,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:22,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:48:22,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:48:22,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703995657] [2021-07-05 16:48:22,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703995657] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:48:22,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:48:22,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:48:22,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114755199] [2021-07-05 16:48:22,415 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:48:22,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:48:22,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:48:22,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:48:22,416 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:48:22,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:48:22,519 INFO L93 Difference]: Finished difference Result 188 states and 252 transitions. [2021-07-05 16:48:22,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:48:22,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-07-05 16:48:22,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:48:22,525 INFO L225 Difference]: With dead ends: 188 [2021-07-05 16:48:22,525 INFO L226 Difference]: Without dead ends: 134 [2021-07-05 16:48:22,526 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:48:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-07-05 16:48:22,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 74. [2021-07-05 16:48:22,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 73 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:48:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2021-07-05 16:48:22,541 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 36 [2021-07-05 16:48:22,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:48:22,541 INFO L442 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2021-07-05 16:48:22,541 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:48:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2021-07-05 16:48:22,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-07-05 16:48:22,544 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:48:22,545 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:48:22,545 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-05 16:48:22,545 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:48:22,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:48:22,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1511087075, now seen corresponding path program 1 times [2021-07-05 16:48:22,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:48:22,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214090818] [2021-07-05 16:48:22,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:48:22,547 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:48:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:48:22,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:22,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:22,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:22,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:48:22,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:22,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:48:22,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:22,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:48:22,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:48:22,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214090818] [2021-07-05 16:48:22,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214090818] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:48:22,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:48:22,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:48:22,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894397410] [2021-07-05 16:48:22,755 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:48:22,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:48:22,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:48:22,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:48:22,756 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:48:22,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:48:22,830 INFO L93 Difference]: Finished difference Result 154 states and 199 transitions. [2021-07-05 16:48:22,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:48:22,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-07-05 16:48:22,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:48:22,832 INFO L225 Difference]: With dead ends: 154 [2021-07-05 16:48:22,832 INFO L226 Difference]: Without dead ends: 104 [2021-07-05 16:48:22,832 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:48:22,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-07-05 16:48:22,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 80. [2021-07-05 16:48:22,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:48:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2021-07-05 16:48:22,851 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 36 [2021-07-05 16:48:22,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:48:22,852 INFO L442 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2021-07-05 16:48:22,852 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:48:22,852 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2021-07-05 16:48:22,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-07-05 16:48:22,854 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:48:22,854 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:48:22,854 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-05 16:48:22,855 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:48:22,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:48:22,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1583060967, now seen corresponding path program 1 times [2021-07-05 16:48:22,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:48:22,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274484898] [2021-07-05 16:48:22,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:48:22,857 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:48:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:48:23,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:23,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:23,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:23,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:48:23,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:23,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:48:23,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:23,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:48:23,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:23,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:48:23,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:23,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:23,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:23,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:48:23,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:48:23,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274484898] [2021-07-05 16:48:23,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274484898] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:48:23,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:48:23,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:48:23,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580378748] [2021-07-05 16:48:23,123 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:48:23,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:48:23,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:48:23,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:48:23,124 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:48:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:48:23,194 INFO L93 Difference]: Finished difference Result 108 states and 134 transitions. [2021-07-05 16:48:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:48:23,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-07-05 16:48:23,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:48:23,196 INFO L225 Difference]: With dead ends: 108 [2021-07-05 16:48:23,196 INFO L226 Difference]: Without dead ends: 80 [2021-07-05 16:48:23,196 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 60.5ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-07-05 16:48:23,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-07-05 16:48:23,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-07-05 16:48:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.240506329113924) internal successors, (98), 79 states have internal predecessors, (98), 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-07-05 16:48:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2021-07-05 16:48:23,200 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 36 [2021-07-05 16:48:23,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:48:23,201 INFO L442 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2021-07-05 16:48:23,201 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:48:23,201 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2021-07-05 16:48:23,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-07-05 16:48:23,206 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:48:23,206 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:48:23,206 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-05 16:48:23,207 INFO L374 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:48:23,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:48:23,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1751879417, now seen corresponding path program 1 times [2021-07-05 16:48:23,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:48:23,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588998803] [2021-07-05 16:48:23,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:48:23,208 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:48:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:48:23,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:23,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:23,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:23,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:23,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:23,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:23,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:23,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:48:23,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:23,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:48:23,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:23,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:23,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:48:23,653 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:48:23,653 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588998803] [2021-07-05 16:48:23,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588998803] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:48:23,653 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:48:23,654 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-05 16:48:23,654 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530903010] [2021-07-05 16:48:23,654 INFO L425 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-05 16:48:23,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:48:23,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-05 16:48:23,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:48:23,656 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-07-05 16:48:23,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:48:23,769 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2021-07-05 16:48:23,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:48:23,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-07-05 16:48:23,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:48:23,771 INFO L225 Difference]: With dead ends: 102 [2021-07-05 16:48:23,772 INFO L226 Difference]: Without dead ends: 96 [2021-07-05 16:48:23,772 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 62.3ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:48:23,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-07-05 16:48:23,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2021-07-05 16:48:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 77 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:48:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2021-07-05 16:48:23,775 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 48 [2021-07-05 16:48:23,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:48:23,775 INFO L442 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2021-07-05 16:48:23,775 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-07-05 16:48:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2021-07-05 16:48:23,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-07-05 16:48:23,775 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:48:23,776 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:48:23,776 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-05 16:48:23,776 INFO L374 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:48:23,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:48:23,776 INFO L82 PathProgramCache]: Analyzing trace with hash 125219709, now seen corresponding path program 1 times [2021-07-05 16:48:23,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:48:23,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379894605] [2021-07-05 16:48:23,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:48:23,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:48:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:48:24,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:24,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:24,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:24,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:48:24,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:24,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-07-05 16:48:24,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:24,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-07-05 16:48:24,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:24,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:48:24,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:24,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:48:24,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:24,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:48:24,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:24,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:24,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:24,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:24,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:24,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:48:24,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:48:24,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379894605] [2021-07-05 16:48:24,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379894605] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:48:24,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:48:24,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-05 16:48:24,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151661453] [2021-07-05 16:48:24,313 INFO L425 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-05 16:48:24,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:48:24,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-05 16:48:24,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:48:24,314 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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-07-05 16:48:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:48:35,450 INFO L93 Difference]: Finished difference Result 227 states and 282 transitions. [2021-07-05 16:48:35,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-05 16:48:35,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-07-05 16:48:35,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:48:35,452 INFO L225 Difference]: With dead ends: 227 [2021-07-05 16:48:35,452 INFO L226 Difference]: Without dead ends: 192 [2021-07-05 16:48:35,453 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 458.6ms TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-07-05 16:48:35,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-07-05 16:48:35,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 120. [2021-07-05 16:48:35,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.226890756302521) internal successors, (146), 119 states have internal predecessors, (146), 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-07-05 16:48:35,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2021-07-05 16:48:35,462 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 52 [2021-07-05 16:48:35,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:48:35,463 INFO L442 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2021-07-05 16:48:35,463 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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-07-05 16:48:35,463 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2021-07-05 16:48:35,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-07-05 16:48:35,464 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:48:35,464 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:48:35,464 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-05 16:48:35,464 INFO L374 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:48:35,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:48:35,465 INFO L82 PathProgramCache]: Analyzing trace with hash -132945729, now seen corresponding path program 1 times [2021-07-05 16:48:35,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:48:35,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540870413] [2021-07-05 16:48:35,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:48:35,465 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:48:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:48:35,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:35,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:35,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:35,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-05 16:48:35,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:35,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:48:35,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:35,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:48:35,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:35,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:48:35,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:48:35,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540870413] [2021-07-05 16:48:35,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540870413] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:48:35,825 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:48:35,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:48:35,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232865175] [2021-07-05 16:48:35,825 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:48:35,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:48:35,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:48:35,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:48:35,826 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-07-05 16:48:38,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:48:38,154 INFO L93 Difference]: Finished difference Result 311 states and 376 transitions. [2021-07-05 16:48:38,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:48:38,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-07-05 16:48:38,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:48:38,156 INFO L225 Difference]: With dead ends: 311 [2021-07-05 16:48:38,156 INFO L226 Difference]: Without dead ends: 213 [2021-07-05 16:48:38,156 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 41.1ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:48:38,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-07-05 16:48:38,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 130. [2021-07-05 16:48:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.2015503875968991) internal successors, (155), 129 states have internal predecessors, (155), 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-07-05 16:48:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2021-07-05 16:48:38,161 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 52 [2021-07-05 16:48:38,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:48:38,162 INFO L442 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2021-07-05 16:48:38,162 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-07-05 16:48:38,162 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2021-07-05 16:48:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-07-05 16:48:38,162 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:48:38,162 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:48:38,163 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-05 16:48:38,163 INFO L374 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:48:38,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:48:38,163 INFO L82 PathProgramCache]: Analyzing trace with hash 547112641, now seen corresponding path program 1 times [2021-07-05 16:48:38,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:48:38,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968512751] [2021-07-05 16:48:38,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:48:38,163 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:48:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:48:40,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:40,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:40,937 INFO L142 QuantifierPusher]: treesize reduction 15, result has 40.0 percent of original size [2021-07-05 16:48:40,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:48:40,950 INFO L142 QuantifierPusher]: treesize reduction 15, result has 48.3 percent of original size [2021-07-05 16:48:40,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:48:40,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:40,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:48:40,976 INFO L142 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-07-05 16:48:40,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:48:40,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:40,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:48:40,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:40,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:48:41,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:41,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:48:41,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:48:41,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968512751] [2021-07-05 16:48:41,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968512751] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:48:41,011 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:48:41,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:48:41,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927752353] [2021-07-05 16:48:41,012 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 16:48:41,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:48:41,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 16:48:41,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:48:41,013 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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-07-05 16:48:45,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:48:45,471 INFO L93 Difference]: Finished difference Result 211 states and 250 transitions. [2021-07-05 16:48:45,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-05 16:48:45,472 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-07-05 16:48:45,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:48:45,473 INFO L225 Difference]: With dead ends: 211 [2021-07-05 16:48:45,473 INFO L226 Difference]: Without dead ends: 155 [2021-07-05 16:48:45,474 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 206.2ms TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2021-07-05 16:48:45,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-07-05 16:48:45,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 130. [2021-07-05 16:48:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.193798449612403) internal successors, (154), 129 states have internal predecessors, (154), 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-07-05 16:48:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2021-07-05 16:48:45,478 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 52 [2021-07-05 16:48:45,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:48:45,478 INFO L442 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2021-07-05 16:48:45,478 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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-07-05 16:48:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2021-07-05 16:48:45,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-07-05 16:48:45,479 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:48:45,479 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:48:45,479 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-05 16:48:45,479 INFO L374 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:48:45,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:48:45,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1074852403, now seen corresponding path program 1 times [2021-07-05 16:48:45,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:48:45,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305502854] [2021-07-05 16:48:45,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:48:45,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:48:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:48:45,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:45,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:45,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:45,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:48:45,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:45,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:48:45,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:45,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:48:45,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:45,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:48:45,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:45,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:48:45,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:45,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:48:45,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:45,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:48:45,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:45,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:48:45,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:45,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:45,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:48:45,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:48:45,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305502854] [2021-07-05 16:48:45,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305502854] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:48:45,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:48:45,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-05 16:48:45,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268609057] [2021-07-05 16:48:45,887 INFO L425 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-05 16:48:45,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:48:45,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-05 16:48:45,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:48:45,888 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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-07-05 16:48:54,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:48:54,961 INFO L93 Difference]: Finished difference Result 278 states and 332 transitions. [2021-07-05 16:48:54,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-07-05 16:48:54,961 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-07-05 16:48:54,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:48:54,962 INFO L225 Difference]: With dead ends: 278 [2021-07-05 16:48:54,962 INFO L226 Difference]: Without dead ends: 240 [2021-07-05 16:48:54,963 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 440.4ms TimeCoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2021-07-05 16:48:54,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-07-05 16:48:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 170. [2021-07-05 16:48:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.183431952662722) internal successors, (200), 169 states have internal predecessors, (200), 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-07-05 16:48:54,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 200 transitions. [2021-07-05 16:48:54,969 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 200 transitions. Word has length 56 [2021-07-05 16:48:54,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:48:54,969 INFO L442 AbstractCegarLoop]: Abstraction has 170 states and 200 transitions. [2021-07-05 16:48:54,969 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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-07-05 16:48:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 200 transitions. [2021-07-05 16:48:54,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-07-05 16:48:54,970 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:48:54,970 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:48:54,970 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-05 16:48:54,970 INFO L374 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:48:54,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:48:54,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1498499125, now seen corresponding path program 1 times [2021-07-05 16:48:54,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:48:54,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057038377] [2021-07-05 16:48:54,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:48:54,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:48:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:48:55,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:55,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:55,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:55,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-07-05 16:48:55,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:55,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-05 16:48:55,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:55,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:55,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:55,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:55,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:48:55,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:48:55,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057038377] [2021-07-05 16:48:55,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057038377] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:48:55,257 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:48:55,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:48:55,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598631471] [2021-07-05 16:48:55,257 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:48:55,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:48:55,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:48:55,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:48:55,259 INFO L87 Difference]: Start difference. First operand 170 states and 200 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-07-05 16:48:57,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:48:57,541 INFO L93 Difference]: Finished difference Result 324 states and 380 transitions. [2021-07-05 16:48:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:48:57,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-07-05 16:48:57,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:48:57,544 INFO L225 Difference]: With dead ends: 324 [2021-07-05 16:48:57,544 INFO L226 Difference]: Without dead ends: 229 [2021-07-05 16:48:57,544 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 32.5ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:48:57,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-07-05 16:48:57,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 170. [2021-07-05 16:48:57,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.1538461538461537) internal successors, (195), 169 states have internal predecessors, (195), 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-07-05 16:48:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 195 transitions. [2021-07-05 16:48:57,552 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 195 transitions. Word has length 56 [2021-07-05 16:48:57,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:48:57,552 INFO L442 AbstractCegarLoop]: Abstraction has 170 states and 195 transitions. [2021-07-05 16:48:57,552 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-07-05 16:48:57,553 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 195 transitions. [2021-07-05 16:48:57,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-07-05 16:48:57,553 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:48:57,553 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:48:57,554 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-05 16:48:57,554 INFO L374 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:48:57,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:48:57,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1361448827, now seen corresponding path program 1 times [2021-07-05 16:48:57,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:48:57,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514207635] [2021-07-05 16:48:57,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:48:57,555 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:48:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:48:57,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:57,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:57,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:57,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:48:57,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:57,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:48:57,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:57,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:48:57,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:57,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:48:57,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:57,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:48:57,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:57,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:57,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:48:57,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:48:57,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514207635] [2021-07-05 16:48:57,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514207635] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:48:57,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:48:57,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:48:57,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350695856] [2021-07-05 16:48:57,854 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:48:57,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:48:57,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:48:57,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:48:57,854 INFO L87 Difference]: Start difference. First operand 170 states and 195 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-07-05 16:48:58,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:48:58,016 INFO L93 Difference]: Finished difference Result 290 states and 327 transitions. [2021-07-05 16:48:58,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 16:48:58,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-07-05 16:48:58,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:48:58,017 INFO L225 Difference]: With dead ends: 290 [2021-07-05 16:48:58,017 INFO L226 Difference]: Without dead ends: 155 [2021-07-05 16:48:58,017 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 91.6ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:48:58,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-07-05 16:48:58,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 130. [2021-07-05 16:48:58,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.1472868217054264) internal successors, (148), 129 states have internal predecessors, (148), 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-07-05 16:48:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2021-07-05 16:48:58,022 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 56 [2021-07-05 16:48:58,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:48:58,022 INFO L442 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2021-07-05 16:48:58,022 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-07-05 16:48:58,022 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2021-07-05 16:48:58,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-07-05 16:48:58,023 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:48:58,023 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:48:58,023 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-05 16:48:58,023 INFO L374 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:48:58,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:48:58,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1367992626, now seen corresponding path program 1 times [2021-07-05 16:48:58,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:48:58,024 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338231616] [2021-07-05 16:48:58,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:48:58,024 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:48:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:48:58,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:58,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:58,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:58,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:48:58,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:58,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-07-05 16:48:58,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:58,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:48:58,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:58,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:48:58,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:58,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:48:58,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:58,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-07-05 16:48:58,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:58,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-07-05 16:48:58,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:58,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-07-05 16:48:58,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:58,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:58,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:58,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:58,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:48:58,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:48:58,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:48:58,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:48:58,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338231616] [2021-07-05 16:48:58,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338231616] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:48:58,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:48:58,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-05 16:48:58,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213656841] [2021-07-05 16:48:58,497 INFO L425 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-05 16:48:58,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:48:58,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-05 16:48:58,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-07-05 16:48:58,498 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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-07-05 16:49:05,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:49:05,629 INFO L93 Difference]: Finished difference Result 437 states and 488 transitions. [2021-07-05 16:49:05,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-07-05 16:49:05,629 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-07-05 16:49:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:49:05,631 INFO L225 Difference]: With dead ends: 437 [2021-07-05 16:49:05,631 INFO L226 Difference]: Without dead ends: 399 [2021-07-05 16:49:05,631 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 533.8ms TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2021-07-05 16:49:05,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2021-07-05 16:49:05,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 130. [2021-07-05 16:49:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.1472868217054264) internal successors, (148), 129 states have internal predecessors, (148), 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-07-05 16:49:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2021-07-05 16:49:05,638 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 58 [2021-07-05 16:49:05,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:49:05,638 INFO L442 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2021-07-05 16:49:05,638 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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-07-05 16:49:05,639 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2021-07-05 16:49:05,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-07-05 16:49:05,639 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:49:05,639 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:49:05,640 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-05 16:49:05,640 INFO L374 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:49:05,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:49:05,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1626158064, now seen corresponding path program 1 times [2021-07-05 16:49:05,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:49:05,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161633467] [2021-07-05 16:49:05,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:49:05,641 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:49:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:49:07,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:07,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:07,854 INFO L142 QuantifierPusher]: treesize reduction 15, result has 40.0 percent of original size [2021-07-05 16:49:07,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:49:07,864 INFO L142 QuantifierPusher]: treesize reduction 15, result has 48.3 percent of original size [2021-07-05 16:49:07,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:49:07,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:07,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:49:07,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:07,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:49:07,900 INFO L142 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-07-05 16:49:07,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:49:07,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:07,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:49:07,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:07,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:49:07,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:07,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:49:07,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:49:07,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161633467] [2021-07-05 16:49:07,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161633467] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:49:07,940 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:49:07,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-05 16:49:07,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477265690] [2021-07-05 16:49:07,941 INFO L425 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-05 16:49:07,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:49:07,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-05 16:49:07,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-07-05 16:49:07,942 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 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-07-05 16:49:14,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:49:14,428 INFO L93 Difference]: Finished difference Result 171 states and 193 transitions. [2021-07-05 16:49:14,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-05 16:49:14,429 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-07-05 16:49:14,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:49:14,429 INFO L225 Difference]: With dead ends: 171 [2021-07-05 16:49:14,430 INFO L226 Difference]: Without dead ends: 130 [2021-07-05 16:49:14,430 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 206.8ms TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2021-07-05 16:49:14,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-07-05 16:49:14,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2021-07-05 16:49:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 127 states have internal predecessors, (144), 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-07-05 16:49:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2021-07-05 16:49:14,435 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 58 [2021-07-05 16:49:14,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:49:14,435 INFO L442 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2021-07-05 16:49:14,435 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 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-07-05 16:49:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2021-07-05 16:49:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-07-05 16:49:14,436 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:49:14,436 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:49:14,436 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-07-05 16:49:14,436 INFO L374 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:49:14,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:49:14,437 INFO L82 PathProgramCache]: Analyzing trace with hash -531358058, now seen corresponding path program 1 times [2021-07-05 16:49:14,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:49:14,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999727859] [2021-07-05 16:49:14,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:49:14,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:49:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:49:14,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:14,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:14,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:14,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:49:14,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:14,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:49:14,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:14,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:49:14,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:14,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:49:14,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:14,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-07-05 16:49:14,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:14,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:14,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:49:14,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:49:14,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999727859] [2021-07-05 16:49:14,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999727859] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:49:14,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:49:14,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:49:14,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169312811] [2021-07-05 16:49:14,706 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:49:14,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:49:14,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:49:14,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:49:14,707 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-07-05 16:49:14,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:49:14,851 INFO L93 Difference]: Finished difference Result 178 states and 197 transitions. [2021-07-05 16:49:14,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 16:49:14,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-07-05 16:49:14,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:49:14,852 INFO L225 Difference]: With dead ends: 178 [2021-07-05 16:49:14,852 INFO L226 Difference]: Without dead ends: 135 [2021-07-05 16:49:14,853 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 77.0ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:49:14,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-07-05 16:49:14,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2021-07-05 16:49:14,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.1181102362204725) internal successors, (142), 127 states have internal predecessors, (142), 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-07-05 16:49:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 142 transitions. [2021-07-05 16:49:14,857 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 142 transitions. Word has length 62 [2021-07-05 16:49:14,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:49:14,857 INFO L442 AbstractCegarLoop]: Abstraction has 128 states and 142 transitions. [2021-07-05 16:49:14,857 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-07-05 16:49:14,857 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 142 transitions. [2021-07-05 16:49:14,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-07-05 16:49:14,858 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:49:14,858 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:49:14,858 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-07-05 16:49:14,858 INFO L374 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:49:14,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:49:14,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1367536421, now seen corresponding path program 1 times [2021-07-05 16:49:14,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:49:14,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130111749] [2021-07-05 16:49:14,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:49:14,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:49:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:49:15,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:15,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:15,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:15,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:49:15,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:15,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:49:15,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:15,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:49:15,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:49:15,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130111749] [2021-07-05 16:49:15,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130111749] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:49:15,050 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:49:15,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:49:15,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366370337] [2021-07-05 16:49:15,050 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:49:15,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:49:15,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:49:15,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:49:15,051 INFO L87 Difference]: Start difference. First operand 128 states and 142 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-07-05 16:49:15,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:49:15,121 INFO L93 Difference]: Finished difference Result 240 states and 265 transitions. [2021-07-05 16:49:15,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:49:15,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-07-05 16:49:15,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:49:15,123 INFO L225 Difference]: With dead ends: 240 [2021-07-05 16:49:15,123 INFO L226 Difference]: Without dead ends: 115 [2021-07-05 16:49:15,123 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:49:15,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-07-05 16:49:15,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2021-07-05 16:49:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.0833333333333333) internal successors, (117), 108 states have internal predecessors, (117), 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-07-05 16:49:15,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2021-07-05 16:49:15,128 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 64 [2021-07-05 16:49:15,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:49:15,129 INFO L442 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2021-07-05 16:49:15,129 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-07-05 16:49:15,129 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2021-07-05 16:49:15,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-07-05 16:49:15,130 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:49:15,130 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:49:15,130 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-07-05 16:49:15,130 INFO L374 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:49:15,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:49:15,131 INFO L82 PathProgramCache]: Analyzing trace with hash -228850015, now seen corresponding path program 1 times [2021-07-05 16:49:15,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:49:15,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261961550] [2021-07-05 16:49:15,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:49:15,131 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:49:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:49:18,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:18,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:18,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:18,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:49:18,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:18,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-07-05 16:49:18,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:18,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-07-05 16:49:18,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:18,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-07-05 16:49:18,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:18,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-07-05 16:49:19,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:19,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-07-05 16:49:19,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:19,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:49:19,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:19,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:49:19,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:49:19,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261961550] [2021-07-05 16:49:19,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261961550] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:49:19,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:49:19,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:49:19,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632589286] [2021-07-05 16:49:19,043 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 16:49:19,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:49:19,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 16:49:19,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:49:19,044 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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-07-05 16:49:23,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:49:23,341 INFO L93 Difference]: Finished difference Result 213 states and 228 transitions. [2021-07-05 16:49:23,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 16:49:23,342 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-07-05 16:49:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:49:23,343 INFO L225 Difference]: With dead ends: 213 [2021-07-05 16:49:23,343 INFO L226 Difference]: Without dead ends: 109 [2021-07-05 16:49:23,343 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 139.9ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:49:23,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-07-05 16:49:23,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-07-05 16:49:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.0740740740740742) internal successors, (116), 108 states have internal predecessors, (116), 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-07-05 16:49:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2021-07-05 16:49:23,347 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 64 [2021-07-05 16:49:23,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:49:23,347 INFO L442 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2021-07-05 16:49:23,348 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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-07-05 16:49:23,348 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2021-07-05 16:49:23,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-07-05 16:49:23,348 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:49:23,348 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:49:23,348 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-07-05 16:49:23,349 INFO L374 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:49:23,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:49:23,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1044654306, now seen corresponding path program 1 times [2021-07-05 16:49:23,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:49:23,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245661819] [2021-07-05 16:49:23,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:49:23,350 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:49:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:49:27,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:27,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:27,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:27,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:49:27,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:27,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:49:27,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:27,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-07-05 16:49:27,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:27,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-07-05 16:49:27,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:27,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-05 16:49:27,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:27,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-05 16:49:27,234 INFO L142 QuantifierPusher]: treesize reduction 5, result has 84.4 percent of original size [2021-07-05 16:49:27,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-07-05 16:49:27,255 INFO L142 QuantifierPusher]: treesize reduction 5, result has 54.5 percent of original size [2021-07-05 16:49:27,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-07-05 16:49:27,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:27,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:49:27,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:49:27,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245661819] [2021-07-05 16:49:27,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245661819] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:49:27,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:49:27,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-05 16:49:27,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312371000] [2021-07-05 16:49:27,273 INFO L425 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-05 16:49:27,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:49:27,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-05 16:49:27,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:49:27,274 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 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-07-05 16:49:31,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:49:31,725 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2021-07-05 16:49:31,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-05 16:49:31,726 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-07-05 16:49:31,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:49:31,727 INFO L225 Difference]: With dead ends: 116 [2021-07-05 16:49:31,727 INFO L226 Difference]: Without dead ends: 100 [2021-07-05 16:49:31,727 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 216.2ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-07-05 16:49:31,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-07-05 16:49:31,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 68. [2021-07-05 16:49:31,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 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-07-05 16:49:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2021-07-05 16:49:31,730 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 65 [2021-07-05 16:49:31,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:49:31,731 INFO L442 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2021-07-05 16:49:31,731 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 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-07-05 16:49:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2021-07-05 16:49:31,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-07-05 16:49:31,731 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:49:31,732 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:49:31,732 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-07-05 16:49:31,732 INFO L374 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:49:31,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:49:31,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1817302808, now seen corresponding path program 1 times [2021-07-05 16:49:31,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:49:31,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587233533] [2021-07-05 16:49:31,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:49:31,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:49:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:49:32,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:32,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:32,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:32,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:49:32,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:32,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-07-05 16:49:32,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:32,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:49:32,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:32,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:49:32,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:32,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:49:32,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:32,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-07-05 16:49:32,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:32,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-07-05 16:49:32,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:32,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-07-05 16:49:32,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:32,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-07-05 16:49:32,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:32,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:32,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:32,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:32,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:32,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:32,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:49:32,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:49:32,305 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587233533] [2021-07-05 16:49:32,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587233533] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:49:32,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:49:32,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-05 16:49:32,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330867793] [2021-07-05 16:49:32,305 INFO L425 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-05 16:49:32,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:49:32,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-05 16:49:32,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-07-05 16:49:32,306 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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-07-05 16:49:38,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:49:38,968 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2021-07-05 16:49:38,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-05 16:49:38,968 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-07-05 16:49:38,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:49:38,969 INFO L225 Difference]: With dead ends: 126 [2021-07-05 16:49:38,969 INFO L226 Difference]: Without dead ends: 119 [2021-07-05 16:49:38,969 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 389.2ms TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-07-05 16:49:38,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-07-05 16:49:38,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 107. [2021-07-05 16:49:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.0471698113207548) internal successors, (111), 106 states have internal predecessors, (111), 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-07-05 16:49:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2021-07-05 16:49:38,975 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 65 [2021-07-05 16:49:38,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:49:38,975 INFO L442 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2021-07-05 16:49:38,975 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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-07-05 16:49:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2021-07-05 16:49:38,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-07-05 16:49:38,976 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:49:38,976 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:49:38,976 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-07-05 16:49:38,977 INFO L374 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:49:38,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:49:38,977 INFO L82 PathProgramCache]: Analyzing trace with hash -549391786, now seen corresponding path program 1 times [2021-07-05 16:49:38,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:49:38,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960658640] [2021-07-05 16:49:38,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:49:38,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:49:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:49:39,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:39,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:39,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:39,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:49:39,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:39,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-07-05 16:49:39,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:39,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-07-05 16:49:39,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:39,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-07-05 16:49:39,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:39,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-07-05 16:49:39,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:39,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:49:39,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:39,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:49:39,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:39,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:49:39,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:39,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:49:39,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:39,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:49:39,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:49:39,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960658640] [2021-07-05 16:49:39,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960658640] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:49:39,429 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:49:39,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:49:39,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053672622] [2021-07-05 16:49:39,430 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 16:49:39,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:49:39,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 16:49:39,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:49:39,431 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 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-07-05 16:49:45,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:49:45,893 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2021-07-05 16:49:45,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 16:49:45,894 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-07-05 16:49:45,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:49:45,894 INFO L225 Difference]: With dead ends: 143 [2021-07-05 16:49:45,895 INFO L226 Difference]: Without dead ends: 116 [2021-07-05 16:49:45,895 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 190.0ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-07-05 16:49:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-07-05 16:49:45,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2021-07-05 16:49:45,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.0373831775700935) internal successors, (111), 107 states have internal predecessors, (111), 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-07-05 16:49:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2021-07-05 16:49:45,900 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 65 [2021-07-05 16:49:45,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:49:45,901 INFO L442 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2021-07-05 16:49:45,901 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 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-07-05 16:49:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2021-07-05 16:49:45,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-07-05 16:49:45,901 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:49:45,902 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:49:45,902 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-07-05 16:49:45,902 INFO L374 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:49:45,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:49:45,902 INFO L82 PathProgramCache]: Analyzing trace with hash -408843176, now seen corresponding path program 1 times [2021-07-05 16:49:45,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:49:45,903 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625634626] [2021-07-05 16:49:45,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:49:45,903 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:49:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:49:49,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:49,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:49,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:49,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:49:49,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:49,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:49:49,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:49,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-05 16:49:49,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:49,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 111 [2021-07-05 16:49:49,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:49,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 111 [2021-07-05 16:49:49,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:49,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-07-05 16:49:49,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:49,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-07-05 16:49:49,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:49,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-07-05 16:49:49,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:49,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-07-05 16:49:49,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:49,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-07-05 16:49:49,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:49,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:49,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:49,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:49,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:49,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:49,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:49:49,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:49:49,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625634626] [2021-07-05 16:49:49,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625634626] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:49:49,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:49:49,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-05 16:49:49,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763688522] [2021-07-05 16:49:49,870 INFO L425 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-05 16:49:49,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:49:49,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-05 16:49:49,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-07-05 16:49:49,871 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-07-05 16:49:56,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:49:56,526 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2021-07-05 16:49:56,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-05 16:49:56,527 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-07-05 16:49:56,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:49:56,527 INFO L225 Difference]: With dead ends: 115 [2021-07-05 16:49:56,527 INFO L226 Difference]: Without dead ends: 108 [2021-07-05 16:49:56,528 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 585.0ms TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2021-07-05 16:49:56,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-07-05 16:49:56,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-07-05 16:49:56,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.02803738317757) internal successors, (110), 107 states have internal predecessors, (110), 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-07-05 16:49:56,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2021-07-05 16:49:56,532 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 65 [2021-07-05 16:49:56,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:49:56,533 INFO L442 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2021-07-05 16:49:56,533 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-07-05 16:49:56,533 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2021-07-05 16:49:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-07-05 16:49:56,533 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:49:56,533 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:49:56,533 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-07-05 16:49:56,534 INFO L374 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:49:56,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:49:56,534 INFO L82 PathProgramCache]: Analyzing trace with hash -506599693, now seen corresponding path program 1 times [2021-07-05 16:49:56,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:49:56,534 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9811191] [2021-07-05 16:49:56,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:49:56,534 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:49:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:49:56,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:56,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:56,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:56,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:56,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:56,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:56,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:56,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:56,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:56,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:56,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:56,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:49:56,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:56,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:49:56,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:56,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:56,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:49:56,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:49:56,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9811191] [2021-07-05 16:49:56,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9811191] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:49:56,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:49:56,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:49:56,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525568749] [2021-07-05 16:49:56,846 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 16:49:56,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:49:56,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 16:49:56,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:49:56,847 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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-07-05 16:49:57,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:49:57,036 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2021-07-05 16:49:57,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 16:49:57,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-07-05 16:49:57,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:49:57,037 INFO L225 Difference]: With dead ends: 125 [2021-07-05 16:49:57,037 INFO L226 Difference]: Without dead ends: 117 [2021-07-05 16:49:57,038 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 113.3ms TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-07-05 16:49:57,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-07-05 16:49:57,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 89. [2021-07-05 16:49:57,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 states have internal predecessors, (90), 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-07-05 16:49:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2021-07-05 16:49:57,043 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 67 [2021-07-05 16:49:57,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:49:57,043 INFO L442 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2021-07-05 16:49:57,043 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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-07-05 16:49:57,043 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2021-07-05 16:49:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-07-05 16:49:57,046 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:49:57,046 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:49:57,046 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-07-05 16:49:57,046 INFO L374 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:49:57,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:49:57,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1315946319, now seen corresponding path program 1 times [2021-07-05 16:49:57,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:49:57,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025623688] [2021-07-05 16:49:57,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:49:57,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:49:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:49:57,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:57,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:57,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:57,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:49:57,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:57,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:49:57,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:57,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-07-05 16:49:57,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:57,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:49:57,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:57,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:49:57,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:57,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:49:57,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:57,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-07-05 16:49:57,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:57,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:49:57,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:57,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:49:57,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:57,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:57,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:49:57,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:49:57,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:49:57,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:49:57,477 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025623688] [2021-07-05 16:49:57,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025623688] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:49:57,477 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:49:57,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-05 16:49:57,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145413790] [2021-07-05 16:49:57,478 INFO L425 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-05 16:49:57,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:49:57,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-05 16:49:57,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-07-05 16:49:57,479 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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-07-05 16:50:08,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:50:08,380 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2021-07-05 16:50:08,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-05 16:50:08,385 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-07-05 16:50:08,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:50:08,385 INFO L225 Difference]: With dead ends: 135 [2021-07-05 16:50:08,386 INFO L226 Difference]: Without dead ends: 68 [2021-07-05 16:50:08,386 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 301.3ms TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-07-05 16:50:08,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-07-05 16:50:08,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-07-05 16:50:08,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0) internal successors, (67), 67 states have internal predecessors, (67), 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-07-05 16:50:08,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 67 transitions. [2021-07-05 16:50:08,389 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 67 transitions. Word has length 67 [2021-07-05 16:50:08,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:50:08,389 INFO L442 AbstractCegarLoop]: Abstraction has 68 states and 67 transitions. [2021-07-05 16:50:08,389 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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-07-05 16:50:08,390 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 67 transitions. [2021-07-05 16:50:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-07-05 16:50:08,390 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:50:08,390 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:50:08,391 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-07-05 16:50:08,391 INFO L374 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:50:08,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:50:08,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1748523535, now seen corresponding path program 1 times [2021-07-05 16:50:08,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:50:08,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135952227] [2021-07-05 16:50:08,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:50:08,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:50:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:50:11,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:11,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:11,095 INFO L142 QuantifierPusher]: treesize reduction 15, result has 40.0 percent of original size [2021-07-05 16:50:11,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:50:11,106 INFO L142 QuantifierPusher]: treesize reduction 15, result has 48.3 percent of original size [2021-07-05 16:50:11,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:50:11,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:11,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:50:11,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:11,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:50:11,147 INFO L142 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-07-05 16:50:11,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:50:11,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:11,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:11,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:11,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:11,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:11,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:11,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:11,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:11,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:11,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:50:11,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:11,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:50:11,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:11,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:11,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:50:11,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:50:11,318 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135952227] [2021-07-05 16:50:11,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135952227] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:50:11,319 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:50:11,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-05 16:50:11,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472870552] [2021-07-05 16:50:11,319 INFO L425 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-05 16:50:11,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:50:11,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-05 16:50:11,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2021-07-05 16:50:11,320 INFO L87 Difference]: Start difference. First operand 68 states and 67 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 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-07-05 16:50:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:50:18,230 INFO L93 Difference]: Finished difference Result 68 states and 67 transitions. [2021-07-05 16:50:18,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-07-05 16:50:18,230 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-07-05 16:50:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:50:18,231 INFO L225 Difference]: With dead ends: 68 [2021-07-05 16:50:18,231 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 16:50:18,231 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 638.0ms TimeCoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2021-07-05 16:50:18,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 16:50:18,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 16:50:18,232 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-07-05 16:50:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 16:50:18,232 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2021-07-05 16:50:18,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:50:18,232 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 16:50:18,232 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 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-07-05 16:50:18,232 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 16:50:18,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 16:50:18,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 16:50:18,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,244 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,274 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,343 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,374 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:18,422 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:50:19,110 WARN L205 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2021-07-05 16:50:20,003 WARN L205 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 135 [2021-07-05 16:50:20,273 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2021-07-05 16:50:20,624 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 14 [2021-07-05 16:50:20,628 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,628 INFO L762 garLoopResultBuilder]: For program point L9153(lines 9153 9155) no Hoare annotation was computed. [2021-07-05 16:50:20,628 INFO L762 garLoopResultBuilder]: For program point L9153-2(lines 9153 9155) no Hoare annotation was computed. [2021-07-05 16:50:20,628 INFO L762 garLoopResultBuilder]: For program point L6973(lines 6973 6978) no Hoare annotation was computed. [2021-07-05 16:50:20,628 INFO L765 garLoopResultBuilder]: At program point L268(line 268) the Hoare annotation is: true [2021-07-05 16:50:20,628 INFO L762 garLoopResultBuilder]: For program point L6974(lines 6974 6976) no Hoare annotation was computed. [2021-07-05 16:50:20,628 INFO L762 garLoopResultBuilder]: For program point L6974-2(lines 6974 6976) no Hoare annotation was computed. [2021-07-05 16:50:20,628 INFO L762 garLoopResultBuilder]: For program point L7141-2(line 7141) no Hoare annotation was computed. [2021-07-05 16:50:20,629 INFO L762 garLoopResultBuilder]: For program point L7141(line 7141) no Hoare annotation was computed. [2021-07-05 16:50:20,629 INFO L765 garLoopResultBuilder]: At program point L9157(line 9157) the Hoare annotation is: true [2021-07-05 16:50:20,629 INFO L762 garLoopResultBuilder]: For program point L6979(lines 6979 6981) no Hoare annotation was computed. [2021-07-05 16:50:20,629 INFO L765 garLoopResultBuilder]: At program point L6979-3(lines 6965 6982) the Hoare annotation is: true [2021-07-05 16:50:20,629 INFO L762 garLoopResultBuilder]: For program point L6979-2(lines 6979 6981) no Hoare annotation was computed. [2021-07-05 16:50:20,629 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,629 INFO L762 garLoopResultBuilder]: For program point L7145(lines 7145 7151) no Hoare annotation was computed. [2021-07-05 16:50:20,630 INFO L758 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:50:20,630 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,630 INFO L762 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:50:20,630 INFO L762 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:50:20,630 INFO L762 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:50:20,630 INFO L762 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:50:20,630 INFO L762 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:50:20,631 INFO L762 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:50:20,631 INFO L762 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:50:20,631 INFO L762 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:50:20,631 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,631 INFO L762 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-07-05 16:50:20,631 INFO L762 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-07-05 16:50:20,631 INFO L762 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-07-05 16:50:20,631 INFO L762 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-07-05 16:50:20,632 INFO L762 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-07-05 16:50:20,632 INFO L762 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-07-05 16:50:20,632 INFO L762 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-07-05 16:50:20,632 INFO L762 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-07-05 16:50:20,632 INFO L765 garLoopResultBuilder]: At program point L6951-1(lines 6950 6952) the Hoare annotation is: true [2021-07-05 16:50:20,632 INFO L758 garLoopResultBuilder]: At program point L6951(lines 6950 6952) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:50:20,632 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,633 INFO L765 garLoopResultBuilder]: At program point L6655(lines 6653 6656) the Hoare annotation is: true [2021-07-05 16:50:20,633 INFO L765 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: true [2021-07-05 16:50:20,633 INFO L765 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: true [2021-07-05 16:50:20,633 INFO L765 garLoopResultBuilder]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: true [2021-07-05 16:50:20,633 INFO L762 garLoopResultBuilder]: For program point L8176-1(line 8176) no Hoare annotation was computed. [2021-07-05 16:50:20,634 INFO L758 garLoopResultBuilder]: At program point L8176-4(line 8176) the Hoare annotation is: (let ((.cse25 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse26 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse24 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse5 (select .cse26 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse20 (select .cse25 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse13 (select .cse26 12)) (.cse18 (select .cse25 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (let ((.cse0 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse3 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse19 (div .cse18 4294967296)) (.cse8 (<= .cse13 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse13) 4294967296))))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse12 (<= .cse20 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse20) 4294967296))))) (.cse14 (div .cse5 4294967296)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse10 (not (= (select .cse24 4) 0))) (.cse11 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse15 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse16 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse17 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse21 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse5) 4294967296)))) .cse6 (let ((.cse7 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (<= .cse7 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse7) 4294967296))))) .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse5 (+ .cse13 (* 4294967296 (div (+ (* .cse14 4294967296) 4294967295 (* .cse13 (- 1))) 4294967296)))) .cse15 .cse16 .cse17 (<= .cse18 (+ (* 4294967296 (div (+ (* .cse19 4294967296) (* .cse20 (- 1)) 4294967295) 4294967296)) .cse20)) .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse18 (* 4294967296 .cse19)) .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 (<= .cse5 (* 4294967296 .cse14)) .cse16 .cse17 .cse21) (let ((.cse22 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse23 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 16))) (and .cse1 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse22) 0) .cse2 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse22) 0) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse23) 0) .cse4 .cse6 .cse10 .cse11 .cse15 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) .cse16 .cse17 .cse21 (= (select .cse24 .cse23) 0))))))) [2021-07-05 16:50:20,634 INFO L762 garLoopResultBuilder]: For program point L8176-3(line 8176) no Hoare annotation was computed. [2021-07-05 16:50:20,634 INFO L762 garLoopResultBuilder]: For program point L8177-3(lines 8175 8193) no Hoare annotation was computed. [2021-07-05 16:50:20,634 INFO L762 garLoopResultBuilder]: For program point L8177-2(line 8177) no Hoare annotation was computed. [2021-07-05 16:50:20,634 INFO L762 garLoopResultBuilder]: For program point L8177(line 8177) no Hoare annotation was computed. [2021-07-05 16:50:20,634 INFO L762 garLoopResultBuilder]: For program point L8177-4(line 8177) no Hoare annotation was computed. [2021-07-05 16:50:20,634 INFO L762 garLoopResultBuilder]: For program point L6658(lines 6658 6663) no Hoare annotation was computed. [2021-07-05 16:50:20,635 INFO L762 garLoopResultBuilder]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:50:20,635 INFO L762 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:50:20,635 INFO L762 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:50:20,635 INFO L762 garLoopResultBuilder]: For program point L7154(lines 7154 7156) no Hoare annotation was computed. [2021-07-05 16:50:20,635 INFO L762 garLoopResultBuilder]: For program point L6659(lines 6659 6661) no Hoare annotation was computed. [2021-07-05 16:50:20,635 INFO L762 garLoopResultBuilder]: For program point L6659-2(lines 6659 6661) no Hoare annotation was computed. [2021-07-05 16:50:20,635 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 16:50:20,635 INFO L762 garLoopResultBuilder]: For program point L7122(lines 7122 7135) no Hoare annotation was computed. [2021-07-05 16:50:20,636 INFO L762 garLoopResultBuilder]: For program point L8179(lines 8179 8182) no Hoare annotation was computed. [2021-07-05 16:50:20,636 INFO L762 garLoopResultBuilder]: For program point L9137(lines 9137 9156) no Hoare annotation was computed. [2021-07-05 16:50:20,636 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,636 INFO L765 garLoopResultBuilder]: At program point L7158(lines 7137 7159) the Hoare annotation is: true [2021-07-05 16:50:20,636 INFO L762 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:50:20,636 INFO L762 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:50:20,636 INFO L762 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:50:20,637 INFO L762 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:50:20,637 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,637 INFO L762 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:50:20,637 INFO L762 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:50:20,637 INFO L762 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:50:20,637 INFO L762 garLoopResultBuilder]: For program point L222-7(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:50:20,637 INFO L762 garLoopResultBuilder]: For program point L222-8(lines 7162 7172) no Hoare annotation was computed. [2021-07-05 16:50:20,637 INFO L762 garLoopResultBuilder]: For program point L222-9(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:50:20,638 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 16:50:20,638 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,638 INFO L762 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,638 INFO L762 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,638 INFO L762 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,638 INFO L762 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,638 INFO L762 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,638 INFO L762 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,639 INFO L762 garLoopResultBuilder]: For program point L8184(lines 8184 8187) no Hoare annotation was computed. [2021-07-05 16:50:20,639 INFO L762 garLoopResultBuilder]: For program point L7160(lines 7160 7173) no Hoare annotation was computed. [2021-07-05 16:50:20,639 INFO L762 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,639 INFO L762 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,639 INFO L762 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,639 INFO L762 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,639 INFO L762 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,639 INFO L762 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,640 INFO L762 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,640 INFO L762 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,640 INFO L762 garLoopResultBuilder]: For program point L223-21(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,640 INFO L762 garLoopResultBuilder]: For program point L223-22(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,640 INFO L762 garLoopResultBuilder]: For program point L223-24(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,640 INFO L762 garLoopResultBuilder]: For program point L223-25(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,640 INFO L762 garLoopResultBuilder]: For program point L7491-1(line 7491) no Hoare annotation was computed. [2021-07-05 16:50:20,641 INFO L762 garLoopResultBuilder]: For program point L7491(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,641 INFO L762 garLoopResultBuilder]: For program point L223-27(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,641 INFO L762 garLoopResultBuilder]: For program point L223-28(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,641 INFO L762 garLoopResultBuilder]: For program point L7491-4(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:50:20,641 INFO L762 garLoopResultBuilder]: For program point L7491-3(line 7491) no Hoare annotation was computed. [2021-07-05 16:50:20,641 INFO L762 garLoopResultBuilder]: For program point L7491-9(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,641 INFO L762 garLoopResultBuilder]: For program point L7491-7(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,641 INFO L762 garLoopResultBuilder]: For program point L7491-6(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:50:20,642 INFO L762 garLoopResultBuilder]: For program point L7491-13(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,642 INFO L758 garLoopResultBuilder]: At program point L7491-12(lines 7489 7495) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse3 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse4 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse5 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (or (and (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse4 .cse5 .cse6 .cse7) (let ((.cse10 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse8 (select .cse10 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse2 .cse3 (<= .cse8 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse8) 4294967296)))) .cse4 .cse5 .cse6 (let ((.cse9 (select .cse10 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= .cse9 (+ (* 4294967296 (div (+ (* (div .cse9 4294967296) 4294967296) (* .cse8 (- 1)) 4294967295) 4294967296)) .cse8))) .cse7))) (let ((.cse11 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and .cse0 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse11) 0) .cse1 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse11) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2021-07-05 16:50:20,642 INFO L762 garLoopResultBuilder]: For program point L7491-11(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,642 INFO L762 garLoopResultBuilder]: For program point L7491-17(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:50:20,642 INFO L762 garLoopResultBuilder]: For program point L7491-16(line 7491) no Hoare annotation was computed. [2021-07-05 16:50:20,642 INFO L762 garLoopResultBuilder]: For program point L7491-14(line 7491) no Hoare annotation was computed. [2021-07-05 16:50:20,643 INFO L762 garLoopResultBuilder]: For program point L7491-20(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,643 INFO L762 garLoopResultBuilder]: For program point L7491-19(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:50:20,643 INFO L758 garLoopResultBuilder]: At program point L7491-25(lines 7489 7495) the Hoare annotation is: (let ((.cse24 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse1 (select .cse24 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse3 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse4 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse7 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0))) (.cse8 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0))) (.cse9 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse2 (div .cse1 4294967296)) (.cse10 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse11 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse12 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse13 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (let ((.cse0 (let ((.cse22 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse23 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse20 (select .cse23 12)) (.cse21 (select .cse22 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse19 (select .cse24 12))) (let ((.cse16 (<= .cse19 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse19) 4294967296))))) (.cse17 (<= .cse21 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse21) 4294967296))))) (.cse14 (select .cse23 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse18 (<= .cse20 (+ (* 4294967296 (div (+ (- 1) .cse20) 4294967296)) 4294967295))) (.cse15 (select .cse22 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (or (and .cse3 .cse4 (<= (* 4294967296 (div (+ .cse14 4294967295) 4294967296)) .cse14) (<= (* 4294967296 (div (+ 4294967295 .cse15) 4294967296)) .cse15) (<= (* 4294967296 (div (+ .cse1 4294967295) 4294967296)) .cse1) .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse18 .cse13) (and (<= .cse15 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse15) 4294967296)))) .cse3 .cse4 (<= .cse1 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse1) 4294967296)))) .cse5 (<= .cse14 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse14) 4294967296)))) .cse16 .cse6 .cse7 .cse8 .cse9 .cse17 (<= .cse1 (+ .cse19 (* 4294967296 (div (+ (* .cse2 4294967296) 4294967295 (* .cse19 (- 1))) 4294967296)))) .cse10 .cse11 (<= .cse14 (+ (* 4294967296 (div (+ (* (div .cse14 4294967296) 4294967296) 4294967295 (* .cse20 (- 1))) 4294967296)) .cse20)) .cse12 .cse18 (<= .cse15 (+ (* 4294967296 (div (+ (* (div .cse15 4294967296) 4294967296) (* .cse21 (- 1)) 4294967295) 4294967296)) .cse21)) .cse13))))))) (or (and .cse0 (<= .cse1 (* 4294967296 .cse2))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse0) (and (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse10 .cse11 .cse12 .cse13)))))) [2021-07-05 16:50:20,643 INFO L762 garLoopResultBuilder]: For program point L7491-24(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,643 INFO L762 garLoopResultBuilder]: For program point L7491-22(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,643 INFO L762 garLoopResultBuilder]: For program point L7491-29(line 7491) no Hoare annotation was computed. [2021-07-05 16:50:20,644 INFO L762 garLoopResultBuilder]: For program point L7491-27(line 7491) no Hoare annotation was computed. [2021-07-05 16:50:20,644 INFO L762 garLoopResultBuilder]: For program point L7491-26(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,644 INFO L762 garLoopResultBuilder]: For program point L7491-33(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,644 INFO L762 garLoopResultBuilder]: For program point L7491-32(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:50:20,644 INFO L762 garLoopResultBuilder]: For program point L7491-30(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:50:20,644 INFO L762 garLoopResultBuilder]: For program point L7491-37(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,644 INFO L762 garLoopResultBuilder]: For program point L7491-35(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,645 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,645 INFO L762 garLoopResultBuilder]: For program point L7491-40(line 7491) no Hoare annotation was computed. [2021-07-05 16:50:20,645 INFO L762 garLoopResultBuilder]: For program point L7491-39(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,645 INFO L758 garLoopResultBuilder]: At program point L7491-38(lines 7489 7495) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:50:20,645 INFO L762 garLoopResultBuilder]: For program point L7491-45(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:50:20,645 INFO L762 garLoopResultBuilder]: For program point L7491-43(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:50:20,645 INFO L762 garLoopResultBuilder]: For program point L7491-42(line 7491) no Hoare annotation was computed. [2021-07-05 16:50:20,646 INFO L762 garLoopResultBuilder]: For program point L7491-48(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,646 INFO L762 garLoopResultBuilder]: For program point L7491-46(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,646 INFO L762 garLoopResultBuilder]: For program point L7491-53(line 7491) no Hoare annotation was computed. [2021-07-05 16:50:20,646 INFO L762 garLoopResultBuilder]: For program point L7491-52(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,646 INFO L765 garLoopResultBuilder]: At program point L7491-51(lines 7489 7495) the Hoare annotation is: true [2021-07-05 16:50:20,646 INFO L762 garLoopResultBuilder]: For program point L7491-50(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,646 INFO L762 garLoopResultBuilder]: For program point L7491-56(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:50:20,647 INFO L762 garLoopResultBuilder]: For program point L7491-55(line 7491) no Hoare annotation was computed. [2021-07-05 16:50:20,647 INFO L762 garLoopResultBuilder]: For program point L7491-61(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,647 INFO L762 garLoopResultBuilder]: For program point L7491-59(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,647 INFO L762 garLoopResultBuilder]: For program point L7491-58(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:50:20,647 INFO L762 garLoopResultBuilder]: For program point L7491-65(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,647 INFO L765 garLoopResultBuilder]: At program point L7491-64(lines 7489 7495) the Hoare annotation is: true [2021-07-05 16:50:20,647 INFO L762 garLoopResultBuilder]: For program point L7491-63(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,647 INFO L762 garLoopResultBuilder]: For program point L7491-69(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:50:20,648 INFO L762 garLoopResultBuilder]: For program point L7491-68(line 7491) no Hoare annotation was computed. [2021-07-05 16:50:20,648 INFO L762 garLoopResultBuilder]: For program point L7491-66(line 7491) no Hoare annotation was computed. [2021-07-05 16:50:20,648 INFO L762 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2021-07-05 16:50:20,648 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 16:50:20,648 INFO L762 garLoopResultBuilder]: For program point L7491-72(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,648 INFO L762 garLoopResultBuilder]: For program point L7491-71(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:50:20,648 INFO L765 garLoopResultBuilder]: At program point L7491-77(lines 7489 7495) the Hoare annotation is: true [2021-07-05 16:50:20,649 INFO L762 garLoopResultBuilder]: For program point L7491-76(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,649 INFO L762 garLoopResultBuilder]: For program point L7491-74(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,649 INFO L762 garLoopResultBuilder]: For program point L9145(lines 9145 9148) no Hoare annotation was computed. [2021-07-05 16:50:20,649 INFO L762 garLoopResultBuilder]: For program point L9145-2(lines 9145 9148) no Hoare annotation was computed. [2021-07-05 16:50:20,649 INFO L762 garLoopResultBuilder]: For program point L7494(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,649 INFO L762 garLoopResultBuilder]: For program point L7494-4(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,649 INFO L762 garLoopResultBuilder]: For program point L7494-3(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,649 INFO L762 garLoopResultBuilder]: For program point L7494-2(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,650 INFO L762 garLoopResultBuilder]: For program point L7494-8(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,650 INFO L762 garLoopResultBuilder]: For program point L7494-6(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,650 INFO L762 garLoopResultBuilder]: For program point L7494-12(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,650 INFO L762 garLoopResultBuilder]: For program point L7494-11(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,650 INFO L762 garLoopResultBuilder]: For program point L7494-9(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,650 INFO L762 garLoopResultBuilder]: For program point L6966(lines 6966 6972) no Hoare annotation was computed. [2021-07-05 16:50:20,650 INFO L762 garLoopResultBuilder]: For program point L7494-15(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,650 INFO L762 garLoopResultBuilder]: For program point L7494-13(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,651 INFO L762 garLoopResultBuilder]: For program point L7494-20(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,651 INFO L762 garLoopResultBuilder]: For program point L7494-18(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,651 INFO L762 garLoopResultBuilder]: For program point L7494-17(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,651 INFO L762 garLoopResultBuilder]: For program point L7494-24(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,651 INFO L762 garLoopResultBuilder]: For program point L7494-22(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,651 INFO L762 garLoopResultBuilder]: For program point L7494-21(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,651 INFO L762 garLoopResultBuilder]: For program point L7494-27(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,651 INFO L762 garLoopResultBuilder]: For program point L7494-26(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,652 INFO L762 garLoopResultBuilder]: For program point L7494-31(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,652 INFO L762 garLoopResultBuilder]: For program point L7494-30(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,652 INFO L762 garLoopResultBuilder]: For program point L7494-29(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,652 INFO L758 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:50:20,652 INFO L762 garLoopResultBuilder]: For program point L7494-36(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,652 INFO L765 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: true [2021-07-05 16:50:20,652 INFO L762 garLoopResultBuilder]: For program point L7494-35(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,653 INFO L765 garLoopResultBuilder]: At program point L261-2(line 261) the Hoare annotation is: true [2021-07-05 16:50:20,653 INFO L762 garLoopResultBuilder]: For program point L7494-33(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,653 INFO L762 garLoopResultBuilder]: For program point L7494-40(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,653 INFO L762 garLoopResultBuilder]: For program point L7494-39(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,653 INFO L762 garLoopResultBuilder]: For program point L7494-38(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,653 INFO L762 garLoopResultBuilder]: For program point L7494-44(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,653 INFO L762 garLoopResultBuilder]: For program point L7494-42(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,653 INFO L762 garLoopResultBuilder]: For program point L7494-48(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,654 INFO L762 garLoopResultBuilder]: For program point L7494-47(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,654 INFO L762 garLoopResultBuilder]: For program point L7494-45(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,654 INFO L762 garLoopResultBuilder]: For program point L7494-51(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,654 INFO L762 garLoopResultBuilder]: For program point L7494-49(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,654 INFO L762 garLoopResultBuilder]: For program point L7494-53(line 7494) no Hoare annotation was computed. [2021-07-05 16:50:20,654 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 16:50:20,654 INFO L762 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2021-07-05 16:50:20,654 INFO L765 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: true [2021-07-05 16:50:20,655 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:50:20,655 INFO L765 garLoopResultBuilder]: At program point L8192(lines 8175 8193) the Hoare annotation is: true [2021-07-05 16:50:20,655 INFO L765 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: true [2021-07-05 16:50:20,655 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-07-05 16:50:20,655 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 16:50:20,659 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/10) [2021-07-05 16:50:20,661 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 16:50:20,661 INFO L329 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 16:50:20,661 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 16:50:20,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 200 states have internal predecessors, (281), 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-07-05 16:50:20,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-07-05 16:50:20,664 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:50:20,664 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:50:20,665 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:50:20,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:50:20,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2021918312, now seen corresponding path program 1 times [2021-07-05 16:50:20,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:50:20,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512677892] [2021-07-05 16:50:20,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:50:20,666 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:50:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:50:20,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:20,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:20,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:20,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:20,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:50:20,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:50:20,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512677892] [2021-07-05 16:50:20,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512677892] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:50:20,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:50:20,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 16:50:20,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312105238] [2021-07-05 16:50:20,773 INFO L425 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-05 16:50:20,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:50:20,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-05 16:50:20,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-05 16:50:20,780 INFO L87 Difference]: Start difference. First operand has 201 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 200 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-07-05 16:50:20,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:50:20,783 INFO L93 Difference]: Finished difference Result 395 states and 553 transitions. [2021-07-05 16:50:20,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-05 16:50:20,784 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-07-05 16:50:20,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:50:20,784 INFO L225 Difference]: With dead ends: 395 [2021-07-05 16:50:20,784 INFO L226 Difference]: Without dead ends: 100 [2021-07-05 16:50:20,785 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-05 16:50:20,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-07-05 16:50:20,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-07-05 16:50:20,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.303030303030303) internal successors, (129), 99 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:50:20,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 129 transitions. [2021-07-05 16:50:20,787 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 129 transitions. Word has length 37 [2021-07-05 16:50:20,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:50:20,788 INFO L442 AbstractCegarLoop]: Abstraction has 100 states and 129 transitions. [2021-07-05 16:50:20,788 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-07-05 16:50:20,788 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2021-07-05 16:50:20,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-07-05 16:50:20,789 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:50:20,789 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:50:20,789 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-07-05 16:50:20,789 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:50:20,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:50:20,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1896080979, now seen corresponding path program 1 times [2021-07-05 16:50:20,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:50:20,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105064982] [2021-07-05 16:50:20,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:50:20,790 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:50:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:50:20,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:20,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:20,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:20,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:50:20,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:20,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-07-05 16:50:20,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:20,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:50:20,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:50:20,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105064982] [2021-07-05 16:50:20,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105064982] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:50:20,930 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:50:20,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:50:20,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900281251] [2021-07-05 16:50:20,931 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:50:20,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:50:20,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:50:20,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:50:20,932 INFO L87 Difference]: Start difference. First operand 100 states and 129 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-07-05 16:50:20,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:50:20,962 INFO L93 Difference]: Finished difference Result 177 states and 227 transitions. [2021-07-05 16:50:20,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:50:20,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-07-05 16:50:20,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:50:20,963 INFO L225 Difference]: With dead ends: 177 [2021-07-05 16:50:20,963 INFO L226 Difference]: Without dead ends: 100 [2021-07-05 16:50:20,964 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:50:20,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-07-05 16:50:20,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-07-05 16:50:20,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 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-07-05 16:50:20,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 128 transitions. [2021-07-05 16:50:20,966 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 128 transitions. Word has length 47 [2021-07-05 16:50:20,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:50:20,966 INFO L442 AbstractCegarLoop]: Abstraction has 100 states and 128 transitions. [2021-07-05 16:50:20,967 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-07-05 16:50:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 128 transitions. [2021-07-05 16:50:20,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-07-05 16:50:20,967 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:50:20,967 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:50:20,967 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-07-05 16:50:20,968 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:50:20,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:50:20,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1301530246, now seen corresponding path program 1 times [2021-07-05 16:50:20,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:50:20,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440636623] [2021-07-05 16:50:20,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:50:20,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:50:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:50:21,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:21,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:21,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:21,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:50:21,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:21,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:50:21,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:21,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:21,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:50:21,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:50:21,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440636623] [2021-07-05 16:50:21,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440636623] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:50:21,125 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:50:21,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:50:21,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229979972] [2021-07-05 16:50:21,126 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:50:21,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:50:21,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:50:21,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:50:21,127 INFO L87 Difference]: Start difference. First operand 100 states and 128 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-07-05 16:50:21,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:50:21,215 INFO L93 Difference]: Finished difference Result 252 states and 332 transitions. [2021-07-05 16:50:21,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:50:21,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-07-05 16:50:21,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:50:21,217 INFO L225 Difference]: With dead ends: 252 [2021-07-05 16:50:21,217 INFO L226 Difference]: Without dead ends: 166 [2021-07-05 16:50:21,217 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:50:21,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-07-05 16:50:21,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 106. [2021-07-05 16:50:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.276190476190476) internal successors, (134), 105 states have internal predecessors, (134), 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-07-05 16:50:21,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 134 transitions. [2021-07-05 16:50:21,220 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 134 transitions. Word has length 53 [2021-07-05 16:50:21,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:50:21,220 INFO L442 AbstractCegarLoop]: Abstraction has 106 states and 134 transitions. [2021-07-05 16:50:21,220 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-07-05 16:50:21,221 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 134 transitions. [2021-07-05 16:50:21,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-07-05 16:50:21,221 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:50:21,221 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:50:21,221 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-07-05 16:50:21,222 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:50:21,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:50:21,222 INFO L82 PathProgramCache]: Analyzing trace with hash -877883524, now seen corresponding path program 1 times [2021-07-05 16:50:21,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:50:21,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532147659] [2021-07-05 16:50:21,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:50:21,223 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:50:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:50:21,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:21,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:21,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:21,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:50:21,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:21,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:50:21,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:21,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:50:21,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:50:21,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532147659] [2021-07-05 16:50:21,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532147659] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:50:21,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:50:21,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:50:21,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578040330] [2021-07-05 16:50:21,356 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:50:21,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:50:21,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:50:21,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:50:21,357 INFO L87 Difference]: Start difference. First operand 106 states and 134 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-07-05 16:50:21,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:50:21,449 INFO L93 Difference]: Finished difference Result 218 states and 279 transitions. [2021-07-05 16:50:21,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:50:21,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-07-05 16:50:21,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:50:21,450 INFO L225 Difference]: With dead ends: 218 [2021-07-05 16:50:21,450 INFO L226 Difference]: Without dead ends: 136 [2021-07-05 16:50:21,451 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:50:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-07-05 16:50:21,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 112. [2021-07-05 16:50:21,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.2612612612612613) internal successors, (140), 111 states have internal predecessors, (140), 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-07-05 16:50:21,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 140 transitions. [2021-07-05 16:50:21,453 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 140 transitions. Word has length 53 [2021-07-05 16:50:21,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:50:21,453 INFO L442 AbstractCegarLoop]: Abstraction has 112 states and 140 transitions. [2021-07-05 16:50:21,453 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-07-05 16:50:21,453 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 140 transitions. [2021-07-05 16:50:21,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-07-05 16:50:21,454 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:50:21,454 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:50:21,454 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-07-05 16:50:21,454 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:50:21,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:50:21,454 INFO L82 PathProgramCache]: Analyzing trace with hash -404136968, now seen corresponding path program 1 times [2021-07-05 16:50:21,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:50:21,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314263511] [2021-07-05 16:50:21,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:50:21,455 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:50:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:50:21,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:21,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:21,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:21,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:50:21,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:21,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:50:21,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:21,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:50:21,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:21,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:50:21,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:21,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:21,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:21,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:50:21,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:50:21,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314263511] [2021-07-05 16:50:21,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314263511] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:50:21,624 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:50:21,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:50:21,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168897124] [2021-07-05 16:50:21,625 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:50:21,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:50:21,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:50:21,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:50:21,626 INFO L87 Difference]: Start difference. First operand 112 states and 140 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-07-05 16:50:21,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:50:21,714 INFO L93 Difference]: Finished difference Result 172 states and 214 transitions. [2021-07-05 16:50:21,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:50:21,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-07-05 16:50:21,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:50:21,715 INFO L225 Difference]: With dead ends: 172 [2021-07-05 16:50:21,715 INFO L226 Difference]: Without dead ends: 112 [2021-07-05 16:50:21,715 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.3ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-07-05 16:50:21,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-07-05 16:50:21,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-07-05 16:50:21,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.2432432432432432) internal successors, (138), 111 states have internal predecessors, (138), 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-07-05 16:50:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2021-07-05 16:50:21,718 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 53 [2021-07-05 16:50:21,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:50:21,718 INFO L442 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2021-07-05 16:50:21,718 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-07-05 16:50:21,718 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2021-07-05 16:50:21,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-07-05 16:50:21,719 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:50:21,719 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:50:21,719 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-07-05 16:50:21,719 INFO L374 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:50:21,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:50:21,719 INFO L82 PathProgramCache]: Analyzing trace with hash -861732606, now seen corresponding path program 1 times [2021-07-05 16:50:21,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:50:21,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309241025] [2021-07-05 16:50:21,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:50:21,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:50:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:50:21,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:21,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:21,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:21,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:50:21,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:21,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:50:21,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:21,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:21,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:50:21,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:50:21,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309241025] [2021-07-05 16:50:21,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309241025] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:50:21,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:50:21,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:50:21,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254262255] [2021-07-05 16:50:21,896 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:50:21,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:50:21,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:50:21,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:50:21,897 INFO L87 Difference]: Start difference. First operand 112 states and 138 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-07-05 16:50:21,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:50:21,919 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2021-07-05 16:50:21,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:50:21,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-07-05 16:50:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:50:21,921 INFO L225 Difference]: With dead ends: 136 [2021-07-05 16:50:21,921 INFO L226 Difference]: Without dead ends: 106 [2021-07-05 16:50:21,921 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:50:21,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-07-05 16:50:21,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-07-05 16:50:21,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 105 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:50:21,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2021-07-05 16:50:21,924 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 65 [2021-07-05 16:50:21,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:50:21,924 INFO L442 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2021-07-05 16:50:21,924 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-07-05 16:50:21,925 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2021-07-05 16:50:21,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-07-05 16:50:21,925 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:50:21,925 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:50:21,925 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-07-05 16:50:21,926 INFO L374 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:50:21,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:50:21,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1871151762, now seen corresponding path program 1 times [2021-07-05 16:50:21,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:50:21,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338324648] [2021-07-05 16:50:21,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:50:21,927 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:50:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:50:22,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:22,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:22,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:22,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:22,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:22,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:22,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:22,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:50:22,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:22,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:50:22,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:22,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:22,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:50:22,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:50:22,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338324648] [2021-07-05 16:50:22,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338324648] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:50:22,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:50:22,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-05 16:50:22,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600754760] [2021-07-05 16:50:22,177 INFO L425 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-05 16:50:22,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:50:22,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-05 16:50:22,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:50:22,178 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-07-05 16:50:22,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:50:22,287 INFO L93 Difference]: Finished difference Result 154 states and 181 transitions. [2021-07-05 16:50:22,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:50:22,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-07-05 16:50:22,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:50:22,289 INFO L225 Difference]: With dead ends: 154 [2021-07-05 16:50:22,289 INFO L226 Difference]: Without dead ends: 148 [2021-07-05 16:50:22,289 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 64.8ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:50:22,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-07-05 16:50:22,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 104. [2021-07-05 16:50:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.2233009708737863) internal successors, (126), 103 states have internal predecessors, (126), 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-07-05 16:50:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2021-07-05 16:50:22,292 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 68 [2021-07-05 16:50:22,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:50:22,292 INFO L442 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2021-07-05 16:50:22,293 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-07-05 16:50:22,293 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2021-07-05 16:50:22,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-07-05 16:50:22,293 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:50:22,294 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:50:22,294 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-07-05 16:50:22,294 INFO L374 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:50:22,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:50:22,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1911796762, now seen corresponding path program 1 times [2021-07-05 16:50:22,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:50:22,295 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918030272] [2021-07-05 16:50:22,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:50:22,295 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:50:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:50:22,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:22,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:22,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:22,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-05 16:50:22,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:22,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:50:22,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:22,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:50:22,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:22,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:50:22,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:50:22,529 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918030272] [2021-07-05 16:50:22,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918030272] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:50:22,529 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:50:22,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:50:22,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831838747] [2021-07-05 16:50:22,530 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:50:22,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:50:22,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:50:22,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:50:22,531 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-07-05 16:50:24,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:50:24,866 INFO L93 Difference]: Finished difference Result 284 states and 342 transitions. [2021-07-05 16:50:24,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:50:24,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-07-05 16:50:24,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:50:24,867 INFO L225 Difference]: With dead ends: 284 [2021-07-05 16:50:24,867 INFO L226 Difference]: Without dead ends: 201 [2021-07-05 16:50:24,868 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 39.9ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:50:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-07-05 16:50:24,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 113. [2021-07-05 16:50:24,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.2053571428571428) internal successors, (135), 112 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:50:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2021-07-05 16:50:24,871 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 72 [2021-07-05 16:50:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:50:24,872 INFO L442 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2021-07-05 16:50:24,872 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-07-05 16:50:24,872 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2021-07-05 16:50:24,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-07-05 16:50:24,873 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:50:24,873 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:50:24,873 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-07-05 16:50:24,873 INFO L374 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:50:24,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:50:24,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1231738392, now seen corresponding path program 1 times [2021-07-05 16:50:24,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:50:24,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164398417] [2021-07-05 16:50:24,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:50:24,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:50:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:50:26,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:26,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:26,586 INFO L142 QuantifierPusher]: treesize reduction 17, result has 37.0 percent of original size [2021-07-05 16:50:26,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:50:26,599 INFO L142 QuantifierPusher]: treesize reduction 17, result has 45.2 percent of original size [2021-07-05 16:50:26,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:50:26,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:26,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:50:26,635 INFO L142 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-07-05 16:50:26,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:50:26,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:26,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:50:26,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:26,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:50:26,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:26,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:50:26,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:50:26,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164398417] [2021-07-05 16:50:26,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164398417] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:50:26,688 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:50:26,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:50:26,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128880405] [2021-07-05 16:50:26,688 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 16:50:26,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:50:26,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 16:50:26,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:50:26,689 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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-07-05 16:50:31,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:50:31,216 INFO L93 Difference]: Finished difference Result 256 states and 303 transitions. [2021-07-05 16:50:31,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-05 16:50:31,217 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-07-05 16:50:31,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:50:31,217 INFO L225 Difference]: With dead ends: 256 [2021-07-05 16:50:31,217 INFO L226 Difference]: Without dead ends: 172 [2021-07-05 16:50:31,218 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 255.9ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-07-05 16:50:31,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-07-05 16:50:31,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 111. [2021-07-05 16:50:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.2) internal successors, (132), 110 states have internal predecessors, (132), 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-07-05 16:50:31,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 132 transitions. [2021-07-05 16:50:31,221 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 132 transitions. Word has length 72 [2021-07-05 16:50:31,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:50:31,221 INFO L442 AbstractCegarLoop]: Abstraction has 111 states and 132 transitions. [2021-07-05 16:50:31,222 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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-07-05 16:50:31,222 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 132 transitions. [2021-07-05 16:50:31,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-05 16:50:31,222 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:50:31,222 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:50:31,222 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-07-05 16:50:31,222 INFO L374 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:50:31,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:50:31,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1271081116, now seen corresponding path program 1 times [2021-07-05 16:50:31,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:50:31,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689670860] [2021-07-05 16:50:31,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:50:31,223 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:50:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:50:31,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:31,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:31,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:31,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:50:31,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:31,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:50:31,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:31,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:50:31,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:31,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:50:31,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:31,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:50:31,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:31,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:50:31,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:31,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:50:31,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:31,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:50:31,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:31,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:50:31,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:50:31,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689670860] [2021-07-05 16:50:31,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689670860] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:50:31,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:50:31,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-05 16:50:31,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997461481] [2021-07-05 16:50:31,590 INFO L425 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-05 16:50:31,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:50:31,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-05 16:50:31,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:50:31,591 INFO L87 Difference]: Start difference. First operand 111 states and 132 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:50:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:50:40,666 INFO L93 Difference]: Finished difference Result 314 states and 375 transitions. [2021-07-05 16:50:40,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-07-05 16:50:40,667 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-07-05 16:50:40,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:50:40,668 INFO L225 Difference]: With dead ends: 314 [2021-07-05 16:50:40,668 INFO L226 Difference]: Without dead ends: 250 [2021-07-05 16:50:40,669 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 451.8ms TimeCoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2021-07-05 16:50:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-07-05 16:50:40,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 177. [2021-07-05 16:50:40,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.1875) internal successors, (209), 176 states have internal predecessors, (209), 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-07-05 16:50:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 209 transitions. [2021-07-05 16:50:40,675 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 209 transitions. Word has length 76 [2021-07-05 16:50:40,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:50:40,675 INFO L442 AbstractCegarLoop]: Abstraction has 177 states and 209 transitions. [2021-07-05 16:50:40,675 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:50:40,675 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 209 transitions. [2021-07-05 16:50:40,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-05 16:50:40,676 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:50:40,676 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:50:40,676 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-07-05 16:50:40,677 INFO L374 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:50:40,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:50:40,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1062311522, now seen corresponding path program 1 times [2021-07-05 16:50:40,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:50:40,677 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173825969] [2021-07-05 16:50:40,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:50:40,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:50:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:50:40,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:40,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:40,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:40,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-07-05 16:50:40,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:40,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-05 16:50:40,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:40,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:40,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:40,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:50:40,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:50:40,916 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173825969] [2021-07-05 16:50:40,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173825969] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:50:40,916 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:50:40,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:50:40,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131451248] [2021-07-05 16:50:40,917 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:50:40,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:50:40,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:50:40,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:50:40,918 INFO L87 Difference]: Start difference. First operand 177 states and 209 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:50:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:50:43,205 INFO L93 Difference]: Finished difference Result 407 states and 480 transitions. [2021-07-05 16:50:43,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:50:43,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-07-05 16:50:43,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:50:43,206 INFO L225 Difference]: With dead ends: 407 [2021-07-05 16:50:43,206 INFO L226 Difference]: Without dead ends: 276 [2021-07-05 16:50:43,207 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 29.8ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:50:43,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-07-05 16:50:43,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 177. [2021-07-05 16:50:43,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.1647727272727273) internal successors, (205), 176 states have internal predecessors, (205), 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-07-05 16:50:43,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 205 transitions. [2021-07-05 16:50:43,213 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 205 transitions. Word has length 76 [2021-07-05 16:50:43,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:50:43,213 INFO L442 AbstractCegarLoop]: Abstraction has 177 states and 205 transitions. [2021-07-05 16:50:43,213 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:50:43,213 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2021-07-05 16:50:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-05 16:50:43,214 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:50:43,214 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:50:43,214 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-07-05 16:50:43,214 INFO L374 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:50:43,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:50:43,215 INFO L82 PathProgramCache]: Analyzing trace with hash -275951198, now seen corresponding path program 1 times [2021-07-05 16:50:43,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:50:43,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182357456] [2021-07-05 16:50:43,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:50:43,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:50:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:50:43,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:43,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:43,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:43,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:50:43,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:43,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:50:43,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:43,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:50:43,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:43,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:50:43,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:43,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:50:43,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:43,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:50:43,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:50:43,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182357456] [2021-07-05 16:50:43,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182357456] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:50:43,486 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:50:43,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:50:43,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735278660] [2021-07-05 16:50:43,486 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:50:43,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:50:43,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:50:43,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:50:43,487 INFO L87 Difference]: Start difference. First operand 177 states and 205 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:50:43,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:50:43,642 INFO L93 Difference]: Finished difference Result 303 states and 348 transitions. [2021-07-05 16:50:43,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 16:50:43,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-07-05 16:50:43,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:50:43,643 INFO L225 Difference]: With dead ends: 303 [2021-07-05 16:50:43,644 INFO L226 Difference]: Without dead ends: 154 [2021-07-05 16:50:43,644 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 80.2ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:50:43,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-07-05 16:50:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 111. [2021-07-05 16:50:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.1636363636363636) internal successors, (128), 110 states have internal predecessors, (128), 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-07-05 16:50:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 128 transitions. [2021-07-05 16:50:43,648 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 128 transitions. Word has length 76 [2021-07-05 16:50:43,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:50:43,648 INFO L442 AbstractCegarLoop]: Abstraction has 111 states and 128 transitions. [2021-07-05 16:50:43,649 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:50:43,649 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2021-07-05 16:50:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-07-05 16:50:43,649 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:50:43,650 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:50:43,650 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-07-05 16:50:43,650 INFO L374 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:50:43,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:50:43,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1194659401, now seen corresponding path program 1 times [2021-07-05 16:50:43,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:50:43,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823415393] [2021-07-05 16:50:43,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:50:43,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:50:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:50:45,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:45,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:45,435 INFO L142 QuantifierPusher]: treesize reduction 17, result has 37.0 percent of original size [2021-07-05 16:50:45,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:50:45,445 INFO L142 QuantifierPusher]: treesize reduction 17, result has 45.2 percent of original size [2021-07-05 16:50:45,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:50:45,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:45,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:50:45,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:45,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:50:45,484 INFO L142 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-07-05 16:50:45,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:50:45,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:45,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:50:45,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:45,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:50:45,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:45,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:45,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:50:45,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:50:45,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823415393] [2021-07-05 16:50:45,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823415393] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:50:45,517 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:50:45,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-05 16:50:45,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676974012] [2021-07-05 16:50:45,517 INFO L425 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-05 16:50:45,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:50:45,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-05 16:50:45,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-07-05 16:50:45,518 INFO L87 Difference]: Start difference. First operand 111 states and 128 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:50:52,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:50:52,025 INFO L93 Difference]: Finished difference Result 208 states and 238 transitions. [2021-07-05 16:50:52,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-05 16:50:52,025 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-07-05 16:50:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:50:52,026 INFO L225 Difference]: With dead ends: 208 [2021-07-05 16:50:52,026 INFO L226 Difference]: Without dead ends: 152 [2021-07-05 16:50:52,026 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 249.7ms TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2021-07-05 16:50:52,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-07-05 16:50:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 109. [2021-07-05 16:50:52,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.1574074074074074) internal successors, (125), 108 states have internal predecessors, (125), 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-07-05 16:50:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2021-07-05 16:50:52,030 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 78 [2021-07-05 16:50:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:50:52,031 INFO L442 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2021-07-05 16:50:52,031 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:50:52,031 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2021-07-05 16:50:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-05 16:50:52,032 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:50:52,032 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:50:52,032 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-07-05 16:50:52,032 INFO L374 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:50:52,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:50:52,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1715455293, now seen corresponding path program 1 times [2021-07-05 16:50:52,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:50:52,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833192129] [2021-07-05 16:50:52,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:50:52,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:50:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:50:52,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:52,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:52,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:52,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:50:52,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:52,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:50:52,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:52,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:50:52,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:52,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:50:52,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:52,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-07-05 16:50:52,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:52,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:52,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:50:52,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:50:52,286 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833192129] [2021-07-05 16:50:52,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833192129] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:50:52,286 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:50:52,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:50:52,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140859599] [2021-07-05 16:50:52,287 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:50:52,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:50:52,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:50:52,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:50:52,288 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-07-05 16:50:52,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:50:52,433 INFO L93 Difference]: Finished difference Result 173 states and 196 transitions. [2021-07-05 16:50:52,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 16:50:52,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-07-05 16:50:52,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:50:52,435 INFO L225 Difference]: With dead ends: 173 [2021-07-05 16:50:52,435 INFO L226 Difference]: Without dead ends: 116 [2021-07-05 16:50:52,435 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 81.5ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:50:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-07-05 16:50:52,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2021-07-05 16:50:52,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.1481481481481481) internal successors, (124), 108 states have internal predecessors, (124), 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-07-05 16:50:52,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2021-07-05 16:50:52,438 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 82 [2021-07-05 16:50:52,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:50:52,439 INFO L442 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2021-07-05 16:50:52,439 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-07-05 16:50:52,439 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2021-07-05 16:50:52,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-07-05 16:50:52,439 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:50:52,439 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:50:52,439 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-07-05 16:50:52,440 INFO L374 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:50:52,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:50:52,440 INFO L82 PathProgramCache]: Analyzing trace with hash 702537474, now seen corresponding path program 1 times [2021-07-05 16:50:52,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:50:52,440 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279807399] [2021-07-05 16:50:52,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:50:52,440 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:50:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:50:52,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:52,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:52,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:52,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:50:52,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:52,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:50:52,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:52,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:50:52,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:50:52,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279807399] [2021-07-05 16:50:52,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279807399] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:50:52,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:50:52,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:50:52,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322515393] [2021-07-05 16:50:52,579 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:50:52,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:50:52,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:50:52,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:50:52,580 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-07-05 16:50:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:50:52,642 INFO L93 Difference]: Finished difference Result 206 states and 234 transitions. [2021-07-05 16:50:52,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:50:52,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-07-05 16:50:52,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:50:52,643 INFO L225 Difference]: With dead ends: 206 [2021-07-05 16:50:52,643 INFO L226 Difference]: Without dead ends: 107 [2021-07-05 16:50:52,643 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:50:52,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-07-05 16:50:52,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2021-07-05 16:50:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.12) internal successors, (112), 100 states have internal predecessors, (112), 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-07-05 16:50:52,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2021-07-05 16:50:52,647 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 84 [2021-07-05 16:50:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:50:52,647 INFO L442 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2021-07-05 16:50:52,647 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-07-05 16:50:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2021-07-05 16:50:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-07-05 16:50:52,648 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:50:52,648 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:50:52,648 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-07-05 16:50:52,648 INFO L374 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:50:52,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:50:52,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1473657288, now seen corresponding path program 1 times [2021-07-05 16:50:52,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:50:52,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653683795] [2021-07-05 16:50:52,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:50:52,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:50:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:50:54,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:54,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:54,502 INFO L142 QuantifierPusher]: treesize reduction 15, result has 40.0 percent of original size [2021-07-05 16:50:54,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:50:54,511 INFO L142 QuantifierPusher]: treesize reduction 15, result has 51.6 percent of original size [2021-07-05 16:50:54,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-07-05 16:50:54,527 INFO L142 QuantifierPusher]: treesize reduction 15, result has 65.1 percent of original size [2021-07-05 16:50:54,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-07-05 16:50:54,544 INFO L142 QuantifierPusher]: treesize reduction 15, result has 71.7 percent of original size [2021-07-05 16:50:54,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-07-05 16:50:54,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:54,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-07-05 16:50:54,565 INFO L142 QuantifierPusher]: treesize reduction 10, result has 68.8 percent of original size [2021-07-05 16:50:54,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-05 16:50:54,582 INFO L142 QuantifierPusher]: treesize reduction 10, result has 50.0 percent of original size [2021-07-05 16:50:54,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:50:54,600 INFO L142 QuantifierPusher]: treesize reduction 12, result has 7.7 percent of original size [2021-07-05 16:50:54,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:54,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:50:54,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:50:54,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:50:54,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:50:54,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653683795] [2021-07-05 16:50:54,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653683795] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:50:54,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:50:54,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:50:54,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924571635] [2021-07-05 16:50:54,603 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 16:50:54,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:50:54,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 16:50:54,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:50:54,604 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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-07-05 16:51:00,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:51:00,933 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2021-07-05 16:51:00,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 16:51:00,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-07-05 16:51:00,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:51:00,934 INFO L225 Difference]: With dead ends: 197 [2021-07-05 16:51:00,934 INFO L226 Difference]: Without dead ends: 101 [2021-07-05 16:51:00,934 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 132.6ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:51:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-07-05 16:51:00,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-07-05 16:51:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.11) internal successors, (111), 100 states have internal predecessors, (111), 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-07-05 16:51:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2021-07-05 16:51:00,938 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 84 [2021-07-05 16:51:00,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:51:00,938 INFO L442 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2021-07-05 16:51:00,938 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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-07-05 16:51:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2021-07-05 16:51:00,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-05 16:51:00,939 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:51:00,939 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:51:00,939 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-07-05 16:51:00,939 INFO L374 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:51:00,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:51:00,940 INFO L82 PathProgramCache]: Analyzing trace with hash 803072453, now seen corresponding path program 1 times [2021-07-05 16:51:00,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:51:00,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377927501] [2021-07-05 16:51:00,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:51:00,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:51:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:51:04,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:04,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:04,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:04,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:51:04,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:04,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:51:04,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:04,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-07-05 16:51:04,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:04,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-07-05 16:51:04,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:04,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-05 16:51:04,463 INFO L142 QuantifierPusher]: treesize reduction 5, result has 88.4 percent of original size [2021-07-05 16:51:04,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-07-05 16:51:04,490 INFO L142 QuantifierPusher]: treesize reduction 5, result has 87.2 percent of original size [2021-07-05 16:51:04,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-05 16:51:04,525 INFO L142 QuantifierPusher]: treesize reduction 5, result has 82.1 percent of original size [2021-07-05 16:51:04,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-05 16:51:04,548 INFO L142 QuantifierPusher]: treesize reduction 9, result has 75.0 percent of original size [2021-07-05 16:51:04,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-07-05 16:51:04,571 INFO L142 QuantifierPusher]: treesize reduction 9, result has 40.0 percent of original size [2021-07-05 16:51:04,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-07-05 16:51:04,590 INFO L142 QuantifierPusher]: treesize reduction 12, result has 7.7 percent of original size [2021-07-05 16:51:04,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:04,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:04,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:04,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:51:04,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:51:04,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377927501] [2021-07-05 16:51:04,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377927501] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:51:04,592 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:51:04,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-05 16:51:04,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814542844] [2021-07-05 16:51:04,593 INFO L425 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-05 16:51:04,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:51:04,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-05 16:51:04,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-07-05 16:51:04,593 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 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-07-05 16:51:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:51:11,177 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2021-07-05 16:51:11,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-05 16:51:11,178 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-07-05 16:51:11,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:51:11,179 INFO L225 Difference]: With dead ends: 141 [2021-07-05 16:51:11,179 INFO L226 Difference]: Without dead ends: 127 [2021-07-05 16:51:11,179 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 361.0ms TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2021-07-05 16:51:11,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-07-05 16:51:11,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2021-07-05 16:51:11,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.1) internal successors, (121), 110 states have internal predecessors, (121), 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-07-05 16:51:11,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2021-07-05 16:51:11,183 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 85 [2021-07-05 16:51:11,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:51:11,184 INFO L442 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2021-07-05 16:51:11,184 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 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-07-05 16:51:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2021-07-05 16:51:11,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-05 16:51:11,184 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:51:11,184 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:51:11,185 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-07-05 16:51:11,185 INFO L374 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:51:11,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:51:11,185 INFO L82 PathProgramCache]: Analyzing trace with hash -629937729, now seen corresponding path program 1 times [2021-07-05 16:51:11,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:51:11,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381798873] [2021-07-05 16:51:11,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:51:11,186 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:51:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:51:11,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:11,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:11,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:11,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:51:11,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:11,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-07-05 16:51:11,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:11,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:51:11,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:11,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:51:11,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:11,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:51:11,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:11,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-07-05 16:51:11,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:11,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-07-05 16:51:11,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:11,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-07-05 16:51:11,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:11,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-07-05 16:51:11,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:11,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:11,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:11,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:11,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:11,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:51:11,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:51:11,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381798873] [2021-07-05 16:51:11,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381798873] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:51:11,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:51:11,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-05 16:51:11,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33884028] [2021-07-05 16:51:11,679 INFO L425 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-05 16:51:11,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:51:11,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-05 16:51:11,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-07-05 16:51:11,680 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 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-07-05 16:51:20,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:51:20,540 INFO L93 Difference]: Finished difference Result 198 states and 214 transitions. [2021-07-05 16:51:20,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-05 16:51:20,540 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-07-05 16:51:20,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:51:20,541 INFO L225 Difference]: With dead ends: 198 [2021-07-05 16:51:20,541 INFO L226 Difference]: Without dead ends: 191 [2021-07-05 16:51:20,541 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 348.2ms TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2021-07-05 16:51:20,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-07-05 16:51:20,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 176. [2021-07-05 16:51:20,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.0971428571428572) internal successors, (192), 175 states have internal predecessors, (192), 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-07-05 16:51:20,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 192 transitions. [2021-07-05 16:51:20,548 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 192 transitions. Word has length 85 [2021-07-05 16:51:20,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:51:20,548 INFO L442 AbstractCegarLoop]: Abstraction has 176 states and 192 transitions. [2021-07-05 16:51:20,549 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 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-07-05 16:51:20,549 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 192 transitions. [2021-07-05 16:51:20,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-05 16:51:20,550 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:51:20,550 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:51:20,550 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-07-05 16:51:20,550 INFO L374 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:51:20,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:51:20,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1361905155, now seen corresponding path program 1 times [2021-07-05 16:51:20,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:51:20,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977141790] [2021-07-05 16:51:20,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:51:20,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:51:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:51:20,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:20,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:20,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:20,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:51:20,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:20,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-07-05 16:51:20,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:20,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-07-05 16:51:20,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:20,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-07-05 16:51:20,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:20,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-07-05 16:51:20,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:20,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:51:20,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:20,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:51:20,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:20,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:51:20,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:20,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:51:20,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:20,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:51:20,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:51:20,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977141790] [2021-07-05 16:51:20,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977141790] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:51:20,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:51:20,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:51:20,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483359513] [2021-07-05 16:51:20,926 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 16:51:20,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:51:20,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 16:51:20,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:51:20,927 INFO L87 Difference]: Start difference. First operand 176 states and 192 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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-07-05 16:51:27,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:51:27,476 INFO L93 Difference]: Finished difference Result 262 states and 287 transitions. [2021-07-05 16:51:27,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 16:51:27,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-07-05 16:51:27,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:51:27,478 INFO L225 Difference]: With dead ends: 262 [2021-07-05 16:51:27,478 INFO L226 Difference]: Without dead ends: 192 [2021-07-05 16:51:27,478 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 154.1ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-07-05 16:51:27,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-07-05 16:51:27,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 184. [2021-07-05 16:51:27,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.092896174863388) internal successors, (200), 183 states have internal predecessors, (200), 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-07-05 16:51:27,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 200 transitions. [2021-07-05 16:51:27,486 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 200 transitions. Word has length 85 [2021-07-05 16:51:27,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:51:27,487 INFO L442 AbstractCegarLoop]: Abstraction has 184 states and 200 transitions. [2021-07-05 16:51:27,487 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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-07-05 16:51:27,487 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 200 transitions. [2021-07-05 16:51:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-05 16:51:27,488 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:51:27,488 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:51:27,488 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-07-05 16:51:27,488 INFO L374 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:51:27,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:51:27,488 INFO L82 PathProgramCache]: Analyzing trace with hash -468418817, now seen corresponding path program 1 times [2021-07-05 16:51:27,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:51:27,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871001098] [2021-07-05 16:51:27,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:51:27,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:51:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:51:30,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:30,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:30,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:30,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:51:30,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:30,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:51:30,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:30,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-07-05 16:51:30,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:30,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-05 16:51:30,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:30,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-05 16:51:30,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:30,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-07-05 16:51:30,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:30,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:51:30,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:30,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:51:30,904 INFO L142 QuantifierPusher]: treesize reduction 15, result has 70.6 percent of original size [2021-07-05 16:51:30,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-07-05 16:51:30,930 INFO L142 QuantifierPusher]: treesize reduction 15, result has 80.3 percent of original size [2021-07-05 16:51:30,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-07-05 16:51:30,945 INFO L142 QuantifierPusher]: treesize reduction 15, result has 89.8 percent of original size [2021-07-05 16:51:30,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 132 [2021-07-05 16:51:31,015 INFO L142 QuantifierPusher]: treesize reduction 15, result has 89.8 percent of original size [2021-07-05 16:51:31,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 132 [2021-07-05 16:51:31,087 INFO L142 QuantifierPusher]: treesize reduction 15, result has 76.2 percent of original size [2021-07-05 16:51:31,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-07-05 16:51:31,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:31,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-07-05 16:51:31,155 INFO L142 QuantifierPusher]: treesize reduction 9, result has 82.4 percent of original size [2021-07-05 16:51:31,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-07-05 16:51:31,184 INFO L142 QuantifierPusher]: treesize reduction 9, result has 83.0 percent of original size [2021-07-05 16:51:31,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-07-05 16:51:31,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:31,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:31,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:31,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:31,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:31,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:31,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:51:31,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:51:31,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871001098] [2021-07-05 16:51:31,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871001098] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:51:31,253 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:51:31,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-05 16:51:31,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385830364] [2021-07-05 16:51:31,253 INFO L425 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-05 16:51:31,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:51:31,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-05 16:51:31,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-07-05 16:51:31,254 INFO L87 Difference]: Start difference. First operand 184 states and 200 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 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-07-05 16:51:40,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:51:40,142 INFO L93 Difference]: Finished difference Result 203 states and 218 transitions. [2021-07-05 16:51:40,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-05 16:51:40,143 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-07-05 16:51:40,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:51:40,144 INFO L225 Difference]: With dead ends: 203 [2021-07-05 16:51:40,144 INFO L226 Difference]: Without dead ends: 196 [2021-07-05 16:51:40,145 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 677.9ms TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2021-07-05 16:51:40,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-07-05 16:51:40,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 184. [2021-07-05 16:51:40,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.0874316939890711) internal successors, (199), 183 states have internal predecessors, (199), 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-07-05 16:51:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2021-07-05 16:51:40,153 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 85 [2021-07-05 16:51:40,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:51:40,153 INFO L442 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2021-07-05 16:51:40,153 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 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-07-05 16:51:40,153 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2021-07-05 16:51:40,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-05 16:51:40,154 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:51:40,154 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:51:40,154 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-07-05 16:51:40,154 INFO L374 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:51:40,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:51:40,155 INFO L82 PathProgramCache]: Analyzing trace with hash 527981240, now seen corresponding path program 1 times [2021-07-05 16:51:40,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:51:40,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650707962] [2021-07-05 16:51:40,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:51:40,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:51:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:51:40,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:40,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:40,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:40,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:51:40,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:40,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:51:40,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:40,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-07-05 16:51:40,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:40,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:51:40,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:40,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:51:40,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:40,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:51:40,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:40,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-07-05 16:51:40,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:40,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:51:40,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:40,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:51:40,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:40,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:40,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:40,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:51:40,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:51:40,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650707962] [2021-07-05 16:51:40,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650707962] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:51:40,589 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:51:40,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-05 16:51:40,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399303121] [2021-07-05 16:51:40,590 INFO L425 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-05 16:51:40,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:51:40,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-05 16:51:40,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-07-05 16:51:40,590 INFO L87 Difference]: Start difference. First operand 184 states and 199 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 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-07-05 16:51:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:51:47,192 INFO L93 Difference]: Finished difference Result 280 states and 303 transitions. [2021-07-05 16:51:47,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-05 16:51:47,193 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-07-05 16:51:47,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:51:47,194 INFO L225 Difference]: With dead ends: 280 [2021-07-05 16:51:47,194 INFO L226 Difference]: Without dead ends: 203 [2021-07-05 16:51:47,194 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 249.0ms TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2021-07-05 16:51:47,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-07-05 16:51:47,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 185. [2021-07-05 16:51:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.0815217391304348) internal successors, (199), 184 states have internal predecessors, (199), 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-07-05 16:51:47,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 199 transitions. [2021-07-05 16:51:47,204 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 199 transitions. Word has length 87 [2021-07-05 16:51:47,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:51:47,204 INFO L442 AbstractCegarLoop]: Abstraction has 185 states and 199 transitions. [2021-07-05 16:51:47,204 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 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-07-05 16:51:47,205 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 199 transitions. [2021-07-05 16:51:47,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-05 16:51:47,205 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:51:47,205 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:51:47,206 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-07-05 16:51:47,206 INFO L374 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:51:47,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:51:47,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1337327866, now seen corresponding path program 1 times [2021-07-05 16:51:47,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:51:47,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078932818] [2021-07-05 16:51:47,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:51:47,207 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:51:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:51:47,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:47,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:47,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:47,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:47,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:47,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:47,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:47,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:47,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:47,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:47,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:47,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:51:47,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:47,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:51:47,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:47,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:47,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:51:47,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:51:47,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078932818] [2021-07-05 16:51:47,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078932818] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:51:47,456 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:51:47,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:51:47,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120699448] [2021-07-05 16:51:47,457 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 16:51:47,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:51:47,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 16:51:47,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:51:47,458 INFO L87 Difference]: Start difference. First operand 185 states and 199 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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-07-05 16:51:47,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:51:47,639 INFO L93 Difference]: Finished difference Result 201 states and 214 transitions. [2021-07-05 16:51:47,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 16:51:47,640 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-07-05 16:51:47,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:51:47,641 INFO L225 Difference]: With dead ends: 201 [2021-07-05 16:51:47,641 INFO L226 Difference]: Without dead ends: 171 [2021-07-05 16:51:47,641 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 128.6ms TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-07-05 16:51:47,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-07-05 16:51:47,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 162. [2021-07-05 16:51:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.062111801242236) internal successors, (171), 161 states have internal predecessors, (171), 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-07-05 16:51:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 171 transitions. [2021-07-05 16:51:47,647 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 171 transitions. Word has length 87 [2021-07-05 16:51:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:51:47,647 INFO L442 AbstractCegarLoop]: Abstraction has 162 states and 171 transitions. [2021-07-05 16:51:47,647 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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-07-05 16:51:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions. [2021-07-05 16:51:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-05 16:51:47,648 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:51:47,648 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:51:47,648 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-07-05 16:51:47,648 INFO L374 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:51:47,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:51:47,649 INFO L82 PathProgramCache]: Analyzing trace with hash 772483113, now seen corresponding path program 1 times [2021-07-05 16:51:47,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:51:47,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332872521] [2021-07-05 16:51:47,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:51:47,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:51:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:51:47,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:47,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:47,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:47,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:51:47,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:47,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:51:47,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:47,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:51:47,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:47,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:51:47,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:47,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:47,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:51:47,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:51:47,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332872521] [2021-07-05 16:51:47,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332872521] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:51:47,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:51:47,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-05 16:51:47,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331829301] [2021-07-05 16:51:47,783 INFO L425 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-05 16:51:47,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:51:47,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-05 16:51:47,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:51:47,783 INFO L87 Difference]: Start difference. First operand 162 states and 171 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-07-05 16:51:47,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:51:47,839 INFO L93 Difference]: Finished difference Result 187 states and 195 transitions. [2021-07-05 16:51:47,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:51:47,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-07-05 16:51:47,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:51:47,840 INFO L225 Difference]: With dead ends: 187 [2021-07-05 16:51:47,840 INFO L226 Difference]: Without dead ends: 92 [2021-07-05 16:51:47,840 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 44.4ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-07-05 16:51:47,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-07-05 16:51:47,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-07-05 16:51:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.032967032967033) internal successors, (94), 91 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:51:47,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2021-07-05 16:51:47,844 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 87 [2021-07-05 16:51:47,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:51:47,844 INFO L442 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2021-07-05 16:51:47,846 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-07-05 16:51:47,846 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2021-07-05 16:51:47,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-05 16:51:47,846 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:51:47,846 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:51:47,846 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-07-05 16:51:47,847 INFO L374 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:51:47,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:51:47,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1128833016, now seen corresponding path program 1 times [2021-07-05 16:51:47,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:51:47,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941821778] [2021-07-05 16:51:47,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:51:47,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:51:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:51:49,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:49,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:49,686 INFO L142 QuantifierPusher]: treesize reduction 17, result has 37.0 percent of original size [2021-07-05 16:51:49,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:51:49,697 INFO L142 QuantifierPusher]: treesize reduction 17, result has 45.2 percent of original size [2021-07-05 16:51:49,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:51:49,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:49,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:51:49,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:49,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:51:49,738 INFO L142 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-07-05 16:51:49,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:51:49,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:49,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:49,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:49,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:49,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:49,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:49,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:49,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:49,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:49,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:51:49,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:49,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:51:49,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:49,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:51:49,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:51:49,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941821778] [2021-07-05 16:51:49,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941821778] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:51:49,875 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:51:49,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-05 16:51:49,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295652374] [2021-07-05 16:51:49,875 INFO L425 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-05 16:51:49,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:51:49,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-05 16:51:49,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2021-07-05 16:51:49,876 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 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-07-05 16:51:56,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:51:56,628 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2021-07-05 16:51:56,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-07-05 16:51:56,628 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-07-05 16:51:56,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:51:56,629 INFO L225 Difference]: With dead ends: 92 [2021-07-05 16:51:56,629 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 16:51:56,629 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 544.7ms TimeCoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2021-07-05 16:51:56,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 16:51:56,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 16:51:56,630 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-07-05 16:51:56,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 16:51:56,630 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2021-07-05 16:51:56,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:51:56,630 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 16:51:56,630 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 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-07-05 16:51:56,631 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 16:51:56,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 16:51:56,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 16:51:56,640 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,641 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,666 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,715 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,766 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,774 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:56,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:51:57,009 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 71 [2021-07-05 16:51:57,348 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 69 [2021-07-05 16:51:57,592 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 73 [2021-07-05 16:51:57,933 WARN L205 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 72 [2021-07-05 16:51:58,222 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 50 [2021-07-05 16:51:58,539 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 65 [2021-07-05 16:51:58,717 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2021-07-05 16:51:58,973 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 14 [2021-07-05 16:51:59,230 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 58 [2021-07-05 16:51:59,474 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 58 [2021-07-05 16:51:59,721 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 58 [2021-07-05 16:51:59,722 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,722 INFO L762 garLoopResultBuilder]: For program point L9153(lines 9153 9155) no Hoare annotation was computed. [2021-07-05 16:51:59,722 INFO L762 garLoopResultBuilder]: For program point L9153-2(lines 9153 9155) no Hoare annotation was computed. [2021-07-05 16:51:59,722 INFO L762 garLoopResultBuilder]: For program point L6973(lines 6973 6978) no Hoare annotation was computed. [2021-07-05 16:51:59,722 INFO L758 garLoopResultBuilder]: At program point L268(line 268) the Hoare annotation is: (let ((.cse1 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (let ((.cse0 (select .cse1 12))) (<= .cse0 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse0) 4294967296))))) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (let ((.cse2 (select .cse1 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (<= .cse2 (let ((.cse3 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse3 (- 1)) (* (div .cse2 4294967296) 4294967296) 4294967295) 4294967296)) .cse3)))) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) [2021-07-05 16:51:59,722 INFO L762 garLoopResultBuilder]: For program point L6974(lines 6974 6976) no Hoare annotation was computed. [2021-07-05 16:51:59,722 INFO L762 garLoopResultBuilder]: For program point L6974-2(lines 6974 6976) no Hoare annotation was computed. [2021-07-05 16:51:59,722 INFO L762 garLoopResultBuilder]: For program point L7141-2(line 7141) no Hoare annotation was computed. [2021-07-05 16:51:59,722 INFO L762 garLoopResultBuilder]: For program point L7141(line 7141) no Hoare annotation was computed. [2021-07-05 16:51:59,723 INFO L765 garLoopResultBuilder]: At program point L9157(line 9157) the Hoare annotation is: true [2021-07-05 16:51:59,723 INFO L762 garLoopResultBuilder]: For program point L6979(lines 6979 6981) no Hoare annotation was computed. [2021-07-05 16:51:59,723 INFO L758 garLoopResultBuilder]: At program point L6979-3(lines 6965 6982) the Hoare annotation is: (let ((.cse17 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse12 (select .cse17 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse10 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse11 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse2 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse3 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse5 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse6 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse14 (let ((.cse16 (select .cse17 12))) (<= .cse16 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse16) 4294967296)))))) (.cse7 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse13 (div .cse12 4294967296)) (.cse9 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= |ULTIMATE.start_can_fail_realloc_#res.base| 0)) .cse9) (and .cse10 .cse0 .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 (<= .cse12 (* 4294967296 .cse13)) .cse6 .cse14 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse11 .cse2 .cse3 .cse4 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0)) .cse5 .cse6 .cse14 .cse7 .cse8 (<= .cse12 (let ((.cse15 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse15 (- 1)) (* .cse13 4294967296) 4294967295) 4294967296)) .cse15))) .cse9))))) [2021-07-05 16:51:59,723 INFO L762 garLoopResultBuilder]: For program point L6979-2(lines 6979 6981) no Hoare annotation was computed. [2021-07-05 16:51:59,723 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,723 INFO L762 garLoopResultBuilder]: For program point L7145(lines 7145 7151) no Hoare annotation was computed. [2021-07-05 16:51:59,724 INFO L758 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:51:59,724 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,724 INFO L762 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:51:59,724 INFO L762 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:51:59,724 INFO L762 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:51:59,724 INFO L762 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:51:59,724 INFO L762 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:51:59,724 INFO L762 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:51:59,725 INFO L762 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:51:59,725 INFO L762 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:51:59,725 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,725 INFO L762 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-07-05 16:51:59,725 INFO L762 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-07-05 16:51:59,725 INFO L762 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-07-05 16:51:59,725 INFO L762 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-07-05 16:51:59,725 INFO L762 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-07-05 16:51:59,726 INFO L762 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-07-05 16:51:59,726 INFO L762 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-07-05 16:51:59,726 INFO L762 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-07-05 16:51:59,726 INFO L765 garLoopResultBuilder]: At program point L6951-1(lines 6950 6952) the Hoare annotation is: true [2021-07-05 16:51:59,726 INFO L758 garLoopResultBuilder]: At program point L6951(lines 6950 6952) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:51:59,726 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,726 INFO L765 garLoopResultBuilder]: At program point L6655(lines 6653 6656) the Hoare annotation is: true [2021-07-05 16:51:59,727 INFO L765 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: true [2021-07-05 16:51:59,727 INFO L765 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: true [2021-07-05 16:51:59,727 INFO L758 garLoopResultBuilder]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: (let ((.cse17 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse8 (select .cse17 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse0 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse3 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse5 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse6 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse7 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse11 (let ((.cse16 (select .cse17 12))) (<= .cse16 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse16) 4294967296)))))) (.cse12 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse13 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse9 (div .cse8 4294967296)) (.cse14 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse8 (* 4294967296 .cse9)) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0)) .cse7 .cse10 .cse11 .cse12 .cse13 (<= .cse8 (let ((.cse15 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse15 (- 1)) (* .cse9 4294967296) 4294967295) 4294967296)) .cse15))) .cse14))))) [2021-07-05 16:51:59,727 INFO L762 garLoopResultBuilder]: For program point L8176-1(line 8176) no Hoare annotation was computed. [2021-07-05 16:51:59,727 INFO L758 garLoopResultBuilder]: At program point L8176-4(line 8176) the Hoare annotation is: (let ((.cse29 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse25 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse13 (select .cse25 12)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse10 (not (= (select .cse29 4) 0))) (.cse11 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse15 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse26 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse16 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse17 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse21 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (let ((.cse22 (let ((.cse27 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse28 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 16))) (and .cse1 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse27) 0) .cse2 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse27) 0) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse28) 0) .cse4 .cse6 .cse10 .cse11 .cse15 .cse26 .cse16 .cse17 .cse21 (= (select .cse29 .cse28) 0)))) (.cse0 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse3 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse23 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse13) 4294967296))))) (and (let ((.cse24 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse5 (select .cse25 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse20 (select .cse24 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse18 (select .cse24 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (let ((.cse19 (div .cse18 4294967296)) (.cse8 (<= .cse13 .cse23)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse12 (<= .cse20 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse20) 4294967296))))) (.cse14 (div .cse5 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse5) 4294967296)))) .cse6 (let ((.cse7 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (<= .cse7 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse7) 4294967296))))) .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse5 (+ .cse13 (* 4294967296 (div (+ (* .cse14 4294967296) 4294967295 (* .cse13 (- 1))) 4294967296)))) .cse15 .cse16 .cse17 (<= .cse18 (+ (* 4294967296 (div (+ (* .cse19 4294967296) (* .cse20 (- 1)) 4294967295) 4294967296)) .cse20)) .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse18 (* 4294967296 .cse19)) .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 (<= .cse5 (* 4294967296 .cse14)) .cse16 .cse17 .cse21) .cse22)))) (or .cse22 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse11 (<= (select .cse25 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 12)) .cse23) .cse15 .cse26 .cse16 .cse17 .cse21)))))) [2021-07-05 16:51:59,728 INFO L762 garLoopResultBuilder]: For program point L8176-3(line 8176) no Hoare annotation was computed. [2021-07-05 16:51:59,728 INFO L762 garLoopResultBuilder]: For program point L8177-3(lines 8175 8193) no Hoare annotation was computed. [2021-07-05 16:51:59,728 INFO L762 garLoopResultBuilder]: For program point L8177-2(line 8177) no Hoare annotation was computed. [2021-07-05 16:51:59,728 INFO L762 garLoopResultBuilder]: For program point L8177(line 8177) no Hoare annotation was computed. [2021-07-05 16:51:59,728 INFO L762 garLoopResultBuilder]: For program point L8177-4(line 8177) no Hoare annotation was computed. [2021-07-05 16:51:59,728 INFO L762 garLoopResultBuilder]: For program point L6658(lines 6658 6663) no Hoare annotation was computed. [2021-07-05 16:51:59,728 INFO L762 garLoopResultBuilder]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:51:59,728 INFO L762 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:51:59,729 INFO L762 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:51:59,729 INFO L762 garLoopResultBuilder]: For program point L7154(lines 7154 7156) no Hoare annotation was computed. [2021-07-05 16:51:59,729 INFO L762 garLoopResultBuilder]: For program point L6659(lines 6659 6661) no Hoare annotation was computed. [2021-07-05 16:51:59,729 INFO L762 garLoopResultBuilder]: For program point L6659-2(lines 6659 6661) no Hoare annotation was computed. [2021-07-05 16:51:59,729 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 16:51:59,729 INFO L762 garLoopResultBuilder]: For program point L7122(lines 7122 7135) no Hoare annotation was computed. [2021-07-05 16:51:59,729 INFO L762 garLoopResultBuilder]: For program point L8179(lines 8179 8182) no Hoare annotation was computed. [2021-07-05 16:51:59,729 INFO L762 garLoopResultBuilder]: For program point L9137(lines 9137 9156) no Hoare annotation was computed. [2021-07-05 16:51:59,730 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,730 INFO L758 garLoopResultBuilder]: At program point L7158(lines 7137 7159) the Hoare annotation is: (let ((.cse17 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse8 (select .cse17 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse0 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse3 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse5 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse6 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse7 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse11 (let ((.cse16 (select .cse17 12))) (<= .cse16 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse16) 4294967296)))))) (.cse9 (div .cse8 4294967296)) (.cse14 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse12 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse13 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse8 (* 4294967296 .cse9)) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0)) .cse7 .cse10 .cse11 .cse12 .cse13 (<= .cse8 (let ((.cse15 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse15 (- 1)) (* .cse9 4294967296) 4294967295) 4294967296)) .cse15))) .cse14) (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) .cse12 .cse13 (= |ULTIMATE.start_aws_mem_realloc_#res| 0)))))) [2021-07-05 16:51:59,730 INFO L762 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:51:59,730 INFO L762 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:51:59,730 INFO L762 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:51:59,730 INFO L762 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:51:59,730 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,731 INFO L762 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:51:59,731 INFO L762 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:51:59,731 INFO L762 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:51:59,731 INFO L762 garLoopResultBuilder]: For program point L222-7(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:51:59,731 INFO L762 garLoopResultBuilder]: For program point L222-8(lines 7162 7172) no Hoare annotation was computed. [2021-07-05 16:51:59,731 INFO L762 garLoopResultBuilder]: For program point L222-9(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:51:59,731 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 16:51:59,731 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,732 INFO L762 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,732 INFO L762 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,732 INFO L762 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,732 INFO L762 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,732 INFO L762 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,732 INFO L762 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,732 INFO L762 garLoopResultBuilder]: For program point L8184(lines 8184 8187) no Hoare annotation was computed. [2021-07-05 16:51:59,733 INFO L762 garLoopResultBuilder]: For program point L7160(lines 7160 7173) no Hoare annotation was computed. [2021-07-05 16:51:59,733 INFO L762 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,733 INFO L762 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,733 INFO L762 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,733 INFO L762 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,733 INFO L762 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,733 INFO L762 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,733 INFO L762 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,734 INFO L762 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,734 INFO L762 garLoopResultBuilder]: For program point L223-21(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,734 INFO L762 garLoopResultBuilder]: For program point L223-22(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,734 INFO L762 garLoopResultBuilder]: For program point L223-24(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,734 INFO L762 garLoopResultBuilder]: For program point L223-25(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,734 INFO L762 garLoopResultBuilder]: For program point L7491-1(line 7491) no Hoare annotation was computed. [2021-07-05 16:51:59,734 INFO L762 garLoopResultBuilder]: For program point L7491(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,734 INFO L762 garLoopResultBuilder]: For program point L223-27(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,734 INFO L762 garLoopResultBuilder]: For program point L223-28(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,735 INFO L762 garLoopResultBuilder]: For program point L7491-4(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:51:59,735 INFO L762 garLoopResultBuilder]: For program point L7491-3(line 7491) no Hoare annotation was computed. [2021-07-05 16:51:59,735 INFO L762 garLoopResultBuilder]: For program point L7491-9(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,735 INFO L762 garLoopResultBuilder]: For program point L7491-7(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,735 INFO L762 garLoopResultBuilder]: For program point L7491-6(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:51:59,735 INFO L762 garLoopResultBuilder]: For program point L7491-13(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,736 INFO L758 garLoopResultBuilder]: At program point L7491-12(lines 7489 7495) the Hoare annotation is: (let ((.cse13 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse12 (select .cse13 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse2 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse3 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse14 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (let ((.cse0 (and (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse2 .cse3 .cse5 .cse6 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse8 .cse9 .cse10 .cse14)) (.cse1 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse4 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse7 (<= .cse12 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse12) 4294967296))))) (.cse15 (let ((.cse16 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and .cse2 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse16) 0) .cse3 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse16) 0) .cse5 .cse6 .cse8 .cse9 .cse10 .cse14)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (let ((.cse11 (select .cse13 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= .cse11 (+ (* 4294967296 (div (+ (* (div .cse11 4294967296) 4294967296) (* .cse12 (- 1)) 4294967295) 4294967296)) .cse12))) .cse14) .cse15) (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14) .cse15))))) [2021-07-05 16:51:59,736 INFO L762 garLoopResultBuilder]: For program point L7491-11(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,736 INFO L762 garLoopResultBuilder]: For program point L7491-17(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:51:59,736 INFO L762 garLoopResultBuilder]: For program point L7491-16(line 7491) no Hoare annotation was computed. [2021-07-05 16:51:59,736 INFO L762 garLoopResultBuilder]: For program point L7491-14(line 7491) no Hoare annotation was computed. [2021-07-05 16:51:59,736 INFO L762 garLoopResultBuilder]: For program point L7491-20(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,736 INFO L762 garLoopResultBuilder]: For program point L7491-19(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:51:59,737 INFO L758 garLoopResultBuilder]: At program point L7491-25(lines 7489 7495) the Hoare annotation is: (let ((.cse29 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse11 (select .cse29 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse28 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse27 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse14 (select .cse27 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse26 (select .cse28 12)) (.cse18 (div .cse11 4294967296)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse22 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0))) (.cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0))) (.cse23 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse7 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse8 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse15 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (let ((.cse0 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse3 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse16 (and (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse1 .cse2 .cse4 .cse5 .cse22 .cse6 .cse23 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse7 .cse8 .cse9 .cse15)) (.cse13 (* .cse18 4294967296)) (.cse10 (<= .cse26 (+ (* 4294967296 (div (+ (- 1) .cse26) 4294967296)) 4294967295))) (.cse12 (* .cse14 (- 1)))) (and (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse11 (+ (* 4294967296 (div (+ .cse12 .cse13 4294967295) 4294967296)) .cse14)) .cse15) .cse16) (let ((.cse17 (let ((.cse25 (select .cse29 12))) (let ((.cse21 (<= .cse25 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse25) 4294967296))))) (.cse24 (<= .cse14 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse14) 4294967296))))) (.cse19 (select .cse28 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse20 (select .cse27 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (or (and .cse1 .cse2 (<= (* 4294967296 (div (+ .cse19 4294967295) 4294967296)) .cse19) (<= (* 4294967296 (div (+ 4294967295 .cse20) 4294967296)) .cse20) (<= (* 4294967296 (div (+ .cse11 4294967295) 4294967296)) .cse11) .cse4 .cse21 .cse5 .cse22 .cse6 .cse23 .cse24 .cse7 .cse8 .cse9 .cse10 .cse15) (and (<= .cse20 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse20) 4294967296)))) .cse1 .cse2 (<= .cse11 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse11) 4294967296)))) .cse4 (<= .cse19 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse19) 4294967296)))) .cse21 .cse5 .cse22 .cse6 .cse23 .cse24 (<= .cse11 (+ .cse25 (* 4294967296 (div (+ .cse13 4294967295 (* .cse25 (- 1))) 4294967296)))) .cse7 .cse8 (<= .cse19 (+ (* 4294967296 (div (+ (* (div .cse19 4294967296) 4294967296) 4294967295 (* .cse26 (- 1))) 4294967296)) .cse26)) .cse9 .cse10 (<= .cse20 (+ (* 4294967296 (div (+ (* (div .cse20 4294967296) 4294967296) .cse12 4294967295) 4294967296)) .cse14)) .cse15)))))) (or (and .cse17 (<= .cse11 (* 4294967296 .cse18))) (and .cse0 .cse3 .cse17) .cse16))))))) [2021-07-05 16:51:59,737 INFO L762 garLoopResultBuilder]: For program point L7491-24(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,737 INFO L762 garLoopResultBuilder]: For program point L7491-22(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,737 INFO L762 garLoopResultBuilder]: For program point L7491-29(line 7491) no Hoare annotation was computed. [2021-07-05 16:51:59,737 INFO L762 garLoopResultBuilder]: For program point L7491-27(line 7491) no Hoare annotation was computed. [2021-07-05 16:51:59,737 INFO L762 garLoopResultBuilder]: For program point L7491-26(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,737 INFO L762 garLoopResultBuilder]: For program point L7491-33(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,738 INFO L762 garLoopResultBuilder]: For program point L7491-32(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:51:59,738 INFO L762 garLoopResultBuilder]: For program point L7491-30(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:51:59,738 INFO L762 garLoopResultBuilder]: For program point L7491-37(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,738 INFO L762 garLoopResultBuilder]: For program point L7491-35(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,738 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,738 INFO L762 garLoopResultBuilder]: For program point L7491-40(line 7491) no Hoare annotation was computed. [2021-07-05 16:51:59,738 INFO L762 garLoopResultBuilder]: For program point L7491-39(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,739 INFO L758 garLoopResultBuilder]: At program point L7491-38(lines 7489 7495) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:51:59,739 INFO L762 garLoopResultBuilder]: For program point L7491-45(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:51:59,739 INFO L762 garLoopResultBuilder]: For program point L7491-43(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:51:59,739 INFO L762 garLoopResultBuilder]: For program point L7491-42(line 7491) no Hoare annotation was computed. [2021-07-05 16:51:59,739 INFO L762 garLoopResultBuilder]: For program point L7491-48(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,739 INFO L762 garLoopResultBuilder]: For program point L7491-46(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,739 INFO L762 garLoopResultBuilder]: For program point L7491-53(line 7491) no Hoare annotation was computed. [2021-07-05 16:51:59,739 INFO L762 garLoopResultBuilder]: For program point L7491-52(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,740 INFO L758 garLoopResultBuilder]: At program point L7491-51(lines 7489 7495) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:51:59,740 INFO L762 garLoopResultBuilder]: For program point L7491-50(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,740 INFO L762 garLoopResultBuilder]: For program point L7491-56(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:51:59,740 INFO L762 garLoopResultBuilder]: For program point L7491-55(line 7491) no Hoare annotation was computed. [2021-07-05 16:51:59,740 INFO L762 garLoopResultBuilder]: For program point L7491-61(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,740 INFO L762 garLoopResultBuilder]: For program point L7491-59(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,740 INFO L762 garLoopResultBuilder]: For program point L7491-58(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:51:59,740 INFO L762 garLoopResultBuilder]: For program point L7491-65(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,741 INFO L765 garLoopResultBuilder]: At program point L7491-64(lines 7489 7495) the Hoare annotation is: true [2021-07-05 16:51:59,741 INFO L762 garLoopResultBuilder]: For program point L7491-63(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,741 INFO L762 garLoopResultBuilder]: For program point L7491-69(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:51:59,741 INFO L762 garLoopResultBuilder]: For program point L7491-68(line 7491) no Hoare annotation was computed. [2021-07-05 16:51:59,741 INFO L762 garLoopResultBuilder]: For program point L7491-66(line 7491) no Hoare annotation was computed. [2021-07-05 16:51:59,741 INFO L762 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2021-07-05 16:51:59,741 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 16:51:59,741 INFO L762 garLoopResultBuilder]: For program point L7491-72(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,742 INFO L762 garLoopResultBuilder]: For program point L7491-71(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:51:59,742 INFO L765 garLoopResultBuilder]: At program point L7491-77(lines 7489 7495) the Hoare annotation is: true [2021-07-05 16:51:59,742 INFO L762 garLoopResultBuilder]: For program point L7491-76(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,742 INFO L762 garLoopResultBuilder]: For program point L7491-74(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,742 INFO L762 garLoopResultBuilder]: For program point L9145(lines 9145 9148) no Hoare annotation was computed. [2021-07-05 16:51:59,742 INFO L762 garLoopResultBuilder]: For program point L9145-2(lines 9145 9148) no Hoare annotation was computed. [2021-07-05 16:51:59,742 INFO L762 garLoopResultBuilder]: For program point L7494(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,742 INFO L762 garLoopResultBuilder]: For program point L7494-4(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,743 INFO L762 garLoopResultBuilder]: For program point L7494-3(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,743 INFO L762 garLoopResultBuilder]: For program point L7494-2(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,743 INFO L762 garLoopResultBuilder]: For program point L7494-8(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,743 INFO L762 garLoopResultBuilder]: For program point L7494-6(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,743 INFO L762 garLoopResultBuilder]: For program point L7494-12(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,743 INFO L762 garLoopResultBuilder]: For program point L7494-11(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,743 INFO L762 garLoopResultBuilder]: For program point L7494-9(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,744 INFO L762 garLoopResultBuilder]: For program point L6966(lines 6966 6972) no Hoare annotation was computed. [2021-07-05 16:51:59,744 INFO L762 garLoopResultBuilder]: For program point L7494-15(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,744 INFO L762 garLoopResultBuilder]: For program point L7494-13(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,744 INFO L762 garLoopResultBuilder]: For program point L7494-20(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,744 INFO L762 garLoopResultBuilder]: For program point L7494-18(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,744 INFO L762 garLoopResultBuilder]: For program point L7494-17(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,744 INFO L762 garLoopResultBuilder]: For program point L7494-24(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,744 INFO L762 garLoopResultBuilder]: For program point L7494-22(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,745 INFO L762 garLoopResultBuilder]: For program point L7494-21(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,745 INFO L762 garLoopResultBuilder]: For program point L7494-27(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,745 INFO L762 garLoopResultBuilder]: For program point L7494-26(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,745 INFO L762 garLoopResultBuilder]: For program point L7494-31(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,745 INFO L762 garLoopResultBuilder]: For program point L7494-30(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,745 INFO L762 garLoopResultBuilder]: For program point L7494-29(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,745 INFO L758 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:51:59,745 INFO L762 garLoopResultBuilder]: For program point L7494-36(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,745 INFO L758 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: (let ((.cse1 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (let ((.cse0 (select .cse1 12))) (<= .cse0 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse0) 4294967296))))) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (let ((.cse2 (select .cse1 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (<= .cse2 (let ((.cse3 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse3 (- 1)) (* (div .cse2 4294967296) 4294967296) 4294967295) 4294967296)) .cse3)))) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) [2021-07-05 16:51:59,746 INFO L762 garLoopResultBuilder]: For program point L7494-35(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,746 INFO L758 garLoopResultBuilder]: At program point L261-2(line 261) the Hoare annotation is: (let ((.cse1 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (let ((.cse0 (select .cse1 12))) (<= .cse0 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse0) 4294967296))))) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (let ((.cse2 (select .cse1 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (<= .cse2 (let ((.cse3 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse3 (- 1)) (* (div .cse2 4294967296) 4294967296) 4294967295) 4294967296)) .cse3)))) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) [2021-07-05 16:51:59,746 INFO L762 garLoopResultBuilder]: For program point L7494-33(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,746 INFO L762 garLoopResultBuilder]: For program point L7494-40(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,746 INFO L762 garLoopResultBuilder]: For program point L7494-39(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,746 INFO L762 garLoopResultBuilder]: For program point L7494-38(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,746 INFO L762 garLoopResultBuilder]: For program point L7494-44(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,746 INFO L762 garLoopResultBuilder]: For program point L7494-42(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,747 INFO L762 garLoopResultBuilder]: For program point L7494-48(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,747 INFO L762 garLoopResultBuilder]: For program point L7494-47(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,747 INFO L762 garLoopResultBuilder]: For program point L7494-45(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,747 INFO L762 garLoopResultBuilder]: For program point L7494-51(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,747 INFO L762 garLoopResultBuilder]: For program point L7494-49(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,747 INFO L762 garLoopResultBuilder]: For program point L7494-53(line 7494) no Hoare annotation was computed. [2021-07-05 16:51:59,747 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 16:51:59,747 INFO L762 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2021-07-05 16:51:59,747 INFO L758 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse3 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse5 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse6 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse7 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse9 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse11 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse2 .cse3 .cse4 .cse5 (let ((.cse10 (select .cse11 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (<= .cse10 (* 4294967296 (div .cse10 4294967296)))) .cse6 (let ((.cse12 (select .cse11 12))) (<= .cse12 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse12) 4294967296))))) .cse7 .cse8 .cse9)))) [2021-07-05 16:51:59,747 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:51:59,747 INFO L765 garLoopResultBuilder]: At program point L8192(lines 8175 8193) the Hoare annotation is: true [2021-07-05 16:51:59,747 INFO L765 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: true [2021-07-05 16:51:59,748 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-07-05 16:51:59,748 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 16:51:59,748 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION was SAFE (2/10) [2021-07-05 16:51:59,749 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 16:51:59,749 INFO L329 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 16:51:59,749 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 16:51:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 200 states have internal predecessors, (281), 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-07-05 16:51:59,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-07-05 16:51:59,752 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:51:59,752 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:51:59,752 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:51:59,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:51:59,753 INFO L82 PathProgramCache]: Analyzing trace with hash -438874712, now seen corresponding path program 1 times [2021-07-05 16:51:59,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:51:59,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054054109] [2021-07-05 16:51:59,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:51:59,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:51:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:51:59,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:59,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:59,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:59,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:59,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:51:59,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:51:59,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054054109] [2021-07-05 16:51:59,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054054109] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:51:59,825 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:51:59,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 16:51:59,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074030553] [2021-07-05 16:51:59,826 INFO L425 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-05 16:51:59,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:51:59,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-05 16:51:59,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-05 16:51:59,827 INFO L87 Difference]: Start difference. First operand has 201 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 200 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-07-05 16:51:59,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:51:59,829 INFO L93 Difference]: Finished difference Result 395 states and 553 transitions. [2021-07-05 16:51:59,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-05 16:51:59,829 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-07-05 16:51:59,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:51:59,829 INFO L225 Difference]: With dead ends: 395 [2021-07-05 16:51:59,829 INFO L226 Difference]: Without dead ends: 100 [2021-07-05 16:51:59,830 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-05 16:51:59,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-07-05 16:51:59,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-07-05 16:51:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.303030303030303) internal successors, (129), 99 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:51:59,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 129 transitions. [2021-07-05 16:51:59,832 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 129 transitions. Word has length 37 [2021-07-05 16:51:59,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:51:59,832 INFO L442 AbstractCegarLoop]: Abstraction has 100 states and 129 transitions. [2021-07-05 16:51:59,832 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-07-05 16:51:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 129 transitions. [2021-07-05 16:51:59,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-07-05 16:51:59,833 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:51:59,833 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:51:59,833 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-07-05 16:51:59,833 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:51:59,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:51:59,833 INFO L82 PathProgramCache]: Analyzing trace with hash -61906707, now seen corresponding path program 1 times [2021-07-05 16:51:59,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:51:59,834 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451193375] [2021-07-05 16:51:59,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:51:59,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:51:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:51:59,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:59,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:59,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:59,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:51:59,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:59,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-07-05 16:51:59,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:51:59,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:51:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:51:59,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:51:59,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451193375] [2021-07-05 16:51:59,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451193375] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:51:59,937 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:51:59,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:51:59,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649043893] [2021-07-05 16:51:59,938 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:51:59,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:51:59,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:51:59,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:51:59,939 INFO L87 Difference]: Start difference. First operand 100 states and 129 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-07-05 16:51:59,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:51:59,967 INFO L93 Difference]: Finished difference Result 177 states and 227 transitions. [2021-07-05 16:51:59,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:51:59,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-07-05 16:51:59,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:51:59,968 INFO L225 Difference]: With dead ends: 177 [2021-07-05 16:51:59,968 INFO L226 Difference]: Without dead ends: 100 [2021-07-05 16:51:59,968 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:51:59,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-07-05 16:51:59,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-07-05 16:51:59,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 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-07-05 16:51:59,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 128 transitions. [2021-07-05 16:51:59,970 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 128 transitions. Word has length 47 [2021-07-05 16:51:59,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:51:59,970 INFO L442 AbstractCegarLoop]: Abstraction has 100 states and 128 transitions. [2021-07-05 16:51:59,971 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-07-05 16:51:59,971 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 128 transitions. [2021-07-05 16:51:59,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-07-05 16:51:59,971 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:51:59,971 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:51:59,971 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-07-05 16:51:59,972 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:51:59,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:51:59,972 INFO L82 PathProgramCache]: Analyzing trace with hash 532644026, now seen corresponding path program 1 times [2021-07-05 16:51:59,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:51:59,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317040451] [2021-07-05 16:51:59,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:51:59,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:52:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:52:00,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:00,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:52:00,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:52:00,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:52:00,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:52:00,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317040451] [2021-07-05 16:52:00,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317040451] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:52:00,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:52:00,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:52:00,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635138401] [2021-07-05 16:52:00,061 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:52:00,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:52:00,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:52:00,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:52:00,062 INFO L87 Difference]: Start difference. First operand 100 states and 128 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-07-05 16:52:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:52:00,149 INFO L93 Difference]: Finished difference Result 252 states and 332 transitions. [2021-07-05 16:52:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:52:00,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-07-05 16:52:00,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:52:00,150 INFO L225 Difference]: With dead ends: 252 [2021-07-05 16:52:00,151 INFO L226 Difference]: Without dead ends: 166 [2021-07-05 16:52:00,151 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:52:00,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-07-05 16:52:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 106. [2021-07-05 16:52:00,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.276190476190476) internal successors, (134), 105 states have internal predecessors, (134), 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-07-05 16:52:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 134 transitions. [2021-07-05 16:52:00,153 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 134 transitions. Word has length 53 [2021-07-05 16:52:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:52:00,153 INFO L442 AbstractCegarLoop]: Abstraction has 106 states and 134 transitions. [2021-07-05 16:52:00,153 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-07-05 16:52:00,154 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 134 transitions. [2021-07-05 16:52:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-07-05 16:52:00,154 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:52:00,154 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:52:00,154 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-07-05 16:52:00,154 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:52:00,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:52:00,155 INFO L82 PathProgramCache]: Analyzing trace with hash 956290748, now seen corresponding path program 1 times [2021-07-05 16:52:00,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:52:00,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223049246] [2021-07-05 16:52:00,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:52:00,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:52:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:52:00,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:00,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:52:00,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:52:00,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:52:00,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:52:00,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223049246] [2021-07-05 16:52:00,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223049246] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:52:00,245 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:52:00,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:52:00,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549418630] [2021-07-05 16:52:00,245 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:52:00,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:52:00,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:52:00,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:52:00,246 INFO L87 Difference]: Start difference. First operand 106 states and 134 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-07-05 16:52:00,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:52:00,324 INFO L93 Difference]: Finished difference Result 218 states and 279 transitions. [2021-07-05 16:52:00,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:52:00,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-07-05 16:52:00,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:52:00,326 INFO L225 Difference]: With dead ends: 218 [2021-07-05 16:52:00,326 INFO L226 Difference]: Without dead ends: 136 [2021-07-05 16:52:00,326 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:52:00,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-07-05 16:52:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 112. [2021-07-05 16:52:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.2612612612612613) internal successors, (140), 111 states have internal predecessors, (140), 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-07-05 16:52:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 140 transitions. [2021-07-05 16:52:00,328 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 140 transitions. Word has length 53 [2021-07-05 16:52:00,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:52:00,328 INFO L442 AbstractCegarLoop]: Abstraction has 112 states and 140 transitions. [2021-07-05 16:52:00,328 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-07-05 16:52:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 140 transitions. [2021-07-05 16:52:00,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-07-05 16:52:00,329 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:52:00,329 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:52:00,329 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-07-05 16:52:00,329 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:52:00,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:52:00,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1430037304, now seen corresponding path program 1 times [2021-07-05 16:52:00,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:52:00,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608106672] [2021-07-05 16:52:00,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:52:00,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:52:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:52:00,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:00,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:52:00,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:52:00,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:52:00,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:52:00,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:00,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:00,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:52:00,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:52:00,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608106672] [2021-07-05 16:52:00,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608106672] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:52:00,458 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:52:00,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:52:00,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228822402] [2021-07-05 16:52:00,458 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:52:00,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:52:00,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:52:00,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:52:00,459 INFO L87 Difference]: Start difference. First operand 112 states and 140 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-07-05 16:52:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:52:00,525 INFO L93 Difference]: Finished difference Result 172 states and 214 transitions. [2021-07-05 16:52:00,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:52:00,525 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-07-05 16:52:00,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:52:00,526 INFO L225 Difference]: With dead ends: 172 [2021-07-05 16:52:00,526 INFO L226 Difference]: Without dead ends: 112 [2021-07-05 16:52:00,526 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 62.9ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-07-05 16:52:00,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-07-05 16:52:00,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-07-05 16:52:00,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.2432432432432432) internal successors, (138), 111 states have internal predecessors, (138), 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-07-05 16:52:00,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2021-07-05 16:52:00,528 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 53 [2021-07-05 16:52:00,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:52:00,528 INFO L442 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2021-07-05 16:52:00,528 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-07-05 16:52:00,528 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2021-07-05 16:52:00,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-07-05 16:52:00,529 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:52:00,529 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:52:00,529 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-07-05 16:52:00,529 INFO L374 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:52:00,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:52:00,530 INFO L82 PathProgramCache]: Analyzing trace with hash 822550402, now seen corresponding path program 1 times [2021-07-05 16:52:00,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:52:00,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285684295] [2021-07-05 16:52:00,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:52:00,530 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:52:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:52:00,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:00,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:00,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:00,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:52:00,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:52:00,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:00,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:52:00,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:52:00,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285684295] [2021-07-05 16:52:00,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285684295] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:52:00,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:52:00,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-05 16:52:00,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066484648] [2021-07-05 16:52:00,749 INFO L425 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-05 16:52:00,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:52:00,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-05 16:52:00,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:52:00,750 INFO L87 Difference]: Start difference. First operand 112 states and 138 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-07-05 16:52:00,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:52:00,854 INFO L93 Difference]: Finished difference Result 166 states and 199 transitions. [2021-07-05 16:52:00,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:52:00,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-07-05 16:52:00,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:52:00,855 INFO L225 Difference]: With dead ends: 166 [2021-07-05 16:52:00,855 INFO L226 Difference]: Without dead ends: 160 [2021-07-05 16:52:00,855 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 65.7ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:52:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-07-05 16:52:00,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 110. [2021-07-05 16:52:00,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.238532110091743) internal successors, (135), 109 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:52:00,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2021-07-05 16:52:00,857 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 65 [2021-07-05 16:52:00,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:52:00,857 INFO L442 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2021-07-05 16:52:00,857 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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-07-05 16:52:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2021-07-05 16:52:00,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-07-05 16:52:00,858 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:52:00,858 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:52:00,858 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-07-05 16:52:00,858 INFO L374 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:52:00,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:52:00,859 INFO L82 PathProgramCache]: Analyzing trace with hash -154156682, now seen corresponding path program 1 times [2021-07-05 16:52:00,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:52:00,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595081113] [2021-07-05 16:52:00,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:52:00,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:52:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:52:01,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:01,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:01,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:01,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-07-05 16:52:01,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:01,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:01,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:52:01,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:52:01,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595081113] [2021-07-05 16:52:01,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595081113] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:52:01,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:52:01,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 16:52:01,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776539305] [2021-07-05 16:52:01,087 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 16:52:01,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:52:01,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 16:52:01,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 16:52:01,088 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:52:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:52:01,098 INFO L93 Difference]: Finished difference Result 132 states and 161 transitions. [2021-07-05 16:52:01,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 16:52:01,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-07-05 16:52:01,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:52:01,099 INFO L225 Difference]: With dead ends: 132 [2021-07-05 16:52:01,099 INFO L226 Difference]: Without dead ends: 104 [2021-07-05 16:52:01,101 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 16:52:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-07-05 16:52:01,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-07-05 16:52:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.233009708737864) internal successors, (127), 103 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:52:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 127 transitions. [2021-07-05 16:52:01,104 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 127 transitions. Word has length 69 [2021-07-05 16:52:01,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:52:01,104 INFO L442 AbstractCegarLoop]: Abstraction has 104 states and 127 transitions. [2021-07-05 16:52:01,104 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:52:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 127 transitions. [2021-07-05 16:52:01,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-07-05 16:52:01,105 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:52:01,105 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:52:01,105 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-07-05 16:52:01,105 INFO L374 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:52:01,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:52:01,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1201564382, now seen corresponding path program 1 times [2021-07-05 16:52:01,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:52:01,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892652609] [2021-07-05 16:52:01,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:52:01,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:52:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:52:01,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:01,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:01,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:01,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:52:01,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:01,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:52:01,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:01,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:52:01,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:01,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:52:01,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:52:01,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892652609] [2021-07-05 16:52:01,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892652609] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:52:01,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:52:01,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:52:01,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232990635] [2021-07-05 16:52:01,291 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:52:01,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:52:01,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:52:01,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:52:01,292 INFO L87 Difference]: Start difference. First operand 104 states and 127 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-07-05 16:52:01,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:52:01,333 INFO L93 Difference]: Finished difference Result 175 states and 211 transitions. [2021-07-05 16:52:01,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:52:01,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-07-05 16:52:01,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:52:01,335 INFO L225 Difference]: With dead ends: 175 [2021-07-05 16:52:01,335 INFO L226 Difference]: Without dead ends: 153 [2021-07-05 16:52:01,335 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.3ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:52:01,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-07-05 16:52:01,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 107. [2021-07-05 16:52:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 106 states have internal predecessors, (130), 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-07-05 16:52:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2021-07-05 16:52:01,339 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 70 [2021-07-05 16:52:01,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:52:01,339 INFO L442 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2021-07-05 16:52:01,339 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-07-05 16:52:01,339 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2021-07-05 16:52:01,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-05 16:52:01,340 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:52:01,340 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:52:01,340 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-07-05 16:52:01,340 INFO L374 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:52:01,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:52:01,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1360977322, now seen corresponding path program 1 times [2021-07-05 16:52:01,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:52:01,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329968727] [2021-07-05 16:52:01,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:52:01,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:52:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:52:01,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:01,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:01,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:01,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:52:01,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:01,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:52:01,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:01,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-07-05 16:52:01,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:01,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-07-05 16:52:01,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:01,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:52:01,719 INFO L142 QuantifierPusher]: treesize reduction 9, result has 70.0 percent of original size [2021-07-05 16:52:01,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:52:01,741 INFO L142 QuantifierPusher]: treesize reduction 15, result has 75.8 percent of original size [2021-07-05 16:52:01,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-07-05 16:52:01,816 INFO L142 QuantifierPusher]: treesize reduction 22, result has 48.8 percent of original size [2021-07-05 16:52:01,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:52:01,817 INFO L142 QuantifierPusher]: treesize reduction 18, result has 60.9 percent of original size [2021-07-05 16:52:01,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-07-05 16:52:01,845 INFO L142 QuantifierPusher]: treesize reduction 11, result has 73.8 percent of original size [2021-07-05 16:52:01,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:52:01,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:01,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-07-05 16:52:01,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:01,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-07-05 16:52:01,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:01,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:01,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:01,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:01,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:01,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:01,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:52:01,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:52:01,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329968727] [2021-07-05 16:52:01,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329968727] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:52:01,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:52:01,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-07-05 16:52:01,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20779527] [2021-07-05 16:52:01,945 INFO L425 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-07-05 16:52:01,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:52:01,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-07-05 16:52:01,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-07-05 16:52:01,945 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 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-07-05 16:52:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:52:11,171 INFO L93 Difference]: Finished difference Result 305 states and 370 transitions. [2021-07-05 16:52:11,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-07-05 16:52:11,171 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-07-05 16:52:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:52:11,172 INFO L225 Difference]: With dead ends: 305 [2021-07-05 16:52:11,172 INFO L226 Difference]: Without dead ends: 223 [2021-07-05 16:52:11,173 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 896.4ms TimeCoverageRelationStatistics Valid=261, Invalid=551, Unknown=0, NotChecked=0, Total=812 [2021-07-05 16:52:11,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-07-05 16:52:11,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 189. [2021-07-05 16:52:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.2234042553191489) internal successors, (230), 188 states have internal predecessors, (230), 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-07-05 16:52:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 230 transitions. [2021-07-05 16:52:11,177 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 230 transitions. Word has length 71 [2021-07-05 16:52:11,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:52:11,177 INFO L442 AbstractCegarLoop]: Abstraction has 189 states and 230 transitions. [2021-07-05 16:52:11,178 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 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-07-05 16:52:11,178 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 230 transitions. [2021-07-05 16:52:11,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-05 16:52:11,178 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:52:11,178 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:52:11,178 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-07-05 16:52:11,178 INFO L374 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:52:11,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:52:11,178 INFO L82 PathProgramCache]: Analyzing trace with hash -680918952, now seen corresponding path program 1 times [2021-07-05 16:52:11,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:52:11,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205247724] [2021-07-05 16:52:11,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:52:11,179 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:52:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:52:11,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:11,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:11,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:11,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-07-05 16:52:11,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:11,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-05 16:52:11,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:11,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:11,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:11,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:52:11,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:52:11,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205247724] [2021-07-05 16:52:11,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205247724] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:52:11,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:52:11,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:52:11,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139967334] [2021-07-05 16:52:11,398 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:52:11,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:52:11,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:52:11,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:52:11,399 INFO L87 Difference]: Start difference. First operand 189 states and 230 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-07-05 16:52:13,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:52:13,719 INFO L93 Difference]: Finished difference Result 451 states and 544 transitions. [2021-07-05 16:52:13,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:52:13,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-07-05 16:52:13,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:52:13,721 INFO L225 Difference]: With dead ends: 451 [2021-07-05 16:52:13,721 INFO L226 Difference]: Without dead ends: 313 [2021-07-05 16:52:13,721 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 35.0ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:52:13,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-07-05 16:52:13,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 204. [2021-07-05 16:52:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.206896551724138) internal successors, (245), 203 states have internal predecessors, (245), 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-07-05 16:52:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 245 transitions. [2021-07-05 16:52:13,726 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 245 transitions. Word has length 71 [2021-07-05 16:52:13,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:52:13,726 INFO L442 AbstractCegarLoop]: Abstraction has 204 states and 245 transitions. [2021-07-05 16:52:13,726 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-07-05 16:52:13,726 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 245 transitions. [2021-07-05 16:52:13,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-05 16:52:13,727 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:52:13,727 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:52:13,727 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-07-05 16:52:13,728 INFO L374 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:52:13,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:52:13,728 INFO L82 PathProgramCache]: Analyzing trace with hash 72032860, now seen corresponding path program 1 times [2021-07-05 16:52:13,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:52:13,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932569840] [2021-07-05 16:52:13,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:52:13,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:52:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:52:13,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:13,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:13,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:13,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-05 16:52:13,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:13,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-07-05 16:52:13,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:13,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:52:13,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:52:13,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932569840] [2021-07-05 16:52:13,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932569840] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:52:13,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:52:13,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:52:13,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233519125] [2021-07-05 16:52:13,910 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:52:13,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:52:13,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:52:13,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:52:13,911 INFO L87 Difference]: Start difference. First operand 204 states and 245 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-07-05 16:52:13,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:52:13,937 INFO L93 Difference]: Finished difference Result 253 states and 303 transitions. [2021-07-05 16:52:13,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:52:13,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-07-05 16:52:13,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:52:13,938 INFO L225 Difference]: With dead ends: 253 [2021-07-05 16:52:13,938 INFO L226 Difference]: Without dead ends: 196 [2021-07-05 16:52:13,938 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:52:13,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-07-05 16:52:13,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2021-07-05 16:52:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.1948717948717948) internal successors, (233), 195 states have internal predecessors, (233), 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-07-05 16:52:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 233 transitions. [2021-07-05 16:52:13,942 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 233 transitions. Word has length 71 [2021-07-05 16:52:13,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:52:13,942 INFO L442 AbstractCegarLoop]: Abstraction has 196 states and 233 transitions. [2021-07-05 16:52:13,942 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-07-05 16:52:13,942 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 233 transitions. [2021-07-05 16:52:13,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-07-05 16:52:13,943 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:52:13,943 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:52:13,943 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-07-05 16:52:13,943 INFO L374 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:52:13,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:52:13,943 INFO L82 PathProgramCache]: Analyzing trace with hash -152885272, now seen corresponding path program 1 times [2021-07-05 16:52:13,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:52:13,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489820842] [2021-07-05 16:52:13,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:52:13,944 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:52:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:52:14,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:14,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:14,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:14,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 16:52:14,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:14,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 16:52:14,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:14,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 16:52:14,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:14,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:52:14,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:52:14,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489820842] [2021-07-05 16:52:14,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489820842] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:52:14,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:52:14,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:52:14,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455399265] [2021-07-05 16:52:14,091 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:52:14,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:52:14,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:52:14,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:52:14,092 INFO L87 Difference]: Start difference. First operand 196 states and 233 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-07-05 16:52:14,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:52:14,122 INFO L93 Difference]: Finished difference Result 237 states and 281 transitions. [2021-07-05 16:52:14,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:52:14,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-07-05 16:52:14,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:52:14,123 INFO L225 Difference]: With dead ends: 237 [2021-07-05 16:52:14,123 INFO L226 Difference]: Without dead ends: 186 [2021-07-05 16:52:14,123 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:52:14,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-07-05 16:52:14,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2021-07-05 16:52:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.1837837837837837) internal successors, (219), 185 states have internal predecessors, (219), 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-07-05 16:52:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 219 transitions. [2021-07-05 16:52:14,127 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 219 transitions. Word has length 72 [2021-07-05 16:52:14,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:52:14,127 INFO L442 AbstractCegarLoop]: Abstraction has 186 states and 219 transitions. [2021-07-05 16:52:14,128 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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-07-05 16:52:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 219 transitions. [2021-07-05 16:52:14,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-07-05 16:52:14,128 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:52:14,128 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:52:14,129 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-07-05 16:52:14,129 INFO L374 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:52:14,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:52:14,129 INFO L82 PathProgramCache]: Analyzing trace with hash 812044362, now seen corresponding path program 1 times [2021-07-05 16:52:14,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:52:14,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734513135] [2021-07-05 16:52:14,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:52:14,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:52:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:52:15,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:15,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:15,810 INFO L142 QuantifierPusher]: treesize reduction 17, result has 37.0 percent of original size [2021-07-05 16:52:15,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:52:15,818 INFO L142 QuantifierPusher]: treesize reduction 17, result has 45.2 percent of original size [2021-07-05 16:52:15,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:52:15,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:15,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:52:15,837 INFO L142 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-07-05 16:52:15,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:52:15,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:15,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:52:15,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:15,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:52:15,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:15,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:15,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:52:15,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:52:15,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734513135] [2021-07-05 16:52:15,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734513135] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:52:15,863 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:52:15,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:52:15,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061611090] [2021-07-05 16:52:15,864 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 16:52:15,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:52:15,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 16:52:15,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:52:15,865 INFO L87 Difference]: Start difference. First operand 186 states and 219 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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-07-05 16:52:20,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:52:20,312 INFO L93 Difference]: Finished difference Result 323 states and 381 transitions. [2021-07-05 16:52:20,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-05 16:52:20,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-07-05 16:52:20,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:52:20,313 INFO L225 Difference]: With dead ends: 323 [2021-07-05 16:52:20,314 INFO L226 Difference]: Without dead ends: 223 [2021-07-05 16:52:20,314 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 207.7ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-07-05 16:52:20,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-07-05 16:52:20,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 186. [2021-07-05 16:52:20,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.1783783783783783) internal successors, (218), 185 states have internal predecessors, (218), 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-07-05 16:52:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 218 transitions. [2021-07-05 16:52:20,319 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 218 transitions. Word has length 72 [2021-07-05 16:52:20,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:52:20,320 INFO L442 AbstractCegarLoop]: Abstraction has 186 states and 218 transitions. [2021-07-05 16:52:20,320 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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-07-05 16:52:20,320 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 218 transitions. [2021-07-05 16:52:20,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-05 16:52:20,321 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:52:20,321 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:52:20,321 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-07-05 16:52:20,321 INFO L374 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:52:20,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:52:20,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1881853688, now seen corresponding path program 1 times [2021-07-05 16:52:20,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:52:20,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613196863] [2021-07-05 16:52:20,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:52:20,322 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:52:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:52:20,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:20,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:20,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:20,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:52:20,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:20,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:52:20,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:20,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:52:20,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:20,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:52:20,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:20,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:52:20,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:20,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:52:20,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:20,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:52:20,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:20,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:52:20,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:20,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:20,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:52:20,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:52:20,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613196863] [2021-07-05 16:52:20,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613196863] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:52:20,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:52:20,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-05 16:52:20,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286173269] [2021-07-05 16:52:20,599 INFO L425 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-05 16:52:20,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:52:20,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-05 16:52:20,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:52:20,600 INFO L87 Difference]: Start difference. First operand 186 states and 218 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:52:29,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:52:29,702 INFO L93 Difference]: Finished difference Result 374 states and 443 transitions. [2021-07-05 16:52:29,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-07-05 16:52:29,703 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-07-05 16:52:29,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:52:29,704 INFO L225 Difference]: With dead ends: 374 [2021-07-05 16:52:29,704 INFO L226 Difference]: Without dead ends: 316 [2021-07-05 16:52:29,704 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 481.8ms TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2021-07-05 16:52:29,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-07-05 16:52:29,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 202. [2021-07-05 16:52:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.1741293532338308) internal successors, (236), 201 states have internal predecessors, (236), 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-07-05 16:52:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 236 transitions. [2021-07-05 16:52:29,711 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 236 transitions. Word has length 76 [2021-07-05 16:52:29,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:52:29,711 INFO L442 AbstractCegarLoop]: Abstraction has 202 states and 236 transitions. [2021-07-05 16:52:29,711 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:52:29,711 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 236 transitions. [2021-07-05 16:52:29,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-05 16:52:29,712 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:52:29,712 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:52:29,712 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2021-07-05 16:52:29,712 INFO L374 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:52:29,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:52:29,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1767831556, now seen corresponding path program 1 times [2021-07-05 16:52:29,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:52:29,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379281723] [2021-07-05 16:52:29,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:52:29,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:52:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:52:29,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:29,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:29,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:29,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:52:29,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:29,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:52:29,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:29,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:52:29,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:29,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:52:29,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:29,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:52:29,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:29,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:29,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:52:29,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:52:29,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379281723] [2021-07-05 16:52:29,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379281723] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:52:29,946 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:52:29,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:52:29,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782132394] [2021-07-05 16:52:29,946 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:52:29,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:52:29,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:52:29,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:52:29,947 INFO L87 Difference]: Start difference. First operand 202 states and 236 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:52:30,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:52:30,108 INFO L93 Difference]: Finished difference Result 416 states and 476 transitions. [2021-07-05 16:52:30,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 16:52:30,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-07-05 16:52:30,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:52:30,110 INFO L225 Difference]: With dead ends: 416 [2021-07-05 16:52:30,110 INFO L226 Difference]: Without dead ends: 251 [2021-07-05 16:52:30,110 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 85.3ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:52:30,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-07-05 16:52:30,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 184. [2021-07-05 16:52:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.169398907103825) internal successors, (214), 183 states have internal predecessors, (214), 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-07-05 16:52:30,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 214 transitions. [2021-07-05 16:52:30,114 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 214 transitions. Word has length 76 [2021-07-05 16:52:30,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:52:30,114 INFO L442 AbstractCegarLoop]: Abstraction has 184 states and 214 transitions. [2021-07-05 16:52:30,114 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:52:30,114 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 214 transitions. [2021-07-05 16:52:30,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-07-05 16:52:30,115 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:52:30,115 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:52:30,115 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-07-05 16:52:30,115 INFO L374 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:52:30,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:52:30,116 INFO L82 PathProgramCache]: Analyzing trace with hash -583886829, now seen corresponding path program 1 times [2021-07-05 16:52:30,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:52:30,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645302248] [2021-07-05 16:52:30,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:52:30,116 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:52:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:52:30,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:30,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:30,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:30,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:52:30,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:30,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:52:30,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:30,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:52:30,382 INFO L142 QuantifierPusher]: treesize reduction 3, result has 92.1 percent of original size [2021-07-05 16:52:30,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-07-05 16:52:30,423 INFO L142 QuantifierPusher]: treesize reduction 3, result has 92.1 percent of original size [2021-07-05 16:52:30,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-07-05 16:52:30,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:30,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-07-05 16:52:30,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:30,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:52:30,511 INFO L142 QuantifierPusher]: treesize reduction 9, result has 70.0 percent of original size [2021-07-05 16:52:30,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:52:30,531 INFO L142 QuantifierPusher]: treesize reduction 15, result has 75.8 percent of original size [2021-07-05 16:52:30,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-07-05 16:52:30,605 INFO L142 QuantifierPusher]: treesize reduction 22, result has 48.8 percent of original size [2021-07-05 16:52:30,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:52:30,606 INFO L142 QuantifierPusher]: treesize reduction 18, result has 60.9 percent of original size [2021-07-05 16:52:30,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-07-05 16:52:30,639 INFO L142 QuantifierPusher]: treesize reduction 11, result has 73.8 percent of original size [2021-07-05 16:52:30,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:52:30,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:30,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-07-05 16:52:30,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:30,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-07-05 16:52:30,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:30,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:30,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:30,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:30,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:30,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:30,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:52:30,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:52:30,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645302248] [2021-07-05 16:52:30,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645302248] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:52:30,731 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:52:30,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-07-05 16:52:30,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870221055] [2021-07-05 16:52:30,732 INFO L425 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-07-05 16:52:30,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:52:30,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-07-05 16:52:30,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-07-05 16:52:30,732 INFO L87 Difference]: Start difference. First operand 184 states and 214 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:52:37,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:52:37,903 INFO L93 Difference]: Finished difference Result 557 states and 632 transitions. [2021-07-05 16:52:37,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-07-05 16:52:37,904 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-07-05 16:52:37,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:52:37,905 INFO L225 Difference]: With dead ends: 557 [2021-07-05 16:52:37,905 INFO L226 Difference]: Without dead ends: 506 [2021-07-05 16:52:37,906 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 835.5ms TimeCoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2021-07-05 16:52:37,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-07-05 16:52:37,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 184. [2021-07-05 16:52:37,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.169398907103825) internal successors, (214), 183 states have internal predecessors, (214), 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-07-05 16:52:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 214 transitions. [2021-07-05 16:52:37,914 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 214 transitions. Word has length 78 [2021-07-05 16:52:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:52:37,914 INFO L442 AbstractCegarLoop]: Abstraction has 184 states and 214 transitions. [2021-07-05 16:52:37,914 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:52:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 214 transitions. [2021-07-05 16:52:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-07-05 16:52:37,915 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:52:37,915 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:52:37,915 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-07-05 16:52:37,916 INFO L374 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:52:37,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:52:37,916 INFO L82 PathProgramCache]: Analyzing trace with hash 849123353, now seen corresponding path program 1 times [2021-07-05 16:52:37,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:52:37,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114128456] [2021-07-05 16:52:37,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:52:37,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:52:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:52:39,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:39,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:39,666 INFO L142 QuantifierPusher]: treesize reduction 17, result has 37.0 percent of original size [2021-07-05 16:52:39,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:52:39,675 INFO L142 QuantifierPusher]: treesize reduction 17, result has 45.2 percent of original size [2021-07-05 16:52:39,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:52:39,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:39,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:52:39,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:39,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:52:39,709 INFO L142 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-07-05 16:52:39,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:52:39,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:39,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:52:39,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:39,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:52:39,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:39,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:39,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:52:39,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:52:39,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114128456] [2021-07-05 16:52:39,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114128456] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:52:39,763 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:52:39,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-05 16:52:39,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357701361] [2021-07-05 16:52:39,764 INFO L425 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-05 16:52:39,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:52:39,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-05 16:52:39,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-07-05 16:52:39,766 INFO L87 Difference]: Start difference. First operand 184 states and 214 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:52:46,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:52:46,329 INFO L93 Difference]: Finished difference Result 294 states and 339 transitions. [2021-07-05 16:52:46,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-05 16:52:46,329 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-07-05 16:52:46,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:52:46,330 INFO L225 Difference]: With dead ends: 294 [2021-07-05 16:52:46,330 INFO L226 Difference]: Without dead ends: 203 [2021-07-05 16:52:46,330 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 260.6ms TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2021-07-05 16:52:46,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-07-05 16:52:46,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 180. [2021-07-05 16:52:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.1620111731843576) internal successors, (208), 179 states have internal predecessors, (208), 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-07-05 16:52:46,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 208 transitions. [2021-07-05 16:52:46,335 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 208 transitions. Word has length 78 [2021-07-05 16:52:46,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:52:46,335 INFO L442 AbstractCegarLoop]: Abstraction has 180 states and 208 transitions. [2021-07-05 16:52:46,335 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:52:46,336 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 208 transitions. [2021-07-05 16:52:46,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-05 16:52:46,336 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:52:46,336 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:52:46,336 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-07-05 16:52:46,337 INFO L374 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:52:46,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:52:46,337 INFO L82 PathProgramCache]: Analyzing trace with hash -535729249, now seen corresponding path program 1 times [2021-07-05 16:52:46,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:52:46,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62082084] [2021-07-05 16:52:46,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:52:46,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:52:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:52:46,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:46,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:46,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:46,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:52:46,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:46,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:52:46,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:46,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:52:46,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:46,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:52:46,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:46,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-07-05 16:52:46,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:46,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:52:46,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:52:46,574 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62082084] [2021-07-05 16:52:46,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62082084] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:52:46,574 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:52:46,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:52:46,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836989140] [2021-07-05 16:52:46,575 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:52:46,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:52:46,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:52:46,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:52:46,575 INFO L87 Difference]: Start difference. First operand 180 states and 208 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-07-05 16:52:46,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:52:46,727 INFO L93 Difference]: Finished difference Result 280 states and 318 transitions. [2021-07-05 16:52:46,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 16:52:46,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-07-05 16:52:46,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:52:46,728 INFO L225 Difference]: With dead ends: 280 [2021-07-05 16:52:46,728 INFO L226 Difference]: Without dead ends: 187 [2021-07-05 16:52:46,728 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 81.1ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:52:46,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-07-05 16:52:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 178. [2021-07-05 16:52:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.152542372881356) internal successors, (204), 177 states have internal predecessors, (204), 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-07-05 16:52:46,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 204 transitions. [2021-07-05 16:52:46,734 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 204 transitions. Word has length 82 [2021-07-05 16:52:46,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:52:46,734 INFO L442 AbstractCegarLoop]: Abstraction has 178 states and 204 transitions. [2021-07-05 16:52:46,734 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-07-05 16:52:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 204 transitions. [2021-07-05 16:52:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-07-05 16:52:46,735 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:52:46,735 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:52:46,735 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-07-05 16:52:46,735 INFO L374 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:52:46,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:52:46,736 INFO L82 PathProgramCache]: Analyzing trace with hash 807158182, now seen corresponding path program 1 times [2021-07-05 16:52:46,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:52:46,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143976690] [2021-07-05 16:52:46,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:52:46,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:52:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:52:46,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:46,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:46,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:46,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-05 16:52:46,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:46,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:52:46,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:46,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:52:46,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:46,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:52:46,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:52:46,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143976690] [2021-07-05 16:52:46,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143976690] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:52:46,992 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:52:46,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:52:46,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557136553] [2021-07-05 16:52:46,992 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:52:46,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:52:46,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:52:46,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:52:46,993 INFO L87 Difference]: Start difference. First operand 178 states and 204 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-07-05 16:52:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:52:49,263 INFO L93 Difference]: Finished difference Result 427 states and 482 transitions. [2021-07-05 16:52:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:52:49,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-07-05 16:52:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:52:49,265 INFO L225 Difference]: With dead ends: 427 [2021-07-05 16:52:49,265 INFO L226 Difference]: Without dead ends: 274 [2021-07-05 16:52:49,265 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 27.3ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:52:49,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-07-05 16:52:49,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 173. [2021-07-05 16:52:49,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.1162790697674418) internal successors, (192), 172 states have internal predecessors, (192), 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-07-05 16:52:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 192 transitions. [2021-07-05 16:52:49,272 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 192 transitions. Word has length 84 [2021-07-05 16:52:49,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:52:49,272 INFO L442 AbstractCegarLoop]: Abstraction has 173 states and 192 transitions. [2021-07-05 16:52:49,272 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-07-05 16:52:49,272 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 192 transitions. [2021-07-05 16:52:49,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-07-05 16:52:49,273 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:52:49,273 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:52:49,273 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-07-05 16:52:49,273 INFO L374 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:52:49,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:52:49,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1548647068, now seen corresponding path program 1 times [2021-07-05 16:52:49,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:52:49,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497786671] [2021-07-05 16:52:49,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:52:49,274 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:52:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:52:49,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:49,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:49,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:49,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:52:49,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:49,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:52:49,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:49,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:49,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:52:49,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:52:49,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497786671] [2021-07-05 16:52:49,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497786671] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:52:49,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:52:49,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:52:49,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040447462] [2021-07-05 16:52:49,379 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:52:49,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:52:49,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:52:49,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:52:49,380 INFO L87 Difference]: Start difference. First operand 173 states and 192 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-07-05 16:52:49,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:52:49,431 INFO L93 Difference]: Finished difference Result 330 states and 365 transitions. [2021-07-05 16:52:49,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:52:49,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-07-05 16:52:49,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:52:49,432 INFO L225 Difference]: With dead ends: 330 [2021-07-05 16:52:49,432 INFO L226 Difference]: Without dead ends: 160 [2021-07-05 16:52:49,433 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:52:49,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-07-05 16:52:49,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2021-07-05 16:52:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.0849673202614378) internal successors, (166), 153 states have internal predecessors, (166), 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-07-05 16:52:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2021-07-05 16:52:49,439 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 84 [2021-07-05 16:52:49,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:52:49,439 INFO L442 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2021-07-05 16:52:49,439 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-07-05 16:52:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2021-07-05 16:52:49,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-07-05 16:52:49,440 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:52:49,440 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:52:49,440 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-07-05 16:52:49,441 INFO L374 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:52:49,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:52:49,441 INFO L82 PathProgramCache]: Analyzing trace with hash -777527254, now seen corresponding path program 1 times [2021-07-05 16:52:49,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:52:49,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412777125] [2021-07-05 16:52:49,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:52:49,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:52:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:52:51,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:51,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:51,159 INFO L142 QuantifierPusher]: treesize reduction 15, result has 40.0 percent of original size [2021-07-05 16:52:51,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:52:51,170 INFO L142 QuantifierPusher]: treesize reduction 15, result has 48.3 percent of original size [2021-07-05 16:52:51,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:52:51,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:51,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:52:51,189 INFO L142 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-07-05 16:52:51,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:52:51,199 INFO L142 QuantifierPusher]: treesize reduction 9, result has 57.1 percent of original size [2021-07-05 16:52:51,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:52:51,210 INFO L142 QuantifierPusher]: treesize reduction 9, result has 47.1 percent of original size [2021-07-05 16:52:51,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-05 16:52:51,222 INFO L142 QuantifierPusher]: treesize reduction 9, result has 47.1 percent of original size [2021-07-05 16:52:51,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-05 16:52:51,235 INFO L142 QuantifierPusher]: treesize reduction 12, result has 7.7 percent of original size [2021-07-05 16:52:51,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:51,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:51,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:52:51,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:52:51,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412777125] [2021-07-05 16:52:51,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412777125] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:52:51,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:52:51,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-05 16:52:51,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110879905] [2021-07-05 16:52:51,237 INFO L425 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-05 16:52:51,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:52:51,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-05 16:52:51,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-07-05 16:52:51,238 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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-07-05 16:52:57,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:52:57,597 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2021-07-05 16:52:57,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-05 16:52:57,598 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-07-05 16:52:57,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:52:57,599 INFO L225 Difference]: With dead ends: 185 [2021-07-05 16:52:57,599 INFO L226 Difference]: Without dead ends: 139 [2021-07-05 16:52:57,599 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 173.7ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-07-05 16:52:57,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-07-05 16:52:57,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 95. [2021-07-05 16:52:57,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.0851063829787233) internal successors, (102), 94 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:52:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2021-07-05 16:52:57,603 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 84 [2021-07-05 16:52:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:52:57,604 INFO L442 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2021-07-05 16:52:57,604 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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-07-05 16:52:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2021-07-05 16:52:57,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-07-05 16:52:57,604 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:52:57,605 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:52:57,605 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-07-05 16:52:57,605 INFO L374 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:52:57,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:52:57,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1991682718, now seen corresponding path program 1 times [2021-07-05 16:52:57,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:52:57,606 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384332658] [2021-07-05 16:52:57,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:52:57,606 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:52:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:52:57,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:57,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:57,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:57,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:52:57,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:57,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-05 16:52:57,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:57,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:52:57,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:57,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-07-05 16:52:57,997 INFO L142 QuantifierPusher]: treesize reduction 3, result has 93.0 percent of original size [2021-07-05 16:52:57,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-07-05 16:52:58,030 INFO L142 QuantifierPusher]: treesize reduction 3, result has 93.0 percent of original size [2021-07-05 16:52:58,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-07-05 16:52:58,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:58,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-07-05 16:52:58,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:58,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-07-05 16:52:58,122 INFO L142 QuantifierPusher]: treesize reduction 9, result has 74.3 percent of original size [2021-07-05 16:52:58,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-07-05 16:52:58,148 INFO L142 QuantifierPusher]: treesize reduction 15, result has 80.0 percent of original size [2021-07-05 16:52:58,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-07-05 16:52:58,212 INFO L142 QuantifierPusher]: treesize reduction 22, result has 54.2 percent of original size [2021-07-05 16:52:58,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-07-05 16:52:58,214 INFO L142 QuantifierPusher]: treesize reduction 18, result has 64.7 percent of original size [2021-07-05 16:52:58,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-07-05 16:52:58,251 INFO L142 QuantifierPusher]: treesize reduction 18, result has 60.9 percent of original size [2021-07-05 16:52:58,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-07-05 16:52:58,285 INFO L142 QuantifierPusher]: treesize reduction 11, result has 73.8 percent of original size [2021-07-05 16:52:58,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:52:58,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:58,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-07-05 16:52:58,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:58,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-07-05 16:52:58,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:58,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:58,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:58,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:58,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:52:58,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:52:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:52:58,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:52:58,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384332658] [2021-07-05 16:52:58,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384332658] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:52:58,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:52:58,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-07-05 16:52:58,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941100643] [2021-07-05 16:52:58,422 INFO L425 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-07-05 16:52:58,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:52:58,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-07-05 16:52:58,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-07-05 16:52:58,423 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 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-07-05 16:53:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:53:10,119 INFO L93 Difference]: Finished difference Result 186 states and 197 transitions. [2021-07-05 16:53:10,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-07-05 16:53:10,119 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-07-05 16:53:10,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:53:10,120 INFO L225 Difference]: With dead ends: 186 [2021-07-05 16:53:10,120 INFO L226 Difference]: Without dead ends: 179 [2021-07-05 16:53:10,120 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1330.3ms TimeCoverageRelationStatistics Valid=311, Invalid=1021, Unknown=0, NotChecked=0, Total=1332 [2021-07-05 16:53:10,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-07-05 16:53:10,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 154. [2021-07-05 16:53:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.0718954248366013) internal successors, (164), 153 states have internal predecessors, (164), 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-07-05 16:53:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2021-07-05 16:53:10,127 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 84 [2021-07-05 16:53:10,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:53:10,127 INFO L442 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2021-07-05 16:53:10,127 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 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-07-05 16:53:10,128 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2021-07-05 16:53:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-07-05 16:53:10,128 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:53:10,128 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:53:10,129 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-07-05 16:53:10,129 INFO L374 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:53:10,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:53:10,129 INFO L82 PathProgramCache]: Analyzing trace with hash -558672536, now seen corresponding path program 1 times [2021-07-05 16:53:10,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:53:10,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196777235] [2021-07-05 16:53:10,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:53:10,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:53:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:53:12,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:12,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:53:12,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:12,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:53:12,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:12,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-07-05 16:53:12,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:12,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-07-05 16:53:12,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:12,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-07-05 16:53:12,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:12,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-07-05 16:53:12,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:12,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-07-05 16:53:12,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:12,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:53:12,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:12,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:53:12,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:53:12,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:53:12,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196777235] [2021-07-05 16:53:12,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196777235] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:53:12,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:53:12,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:53:12,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038806160] [2021-07-05 16:53:12,721 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 16:53:12,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:53:12,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 16:53:12,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:53:12,722 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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-07-05 16:53:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:53:17,059 INFO L93 Difference]: Finished difference Result 303 states and 322 transitions. [2021-07-05 16:53:17,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 16:53:17,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-07-05 16:53:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:53:17,060 INFO L225 Difference]: With dead ends: 303 [2021-07-05 16:53:17,060 INFO L226 Difference]: Without dead ends: 154 [2021-07-05 16:53:17,060 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 138.3ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:53:17,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-07-05 16:53:17,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2021-07-05 16:53:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.065359477124183) internal successors, (163), 153 states have internal predecessors, (163), 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-07-05 16:53:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 163 transitions. [2021-07-05 16:53:17,067 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 163 transitions. Word has length 84 [2021-07-05 16:53:17,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:53:17,067 INFO L442 AbstractCegarLoop]: Abstraction has 154 states and 163 transitions. [2021-07-05 16:53:17,067 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 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-07-05 16:53:17,067 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 163 transitions. [2021-07-05 16:53:17,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-05 16:53:17,068 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:53:17,068 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:53:17,068 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-07-05 16:53:17,068 INFO L374 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:53:17,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:53:17,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1229257371, now seen corresponding path program 1 times [2021-07-05 16:53:17,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:53:17,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641975378] [2021-07-05 16:53:17,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:53:17,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:53:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:53:22,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:22,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:53:22,908 INFO L142 QuantifierPusher]: treesize reduction 20, result has 25.9 percent of original size [2021-07-05 16:53:22,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:53:22,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:22,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:53:22,919 INFO L142 QuantifierPusher]: treesize reduction 6, result has 33.3 percent of original size [2021-07-05 16:53:22,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:53:22,924 INFO L142 QuantifierPusher]: treesize reduction 5, result has 58.3 percent of original size [2021-07-05 16:53:22,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:53:22,933 INFO L142 QuantifierPusher]: treesize reduction 9, result has 43.8 percent of original size [2021-07-05 16:53:22,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:53:22,943 INFO L142 QuantifierPusher]: treesize reduction 10, result has 69.7 percent of original size [2021-07-05 16:53:22,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-05 16:53:22,968 INFO L142 QuantifierPusher]: treesize reduction 5, result has 72.2 percent of original size [2021-07-05 16:53:22,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-05 16:53:22,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:22,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-07-05 16:53:23,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:23,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-05 16:53:23,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:23,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:53:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:53:23,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:53:23,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641975378] [2021-07-05 16:53:23,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641975378] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:53:23,014 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:53:23,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-05 16:53:23,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4233621] [2021-07-05 16:53:23,014 INFO L425 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-05 16:53:23,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:53:23,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-05 16:53:23,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-07-05 16:53:23,015 INFO L87 Difference]: Start difference. First operand 154 states and 163 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 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-07-05 16:53:25,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:53:25,306 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2021-07-05 16:53:25,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 16:53:25,307 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-07-05 16:53:25,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:53:25,307 INFO L225 Difference]: With dead ends: 161 [2021-07-05 16:53:25,307 INFO L226 Difference]: Without dead ends: 147 [2021-07-05 16:53:25,307 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 182.2ms TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-07-05 16:53:25,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-07-05 16:53:25,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-07-05 16:53:25,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.047945205479452) internal successors, (153), 146 states have internal predecessors, (153), 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-07-05 16:53:25,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 153 transitions. [2021-07-05 16:53:25,314 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 153 transitions. Word has length 85 [2021-07-05 16:53:25,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:53:25,314 INFO L442 AbstractCegarLoop]: Abstraction has 147 states and 153 transitions. [2021-07-05 16:53:25,315 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 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-07-05 16:53:25,315 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 153 transitions. [2021-07-05 16:53:25,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-05 16:53:25,315 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:53:25,315 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:53:25,316 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-07-05 16:53:25,316 INFO L374 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:53:25,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:53:25,316 INFO L82 PathProgramCache]: Analyzing trace with hash 900732317, now seen corresponding path program 1 times [2021-07-05 16:53:25,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:53:25,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447266408] [2021-07-05 16:53:25,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:53:25,317 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:53:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:53:25,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:25,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:53:25,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:25,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:53:25,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:25,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-07-05 16:53:25,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:25,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-07-05 16:53:25,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:25,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-07-05 16:53:25,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:25,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-07-05 16:53:25,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:25,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:53:25,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:25,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:53:25,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:25,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:53:25,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:25,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:53:25,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:25,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:53:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:53:25,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:53:25,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447266408] [2021-07-05 16:53:25,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447266408] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:53:25,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:53:25,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:53:25,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902925797] [2021-07-05 16:53:25,724 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 16:53:25,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:53:25,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 16:53:25,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:53:25,725 INFO L87 Difference]: Start difference. First operand 147 states and 153 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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-07-05 16:53:32,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:53:32,128 INFO L93 Difference]: Finished difference Result 194 states and 202 transitions. [2021-07-05 16:53:32,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 16:53:32,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-07-05 16:53:32,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:53:32,129 INFO L225 Difference]: With dead ends: 194 [2021-07-05 16:53:32,129 INFO L226 Difference]: Without dead ends: 147 [2021-07-05 16:53:32,129 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 162.5ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-07-05 16:53:32,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-07-05 16:53:32,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-07-05 16:53:32,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.0410958904109588) internal successors, (152), 146 states have internal predecessors, (152), 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-07-05 16:53:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 152 transitions. [2021-07-05 16:53:32,134 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 152 transitions. Word has length 85 [2021-07-05 16:53:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:53:32,134 INFO L442 AbstractCegarLoop]: Abstraction has 147 states and 152 transitions. [2021-07-05 16:53:32,134 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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-07-05 16:53:32,134 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 152 transitions. [2021-07-05 16:53:32,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-05 16:53:32,135 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:53:32,135 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:53:32,135 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-07-05 16:53:32,135 INFO L374 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:53:32,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:53:32,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1794218655, now seen corresponding path program 1 times [2021-07-05 16:53:32,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:53:32,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114995983] [2021-07-05 16:53:32,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:53:32,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:53:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:53:35,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:35,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:53:35,552 INFO L142 QuantifierPusher]: treesize reduction 18, result has 45.5 percent of original size [2021-07-05 16:53:35,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:53:35,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:35,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-05 16:53:35,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:35,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:53:35,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:35,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-05 16:53:35,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:35,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-07-05 16:53:35,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:35,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-07-05 16:53:35,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:35,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-07-05 16:53:35,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:35,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-07-05 16:53:35,629 INFO L142 QuantifierPusher]: treesize reduction 27, result has 47.1 percent of original size [2021-07-05 16:53:35,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-07-05 16:53:35,645 INFO L142 QuantifierPusher]: treesize reduction 46, result has 57.8 percent of original size [2021-07-05 16:53:35,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-07-05 16:53:35,689 INFO L142 QuantifierPusher]: treesize reduction 56, result has 63.4 percent of original size [2021-07-05 16:53:35,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 97 [2021-07-05 16:53:35,706 INFO L142 QuantifierPusher]: treesize reduction 56, result has 67.6 percent of original size [2021-07-05 16:53:35,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 117 [2021-07-05 16:53:35,768 INFO L142 QuantifierPusher]: treesize reduction 56, result has 67.6 percent of original size [2021-07-05 16:53:35,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 117 [2021-07-05 16:53:35,834 INFO L142 QuantifierPusher]: treesize reduction 56, result has 62.9 percent of original size [2021-07-05 16:53:35,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 95 [2021-07-05 16:53:35,892 INFO L142 QuantifierPusher]: treesize reduction 38, result has 55.3 percent of original size [2021-07-05 16:53:35,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-07-05 16:53:35,916 INFO L142 QuantifierPusher]: treesize reduction 38, result has 47.9 percent of original size [2021-07-05 16:53:35,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-07-05 16:53:35,953 INFO L142 QuantifierPusher]: treesize reduction 34, result has 60.9 percent of original size [2021-07-05 16:53:35,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-07-05 16:53:36,011 INFO L142 QuantifierPusher]: treesize reduction 38, result has 66.1 percent of original size [2021-07-05 16:53:36,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2021-07-05 16:53:36,093 INFO L142 QuantifierPusher]: treesize reduction 38, result has 70.3 percent of original size [2021-07-05 16:53:36,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 90 [2021-07-05 16:53:36,136 INFO L142 QuantifierPusher]: treesize reduction 34, result has 55.8 percent of original size [2021-07-05 16:53:36,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-07-05 16:53:36,190 INFO L142 QuantifierPusher]: treesize reduction 34, result has 52.8 percent of original size [2021-07-05 16:53:36,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-07-05 16:53:36,231 INFO L142 QuantifierPusher]: treesize reduction 28, result has 59.4 percent of original size [2021-07-05 16:53:36,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-07-05 16:53:36,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:36,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-07-05 16:53:36,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:36,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-07-05 16:53:36,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:36,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:53:36,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:36,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:53:36,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:36,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:53:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:53:36,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:53:36,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114995983] [2021-07-05 16:53:36,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114995983] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:53:36,350 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:53:36,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-07-05 16:53:36,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060426793] [2021-07-05 16:53:36,351 INFO L425 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-07-05 16:53:36,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:53:36,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-07-05 16:53:36,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-07-05 16:53:36,351 INFO L87 Difference]: Start difference. First operand 147 states and 152 transitions. Second operand has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 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-07-05 16:53:50,545 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2021-07-05 16:53:50,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:53:50,573 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2021-07-05 16:53:50,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-07-05 16:53:50,574 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-07-05 16:53:50,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:53:50,574 INFO L225 Difference]: With dead ends: 154 [2021-07-05 16:53:50,574 INFO L226 Difference]: Without dead ends: 147 [2021-07-05 16:53:50,574 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1786.4ms TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2021-07-05 16:53:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-07-05 16:53:50,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 109. [2021-07-05 16:53:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 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-07-05 16:53:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 112 transitions. [2021-07-05 16:53:50,579 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 112 transitions. Word has length 85 [2021-07-05 16:53:50,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:53:50,579 INFO L442 AbstractCegarLoop]: Abstraction has 109 states and 112 transitions. [2021-07-05 16:53:50,579 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 20 states have internal predecessors, (85), 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-07-05 16:53:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2021-07-05 16:53:50,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-05 16:53:50,580 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:53:50,580 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:53:50,580 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2021-07-05 16:53:50,580 INFO L374 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:53:50,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:53:50,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1816478630, now seen corresponding path program 1 times [2021-07-05 16:53:50,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:53:50,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747787066] [2021-07-05 16:53:50,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:53:50,581 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:53:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:53:50,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:50,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:53:50,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:50,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:53:50,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:50,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:53:50,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:50,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:53:50,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:50,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:53:50,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:50,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:53:50,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:50,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:53:50,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:50,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:53:50,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:53:50,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:53:50,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747787066] [2021-07-05 16:53:50,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747787066] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:53:50,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:53:50,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:53:50,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62506385] [2021-07-05 16:53:50,824 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 16:53:50,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:53:50,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 16:53:50,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:53:50,825 INFO L87 Difference]: Start difference. First operand 109 states and 112 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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-07-05 16:53:50,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:53:50,991 INFO L93 Difference]: Finished difference Result 146 states and 149 transitions. [2021-07-05 16:53:50,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 16:53:50,992 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-07-05 16:53:50,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:53:50,992 INFO L225 Difference]: With dead ends: 146 [2021-07-05 16:53:50,993 INFO L226 Difference]: Without dead ends: 138 [2021-07-05 16:53:50,993 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 85.4ms TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-07-05 16:53:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-07-05 16:53:50,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 109. [2021-07-05 16:53:50,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 108 states have internal predecessors, (111), 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-07-05 16:53:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2021-07-05 16:53:50,998 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 87 [2021-07-05 16:53:50,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:53:50,998 INFO L442 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2021-07-05 16:53:50,998 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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-07-05 16:53:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2021-07-05 16:53:50,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-05 16:53:50,998 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:53:50,998 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:53:50,998 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-07-05 16:53:50,999 INFO L374 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:53:50,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:53:50,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1669142040, now seen corresponding path program 1 times [2021-07-05 16:53:50,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:53:50,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87791169] [2021-07-05 16:53:50,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:53:50,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:53:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:53:51,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:51,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:53:51,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:51,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:53:51,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:51,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-05 16:53:51,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:51,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:53:51,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:51,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:53:51,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:51,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-07-05 16:53:51,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:51,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-07-05 16:53:51,442 INFO L142 QuantifierPusher]: treesize reduction 9, result has 72.7 percent of original size [2021-07-05 16:53:51,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-07-05 16:53:51,465 INFO L142 QuantifierPusher]: treesize reduction 15, result has 79.5 percent of original size [2021-07-05 16:53:51,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 58 [2021-07-05 16:53:51,523 INFO L142 QuantifierPusher]: treesize reduction 22, result has 52.2 percent of original size [2021-07-05 16:53:51,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-07-05 16:53:51,524 INFO L142 QuantifierPusher]: treesize reduction 18, result has 63.3 percent of original size [2021-07-05 16:53:51,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:53:51,554 INFO L142 QuantifierPusher]: treesize reduction 18, result has 59.1 percent of original size [2021-07-05 16:53:51,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-07-05 16:53:51,580 INFO L142 QuantifierPusher]: treesize reduction 11, result has 72.5 percent of original size [2021-07-05 16:53:51,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-07-05 16:53:51,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:51,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:53:51,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:51,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-07-05 16:53:51,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:51,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:53:51,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:51,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:53:51,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:51,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:53:51,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:53:51,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:53:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:53:51,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:53:51,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87791169] [2021-07-05 16:53:51,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87791169] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:53:51,746 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:53:51,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-07-05 16:53:51,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153469050] [2021-07-05 16:53:51,746 INFO L425 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-07-05 16:53:51,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:53:51,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-07-05 16:53:51,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-07-05 16:53:51,747 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 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-07-05 16:53:58,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:53:58,739 INFO L93 Difference]: Finished difference Result 195 states and 198 transitions. [2021-07-05 16:53:58,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-05 16:53:58,740 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-07-05 16:53:58,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:53:58,740 INFO L225 Difference]: With dead ends: 195 [2021-07-05 16:53:58,740 INFO L226 Difference]: Without dead ends: 88 [2021-07-05 16:53:58,741 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 752.0ms TimeCoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2021-07-05 16:53:58,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-07-05 16:53:58,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-07-05 16:53:58,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 87 states have internal predecessors, (88), 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-07-05 16:53:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2021-07-05 16:53:58,744 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 87 [2021-07-05 16:53:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:53:58,744 INFO L442 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2021-07-05 16:53:58,744 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 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-07-05 16:53:58,744 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2021-07-05 16:53:58,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-05 16:53:58,744 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:53:58,744 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:53:58,744 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2021-07-05 16:53:58,745 INFO L374 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:53:58,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:53:58,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2024973480, now seen corresponding path program 1 times [2021-07-05 16:53:58,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:53:58,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951878232] [2021-07-05 16:53:58,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:53:58,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:54:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:54:01,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:01,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:01,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:01,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:54:01,821 INFO L142 QuantifierPusher]: treesize reduction 29, result has 9.4 percent of original size [2021-07-05 16:54:01,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:54:01,826 INFO L142 QuantifierPusher]: treesize reduction 15, result has 51.6 percent of original size [2021-07-05 16:54:01,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-07-05 16:54:01,842 INFO L142 QuantifierPusher]: treesize reduction 15, result has 57.1 percent of original size [2021-07-05 16:54:01,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:54:01,863 INFO L142 QuantifierPusher]: treesize reduction 15, result has 57.1 percent of original size [2021-07-05 16:54:01,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:54:01,885 INFO L142 QuantifierPusher]: treesize reduction 15, result has 57.1 percent of original size [2021-07-05 16:54:01,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:54:01,908 INFO L142 QuantifierPusher]: treesize reduction 15, result has 57.1 percent of original size [2021-07-05 16:54:01,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:54:01,933 INFO L142 QuantifierPusher]: treesize reduction 21, result has 36.4 percent of original size [2021-07-05 16:54:01,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:54:01,945 INFO L142 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-07-05 16:54:01,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:54:01,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:01,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:01,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:01,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:01,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:01,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:01,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:01,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:02,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:02,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:54:02,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:02,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:54:02,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:02,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:02,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:54:02,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:54:02,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951878232] [2021-07-05 16:54:02,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951878232] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:54:02,060 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:54:02,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-07-05 16:54:02,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753113286] [2021-07-05 16:54:02,061 INFO L425 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-07-05 16:54:02,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:54:02,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-07-05 16:54:02,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-07-05 16:54:02,061 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 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-07-05 16:54:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:54:04,840 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2021-07-05 16:54:04,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-07-05 16:54:04,840 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-07-05 16:54:04,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:54:04,841 INFO L225 Difference]: With dead ends: 88 [2021-07-05 16:54:04,841 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 16:54:04,841 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 696.4ms TimeCoverageRelationStatistics Valid=284, Invalid=906, Unknown=0, NotChecked=0, Total=1190 [2021-07-05 16:54:04,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 16:54:04,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 16:54:04,841 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-07-05 16:54:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 16:54:04,841 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2021-07-05 16:54:04,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:54:04,841 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 16:54:04,841 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 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-07-05 16:54:04,842 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 16:54:04,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 16:54:04,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 16:54:04,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:04,843 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:04,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:04,848 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:04,865 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:04,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:04,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:04,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:04,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:04,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:04,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:05,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:05,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:05,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:05,036 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:05,049 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:05,050 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:05,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:05,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:05,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:05,052 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:05,095 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:05,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:05,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:05,337 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 74 [2021-07-05 16:54:05,712 WARN L205 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 90 [2021-07-05 16:54:06,399 WARN L205 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 69 [2021-07-05 16:54:07,015 WARN L205 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 92 [2021-07-05 16:54:08,063 WARN L205 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 173 DAG size of output: 80 [2021-07-05 16:54:08,170 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 14 [2021-07-05 16:54:08,448 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2021-07-05 16:54:09,296 WARN L205 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 127 [2021-07-05 16:54:09,308 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,308 INFO L762 garLoopResultBuilder]: For program point L9153(lines 9153 9155) no Hoare annotation was computed. [2021-07-05 16:54:09,308 INFO L762 garLoopResultBuilder]: For program point L9153-2(lines 9153 9155) no Hoare annotation was computed. [2021-07-05 16:54:09,308 INFO L762 garLoopResultBuilder]: For program point L6973(lines 6973 6978) no Hoare annotation was computed. [2021-07-05 16:54:09,308 INFO L758 garLoopResultBuilder]: At program point L268(line 268) the Hoare annotation is: false [2021-07-05 16:54:09,308 INFO L762 garLoopResultBuilder]: For program point L6974(lines 6974 6976) no Hoare annotation was computed. [2021-07-05 16:54:09,308 INFO L762 garLoopResultBuilder]: For program point L6974-2(lines 6974 6976) no Hoare annotation was computed. [2021-07-05 16:54:09,308 INFO L762 garLoopResultBuilder]: For program point L7141-2(line 7141) no Hoare annotation was computed. [2021-07-05 16:54:09,308 INFO L762 garLoopResultBuilder]: For program point L7141(line 7141) no Hoare annotation was computed. [2021-07-05 16:54:09,308 INFO L765 garLoopResultBuilder]: At program point L9157(line 9157) the Hoare annotation is: true [2021-07-05 16:54:09,308 INFO L762 garLoopResultBuilder]: For program point L6979(lines 6979 6981) no Hoare annotation was computed. [2021-07-05 16:54:09,309 INFO L758 garLoopResultBuilder]: At program point L6979-3(lines 6965 6982) the Hoare annotation is: (let ((.cse27 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse26 (select .cse27 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse22 (= |ULTIMATE.start_can_fail_realloc_#res.base| 0))) (let ((.cse19 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse20 (not .cse22)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse3 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse12 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse14 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse21 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse15 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse24 (* .cse26 (- 1))) (.cse18 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (and (let ((.cse23 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse11 (select (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse0 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse2 (let ((.cse25 (select .cse27 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= (* 4294967296 (div (+ (* (div (+ .cse24 4294967295 .cse25) 4294967296) 4294967296) .cse26) 4294967296)) .cse25))) (.cse8 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse10 (<= (* 4294967296 (div (+ .cse11 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse23 4294967296)) 4294967296)) .cse11)) (.cse13 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse16 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse17 (<= (+ |#StackHeapBarrier| 1) ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse9 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse11 (* 4294967296 (div .cse11 4294967296))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse20 .cse16 .cse17 .cse18) (and .cse4 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) .cse9 (= |ULTIMATE.start_can_fail_realloc_#res.offset| 0) .cse21 .cse15 .cse22 (<= (+ (* 4294967296 .cse23) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity))))) (let ((.cse34 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse30 (select .cse34 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse28 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse29 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse32 (let ((.cse33 (select .cse34 12))) (<= .cse33 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse33) 4294967296)))))) (.cse31 (div .cse30 4294967296))) (or (and .cse1 .cse3 .cse19 .cse5 .cse6 .cse7 .cse12 .cse14 .cse21 .cse15 .cse20 .cse18) (and .cse28 .cse1 .cse3 .cse29 .cse5 .cse6 .cse7 .cse12 (<= .cse30 (* 4294967296 .cse31)) .cse14 .cse32 .cse21 .cse15 .cse18) (and .cse28 .cse1 .cse3 .cse29 .cse5 .cse6 .cse7 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0)) .cse12 .cse14 .cse32 .cse21 .cse15 (<= .cse30 (+ (* 4294967296 (div (+ .cse24 (* .cse31 4294967296) 4294967295) 4294967296)) .cse26)) .cse18))))))))) [2021-07-05 16:54:09,309 INFO L762 garLoopResultBuilder]: For program point L6979-2(lines 6979 6981) no Hoare annotation was computed. [2021-07-05 16:54:09,309 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,309 INFO L762 garLoopResultBuilder]: For program point L7145(lines 7145 7151) no Hoare annotation was computed. [2021-07-05 16:54:09,309 INFO L758 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:54:09,309 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,309 INFO L762 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:54:09,309 INFO L762 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:54:09,309 INFO L762 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:54:09,309 INFO L762 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:54:09,309 INFO L762 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:54:09,309 INFO L762 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:54:09,309 INFO L762 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:54:09,309 INFO L762 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:54:09,309 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,310 INFO L762 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-07-05 16:54:09,310 INFO L762 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-07-05 16:54:09,310 INFO L762 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-07-05 16:54:09,310 INFO L762 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-07-05 16:54:09,310 INFO L762 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-07-05 16:54:09,310 INFO L762 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-07-05 16:54:09,310 INFO L762 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-07-05 16:54:09,310 INFO L762 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-07-05 16:54:09,310 INFO L765 garLoopResultBuilder]: At program point L6951-1(lines 6950 6952) the Hoare annotation is: true [2021-07-05 16:54:09,310 INFO L758 garLoopResultBuilder]: At program point L6951(lines 6950 6952) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:54:09,310 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,310 INFO L765 garLoopResultBuilder]: At program point L6655(lines 6653 6656) the Hoare annotation is: true [2021-07-05 16:54:09,310 INFO L765 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: true [2021-07-05 16:54:09,310 INFO L765 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: true [2021-07-05 16:54:09,310 INFO L758 garLoopResultBuilder]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: (let ((.cse12 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse13 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (let ((.cse17 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse8 (select .cse17 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse0 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse3 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse5 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse6 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse7 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse11 (let ((.cse16 (select .cse17 12))) (<= .cse16 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse16) 4294967296)))))) (.cse9 (div .cse8 4294967296)) (.cse14 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse8 (* 4294967296 .cse9)) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0)) .cse7 .cse10 .cse11 .cse12 .cse13 (<= .cse8 (let ((.cse15 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse15 (- 1)) (* .cse9 4294967296) 4294967295) 4294967296)) .cse15))) .cse14))))) (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity) .cse12 .cse13 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity) (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0))) [2021-07-05 16:54:09,310 INFO L762 garLoopResultBuilder]: For program point L8176-1(line 8176) no Hoare annotation was computed. [2021-07-05 16:54:09,311 INFO L758 garLoopResultBuilder]: At program point L8176-4(line 8176) the Hoare annotation is: (let ((.cse34 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse35 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 16)) (.cse36 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse25 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse13 (select .cse25 12)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse29 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse36) 0)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse30 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse36) 0)) (.cse31 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse35) 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse10 (not (= (select .cse34 4) 0))) (.cse11 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse15 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse27 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse16 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse17 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse21 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse32 (= (select .cse34 .cse35) 0))) (let ((.cse22 (and .cse1 .cse29 .cse2 .cse30 .cse31 .cse4 .cse6 .cse10 .cse11 .cse15 .cse27 .cse16 .cse17 .cse21 .cse32)) (.cse23 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse13) 4294967296)))) (.cse7 (let ((.cse33 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (<= .cse33 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse33) 4294967296)))))) (.cse0 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse3 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse26 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (and (let ((.cse24 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse5 (select .cse25 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse20 (select .cse24 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse18 (select .cse24 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (let ((.cse19 (div .cse18 4294967296)) (.cse8 (<= .cse13 .cse23)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse12 (<= .cse20 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse20) 4294967296))))) (.cse14 (div .cse5 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse5) 4294967296)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse5 (+ .cse13 (* 4294967296 (div (+ (* .cse14 4294967296) 4294967295 (* .cse13 (- 1))) 4294967296)))) .cse15 .cse16 .cse17 (<= .cse18 (+ (* 4294967296 (div (+ (* .cse19 4294967296) (* .cse20 (- 1)) 4294967295) 4294967296)) .cse20)) .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse18 (* 4294967296 .cse19)) .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 (<= .cse5 (* 4294967296 .cse14)) .cse16 .cse17 .cse21) .cse22)))) (or .cse22 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse26 .cse11 (<= (select .cse25 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 12)) .cse23) .cse15 .cse27 .cse16 .cse17 .cse21)) (let ((.cse28 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (or (and .cse1 .cse2 .cse4 .cse28 .cse6 .cse26 .cse7 .cse10 .cse11 .cse15 .cse27 .cse16 .cse17 .cse21) (and .cse1 .cse29 .cse2 .cse30 .cse31 .cse4 .cse28 .cse6 .cse10 .cse11 .cse15 .cse27 .cse16 .cse17 .cse21 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse28 .cse6 .cse26 .cse10 .cse11 .cse15 .cse27 .cse16 .cse17 .cse21))))))) [2021-07-05 16:54:09,311 INFO L762 garLoopResultBuilder]: For program point L8176-3(line 8176) no Hoare annotation was computed. [2021-07-05 16:54:09,311 INFO L762 garLoopResultBuilder]: For program point L8177-3(lines 8175 8193) no Hoare annotation was computed. [2021-07-05 16:54:09,311 INFO L762 garLoopResultBuilder]: For program point L8177-2(line 8177) no Hoare annotation was computed. [2021-07-05 16:54:09,311 INFO L762 garLoopResultBuilder]: For program point L8177(line 8177) no Hoare annotation was computed. [2021-07-05 16:54:09,311 INFO L762 garLoopResultBuilder]: For program point L8177-4(line 8177) no Hoare annotation was computed. [2021-07-05 16:54:09,311 INFO L762 garLoopResultBuilder]: For program point L6658(lines 6658 6663) no Hoare annotation was computed. [2021-07-05 16:54:09,311 INFO L762 garLoopResultBuilder]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:54:09,311 INFO L762 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:54:09,311 INFO L762 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:54:09,311 INFO L762 garLoopResultBuilder]: For program point L7154(lines 7154 7156) no Hoare annotation was computed. [2021-07-05 16:54:09,311 INFO L762 garLoopResultBuilder]: For program point L6659(lines 6659 6661) no Hoare annotation was computed. [2021-07-05 16:54:09,311 INFO L762 garLoopResultBuilder]: For program point L6659-2(lines 6659 6661) no Hoare annotation was computed. [2021-07-05 16:54:09,311 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 16:54:09,311 INFO L762 garLoopResultBuilder]: For program point L7122(lines 7122 7135) no Hoare annotation was computed. [2021-07-05 16:54:09,311 INFO L762 garLoopResultBuilder]: For program point L8179(lines 8179 8182) no Hoare annotation was computed. [2021-07-05 16:54:09,311 INFO L762 garLoopResultBuilder]: For program point L9137(lines 9137 9156) no Hoare annotation was computed. [2021-07-05 16:54:09,312 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,312 INFO L758 garLoopResultBuilder]: At program point L7158(lines 7137 7159) the Hoare annotation is: (let ((.cse7 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse8 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse9 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse10 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse11 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse15 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse19 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse3 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse4 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and (let ((.cse5 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse14 (select (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse6 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse0 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse12 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse2 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse13 (<= (* 4294967296 (div (+ .cse14 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse5 4294967296)) 4294967296)) .cse14)) (.cse16 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse17 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse18 (<= (+ |#StackHeapBarrier| 1) ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_aws_mem_realloc_#res| 1) 0) .cse3 .cse4 (<= (+ (* 4294967296 .cse5) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (and .cse6 .cse7 .cse8 .cse0 .cse9 .cse10 .cse11 .cse12 .cse1 .cse2 .cse13 (<= .cse14 (* 4294967296 (div .cse14 4294967296))) .cse15 .cse16 .cse3 .cse4 .cse17 .cse18 .cse19) (and .cse6 .cse7 .cse8 .cse0 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0)) (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4) .cse9 .cse10 .cse11 .cse12 .cse1 .cse2 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0)) .cse13 (not (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0)) .cse15 .cse16 .cse3 .cse4 (not (= |ULTIMATE.start_can_fail_realloc_#res.base| 0)) .cse17 .cse18 .cse19)))) (let ((.cse28 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse22 (select .cse28 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse20 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse21 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse24 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse25 (let ((.cse27 (select .cse28 12))) (<= .cse27 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse27) 4294967296)))))) (.cse23 (div .cse22 4294967296))) (or (and .cse20 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse15 (<= .cse22 (* 4294967296 .cse23)) .cse24 .cse25 .cse3 .cse4 .cse19) (and .cse20 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0)) .cse15 .cse24 .cse25 .cse3 .cse4 (<= .cse22 (let ((.cse26 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse26 (- 1)) (* .cse23 4294967296) 4294967295) 4294967296)) .cse26))) .cse19) (and .cse1 .cse3 .cse4 (= |ULTIMATE.start_aws_mem_realloc_#res| 0)))))))) [2021-07-05 16:54:09,312 INFO L762 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:54:09,312 INFO L762 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:54:09,312 INFO L762 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:54:09,312 INFO L762 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:54:09,312 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,312 INFO L762 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:54:09,312 INFO L762 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:54:09,312 INFO L762 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:54:09,312 INFO L762 garLoopResultBuilder]: For program point L222-7(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:54:09,312 INFO L762 garLoopResultBuilder]: For program point L222-8(lines 7162 7172) no Hoare annotation was computed. [2021-07-05 16:54:09,312 INFO L762 garLoopResultBuilder]: For program point L222-9(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:54:09,312 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 16:54:09,312 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,312 INFO L762 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,313 INFO L762 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,313 INFO L762 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,313 INFO L762 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,313 INFO L762 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,313 INFO L762 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,313 INFO L762 garLoopResultBuilder]: For program point L8184(lines 8184 8187) no Hoare annotation was computed. [2021-07-05 16:54:09,313 INFO L762 garLoopResultBuilder]: For program point L7160(lines 7160 7173) no Hoare annotation was computed. [2021-07-05 16:54:09,313 INFO L762 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,313 INFO L762 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,313 INFO L762 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,313 INFO L762 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,313 INFO L762 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,313 INFO L762 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,313 INFO L762 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,313 INFO L762 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,313 INFO L762 garLoopResultBuilder]: For program point L223-21(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,313 INFO L762 garLoopResultBuilder]: For program point L223-22(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,313 INFO L762 garLoopResultBuilder]: For program point L223-24(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,313 INFO L762 garLoopResultBuilder]: For program point L223-25(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,313 INFO L762 garLoopResultBuilder]: For program point L7491-1(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:09,314 INFO L762 garLoopResultBuilder]: For program point L7491(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,314 INFO L762 garLoopResultBuilder]: For program point L223-27(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,314 INFO L762 garLoopResultBuilder]: For program point L223-28(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,314 INFO L762 garLoopResultBuilder]: For program point L7491-4(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:09,314 INFO L762 garLoopResultBuilder]: For program point L7491-3(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:09,314 INFO L762 garLoopResultBuilder]: For program point L7491-9(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,314 INFO L762 garLoopResultBuilder]: For program point L7491-7(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,314 INFO L762 garLoopResultBuilder]: For program point L7491-6(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:09,314 INFO L762 garLoopResultBuilder]: For program point L7491-13(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,314 INFO L758 garLoopResultBuilder]: At program point L7491-12(lines 7489 7495) the Hoare annotation is: (let ((.cse18 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse20 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse1 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse20) 0)) (.cse3 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse20) 0)) (.cse17 (select .cse18 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse7 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse8 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse10 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (let ((.cse11 (and (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse2 .cse4 .cse6 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse7 .cse8 .cse9 .cse10)) (.cse13 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse14 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse15 (<= .cse17 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse17) 4294967296))))) (.cse19 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10))) (and (let ((.cse5 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 (and .cse0 .cse2 .cse4 .cse5 (let ((.cse12 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (<= .cse12 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse12) 4294967296))))) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse13 .cse0 .cse2 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (or .cse11 (and .cse13 .cse0 .cse2 .cse14 .cse4 .cse6 .cse15 .cse7 .cse8 .cse9 (let ((.cse16 (select .cse18 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= .cse16 (+ (* 4294967296 (div (+ (* (div .cse16 4294967296) 4294967296) (* .cse17 (- 1)) 4294967295) 4294967296)) .cse17))) .cse10) .cse19) (or .cse11 (and .cse13 .cse0 .cse2 .cse14 .cse4 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10) .cse19))))) [2021-07-05 16:54:09,314 INFO L762 garLoopResultBuilder]: For program point L7491-11(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,314 INFO L762 garLoopResultBuilder]: For program point L7491-17(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:09,314 INFO L762 garLoopResultBuilder]: For program point L7491-16(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:09,314 INFO L762 garLoopResultBuilder]: For program point L7491-14(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:09,314 INFO L762 garLoopResultBuilder]: For program point L7491-20(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,314 INFO L762 garLoopResultBuilder]: For program point L7491-19(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:09,315 INFO L758 garLoopResultBuilder]: At program point L7491-25(lines 7489 7495) the Hoare annotation is: (let ((.cse30 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse18 (select .cse30 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse29 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse31 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse4 (select .cse31 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse28 (select .cse29 12)) (.cse21 (div .cse18 4294967296)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse5 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse7 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse24 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0))) (.cse10 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0))) (.cse25 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse11 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse12 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse13 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse14 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (let ((.cse6 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse8 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse15 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse16 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse0 (and (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse1 .cse5 .cse7 .cse9 .cse24 .cse10 .cse25 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse11 .cse12 .cse13 .cse14)) (.cse19 (* .cse21 4294967296)) (.cse17 (<= .cse28 (+ (* 4294967296 (div (+ (- 1) .cse28) 4294967296)) 4294967295))) (.cse3 (select .cse31 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse2 (* .cse4 (- 1)))) (and (or .cse0 (and .cse1 (<= (* 4294967296 (div (+ (* (div (+ .cse2 4294967295 .cse3) 4294967296) 4294967296) .cse4) 4294967296)) .cse3) .cse5 .cse6 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) (or (and .cse15 .cse1 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 (<= .cse18 (+ (* 4294967296 (div (+ .cse2 .cse19 4294967295) 4294967296)) .cse4)) .cse14) .cse0) (let ((.cse20 (let ((.cse27 (select .cse30 12))) (let ((.cse23 (<= .cse27 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse27) 4294967296))))) (.cse26 (<= .cse4 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse4) 4294967296))))) (.cse22 (select .cse29 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (or (and .cse1 .cse5 (<= (* 4294967296 (div (+ .cse22 4294967295) 4294967296)) .cse22) (<= (* 4294967296 (div (+ 4294967295 .cse3) 4294967296)) .cse3) (<= (* 4294967296 (div (+ .cse18 4294967295) 4294967296)) .cse18) .cse7 .cse23 .cse9 .cse24 .cse10 .cse25 .cse26 .cse11 .cse12 .cse13 .cse17 .cse14) (and (<= .cse3 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse3) 4294967296)))) .cse1 .cse5 (<= .cse18 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse18) 4294967296)))) .cse7 (<= .cse22 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse22) 4294967296)))) .cse23 .cse9 .cse24 .cse10 .cse25 .cse26 (<= .cse18 (+ .cse27 (* 4294967296 (div (+ .cse19 4294967295 (* .cse27 (- 1))) 4294967296)))) .cse11 .cse12 (<= .cse22 (+ (* 4294967296 (div (+ (* (div .cse22 4294967296) 4294967296) 4294967295 (* .cse28 (- 1))) 4294967296)) .cse28)) .cse13 .cse17 (<= .cse3 (+ (* 4294967296 (div (+ (* (div .cse3 4294967296) 4294967296) .cse2 4294967295) 4294967296)) .cse4)) .cse14)))))) (or (and .cse20 (<= .cse18 (* 4294967296 .cse21))) (and .cse15 .cse16 .cse20) .cse0))))))) [2021-07-05 16:54:09,315 INFO L762 garLoopResultBuilder]: For program point L7491-24(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,315 INFO L762 garLoopResultBuilder]: For program point L7491-22(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,315 INFO L762 garLoopResultBuilder]: For program point L7491-29(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:09,315 INFO L762 garLoopResultBuilder]: For program point L7491-27(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:09,315 INFO L762 garLoopResultBuilder]: For program point L7491-26(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,315 INFO L762 garLoopResultBuilder]: For program point L7491-33(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,315 INFO L762 garLoopResultBuilder]: For program point L7491-32(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:09,315 INFO L762 garLoopResultBuilder]: For program point L7491-30(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:09,315 INFO L762 garLoopResultBuilder]: For program point L7491-37(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,315 INFO L762 garLoopResultBuilder]: For program point L7491-35(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,316 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,316 INFO L762 garLoopResultBuilder]: For program point L7491-40(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:09,316 INFO L762 garLoopResultBuilder]: For program point L7491-39(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,316 INFO L758 garLoopResultBuilder]: At program point L7491-38(lines 7489 7495) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:54:09,316 INFO L762 garLoopResultBuilder]: For program point L7491-45(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:09,316 INFO L762 garLoopResultBuilder]: For program point L7491-43(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:09,316 INFO L762 garLoopResultBuilder]: For program point L7491-42(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:09,316 INFO L762 garLoopResultBuilder]: For program point L7491-48(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,317 INFO L762 garLoopResultBuilder]: For program point L7491-46(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,317 INFO L762 garLoopResultBuilder]: For program point L7491-53(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:09,317 INFO L762 garLoopResultBuilder]: For program point L7491-52(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,317 INFO L758 garLoopResultBuilder]: At program point L7491-51(lines 7489 7495) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:54:09,317 INFO L762 garLoopResultBuilder]: For program point L7491-50(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,317 INFO L762 garLoopResultBuilder]: For program point L7491-56(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:09,317 INFO L762 garLoopResultBuilder]: For program point L7491-55(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:09,317 INFO L762 garLoopResultBuilder]: For program point L7491-61(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,318 INFO L762 garLoopResultBuilder]: For program point L7491-59(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,318 INFO L762 garLoopResultBuilder]: For program point L7491-58(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:09,318 INFO L762 garLoopResultBuilder]: For program point L7491-65(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,318 INFO L758 garLoopResultBuilder]: At program point L7491-64(lines 7489 7495) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:54:09,318 INFO L762 garLoopResultBuilder]: For program point L7491-63(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,318 INFO L762 garLoopResultBuilder]: For program point L7491-69(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:09,318 INFO L762 garLoopResultBuilder]: For program point L7491-68(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:09,318 INFO L762 garLoopResultBuilder]: For program point L7491-66(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:09,319 INFO L762 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2021-07-05 16:54:09,319 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 16:54:09,319 INFO L762 garLoopResultBuilder]: For program point L7491-72(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,319 INFO L762 garLoopResultBuilder]: For program point L7491-71(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:09,319 INFO L765 garLoopResultBuilder]: At program point L7491-77(lines 7489 7495) the Hoare annotation is: true [2021-07-05 16:54:09,319 INFO L762 garLoopResultBuilder]: For program point L7491-76(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,319 INFO L762 garLoopResultBuilder]: For program point L7491-74(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,319 INFO L762 garLoopResultBuilder]: For program point L9145(lines 9145 9148) no Hoare annotation was computed. [2021-07-05 16:54:09,320 INFO L762 garLoopResultBuilder]: For program point L9145-2(lines 9145 9148) no Hoare annotation was computed. [2021-07-05 16:54:09,320 INFO L762 garLoopResultBuilder]: For program point L7494(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,320 INFO L762 garLoopResultBuilder]: For program point L7494-4(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,320 INFO L762 garLoopResultBuilder]: For program point L7494-3(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,320 INFO L762 garLoopResultBuilder]: For program point L7494-2(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,320 INFO L762 garLoopResultBuilder]: For program point L7494-8(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,320 INFO L762 garLoopResultBuilder]: For program point L7494-6(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,320 INFO L762 garLoopResultBuilder]: For program point L7494-12(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,321 INFO L762 garLoopResultBuilder]: For program point L7494-11(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,321 INFO L762 garLoopResultBuilder]: For program point L7494-9(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,321 INFO L762 garLoopResultBuilder]: For program point L6966(lines 6966 6972) no Hoare annotation was computed. [2021-07-05 16:54:09,321 INFO L762 garLoopResultBuilder]: For program point L7494-15(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,321 INFO L762 garLoopResultBuilder]: For program point L7494-13(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,321 INFO L762 garLoopResultBuilder]: For program point L7494-20(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,321 INFO L762 garLoopResultBuilder]: For program point L7494-18(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,321 INFO L762 garLoopResultBuilder]: For program point L7494-17(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,321 INFO L762 garLoopResultBuilder]: For program point L7494-24(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,322 INFO L762 garLoopResultBuilder]: For program point L7494-22(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,322 INFO L762 garLoopResultBuilder]: For program point L7494-21(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,322 INFO L762 garLoopResultBuilder]: For program point L7494-27(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,322 INFO L762 garLoopResultBuilder]: For program point L7494-26(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,322 INFO L762 garLoopResultBuilder]: For program point L7494-31(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,322 INFO L762 garLoopResultBuilder]: For program point L7494-30(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,322 INFO L762 garLoopResultBuilder]: For program point L7494-29(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,322 INFO L758 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:54:09,323 INFO L762 garLoopResultBuilder]: For program point L7494-36(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,323 INFO L758 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: false [2021-07-05 16:54:09,323 INFO L762 garLoopResultBuilder]: For program point L7494-35(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,323 INFO L758 garLoopResultBuilder]: At program point L261-2(line 261) the Hoare annotation is: (let ((.cse30 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse9 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse29 (select .cse30 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (let ((.cse3 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse5 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0))) (.cse6 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse7 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse27 (* .cse29 (- 1))) (.cse31 (select .cse9 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse25 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse8 (select .cse9 12))) (<= .cse8 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse8) 4294967296))))) .cse10 (let ((.cse13 (select (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse11 (let ((.cse32 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse33 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse14 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse15 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse16 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse17 (not (= (select .cse33 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 4)) 0))) (.cse18 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse19 (not (= (select .cse33 4) 0))) (.cse20 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse21 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0))) (.cse22 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse23 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse24 (<= (+ |#StackHeapBarrier| 1) ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse26 (<= (+ (* 4294967296 .cse32) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity))) (or (and .cse14 .cse0 .cse1 .cse15 (<= (* 4294967296 (div (+ .cse16 4294967295) 4294967296)) .cse16) .cse2 .cse4 .cse17 .cse18 .cse19 .cse5 .cse20 .cse21 .cse6 (<= (* 4294967296 (div (+ 4294967295 .cse13) 4294967296)) .cse13) .cse7 .cse22 .cse10 .cse23 .cse24 .cse25 .cse26) (and .cse14 .cse0 (let ((.cse28 (select .cse30 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= (* 4294967296 (div (+ (* (div (+ .cse27 4294967295 .cse28) 4294967296) 4294967296) .cse29) 4294967296)) .cse28)) .cse1 .cse15 .cse2 (<= .cse31 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse31) 4294967296)))) .cse4 (<= .cse16 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse16) 4294967296)))) .cse17 .cse18 .cse19 (<= (* 4294967296 (div (+ .cse13 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse32 4294967296)) 4294967296)) .cse13) .cse5 .cse20 .cse21 .cse6 .cse7 .cse22 .cse10 .cse23 .cse24 .cse25 .cse26))))) (.cse12 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4) .cse11 .cse3 .cse12) (and .cse11 .cse3 .cse12 (<= .cse13 (* 4294967296 (div .cse13 4294967296))))))) (<= .cse31 (+ (* 4294967296 (div (+ .cse27 (* (div .cse31 4294967296) 4294967296) 4294967295) 4294967296)) .cse29)) .cse25)))) [2021-07-05 16:54:09,323 INFO L762 garLoopResultBuilder]: For program point L7494-33(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,324 INFO L762 garLoopResultBuilder]: For program point L7494-40(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,324 INFO L762 garLoopResultBuilder]: For program point L7494-39(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,324 INFO L762 garLoopResultBuilder]: For program point L7494-38(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,324 INFO L762 garLoopResultBuilder]: For program point L7494-44(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,324 INFO L762 garLoopResultBuilder]: For program point L7494-42(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,324 INFO L762 garLoopResultBuilder]: For program point L7494-48(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,324 INFO L762 garLoopResultBuilder]: For program point L7494-47(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,324 INFO L762 garLoopResultBuilder]: For program point L7494-45(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,324 INFO L762 garLoopResultBuilder]: For program point L7494-51(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,325 INFO L762 garLoopResultBuilder]: For program point L7494-49(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,325 INFO L762 garLoopResultBuilder]: For program point L7494-53(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:09,325 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 16:54:09,325 INFO L762 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2021-07-05 16:54:09,325 INFO L758 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: (let ((.cse2 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse3 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse6 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse10 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (and (let ((.cse7 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse8 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse12 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse3 .cse4 .cse5 .cse6 (let ((.cse11 (select .cse12 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (<= .cse11 (* 4294967296 (div .cse11 4294967296)))) .cse7 (let ((.cse13 (select .cse12 12))) (<= .cse13 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse13) 4294967296))))) .cse8 .cse9 .cse10)))) (let ((.cse24 (select (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse14 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse15 (let ((.cse27 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse26 (select .cse27 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= (* 4294967296 (div (let ((.cse25 (select .cse27 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* (div (+ (* .cse25 (- 1)) 4294967295 .cse26) 4294967296) 4294967296) .cse25)) 4294967296)) .cse26)))) (.cse16 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse17 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse18 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse19 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse20 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse21 (<= (* 4294967296 (div (+ .cse24 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296) 4294967296)) 4294967296)) .cse24)) (.cse22 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse23 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0)))) (or (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse2 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4) .cse3 .cse17 .cse4 .cse5 .cse18 .cse19 .cse20 .cse21 .cse6 .cse22 .cse9 .cse23 .cse10) (and .cse14 .cse0 .cse15 .cse1 .cse16 .cse3 .cse17 .cse4 .cse5 .cse18 .cse19 .cse20 .cse21 (<= .cse24 (* 4294967296 (div .cse24 4294967296))) .cse6 .cse22 .cse9 .cse23 .cse10)))))) [2021-07-05 16:54:09,325 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:54:09,326 INFO L765 garLoopResultBuilder]: At program point L8192(lines 8175 8193) the Hoare annotation is: true [2021-07-05 16:54:09,326 INFO L765 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: true [2021-07-05 16:54:09,326 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2021-07-05 16:54:09,326 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 16:54:09,326 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION was SAFE (3/10) [2021-07-05 16:54:09,327 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 16:54:09,328 INFO L329 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 16:54:09,328 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 16:54:09,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 200 states have internal predecessors, (281), 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-07-05 16:54:09,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-07-05 16:54:09,330 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:54:09,330 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:54:09,330 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:54:09,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:54:09,330 INFO L82 PathProgramCache]: Analyzing trace with hash -478674777, now seen corresponding path program 1 times [2021-07-05 16:54:09,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:54:09,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38434270] [2021-07-05 16:54:09,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:54:09,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:54:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:54:09,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:09,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:09,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:09,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:54:09,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:54:09,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38434270] [2021-07-05 16:54:09,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38434270] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:54:09,403 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:54:09,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 16:54:09,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063784167] [2021-07-05 16:54:09,404 INFO L425 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-05 16:54:09,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:54:09,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-05 16:54:09,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-05 16:54:09,404 INFO L87 Difference]: Start difference. First operand has 201 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 200 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-07-05 16:54:09,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:54:09,406 INFO L93 Difference]: Finished difference Result 395 states and 553 transitions. [2021-07-05 16:54:09,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-05 16:54:09,406 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-07-05 16:54:09,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:54:09,407 INFO L225 Difference]: With dead ends: 395 [2021-07-05 16:54:09,407 INFO L226 Difference]: Without dead ends: 142 [2021-07-05 16:54:09,408 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-05 16:54:09,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-07-05 16:54:09,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-07-05 16:54:09,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.3404255319148937) internal successors, (189), 141 states have internal predecessors, (189), 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-07-05 16:54:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 189 transitions. [2021-07-05 16:54:09,410 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 189 transitions. Word has length 22 [2021-07-05 16:54:09,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:54:09,410 INFO L442 AbstractCegarLoop]: Abstraction has 142 states and 189 transitions. [2021-07-05 16:54:09,410 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-07-05 16:54:09,410 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 189 transitions. [2021-07-05 16:54:09,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-07-05 16:54:09,411 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:54:09,411 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:54:09,411 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2021-07-05 16:54:09,411 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:54:09,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:54:09,412 INFO L82 PathProgramCache]: Analyzing trace with hash -2067022679, now seen corresponding path program 1 times [2021-07-05 16:54:09,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:54:09,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580016244] [2021-07-05 16:54:09,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:54:09,412 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:54:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:54:09,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:09,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:09,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:09,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:54:09,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:09,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-07-05 16:54:09,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:09,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:54:09,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:54:09,531 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580016244] [2021-07-05 16:54:09,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580016244] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:54:09,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:54:09,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:54:09,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801602398] [2021-07-05 16:54:09,532 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:54:09,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:54:09,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:54:09,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:54:09,532 INFO L87 Difference]: Start difference. First operand 142 states and 189 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-07-05 16:54:09,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:54:09,568 INFO L93 Difference]: Finished difference Result 261 states and 347 transitions. [2021-07-05 16:54:09,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:54:09,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-07-05 16:54:09,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:54:09,569 INFO L225 Difference]: With dead ends: 261 [2021-07-05 16:54:09,569 INFO L226 Difference]: Without dead ends: 142 [2021-07-05 16:54:09,569 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:54:09,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-07-05 16:54:09,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-07-05 16:54:09,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.3333333333333333) internal successors, (188), 141 states have internal predecessors, (188), 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-07-05 16:54:09,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 188 transitions. [2021-07-05 16:54:09,571 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 188 transitions. Word has length 22 [2021-07-05 16:54:09,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:54:09,571 INFO L442 AbstractCegarLoop]: Abstraction has 142 states and 188 transitions. [2021-07-05 16:54:09,571 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-07-05 16:54:09,571 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 188 transitions. [2021-07-05 16:54:09,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-07-05 16:54:09,571 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:54:09,571 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:54:09,571 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2021-07-05 16:54:09,571 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:54:09,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:54:09,572 INFO L82 PathProgramCache]: Analyzing trace with hash 921090108, now seen corresponding path program 1 times [2021-07-05 16:54:09,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:54:09,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167875396] [2021-07-05 16:54:09,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:54:09,572 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:54:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:54:09,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:09,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:09,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:09,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:09,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:09,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:09,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:09,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:09,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:54:09,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:54:09,660 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167875396] [2021-07-05 16:54:09,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167875396] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:54:09,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:54:09,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:54:09,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386692838] [2021-07-05 16:54:09,661 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:54:09,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:54:09,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:54:09,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:54:09,661 INFO L87 Difference]: Start difference. First operand 142 states and 188 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-07-05 16:54:09,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:54:09,761 INFO L93 Difference]: Finished difference Result 380 states and 514 transitions. [2021-07-05 16:54:09,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:54:09,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-07-05 16:54:09,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:54:09,762 INFO L225 Difference]: With dead ends: 380 [2021-07-05 16:54:09,762 INFO L226 Difference]: Without dead ends: 252 [2021-07-05 16:54:09,762 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:54:09,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-07-05 16:54:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 152. [2021-07-05 16:54:09,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.3112582781456954) internal successors, (198), 151 states have internal predecessors, (198), 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-07-05 16:54:09,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 198 transitions. [2021-07-05 16:54:09,765 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 198 transitions. Word has length 28 [2021-07-05 16:54:09,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:54:09,765 INFO L442 AbstractCegarLoop]: Abstraction has 152 states and 198 transitions. [2021-07-05 16:54:09,765 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-07-05 16:54:09,765 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2021-07-05 16:54:09,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-07-05 16:54:09,766 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:54:09,766 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:54:09,766 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2021-07-05 16:54:09,766 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:54:09,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:54:09,766 INFO L82 PathProgramCache]: Analyzing trace with hash -99978246, now seen corresponding path program 1 times [2021-07-05 16:54:09,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:54:09,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200868291] [2021-07-05 16:54:09,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:54:09,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:54:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:54:09,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:09,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:09,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:09,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:09,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:09,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:09,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:09,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:54:09,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:54:09,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200868291] [2021-07-05 16:54:09,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200868291] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:54:09,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:54:09,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:54:09,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860178177] [2021-07-05 16:54:09,877 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:54:09,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:54:09,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:54:09,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:54:09,877 INFO L87 Difference]: Start difference. First operand 152 states and 198 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-07-05 16:54:09,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:54:09,972 INFO L93 Difference]: Finished difference Result 330 states and 435 transitions. [2021-07-05 16:54:09,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:54:09,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-07-05 16:54:09,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:54:09,973 INFO L225 Difference]: With dead ends: 330 [2021-07-05 16:54:09,973 INFO L226 Difference]: Without dead ends: 202 [2021-07-05 16:54:09,973 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:54:09,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-07-05 16:54:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 162. [2021-07-05 16:54:09,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.2919254658385093) internal successors, (208), 161 states have internal predecessors, (208), 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-07-05 16:54:09,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 208 transitions. [2021-07-05 16:54:09,976 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 208 transitions. Word has length 28 [2021-07-05 16:54:09,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:54:09,976 INFO L442 AbstractCegarLoop]: Abstraction has 162 states and 208 transitions. [2021-07-05 16:54:09,976 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-07-05 16:54:09,976 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 208 transitions. [2021-07-05 16:54:09,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-07-05 16:54:09,977 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:54:09,977 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:54:09,977 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2021-07-05 16:54:09,977 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:54:09,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:54:09,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1379732482, now seen corresponding path program 1 times [2021-07-05 16:54:09,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:54:09,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375852833] [2021-07-05 16:54:09,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:54:09,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:54:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:54:10,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:10,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:10,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:10,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 16:54:10,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:10,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 16:54:10,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:10,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 16:54:10,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:10,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:54:10,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:54:10,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375852833] [2021-07-05 16:54:10,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375852833] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:54:10,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:54:10,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:54:10,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785868036] [2021-07-05 16:54:10,096 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:54:10,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:54:10,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:54:10,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:54:10,096 INFO L87 Difference]: Start difference. First operand 162 states and 208 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-07-05 16:54:10,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:54:10,152 INFO L93 Difference]: Finished difference Result 218 states and 277 transitions. [2021-07-05 16:54:10,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 16:54:10,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-07-05 16:54:10,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:54:10,153 INFO L225 Difference]: With dead ends: 218 [2021-07-05 16:54:10,153 INFO L226 Difference]: Without dead ends: 165 [2021-07-05 16:54:10,154 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:54:10,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-07-05 16:54:10,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 137. [2021-07-05 16:54:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.2720588235294117) internal successors, (173), 136 states have internal predecessors, (173), 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-07-05 16:54:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 173 transitions. [2021-07-05 16:54:10,156 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 173 transitions. Word has length 28 [2021-07-05 16:54:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:54:10,156 INFO L442 AbstractCegarLoop]: Abstraction has 137 states and 173 transitions. [2021-07-05 16:54:10,156 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-07-05 16:54:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 173 transitions. [2021-07-05 16:54:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-07-05 16:54:10,157 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:54:10,157 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:54:10,157 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2021-07-05 16:54:10,157 INFO L374 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:54:10,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:54:10,157 INFO L82 PathProgramCache]: Analyzing trace with hash 493252140, now seen corresponding path program 1 times [2021-07-05 16:54:10,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:54:10,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477325320] [2021-07-05 16:54:10,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:54:10,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:54:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:54:10,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:10,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:10,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:10,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:54:10,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:10,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:54:10,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:10,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:54:10,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:10,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:54:10,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:10,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:10,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:10,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:54:10,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:54:10,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477325320] [2021-07-05 16:54:10,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477325320] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:54:10,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:54:10,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:54:10,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721004887] [2021-07-05 16:54:10,278 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:54:10,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:54:10,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:54:10,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:54:10,278 INFO L87 Difference]: Start difference. First operand 137 states and 173 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:54:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:54:10,347 INFO L93 Difference]: Finished difference Result 222 states and 280 transitions. [2021-07-05 16:54:10,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:54:10,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-07-05 16:54:10,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:54:10,348 INFO L225 Difference]: With dead ends: 222 [2021-07-05 16:54:10,348 INFO L226 Difference]: Without dead ends: 137 [2021-07-05 16:54:10,349 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.3ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-07-05 16:54:10,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-07-05 16:54:10,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-07-05 16:54:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.25) internal successors, (170), 136 states have internal predecessors, (170), 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-07-05 16:54:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2021-07-05 16:54:10,351 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 40 [2021-07-05 16:54:10,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:54:10,351 INFO L442 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2021-07-05 16:54:10,351 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:54:10,351 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2021-07-05 16:54:10,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-07-05 16:54:10,351 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:54:10,351 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:54:10,352 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2021-07-05 16:54:10,352 INFO L374 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:54:10,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:54:10,352 INFO L82 PathProgramCache]: Analyzing trace with hash -296896692, now seen corresponding path program 1 times [2021-07-05 16:54:10,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:54:10,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529096239] [2021-07-05 16:54:10,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:54:10,352 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:54:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:54:11,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:11,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:11,989 INFO L142 QuantifierPusher]: treesize reduction 15, result has 40.0 percent of original size [2021-07-05 16:54:11,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:54:11,997 INFO L142 QuantifierPusher]: treesize reduction 15, result has 48.3 percent of original size [2021-07-05 16:54:11,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:54:12,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:12,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:54:12,016 INFO L142 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-07-05 16:54:12,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:54:12,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:12,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:12,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:12,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:12,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:12,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:54:12,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:54:12,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529096239] [2021-07-05 16:54:12,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529096239] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:54:12,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:54:12,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:54:12,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097055385] [2021-07-05 16:54:12,042 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 16:54:12,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:54:12,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 16:54:12,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:54:12,043 INFO L87 Difference]: Start difference. First operand 137 states and 170 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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-07-05 16:54:16,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:54:16,578 INFO L93 Difference]: Finished difference Result 285 states and 353 transitions. [2021-07-05 16:54:16,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-05 16:54:16,578 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-07-05 16:54:16,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:54:16,579 INFO L225 Difference]: With dead ends: 285 [2021-07-05 16:54:16,579 INFO L226 Difference]: Without dead ends: 174 [2021-07-05 16:54:16,579 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 198.6ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-07-05 16:54:16,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-07-05 16:54:16,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 135. [2021-07-05 16:54:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.2462686567164178) internal successors, (167), 134 states have internal predecessors, (167), 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-07-05 16:54:16,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 167 transitions. [2021-07-05 16:54:16,582 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 167 transitions. Word has length 52 [2021-07-05 16:54:16,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:54:16,582 INFO L442 AbstractCegarLoop]: Abstraction has 135 states and 167 transitions. [2021-07-05 16:54:16,582 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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-07-05 16:54:16,583 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 167 transitions. [2021-07-05 16:54:16,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-07-05 16:54:16,583 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:54:16,583 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:54:16,583 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2021-07-05 16:54:16,583 INFO L374 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:54:16,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:54:16,584 INFO L82 PathProgramCache]: Analyzing trace with hash -27322368, now seen corresponding path program 1 times [2021-07-05 16:54:16,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:54:16,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923392738] [2021-07-05 16:54:16,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:54:16,585 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:54:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:54:16,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:16,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:16,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:16,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:54:16,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:16,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:54:16,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:16,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:54:16,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:16,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:54:16,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:16,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:54:16,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:16,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:54:16,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:16,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:16,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:16,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:16,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:16,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:54:16,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:54:16,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923392738] [2021-07-05 16:54:16,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923392738] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:54:16,806 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:54:16,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-05 16:54:16,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856909715] [2021-07-05 16:54:16,806 INFO L425 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-05 16:54:16,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:54:16,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-05 16:54:16,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:54:16,806 INFO L87 Difference]: Start difference. First operand 135 states and 167 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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-07-05 16:54:26,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:54:26,127 INFO L93 Difference]: Finished difference Result 441 states and 549 transitions. [2021-07-05 16:54:26,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-07-05 16:54:26,128 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-07-05 16:54:26,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:54:26,129 INFO L225 Difference]: With dead ends: 441 [2021-07-05 16:54:26,129 INFO L226 Difference]: Without dead ends: 347 [2021-07-05 16:54:26,129 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 539.8ms TimeCoverageRelationStatistics Valid=276, Invalid=984, Unknown=0, NotChecked=0, Total=1260 [2021-07-05 16:54:26,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-07-05 16:54:26,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 196. [2021-07-05 16:54:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.2461538461538462) internal successors, (243), 195 states have internal predecessors, (243), 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-07-05 16:54:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 243 transitions. [2021-07-05 16:54:26,133 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 243 transitions. Word has length 56 [2021-07-05 16:54:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:54:26,133 INFO L442 AbstractCegarLoop]: Abstraction has 196 states and 243 transitions. [2021-07-05 16:54:26,133 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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-07-05 16:54:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 243 transitions. [2021-07-05 16:54:26,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-07-05 16:54:26,134 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:54:26,134 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:54:26,134 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2021-07-05 16:54:26,134 INFO L374 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:54:26,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:54:26,135 INFO L82 PathProgramCache]: Analyzing trace with hash 396324354, now seen corresponding path program 1 times [2021-07-05 16:54:26,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:54:26,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21865119] [2021-07-05 16:54:26,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:54:26,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:54:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:54:26,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:26,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:26,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:26,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-07-05 16:54:26,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:26,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-05 16:54:26,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:26,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:26,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:26,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:54:26,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:54:26,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21865119] [2021-07-05 16:54:26,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21865119] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:54:26,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:54:26,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:54:26,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697032929] [2021-07-05 16:54:26,305 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:54:26,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:54:26,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:54:26,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:54:26,306 INFO L87 Difference]: Start difference. First operand 196 states and 243 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-07-05 16:54:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:54:28,599 INFO L93 Difference]: Finished difference Result 506 states and 624 transitions. [2021-07-05 16:54:28,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:54:28,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-07-05 16:54:28,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:54:28,601 INFO L225 Difference]: With dead ends: 506 [2021-07-05 16:54:28,601 INFO L226 Difference]: Without dead ends: 348 [2021-07-05 16:54:28,601 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 27.4ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:54:28,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2021-07-05 16:54:28,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 217. [2021-07-05 16:54:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.2222222222222223) internal successors, (264), 216 states have internal predecessors, (264), 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-07-05 16:54:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 264 transitions. [2021-07-05 16:54:28,607 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 264 transitions. Word has length 56 [2021-07-05 16:54:28,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:54:28,607 INFO L442 AbstractCegarLoop]: Abstraction has 217 states and 264 transitions. [2021-07-05 16:54:28,607 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-07-05 16:54:28,607 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 264 transitions. [2021-07-05 16:54:28,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-07-05 16:54:28,607 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:54:28,608 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:54:28,608 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2021-07-05 16:54:28,608 INFO L374 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:54:28,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:54:28,608 INFO L82 PathProgramCache]: Analyzing trace with hash 517439494, now seen corresponding path program 1 times [2021-07-05 16:54:28,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:54:28,608 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222635025] [2021-07-05 16:54:28,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:54:28,608 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:54:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:54:28,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:28,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:28,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:28,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:28,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:28,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:28,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:28,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:28,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:28,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:54:28,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:28,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:54:28,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:28,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:54:28,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:54:28,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222635025] [2021-07-05 16:54:28,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222635025] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:54:28,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:54:28,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:54:28,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390043265] [2021-07-05 16:54:28,774 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:54:28,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:54:28,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:54:28,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:54:28,775 INFO L87 Difference]: Start difference. First operand 217 states and 264 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-07-05 16:54:28,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:54:28,989 INFO L93 Difference]: Finished difference Result 395 states and 476 transitions. [2021-07-05 16:54:28,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 16:54:28,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-07-05 16:54:28,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:54:28,990 INFO L225 Difference]: With dead ends: 395 [2021-07-05 16:54:28,990 INFO L226 Difference]: Without dead ends: 206 [2021-07-05 16:54:28,991 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 66.8ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:54:28,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-07-05 16:54:28,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 147. [2021-07-05 16:54:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.2191780821917808) internal successors, (178), 146 states have internal predecessors, (178), 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-07-05 16:54:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 178 transitions. [2021-07-05 16:54:28,994 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 178 transitions. Word has length 56 [2021-07-05 16:54:28,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:54:28,994 INFO L442 AbstractCegarLoop]: Abstraction has 147 states and 178 transitions. [2021-07-05 16:54:28,994 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-07-05 16:54:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 178 transitions. [2021-07-05 16:54:28,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-07-05 16:54:28,994 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:54:28,994 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:54:28,995 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2021-07-05 16:54:28,995 INFO L374 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:54:28,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:54:28,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1824799899, now seen corresponding path program 1 times [2021-07-05 16:54:28,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:54:28,995 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600699082] [2021-07-05 16:54:28,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:54:28,995 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:54:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:54:30,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:30,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:30,656 INFO L142 QuantifierPusher]: treesize reduction 15, result has 40.0 percent of original size [2021-07-05 16:54:30,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:54:30,666 INFO L142 QuantifierPusher]: treesize reduction 15, result has 48.3 percent of original size [2021-07-05 16:54:30,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:54:30,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:30,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:54:30,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:30,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:54:30,709 INFO L142 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-07-05 16:54:30,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:54:30,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:30,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:30,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:30,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:30,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:30,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:30,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:54:30,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:54:30,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600699082] [2021-07-05 16:54:30,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600699082] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:54:30,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:54:30,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-05 16:54:30,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870129807] [2021-07-05 16:54:30,747 INFO L425 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-05 16:54:30,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:54:30,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-05 16:54:30,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-07-05 16:54:30,748 INFO L87 Difference]: Start difference. First operand 147 states and 178 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 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-07-05 16:54:37,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:54:37,360 INFO L93 Difference]: Finished difference Result 284 states and 344 transitions. [2021-07-05 16:54:37,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-05 16:54:37,361 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-07-05 16:54:37,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:54:37,361 INFO L225 Difference]: With dead ends: 284 [2021-07-05 16:54:37,361 INFO L226 Difference]: Without dead ends: 192 [2021-07-05 16:54:37,362 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 259.2ms TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2021-07-05 16:54:37,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-07-05 16:54:37,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 155. [2021-07-05 16:54:37,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.2142857142857142) internal successors, (187), 154 states have internal predecessors, (187), 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-07-05 16:54:37,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 187 transitions. [2021-07-05 16:54:37,365 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 187 transitions. Word has length 58 [2021-07-05 16:54:37,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:54:37,365 INFO L442 AbstractCegarLoop]: Abstraction has 155 states and 187 transitions. [2021-07-05 16:54:37,365 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 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-07-05 16:54:37,365 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 187 transitions. [2021-07-05 16:54:37,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-07-05 16:54:37,365 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:54:37,366 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:54:37,366 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2021-07-05 16:54:37,366 INFO L374 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:54:37,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:54:37,366 INFO L82 PathProgramCache]: Analyzing trace with hash 840064217, now seen corresponding path program 1 times [2021-07-05 16:54:37,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:54:37,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146369262] [2021-07-05 16:54:37,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:54:37,366 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:54:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:54:37,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:37,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:37,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:37,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:37,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:37,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:37,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:37,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:37,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:37,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:54:37,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:37,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:54:37,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:37,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:37,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:54:37,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:54:37,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146369262] [2021-07-05 16:54:37,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146369262] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:54:37,554 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:54:37,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:54:37,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972735141] [2021-07-05 16:54:37,554 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:54:37,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:54:37,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:54:37,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:54:37,555 INFO L87 Difference]: Start difference. First operand 155 states and 187 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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-07-05 16:54:37,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:54:37,694 INFO L93 Difference]: Finished difference Result 275 states and 328 transitions. [2021-07-05 16:54:37,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 16:54:37,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-07-05 16:54:37,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:54:37,695 INFO L225 Difference]: With dead ends: 275 [2021-07-05 16:54:37,695 INFO L226 Difference]: Without dead ends: 172 [2021-07-05 16:54:37,695 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 68.5ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:54:37,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-07-05 16:54:37,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2021-07-05 16:54:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.2077922077922079) internal successors, (186), 154 states have internal predecessors, (186), 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-07-05 16:54:37,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 186 transitions. [2021-07-05 16:54:37,698 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 186 transitions. Word has length 66 [2021-07-05 16:54:37,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:54:37,698 INFO L442 AbstractCegarLoop]: Abstraction has 155 states and 186 transitions. [2021-07-05 16:54:37,698 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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-07-05 16:54:37,699 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 186 transitions. [2021-07-05 16:54:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-07-05 16:54:37,699 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:54:37,699 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:54:37,699 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2021-07-05 16:54:37,699 INFO L374 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:54:37,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:54:37,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1160153058, now seen corresponding path program 1 times [2021-07-05 16:54:37,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:54:37,699 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198324453] [2021-07-05 16:54:37,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:54:37,700 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:54:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:54:37,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:37,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:37,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:37,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:37,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:37,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:37,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:37,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:37,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:37,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:54:37,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:37,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-07-05 16:54:37,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:37,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:54:37,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:54:37,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198324453] [2021-07-05 16:54:37,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198324453] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:54:37,921 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:54:37,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:54:37,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434633660] [2021-07-05 16:54:37,922 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:54:37,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:54:37,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:54:37,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:54:37,922 INFO L87 Difference]: Start difference. First operand 155 states and 186 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-07-05 16:54:38,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:54:38,051 INFO L93 Difference]: Finished difference Result 172 states and 202 transitions. [2021-07-05 16:54:38,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 16:54:38,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-07-05 16:54:38,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:54:38,052 INFO L225 Difference]: With dead ends: 172 [2021-07-05 16:54:38,052 INFO L226 Difference]: Without dead ends: 155 [2021-07-05 16:54:38,052 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 59.2ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:54:38,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-07-05 16:54:38,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2021-07-05 16:54:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.1948051948051948) internal successors, (184), 154 states have internal predecessors, (184), 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-07-05 16:54:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 184 transitions. [2021-07-05 16:54:38,055 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 184 transitions. Word has length 68 [2021-07-05 16:54:38,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:54:38,055 INFO L442 AbstractCegarLoop]: Abstraction has 155 states and 184 transitions. [2021-07-05 16:54:38,055 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-07-05 16:54:38,056 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 184 transitions. [2021-07-05 16:54:38,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-07-05 16:54:38,056 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:54:38,056 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:54:38,056 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2021-07-05 16:54:38,056 INFO L374 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:54:38,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:54:38,056 INFO L82 PathProgramCache]: Analyzing trace with hash -125938119, now seen corresponding path program 1 times [2021-07-05 16:54:38,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:54:38,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098709083] [2021-07-05 16:54:38,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:54:38,057 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:54:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:54:38,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:38,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:38,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:38,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-05 16:54:38,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:38,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:54:38,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:38,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:38,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:38,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:38,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:54:38,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:54:38,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098709083] [2021-07-05 16:54:38,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098709083] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:54:38,222 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:54:38,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:54:38,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413770016] [2021-07-05 16:54:38,222 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:54:38,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:54:38,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:54:38,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:54:38,222 INFO L87 Difference]: Start difference. First operand 155 states and 184 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-07-05 16:54:40,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:54:40,519 INFO L93 Difference]: Finished difference Result 373 states and 439 transitions. [2021-07-05 16:54:40,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:54:40,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-07-05 16:54:40,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:54:40,520 INFO L225 Difference]: With dead ends: 373 [2021-07-05 16:54:40,520 INFO L226 Difference]: Without dead ends: 240 [2021-07-05 16:54:40,521 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 23.5ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:54:40,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-07-05 16:54:40,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 155. [2021-07-05 16:54:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.1688311688311688) internal successors, (180), 154 states have internal predecessors, (180), 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-07-05 16:54:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 180 transitions. [2021-07-05 16:54:40,525 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 180 transitions. Word has length 70 [2021-07-05 16:54:40,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:54:40,525 INFO L442 AbstractCegarLoop]: Abstraction has 155 states and 180 transitions. [2021-07-05 16:54:40,525 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-07-05 16:54:40,525 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 180 transitions. [2021-07-05 16:54:40,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-07-05 16:54:40,526 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:54:40,526 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:54:40,526 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2021-07-05 16:54:40,526 INFO L374 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:54:40,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:54:40,527 INFO L82 PathProgramCache]: Analyzing trace with hash 645182201, now seen corresponding path program 1 times [2021-07-05 16:54:40,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:54:40,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275235036] [2021-07-05 16:54:40,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:54:40,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:54:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:54:40,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:40,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:40,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:40,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:40,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:40,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:54:40,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:40,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:54:40,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:54:40,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275235036] [2021-07-05 16:54:40,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275235036] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:54:40,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:54:40,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:54:40,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310253356] [2021-07-05 16:54:40,656 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:54:40,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:54:40,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:54:40,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:54:40,657 INFO L87 Difference]: Start difference. First operand 155 states and 180 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-07-05 16:54:40,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:54:40,732 INFO L93 Difference]: Finished difference Result 294 states and 341 transitions. [2021-07-05 16:54:40,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:54:40,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-07-05 16:54:40,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:54:40,733 INFO L225 Difference]: With dead ends: 294 [2021-07-05 16:54:40,733 INFO L226 Difference]: Without dead ends: 135 [2021-07-05 16:54:40,733 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:54:40,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-07-05 16:54:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-07-05 16:54:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.1194029850746268) internal successors, (150), 134 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:54:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2021-07-05 16:54:40,736 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 70 [2021-07-05 16:54:40,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:54:40,736 INFO L442 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2021-07-05 16:54:40,736 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-07-05 16:54:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2021-07-05 16:54:40,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-07-05 16:54:40,741 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:54:40,741 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:54:40,741 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2021-07-05 16:54:40,741 INFO L374 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:54:40,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:54:40,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2129422213, now seen corresponding path program 1 times [2021-07-05 16:54:40,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:54:40,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677404557] [2021-07-05 16:54:40,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:54:40,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:54:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:54:44,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:44,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:44,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:44,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:54:44,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:44,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-07-05 16:54:44,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:44,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-07-05 16:54:44,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:44,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-07-05 16:54:44,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:44,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-07-05 16:54:44,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:44,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-07-05 16:54:44,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:44,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:54:44,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:44,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:44,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:54:44,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:54:44,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677404557] [2021-07-05 16:54:44,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677404557] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:54:44,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:54:44,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:54:44,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472118481] [2021-07-05 16:54:44,700 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 16:54:44,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:54:44,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 16:54:44,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:54:44,700 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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-07-05 16:54:48,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:54:48,984 INFO L93 Difference]: Finished difference Result 265 states and 294 transitions. [2021-07-05 16:54:48,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 16:54:48,985 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-07-05 16:54:48,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:54:48,985 INFO L225 Difference]: With dead ends: 265 [2021-07-05 16:54:48,985 INFO L226 Difference]: Without dead ends: 135 [2021-07-05 16:54:48,985 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 122.2ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:54:48,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-07-05 16:54:48,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-07-05 16:54:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.1119402985074627) internal successors, (149), 134 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:54:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2021-07-05 16:54:48,989 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 70 [2021-07-05 16:54:48,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:54:48,990 INFO L442 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2021-07-05 16:54:48,990 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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-07-05 16:54:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2021-07-05 16:54:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-05 16:54:48,991 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:54:48,991 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:54:48,991 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2021-07-05 16:54:48,991 INFO L374 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:54:48,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:54:48,991 INFO L82 PathProgramCache]: Analyzing trace with hash -238921928, now seen corresponding path program 1 times [2021-07-05 16:54:48,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:54:48,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316440441] [2021-07-05 16:54:48,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:54:48,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:54:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:54:54,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:54,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:54,116 INFO L142 QuantifierPusher]: treesize reduction 6, result has 33.3 percent of original size [2021-07-05 16:54:54,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:54:54,120 INFO L142 QuantifierPusher]: treesize reduction 9, result has 67.9 percent of original size [2021-07-05 16:54:54,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:54:54,136 INFO L142 QuantifierPusher]: treesize reduction 15, result has 79.5 percent of original size [2021-07-05 16:54:54,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 58 [2021-07-05 16:54:54,142 INFO L142 QuantifierPusher]: treesize reduction 5, result has 83.3 percent of original size [2021-07-05 16:54:54,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-07-05 16:54:54,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:54,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 79 [2021-07-05 16:54:54,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:54,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 98 [2021-07-05 16:54:54,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:54,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-07-05 16:54:54,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:54,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:54:54,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:54,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:54:54,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:54:54,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316440441] [2021-07-05 16:54:54,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316440441] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:54:54,257 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:54:54,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:54:54,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576370260] [2021-07-05 16:54:54,257 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 16:54:54,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:54:54,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 16:54:54,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:54:54,258 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-07-05 16:54:58,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:54:58,699 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2021-07-05 16:54:58,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 16:54:58,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-07-05 16:54:58,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:54:58,700 INFO L225 Difference]: With dead ends: 135 [2021-07-05 16:54:58,700 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 16:54:58,700 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 208.3ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-07-05 16:54:58,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 16:54:58,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 16:54:58,700 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-07-05 16:54:58,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 16:54:58,701 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2021-07-05 16:54:58,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:54:58,701 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 16:54:58,701 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-07-05 16:54:58,701 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 16:54:58,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 16:54:58,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 16:54:58,702 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,702 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,706 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,738 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,752 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,752 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,752 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,758 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,759 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:54:58,935 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2021-07-05 16:54:59,096 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2021-07-05 16:54:59,356 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2021-07-05 16:54:59,735 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2021-07-05 16:54:59,786 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,787 INFO L762 garLoopResultBuilder]: For program point L9153(lines 9153 9155) no Hoare annotation was computed. [2021-07-05 16:54:59,787 INFO L762 garLoopResultBuilder]: For program point L9153-2(lines 9153 9155) no Hoare annotation was computed. [2021-07-05 16:54:59,787 INFO L762 garLoopResultBuilder]: For program point L6973(lines 6973 6978) no Hoare annotation was computed. [2021-07-05 16:54:59,787 INFO L758 garLoopResultBuilder]: At program point L268(line 268) the Hoare annotation is: false [2021-07-05 16:54:59,787 INFO L762 garLoopResultBuilder]: For program point L6974(lines 6974 6976) no Hoare annotation was computed. [2021-07-05 16:54:59,787 INFO L762 garLoopResultBuilder]: For program point L6974-2(lines 6974 6976) no Hoare annotation was computed. [2021-07-05 16:54:59,787 INFO L762 garLoopResultBuilder]: For program point L7141-2(line 7141) no Hoare annotation was computed. [2021-07-05 16:54:59,787 INFO L762 garLoopResultBuilder]: For program point L7141(line 7141) no Hoare annotation was computed. [2021-07-05 16:54:59,787 INFO L765 garLoopResultBuilder]: At program point L9157(line 9157) the Hoare annotation is: true [2021-07-05 16:54:59,787 INFO L762 garLoopResultBuilder]: For program point L6979(lines 6979 6981) no Hoare annotation was computed. [2021-07-05 16:54:59,787 INFO L758 garLoopResultBuilder]: At program point L6979-3(lines 6965 6982) the Hoare annotation is: (let ((.cse28 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse27 (select .cse28 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse23 (= |ULTIMATE.start_can_fail_realloc_#res.base| 0))) (let ((.cse21 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse19 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse20 (not .cse23)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse3 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse12 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse14 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse22 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse25 (* .cse27 (- 1))) (.cse18 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse15 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and .cse0 (let ((.cse24 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse11 (select (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse1 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse2 (let ((.cse26 (select .cse28 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= (* 4294967296 (div (+ (* (div (+ .cse25 4294967295 .cse26) 4294967296) 4294967296) .cse27) 4294967296)) .cse26))) (.cse8 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse10 (<= (* 4294967296 (div (+ .cse11 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse24 4294967296)) 4294967296)) .cse11)) (.cse13 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse16 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse17 (<= (+ |#StackHeapBarrier| 1) ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse9 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity))) (or (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse11 (* 4294967296 (div .cse11 4294967296))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse19 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse20 .cse16 .cse17 .cse18) (and .cse4 .cse21 .cse9 (= |ULTIMATE.start_can_fail_realloc_#res.offset| 0) .cse22 .cse15 .cse23 (<= (+ (* 4294967296 .cse24) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity))))) .cse3 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) .cse5 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse21 .cse12 .cse14 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) (let ((.cse35 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse31 (select .cse35 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse29 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse30 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse33 (let ((.cse34 (select .cse35 12))) (<= .cse34 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse34) 4294967296)))))) (.cse32 (div .cse31 4294967296))) (or (and .cse0 .cse3 .cse19 .cse5 .cse6 .cse7 .cse12 .cse14 .cse22 .cse15 .cse20 .cse18) (and .cse29 .cse0 .cse3 .cse30 .cse5 .cse6 .cse7 .cse12 (<= .cse31 (* 4294967296 .cse32)) .cse14 .cse33 .cse22 .cse15 .cse18) (and .cse29 .cse0 .cse3 .cse30 .cse5 .cse6 .cse7 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0)) .cse12 .cse14 .cse33 .cse22 .cse15 (<= .cse31 (+ (* 4294967296 (div (+ .cse25 (* .cse32 4294967296) 4294967295) 4294967296)) .cse27)) .cse18))))) .cse15)))) [2021-07-05 16:54:59,787 INFO L762 garLoopResultBuilder]: For program point L6979-2(lines 6979 6981) no Hoare annotation was computed. [2021-07-05 16:54:59,787 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,787 INFO L762 garLoopResultBuilder]: For program point L7145(lines 7145 7151) no Hoare annotation was computed. [2021-07-05 16:54:59,788 INFO L758 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:54:59,788 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,788 INFO L762 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:54:59,788 INFO L762 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:54:59,788 INFO L762 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:54:59,788 INFO L762 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:54:59,788 INFO L762 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:54:59,788 INFO L762 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:54:59,788 INFO L762 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:54:59,788 INFO L762 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:54:59,788 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,788 INFO L762 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-07-05 16:54:59,788 INFO L762 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-07-05 16:54:59,788 INFO L762 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-07-05 16:54:59,788 INFO L762 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-07-05 16:54:59,788 INFO L762 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-07-05 16:54:59,788 INFO L762 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-07-05 16:54:59,788 INFO L762 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-07-05 16:54:59,788 INFO L762 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-07-05 16:54:59,789 INFO L765 garLoopResultBuilder]: At program point L6951-1(lines 6950 6952) the Hoare annotation is: true [2021-07-05 16:54:59,789 INFO L758 garLoopResultBuilder]: At program point L6951(lines 6950 6952) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:54:59,789 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,789 INFO L765 garLoopResultBuilder]: At program point L6655(lines 6653 6656) the Hoare annotation is: true [2021-07-05 16:54:59,789 INFO L758 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:54:59,789 INFO L758 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:54:59,789 INFO L758 garLoopResultBuilder]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse7 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse12 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse13 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse0 .cse1 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize) (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) .cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (let ((.cse17 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse8 (select .cse17 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse3 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse4 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse5 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse6 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse11 (let ((.cse16 (select .cse17 12))) (<= .cse16 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse16) 4294967296)))))) (.cse9 (div .cse8 4294967296)) (.cse14 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (or (and .cse3 .cse0 .cse1 .cse4 .cse2 .cse5 .cse6 .cse7 (<= .cse8 (* 4294967296 .cse9)) .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse3 .cse0 .cse1 .cse4 .cse2 .cse5 .cse6 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0)) .cse7 .cse10 .cse11 .cse12 .cse13 (<= .cse8 (let ((.cse15 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse15 (- 1)) (* .cse9 4294967296) 4294967295) 4294967296)) .cse15))) .cse14))))) (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity) .cse7 .cse10 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse12 .cse13 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity) (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0))) [2021-07-05 16:54:59,789 INFO L762 garLoopResultBuilder]: For program point L8176-1(line 8176) no Hoare annotation was computed. [2021-07-05 16:54:59,789 INFO L758 garLoopResultBuilder]: At program point L8176-4(line 8176) the Hoare annotation is: (let ((.cse25 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse34 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse35 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 16)) (.cse36 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse29 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse36) 0)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse30 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse36) 0)) (.cse31 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse35) 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse10 (not (= (select .cse34 4) 0))) (.cse11 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse15 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse27 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse16 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse17 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse21 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse32 (= (select .cse34 .cse35) 0)) (.cse13 (select .cse25 12))) (let ((.cse23 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse13) 4294967296)))) (.cse7 (let ((.cse33 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (<= .cse33 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse33) 4294967296)))))) (.cse0 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse3 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse26 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse22 (and .cse1 .cse29 .cse2 .cse30 .cse31 .cse4 .cse6 .cse10 .cse11 .cse15 .cse27 .cse16 .cse17 .cse21 .cse32))) (and (let ((.cse24 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse5 (select .cse25 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse20 (select .cse24 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse18 (select .cse24 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (let ((.cse19 (div .cse18 4294967296)) (.cse8 (<= .cse13 .cse23)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse12 (<= .cse20 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse20) 4294967296))))) (.cse14 (div .cse5 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse5) 4294967296)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse5 (+ .cse13 (* 4294967296 (div (+ (* .cse14 4294967296) 4294967295 (* .cse13 (- 1))) 4294967296)))) .cse15 .cse16 .cse17 (<= .cse18 (+ (* 4294967296 (div (+ (* .cse19 4294967296) (* .cse20 (- 1)) 4294967295) 4294967296)) .cse20)) .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse18 (* 4294967296 .cse19)) .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 (<= .cse5 (* 4294967296 .cse14)) .cse16 .cse17 .cse21) .cse22)))) (or .cse22 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse26 .cse11 (<= (select .cse25 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 12)) .cse23) .cse15 .cse27 .cse16 .cse17 .cse21)) (let ((.cse28 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (or (and .cse1 .cse2 .cse4 .cse28 .cse6 .cse26 .cse7 .cse10 .cse11 .cse15 .cse27 .cse16 .cse17 .cse21) (and .cse1 .cse29 .cse2 .cse30 .cse31 .cse4 .cse28 .cse6 .cse10 .cse11 .cse15 .cse27 .cse16 .cse17 .cse21 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse28 .cse6 .cse26 .cse10 .cse11 .cse15 .cse27 .cse16 .cse17 .cse21))) (or (and .cse1 .cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) .cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse11 .cse15 .cse27 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse17 .cse21) .cse22))))) [2021-07-05 16:54:59,790 INFO L762 garLoopResultBuilder]: For program point L8176-3(line 8176) no Hoare annotation was computed. [2021-07-05 16:54:59,790 INFO L762 garLoopResultBuilder]: For program point L8177-3(lines 8175 8193) no Hoare annotation was computed. [2021-07-05 16:54:59,790 INFO L762 garLoopResultBuilder]: For program point L8177-2(line 8177) no Hoare annotation was computed. [2021-07-05 16:54:59,790 INFO L762 garLoopResultBuilder]: For program point L8177(line 8177) no Hoare annotation was computed. [2021-07-05 16:54:59,790 INFO L762 garLoopResultBuilder]: For program point L8177-4(line 8177) no Hoare annotation was computed. [2021-07-05 16:54:59,790 INFO L762 garLoopResultBuilder]: For program point L6658(lines 6658 6663) no Hoare annotation was computed. [2021-07-05 16:54:59,790 INFO L762 garLoopResultBuilder]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:54:59,790 INFO L762 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:54:59,790 INFO L762 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:54:59,790 INFO L762 garLoopResultBuilder]: For program point L7154(lines 7154 7156) no Hoare annotation was computed. [2021-07-05 16:54:59,790 INFO L762 garLoopResultBuilder]: For program point L6659(lines 6659 6661) no Hoare annotation was computed. [2021-07-05 16:54:59,790 INFO L762 garLoopResultBuilder]: For program point L6659-2(lines 6659 6661) no Hoare annotation was computed. [2021-07-05 16:54:59,790 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 16:54:59,790 INFO L762 garLoopResultBuilder]: For program point L7122(lines 7122 7135) no Hoare annotation was computed. [2021-07-05 16:54:59,790 INFO L762 garLoopResultBuilder]: For program point L8179(lines 8179 8182) no Hoare annotation was computed. [2021-07-05 16:54:59,790 INFO L762 garLoopResultBuilder]: For program point L9137(lines 9137 9156) no Hoare annotation was computed. [2021-07-05 16:54:59,790 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,791 INFO L758 garLoopResultBuilder]: At program point L7158(lines 7137 7159) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse10 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse11 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse15 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse20 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse19 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse6 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse7 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and .cse0 .cse1 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) .cse2 (let ((.cse8 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse14 (select (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse9 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse3 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse12 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse5 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse13 (<= (* 4294967296 (div (+ .cse14 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse8 4294967296)) 4294967296)) .cse14)) (.cse16 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse17 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse18 (<= (+ |#StackHeapBarrier| 1) ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse3 .cse4 .cse5 (<= (+ |ULTIMATE.start_aws_mem_realloc_#res| 1) 0) .cse6 .cse7 (<= (+ (* 4294967296 .cse8) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (and .cse9 .cse0 .cse1 .cse3 .cse2 .cse10 .cse11 .cse12 .cse4 .cse5 .cse13 (<= .cse14 (* 4294967296 (div .cse14 4294967296))) .cse15 .cse16 .cse6 .cse7 .cse17 .cse18 .cse19) (and .cse9 .cse0 .cse1 .cse3 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0)) (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4) .cse2 .cse10 .cse11 .cse12 .cse4 .cse5 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0)) .cse13 (not (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0)) .cse15 .cse16 .cse6 .cse7 (not (= |ULTIMATE.start_can_fail_realloc_#res.base| 0)) .cse17 .cse18 .cse19)))) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse4 .cse15 .cse20 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse7 (let ((.cse28 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse23 (select .cse28 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse21 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse22 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse25 (let ((.cse27 (select .cse28 12))) (<= .cse27 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse27) 4294967296)))))) (.cse24 (div .cse23 4294967296))) (or (and .cse21 .cse0 .cse1 .cse22 .cse2 .cse10 .cse11 .cse15 (<= .cse23 (* 4294967296 .cse24)) .cse20 .cse25 .cse6 .cse7 .cse19) (and .cse21 .cse0 .cse1 .cse22 .cse2 .cse10 .cse11 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0)) .cse15 .cse20 .cse25 .cse6 .cse7 (<= .cse23 (let ((.cse26 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse26 (- 1)) (* .cse24 4294967296) 4294967295) 4294967296)) .cse26))) .cse19) (and .cse4 .cse6 .cse7 (= |ULTIMATE.start_aws_mem_realloc_#res| 0)))))))) [2021-07-05 16:54:59,791 INFO L762 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:54:59,791 INFO L762 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:54:59,791 INFO L762 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:54:59,791 INFO L762 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:54:59,791 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,791 INFO L762 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:54:59,791 INFO L762 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:54:59,791 INFO L762 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:54:59,791 INFO L762 garLoopResultBuilder]: For program point L222-7(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:54:59,791 INFO L762 garLoopResultBuilder]: For program point L222-8(lines 7162 7172) no Hoare annotation was computed. [2021-07-05 16:54:59,791 INFO L762 garLoopResultBuilder]: For program point L222-9(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:54:59,791 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 16:54:59,791 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,791 INFO L762 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,791 INFO L762 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,791 INFO L762 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,791 INFO L762 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,792 INFO L762 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,792 INFO L762 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,792 INFO L762 garLoopResultBuilder]: For program point L8184(lines 8184 8187) no Hoare annotation was computed. [2021-07-05 16:54:59,792 INFO L762 garLoopResultBuilder]: For program point L7160(lines 7160 7173) no Hoare annotation was computed. [2021-07-05 16:54:59,792 INFO L762 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,792 INFO L762 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,792 INFO L762 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,792 INFO L762 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,792 INFO L762 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,792 INFO L762 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,792 INFO L762 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,792 INFO L762 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,792 INFO L762 garLoopResultBuilder]: For program point L223-21(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,792 INFO L762 garLoopResultBuilder]: For program point L223-22(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,792 INFO L762 garLoopResultBuilder]: For program point L223-24(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,792 INFO L762 garLoopResultBuilder]: For program point L223-25(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,792 INFO L762 garLoopResultBuilder]: For program point L7491-1(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:59,792 INFO L762 garLoopResultBuilder]: For program point L7491(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,792 INFO L762 garLoopResultBuilder]: For program point L223-27(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,792 INFO L762 garLoopResultBuilder]: For program point L223-28(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,793 INFO L762 garLoopResultBuilder]: For program point L7491-4(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:59,793 INFO L762 garLoopResultBuilder]: For program point L7491-3(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:59,793 INFO L762 garLoopResultBuilder]: For program point L7491-9(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,793 INFO L762 garLoopResultBuilder]: For program point L7491-7(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,793 INFO L762 garLoopResultBuilder]: For program point L7491-6(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:59,793 INFO L762 garLoopResultBuilder]: For program point L7491-13(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,793 INFO L758 garLoopResultBuilder]: At program point L7491-12(lines 7489 7495) the Hoare annotation is: (let ((.cse18 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse20 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse7 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse20) 0)) (.cse8 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse20) 0)) (.cse17 (select .cse18 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse3 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse4 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse5 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse10 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (let ((.cse11 (and (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse4 .cse5 .cse6 .cse10)) (.cse13 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse14 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse15 (<= .cse17 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse17) 4294967296))))) (.cse19 (and .cse0 .cse7 .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (let ((.cse9 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (or (and .cse0 .cse7 .cse1 .cse8 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse10) .cse11 (and .cse0 .cse1 .cse2 .cse9 (let ((.cse12 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (<= .cse12 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse12) 4294967296))))) .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse13 .cse0 .cse1 .cse14 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse10))) (or .cse11 (and .cse13 .cse0 .cse1 .cse14 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 (let ((.cse16 (select .cse18 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= .cse16 (+ (* 4294967296 (div (+ (* (div .cse16 4294967296) 4294967296) (* .cse17 (- 1)) 4294967295) 4294967296)) .cse17))) .cse10) .cse19) (or .cse11 (and .cse13 .cse0 .cse1 .cse14 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse10) .cse19) .cse10)))) [2021-07-05 16:54:59,793 INFO L762 garLoopResultBuilder]: For program point L7491-11(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,793 INFO L762 garLoopResultBuilder]: For program point L7491-17(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:59,793 INFO L762 garLoopResultBuilder]: For program point L7491-16(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:59,793 INFO L762 garLoopResultBuilder]: For program point L7491-14(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:59,793 INFO L762 garLoopResultBuilder]: For program point L7491-20(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,794 INFO L762 garLoopResultBuilder]: For program point L7491-19(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:59,794 INFO L758 garLoopResultBuilder]: At program point L7491-25(lines 7489 7495) the Hoare annotation is: (let ((.cse30 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse18 (select .cse30 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse29 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse31 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse4 (select .cse31 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse28 (select .cse29 12)) (.cse22 (div .cse18 4294967296)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse5 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse7 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse25 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0))) (.cse10 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0))) (.cse20 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse11 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse12 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse13 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse14 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (let ((.cse8 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse6 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse15 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse16 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse0 (and (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse1 .cse5 .cse7 .cse9 .cse25 .cse10 .cse20 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse11 .cse12 .cse13 .cse14)) (.cse19 (* .cse22 4294967296)) (.cse17 (<= .cse28 (+ (* 4294967296 (div (+ (- 1) .cse28) 4294967296)) 4294967295))) (.cse3 (select .cse31 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse2 (* .cse4 (- 1)))) (and (or .cse0 (and .cse1 (<= (* 4294967296 (div (+ (* (div (+ .cse2 4294967295 .cse3) 4294967296) 4294967296) .cse4) 4294967296)) .cse3) .cse5 .cse6 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) (or (and .cse15 .cse1 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 (<= .cse18 (+ (* 4294967296 (div (+ .cse2 .cse19 4294967295) 4294967296)) .cse4)) .cse14) .cse0) (or (and .cse1 .cse5 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) .cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse20 .cse11 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse13 .cse14) .cse0) (let ((.cse21 (let ((.cse27 (select .cse30 12))) (let ((.cse24 (<= .cse27 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse27) 4294967296))))) (.cse26 (<= .cse4 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse4) 4294967296))))) (.cse23 (select .cse29 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (or (and .cse1 .cse5 (<= (* 4294967296 (div (+ .cse23 4294967295) 4294967296)) .cse23) (<= (* 4294967296 (div (+ 4294967295 .cse3) 4294967296)) .cse3) (<= (* 4294967296 (div (+ .cse18 4294967295) 4294967296)) .cse18) .cse7 .cse24 .cse9 .cse25 .cse10 .cse20 .cse26 .cse11 .cse12 .cse13 .cse17 .cse14) (and (<= .cse3 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse3) 4294967296)))) .cse1 .cse5 (<= .cse18 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse18) 4294967296)))) .cse7 (<= .cse23 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse23) 4294967296)))) .cse24 .cse9 .cse25 .cse10 .cse20 .cse26 (<= .cse18 (+ .cse27 (* 4294967296 (div (+ .cse19 4294967295 (* .cse27 (- 1))) 4294967296)))) .cse11 .cse12 (<= .cse23 (+ (* 4294967296 (div (+ (* (div .cse23 4294967296) 4294967296) 4294967295 (* .cse28 (- 1))) 4294967296)) .cse28)) .cse13 .cse17 (<= .cse3 (+ (* 4294967296 (div (+ (* (div .cse3 4294967296) 4294967296) .cse2 4294967295) 4294967296)) .cse4)) .cse14)))))) (or (and .cse21 (<= .cse18 (* 4294967296 .cse22))) (and .cse15 .cse16 .cse21) .cse0))))))) [2021-07-05 16:54:59,794 INFO L762 garLoopResultBuilder]: For program point L7491-24(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,794 INFO L762 garLoopResultBuilder]: For program point L7491-22(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,794 INFO L762 garLoopResultBuilder]: For program point L7491-29(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:59,794 INFO L762 garLoopResultBuilder]: For program point L7491-27(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:59,794 INFO L762 garLoopResultBuilder]: For program point L7491-26(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,794 INFO L762 garLoopResultBuilder]: For program point L7491-33(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,794 INFO L762 garLoopResultBuilder]: For program point L7491-32(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:59,794 INFO L762 garLoopResultBuilder]: For program point L7491-30(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:59,794 INFO L762 garLoopResultBuilder]: For program point L7491-37(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,794 INFO L762 garLoopResultBuilder]: For program point L7491-35(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,794 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,794 INFO L762 garLoopResultBuilder]: For program point L7491-40(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:59,794 INFO L762 garLoopResultBuilder]: For program point L7491-39(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,795 INFO L758 garLoopResultBuilder]: At program point L7491-38(lines 7489 7495) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse9 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse4 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse5 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (or (and .cse0 .cse1 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse8 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse8 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse8 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) 4294967296)) 4294967295)))) (and (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 .cse2 .cse3 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse4 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse5 .cse9 .cse6 .cse7))) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse3 .cse9 .cse6)) [2021-07-05 16:54:59,795 INFO L762 garLoopResultBuilder]: For program point L7491-45(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:59,795 INFO L762 garLoopResultBuilder]: For program point L7491-43(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:59,795 INFO L762 garLoopResultBuilder]: For program point L7491-42(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:59,795 INFO L762 garLoopResultBuilder]: For program point L7491-48(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,795 INFO L762 garLoopResultBuilder]: For program point L7491-46(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,795 INFO L762 garLoopResultBuilder]: For program point L7491-53(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:59,795 INFO L762 garLoopResultBuilder]: For program point L7491-52(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,795 INFO L758 garLoopResultBuilder]: At program point L7491-51(lines 7489 7495) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:54:59,795 INFO L762 garLoopResultBuilder]: For program point L7491-50(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,795 INFO L762 garLoopResultBuilder]: For program point L7491-56(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:59,795 INFO L762 garLoopResultBuilder]: For program point L7491-55(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:59,795 INFO L762 garLoopResultBuilder]: For program point L7491-61(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,795 INFO L762 garLoopResultBuilder]: For program point L7491-59(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,795 INFO L762 garLoopResultBuilder]: For program point L7491-58(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:59,795 INFO L762 garLoopResultBuilder]: For program point L7491-65(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,796 INFO L758 garLoopResultBuilder]: At program point L7491-64(lines 7489 7495) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse1 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse2 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse0 .cse1 .cse2 (let ((.cse3 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse4 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)))) (or (and (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse3 .cse4 .cse0 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse5 .cse1 .cse2) (and .cse3 .cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse0 .cse5 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse1 .cse2 (let ((.cse6 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse6 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse6 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) 4294967296)) 4294967295)))))))) [2021-07-05 16:54:59,796 INFO L762 garLoopResultBuilder]: For program point L7491-63(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,796 INFO L762 garLoopResultBuilder]: For program point L7491-69(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:59,796 INFO L762 garLoopResultBuilder]: For program point L7491-68(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:59,796 INFO L762 garLoopResultBuilder]: For program point L7491-66(line 7491) no Hoare annotation was computed. [2021-07-05 16:54:59,796 INFO L762 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2021-07-05 16:54:59,796 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 16:54:59,796 INFO L762 garLoopResultBuilder]: For program point L7491-72(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,796 INFO L762 garLoopResultBuilder]: For program point L7491-71(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:54:59,796 INFO L765 garLoopResultBuilder]: At program point L7491-77(lines 7489 7495) the Hoare annotation is: true [2021-07-05 16:54:59,796 INFO L762 garLoopResultBuilder]: For program point L7491-76(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,796 INFO L762 garLoopResultBuilder]: For program point L7491-74(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,796 INFO L762 garLoopResultBuilder]: For program point L9145(lines 9145 9148) no Hoare annotation was computed. [2021-07-05 16:54:59,796 INFO L762 garLoopResultBuilder]: For program point L9145-2(lines 9145 9148) no Hoare annotation was computed. [2021-07-05 16:54:59,796 INFO L762 garLoopResultBuilder]: For program point L7494(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,796 INFO L762 garLoopResultBuilder]: For program point L7494-4(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,796 INFO L762 garLoopResultBuilder]: For program point L7494-3(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,797 INFO L762 garLoopResultBuilder]: For program point L7494-2(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,797 INFO L762 garLoopResultBuilder]: For program point L7494-8(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,797 INFO L762 garLoopResultBuilder]: For program point L7494-6(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,797 INFO L762 garLoopResultBuilder]: For program point L7494-12(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,797 INFO L762 garLoopResultBuilder]: For program point L7494-11(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,797 INFO L762 garLoopResultBuilder]: For program point L7494-9(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,797 INFO L762 garLoopResultBuilder]: For program point L6966(lines 6966 6972) no Hoare annotation was computed. [2021-07-05 16:54:59,797 INFO L762 garLoopResultBuilder]: For program point L7494-15(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,797 INFO L762 garLoopResultBuilder]: For program point L7494-13(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,797 INFO L762 garLoopResultBuilder]: For program point L7494-20(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,797 INFO L762 garLoopResultBuilder]: For program point L7494-18(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,797 INFO L762 garLoopResultBuilder]: For program point L7494-17(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,797 INFO L762 garLoopResultBuilder]: For program point L7494-24(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,797 INFO L762 garLoopResultBuilder]: For program point L7494-22(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,797 INFO L762 garLoopResultBuilder]: For program point L7494-21(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,797 INFO L762 garLoopResultBuilder]: For program point L7494-27(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,797 INFO L762 garLoopResultBuilder]: For program point L7494-26(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,797 INFO L762 garLoopResultBuilder]: For program point L7494-31(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,797 INFO L762 garLoopResultBuilder]: For program point L7494-30(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,797 INFO L762 garLoopResultBuilder]: For program point L7494-29(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,798 INFO L758 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:54:59,798 INFO L762 garLoopResultBuilder]: For program point L7494-36(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,798 INFO L758 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: false [2021-07-05 16:54:59,798 INFO L762 garLoopResultBuilder]: For program point L7494-35(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,798 INFO L758 garLoopResultBuilder]: At program point L261-2(line 261) the Hoare annotation is: (let ((.cse30 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse10 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse29 (select .cse30 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (let ((.cse3 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse5 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0))) (.cse6 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse7 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse8 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse27 (* .cse29 (- 1))) (.cse31 (select .cse10 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse25 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) .cse2 .cse3 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse4 .cse5 .cse6 .cse7 .cse8 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) (let ((.cse9 (select .cse10 12))) (<= .cse9 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse9) 4294967296))))) .cse11 (let ((.cse14 (select (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse12 (let ((.cse32 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse33 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse15 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse16 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse17 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse18 (not (= (select .cse33 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 4)) 0))) (.cse19 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse20 (not (= (select .cse33 4) 0))) (.cse21 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0))) (.cse22 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse23 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse24 (<= (+ |#StackHeapBarrier| 1) ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse26 (<= (+ (* 4294967296 .cse32) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity))) (or (and .cse15 .cse0 .cse1 .cse16 (<= (* 4294967296 (div (+ .cse17 4294967295) 4294967296)) .cse17) .cse2 .cse4 .cse18 .cse19 .cse20 .cse5 .cse6 .cse21 .cse7 (<= (* 4294967296 (div (+ 4294967295 .cse14) 4294967296)) .cse14) .cse8 .cse22 .cse11 .cse23 .cse24 .cse25 .cse26) (and .cse15 .cse0 (let ((.cse28 (select .cse30 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= (* 4294967296 (div (+ (* (div (+ .cse27 4294967295 .cse28) 4294967296) 4294967296) .cse29) 4294967296)) .cse28)) .cse1 .cse16 .cse2 (<= .cse31 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse31) 4294967296)))) .cse4 (<= .cse17 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse17) 4294967296)))) .cse18 .cse19 .cse20 (<= (* 4294967296 (div (+ .cse14 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse32 4294967296)) 4294967296)) .cse14) .cse5 .cse6 .cse21 .cse7 .cse8 .cse22 .cse11 .cse23 .cse24 .cse25 .cse26))))) (.cse13 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4) .cse12 .cse3 .cse13) (and .cse12 .cse3 .cse13 (<= .cse14 (* 4294967296 (div .cse14 4294967296))))))) (<= .cse31 (+ (* 4294967296 (div (+ .cse27 (* (div .cse31 4294967296) 4294967296) 4294967295) 4294967296)) .cse29)) .cse25)))) [2021-07-05 16:54:59,798 INFO L762 garLoopResultBuilder]: For program point L7494-33(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,798 INFO L762 garLoopResultBuilder]: For program point L7494-40(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,798 INFO L762 garLoopResultBuilder]: For program point L7494-39(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,798 INFO L762 garLoopResultBuilder]: For program point L7494-38(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,798 INFO L762 garLoopResultBuilder]: For program point L7494-44(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,798 INFO L762 garLoopResultBuilder]: For program point L7494-42(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,798 INFO L762 garLoopResultBuilder]: For program point L7494-48(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,798 INFO L762 garLoopResultBuilder]: For program point L7494-47(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,798 INFO L762 garLoopResultBuilder]: For program point L7494-45(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,798 INFO L762 garLoopResultBuilder]: For program point L7494-51(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,798 INFO L762 garLoopResultBuilder]: For program point L7494-49(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,798 INFO L762 garLoopResultBuilder]: For program point L7494-53(line 7494) no Hoare annotation was computed. [2021-07-05 16:54:59,799 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 16:54:59,799 INFO L762 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2021-07-05 16:54:59,799 INFO L758 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: (let ((.cse7 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse2 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse3 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse14 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse6 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse10 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (and .cse0 .cse1 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (let ((.cse8 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse12 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse3 .cse4 .cse5 .cse6 (let ((.cse11 (select .cse12 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (<= .cse11 (* 4294967296 (div .cse11 4294967296)))) .cse7 (let ((.cse13 (select .cse12 12))) (<= .cse13 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse13) 4294967296))))) .cse8 .cse9 .cse10)))) .cse3 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse14 .cse6 .cse7 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse9 (let ((.cse24 (select (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse15 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse16 (let ((.cse27 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse26 (select .cse27 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= (* 4294967296 (div (let ((.cse25 (select .cse27 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* (div (+ (* .cse25 (- 1)) 4294967295 .cse26) 4294967296) 4294967296) .cse25)) 4294967296)) .cse26)))) (.cse17 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse18 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse19 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse20 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse21 (<= (* 4294967296 (div (+ .cse24 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296) 4294967296)) 4294967296)) .cse24)) (.cse22 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse23 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0)))) (or (and .cse15 .cse0 .cse16 .cse1 .cse17 .cse2 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4) .cse3 .cse18 .cse4 .cse5 .cse19 .cse14 .cse20 .cse21 .cse6 .cse22 .cse9 .cse23 .cse10) (and .cse15 .cse0 .cse16 .cse1 .cse17 .cse3 .cse18 .cse4 .cse5 .cse19 .cse14 .cse20 .cse21 (<= .cse24 (* 4294967296 (div .cse24 4294967296))) .cse6 .cse22 .cse9 .cse23 .cse10)))))) [2021-07-05 16:54:59,799 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:54:59,799 INFO L758 garLoopResultBuilder]: At program point L8192(lines 8175 8193) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (or (and (<= (+ |ULTIMATE.start_aws_byte_buf_reserve_#res| 1) 0) .cse0) (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse0 (let ((.cse1 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse1 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse1 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) 4294967296)) 4294967295)))))) [2021-07-05 16:54:59,799 INFO L765 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: true [2021-07-05 16:54:59,799 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2021-07-05 16:54:59,799 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 16:54:59,799 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION was SAFE (4/10) [2021-07-05 16:54:59,800 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 16:54:59,800 INFO L329 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 16:54:59,801 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 16:54:59,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 200 states have internal predecessors, (281), 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-07-05 16:54:59,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-07-05 16:54:59,802 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:54:59,802 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:54:59,802 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:54:59,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:54:59,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2024212107, now seen corresponding path program 1 times [2021-07-05 16:54:59,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:54:59,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019677265] [2021-07-05 16:54:59,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:54:59,803 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:54:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:54:59,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:59,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:59,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:59,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:59,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:54:59,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:54:59,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019677265] [2021-07-05 16:54:59,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019677265] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:54:59,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:54:59,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 16:54:59,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792547069] [2021-07-05 16:54:59,882 INFO L425 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-05 16:54:59,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:54:59,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-05 16:54:59,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-05 16:54:59,883 INFO L87 Difference]: Start difference. First operand has 201 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 200 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-07-05 16:54:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:54:59,884 INFO L93 Difference]: Finished difference Result 395 states and 553 transitions. [2021-07-05 16:54:59,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-05 16:54:59,885 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-07-05 16:54:59,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:54:59,885 INFO L225 Difference]: With dead ends: 395 [2021-07-05 16:54:59,885 INFO L226 Difference]: Without dead ends: 146 [2021-07-05 16:54:59,885 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-05 16:54:59,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-07-05 16:54:59,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2021-07-05 16:54:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 145 states have internal predecessors, (193), 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-07-05 16:54:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 193 transitions. [2021-07-05 16:54:59,887 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 193 transitions. Word has length 26 [2021-07-05 16:54:59,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:54:59,887 INFO L442 AbstractCegarLoop]: Abstraction has 146 states and 193 transitions. [2021-07-05 16:54:59,887 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-07-05 16:54:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 193 transitions. [2021-07-05 16:54:59,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-07-05 16:54:59,887 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:54:59,888 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:54:59,897 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2021-07-05 16:54:59,897 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:54:59,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:54:59,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1848053363, now seen corresponding path program 1 times [2021-07-05 16:54:59,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:54:59,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789486973] [2021-07-05 16:54:59,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:54:59,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:54:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:54:59,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:59,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:59,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:59,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:54:59,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:59,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-07-05 16:54:59,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:54:59,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:54:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:54:59,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:54:59,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789486973] [2021-07-05 16:54:59,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789486973] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:54:59,993 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:54:59,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:54:59,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300622611] [2021-07-05 16:54:59,993 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:54:59,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:54:59,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:54:59,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:54:59,994 INFO L87 Difference]: Start difference. First operand 146 states and 193 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-07-05 16:55:00,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:55:00,052 INFO L93 Difference]: Finished difference Result 269 states and 355 transitions. [2021-07-05 16:55:00,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:55:00,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-07-05 16:55:00,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:55:00,054 INFO L225 Difference]: With dead ends: 269 [2021-07-05 16:55:00,054 INFO L226 Difference]: Without dead ends: 146 [2021-07-05 16:55:00,054 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:55:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-07-05 16:55:00,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2021-07-05 16:55:00,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 145 states have internal predecessors, (192), 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-07-05 16:55:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 192 transitions. [2021-07-05 16:55:00,057 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 192 transitions. Word has length 26 [2021-07-05 16:55:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:55:00,058 INFO L442 AbstractCegarLoop]: Abstraction has 146 states and 192 transitions. [2021-07-05 16:55:00,058 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-07-05 16:55:00,058 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 192 transitions. [2021-07-05 16:55:00,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-05 16:55:00,058 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:55:00,058 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:55:00,058 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2021-07-05 16:55:00,059 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:55:00,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:55:00,059 INFO L82 PathProgramCache]: Analyzing trace with hash -2146047072, now seen corresponding path program 1 times [2021-07-05 16:55:00,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:55:00,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252310245] [2021-07-05 16:55:00,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:55:00,060 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:55:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:55:00,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:00,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:00,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:00,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:00,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:00,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:00,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:00,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:00,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:55:00,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:55:00,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252310245] [2021-07-05 16:55:00,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252310245] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:55:00,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:55:00,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:55:00,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356693423] [2021-07-05 16:55:00,151 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:55:00,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:55:00,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:55:00,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:55:00,151 INFO L87 Difference]: Start difference. First operand 146 states and 192 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-07-05 16:55:00,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:55:00,263 INFO L93 Difference]: Finished difference Result 388 states and 522 transitions. [2021-07-05 16:55:00,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:55:00,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-05 16:55:00,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:55:00,265 INFO L225 Difference]: With dead ends: 388 [2021-07-05 16:55:00,265 INFO L226 Difference]: Without dead ends: 256 [2021-07-05 16:55:00,265 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:55:00,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-07-05 16:55:00,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 156. [2021-07-05 16:55:00,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.303225806451613) internal successors, (202), 155 states have internal predecessors, (202), 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-07-05 16:55:00,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 202 transitions. [2021-07-05 16:55:00,268 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 202 transitions. Word has length 32 [2021-07-05 16:55:00,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:55:00,268 INFO L442 AbstractCegarLoop]: Abstraction has 156 states and 202 transitions. [2021-07-05 16:55:00,268 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-07-05 16:55:00,268 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 202 transitions. [2021-07-05 16:55:00,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-05 16:55:00,268 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:55:00,269 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:55:00,269 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2021-07-05 16:55:00,269 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:55:00,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:55:00,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1331271774, now seen corresponding path program 1 times [2021-07-05 16:55:00,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:55:00,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556096468] [2021-07-05 16:55:00,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:55:00,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:55:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:55:00,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:00,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:00,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:00,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:00,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:00,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:00,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:00,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:55:00,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:55:00,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556096468] [2021-07-05 16:55:00,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556096468] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:55:00,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:55:00,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:55:00,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762867826] [2021-07-05 16:55:00,392 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:55:00,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:55:00,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:55:00,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:55:00,393 INFO L87 Difference]: Start difference. First operand 156 states and 202 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-07-05 16:55:00,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:55:00,533 INFO L93 Difference]: Finished difference Result 338 states and 443 transitions. [2021-07-05 16:55:00,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:55:00,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-05 16:55:00,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:55:00,535 INFO L225 Difference]: With dead ends: 338 [2021-07-05 16:55:00,535 INFO L226 Difference]: Without dead ends: 206 [2021-07-05 16:55:00,535 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:55:00,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-07-05 16:55:00,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 166. [2021-07-05 16:55:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.284848484848485) internal successors, (212), 165 states have internal predecessors, (212), 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-07-05 16:55:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 212 transitions. [2021-07-05 16:55:00,538 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 212 transitions. Word has length 32 [2021-07-05 16:55:00,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:55:00,538 INFO L442 AbstractCegarLoop]: Abstraction has 166 states and 212 transitions. [2021-07-05 16:55:00,538 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-07-05 16:55:00,538 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 212 transitions. [2021-07-05 16:55:00,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-07-05 16:55:00,538 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:55:00,538 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:55:00,538 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2021-07-05 16:55:00,538 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:55:00,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:55:00,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1930065506, now seen corresponding path program 1 times [2021-07-05 16:55:00,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:55:00,539 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93014368] [2021-07-05 16:55:00,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:55:00,540 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:55:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:55:00,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:00,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:00,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:00,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 16:55:00,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:00,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 16:55:00,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:00,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 16:55:00,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:00,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:55:00,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:55:00,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93014368] [2021-07-05 16:55:00,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93014368] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:55:00,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:55:00,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:55:00,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883544375] [2021-07-05 16:55:00,697 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:55:00,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:55:00,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:55:00,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:55:00,698 INFO L87 Difference]: Start difference. First operand 166 states and 212 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-07-05 16:55:00,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:55:00,747 INFO L93 Difference]: Finished difference Result 230 states and 289 transitions. [2021-07-05 16:55:00,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 16:55:00,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-07-05 16:55:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:55:00,748 INFO L225 Difference]: With dead ends: 230 [2021-07-05 16:55:00,748 INFO L226 Difference]: Without dead ends: 173 [2021-07-05 16:55:00,749 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 31.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:55:00,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-07-05 16:55:00,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 141. [2021-07-05 16:55:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.2642857142857142) internal successors, (177), 140 states have internal predecessors, (177), 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-07-05 16:55:00,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 177 transitions. [2021-07-05 16:55:00,751 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 177 transitions. Word has length 32 [2021-07-05 16:55:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:55:00,752 INFO L442 AbstractCegarLoop]: Abstraction has 141 states and 177 transitions. [2021-07-05 16:55:00,752 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-07-05 16:55:00,752 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 177 transitions. [2021-07-05 16:55:00,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-07-05 16:55:00,752 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:55:00,753 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:55:00,753 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2021-07-05 16:55:00,753 INFO L374 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:55:00,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:55:00,753 INFO L82 PathProgramCache]: Analyzing trace with hash 317270416, now seen corresponding path program 1 times [2021-07-05 16:55:00,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:55:00,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3381095] [2021-07-05 16:55:00,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:55:00,754 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:55:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:55:00,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:00,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:00,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:00,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:55:00,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:00,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:55:00,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:00,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:55:00,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:00,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:55:00,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:00,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:00,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:00,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:00,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:55:00,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:55:00,905 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3381095] [2021-07-05 16:55:00,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3381095] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:55:00,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:55:00,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:55:00,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574348185] [2021-07-05 16:55:00,906 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:55:00,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:55:00,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:55:00,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:55:00,907 INFO L87 Difference]: Start difference. First operand 141 states and 177 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:55:00,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:55:00,998 INFO L93 Difference]: Finished difference Result 230 states and 288 transitions. [2021-07-05 16:55:00,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:55:00,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-07-05 16:55:00,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:55:00,999 INFO L225 Difference]: With dead ends: 230 [2021-07-05 16:55:00,999 INFO L226 Difference]: Without dead ends: 141 [2021-07-05 16:55:00,999 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 70.8ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-07-05 16:55:01,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-07-05 16:55:01,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-07-05 16:55:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.2428571428571429) internal successors, (174), 140 states have internal predecessors, (174), 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-07-05 16:55:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 174 transitions. [2021-07-05 16:55:01,002 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 174 transitions. Word has length 44 [2021-07-05 16:55:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:55:01,002 INFO L442 AbstractCegarLoop]: Abstraction has 141 states and 174 transitions. [2021-07-05 16:55:01,002 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:55:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 174 transitions. [2021-07-05 16:55:01,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-07-05 16:55:01,002 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:55:01,003 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:55:01,003 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2021-07-05 16:55:01,003 INFO L374 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:55:01,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:55:01,003 INFO L82 PathProgramCache]: Analyzing trace with hash 516350640, now seen corresponding path program 1 times [2021-07-05 16:55:01,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:55:01,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690729149] [2021-07-05 16:55:01,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:55:01,003 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:55:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:55:02,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:02,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:02,950 INFO L142 QuantifierPusher]: treesize reduction 15, result has 40.0 percent of original size [2021-07-05 16:55:02,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:55:02,964 INFO L142 QuantifierPusher]: treesize reduction 15, result has 48.3 percent of original size [2021-07-05 16:55:02,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:55:02,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:02,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:55:02,994 INFO L142 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-07-05 16:55:02,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:55:03,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:03,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:03,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:03,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:03,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:03,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:55:03,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:55:03,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690729149] [2021-07-05 16:55:03,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690729149] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:55:03,034 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:55:03,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:55:03,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613646309] [2021-07-05 16:55:03,035 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 16:55:03,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:55:03,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 16:55:03,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:55:03,035 INFO L87 Difference]: Start difference. First operand 141 states and 174 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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-07-05 16:55:07,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:55:07,597 INFO L93 Difference]: Finished difference Result 297 states and 365 transitions. [2021-07-05 16:55:07,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-05 16:55:07,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-07-05 16:55:07,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:55:07,598 INFO L225 Difference]: With dead ends: 297 [2021-07-05 16:55:07,598 INFO L226 Difference]: Without dead ends: 182 [2021-07-05 16:55:07,599 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 265.2ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-07-05 16:55:07,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-07-05 16:55:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 139. [2021-07-05 16:55:07,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 138 states have internal predecessors, (171), 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-07-05 16:55:07,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 171 transitions. [2021-07-05 16:55:07,607 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 171 transitions. Word has length 56 [2021-07-05 16:55:07,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:55:07,607 INFO L442 AbstractCegarLoop]: Abstraction has 139 states and 171 transitions. [2021-07-05 16:55:07,608 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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-07-05 16:55:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 171 transitions. [2021-07-05 16:55:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-07-05 16:55:07,608 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:55:07,608 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:55:07,609 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2021-07-05 16:55:07,609 INFO L374 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:55:07,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:55:07,609 INFO L82 PathProgramCache]: Analyzing trace with hash 286312804, now seen corresponding path program 1 times [2021-07-05 16:55:07,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:55:07,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337130660] [2021-07-05 16:55:07,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:55:07,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:55:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:55:07,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:07,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:07,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:07,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:55:07,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:07,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:55:07,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:07,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:55:07,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:07,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:55:07,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:07,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:55:07,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:07,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:55:07,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:07,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:07,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:07,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:07,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:07,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:55:07,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:55:07,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337130660] [2021-07-05 16:55:07,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337130660] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:55:07,848 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:55:07,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-05 16:55:07,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877633805] [2021-07-05 16:55:07,848 INFO L425 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-05 16:55:07,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:55:07,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-05 16:55:07,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:55:07,848 INFO L87 Difference]: Start difference. First operand 139 states and 171 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:55:17,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:55:17,346 INFO L93 Difference]: Finished difference Result 457 states and 565 transitions. [2021-07-05 16:55:17,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-07-05 16:55:17,346 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-07-05 16:55:17,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:55:17,348 INFO L225 Difference]: With dead ends: 457 [2021-07-05 16:55:17,348 INFO L226 Difference]: Without dead ends: 359 [2021-07-05 16:55:17,348 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 647.0ms TimeCoverageRelationStatistics Valid=276, Invalid=984, Unknown=0, NotChecked=0, Total=1260 [2021-07-05 16:55:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2021-07-05 16:55:17,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 200. [2021-07-05 16:55:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.2412060301507537) internal successors, (247), 199 states have internal predecessors, (247), 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-07-05 16:55:17,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 247 transitions. [2021-07-05 16:55:17,354 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 247 transitions. Word has length 60 [2021-07-05 16:55:17,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:55:17,354 INFO L442 AbstractCegarLoop]: Abstraction has 200 states and 247 transitions. [2021-07-05 16:55:17,354 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:55:17,354 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 247 transitions. [2021-07-05 16:55:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-07-05 16:55:17,354 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:55:17,355 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:55:17,355 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2021-07-05 16:55:17,355 INFO L374 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:55:17,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:55:17,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1179799142, now seen corresponding path program 1 times [2021-07-05 16:55:17,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:55:17,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326783576] [2021-07-05 16:55:17,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:55:17,356 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:55:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:55:17,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:17,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:17,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:17,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-07-05 16:55:17,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:17,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-05 16:55:17,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:17,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:17,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:17,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:17,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:55:17,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:55:17,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326783576] [2021-07-05 16:55:17,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326783576] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:55:17,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:55:17,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:55:17,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873461939] [2021-07-05 16:55:17,518 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:55:17,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:55:17,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:55:17,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:55:17,519 INFO L87 Difference]: Start difference. First operand 200 states and 247 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:55:19,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:55:19,821 INFO L93 Difference]: Finished difference Result 518 states and 636 transitions. [2021-07-05 16:55:19,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:55:19,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-07-05 16:55:19,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:55:19,822 INFO L225 Difference]: With dead ends: 518 [2021-07-05 16:55:19,822 INFO L226 Difference]: Without dead ends: 356 [2021-07-05 16:55:19,822 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 25.6ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:55:19,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-07-05 16:55:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 221. [2021-07-05 16:55:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.2181818181818183) internal successors, (268), 220 states have internal predecessors, (268), 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-07-05 16:55:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 268 transitions. [2021-07-05 16:55:19,828 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 268 transitions. Word has length 60 [2021-07-05 16:55:19,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:55:19,828 INFO L442 AbstractCegarLoop]: Abstraction has 221 states and 268 transitions. [2021-07-05 16:55:19,829 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:55:19,829 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 268 transitions. [2021-07-05 16:55:19,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-07-05 16:55:19,829 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:55:19,829 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:55:19,829 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2021-07-05 16:55:19,830 INFO L374 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:55:19,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:55:19,830 INFO L82 PathProgramCache]: Analyzing trace with hash -278282646, now seen corresponding path program 1 times [2021-07-05 16:55:19,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:55:19,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397747483] [2021-07-05 16:55:19,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:55:19,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:55:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:55:19,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:19,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:19,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:19,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:19,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:19,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:19,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:19,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:19,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:19,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:55:19,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:19,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:55:20,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:20,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:20,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:55:20,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:55:20,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397747483] [2021-07-05 16:55:20,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397747483] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:55:20,026 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:55:20,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:55:20,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546598386] [2021-07-05 16:55:20,026 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:55:20,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:55:20,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:55:20,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:55:20,026 INFO L87 Difference]: Start difference. First operand 221 states and 268 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:55:20,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:55:20,285 INFO L93 Difference]: Finished difference Result 407 states and 488 transitions. [2021-07-05 16:55:20,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 16:55:20,286 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-07-05 16:55:20,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:55:20,286 INFO L225 Difference]: With dead ends: 407 [2021-07-05 16:55:20,286 INFO L226 Difference]: Without dead ends: 214 [2021-07-05 16:55:20,287 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 83.7ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:55:20,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-07-05 16:55:20,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 151. [2021-07-05 16:55:20,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.2133333333333334) internal successors, (182), 150 states have internal predecessors, (182), 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-07-05 16:55:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 182 transitions. [2021-07-05 16:55:20,290 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 182 transitions. Word has length 60 [2021-07-05 16:55:20,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:55:20,291 INFO L442 AbstractCegarLoop]: Abstraction has 151 states and 182 transitions. [2021-07-05 16:55:20,291 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:55:20,291 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 182 transitions. [2021-07-05 16:55:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-07-05 16:55:20,291 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:55:20,291 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:55:20,292 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable199 [2021-07-05 16:55:20,292 INFO L374 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:55:20,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:55:20,292 INFO L82 PathProgramCache]: Analyzing trace with hash -926144385, now seen corresponding path program 1 times [2021-07-05 16:55:20,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:55:20,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676953678] [2021-07-05 16:55:20,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:55:20,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:55:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:55:22,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:22,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:22,087 INFO L142 QuantifierPusher]: treesize reduction 17, result has 37.0 percent of original size [2021-07-05 16:55:22,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:55:22,096 INFO L142 QuantifierPusher]: treesize reduction 17, result has 45.2 percent of original size [2021-07-05 16:55:22,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:55:22,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:22,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:55:22,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:22,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:55:22,124 INFO L142 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-07-05 16:55:22,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:55:22,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:22,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:22,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:22,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:22,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:22,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:55:22,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:55:22,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676953678] [2021-07-05 16:55:22,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676953678] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:55:22,154 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:55:22,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-05 16:55:22,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573678771] [2021-07-05 16:55:22,155 INFO L425 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-05 16:55:22,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:55:22,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-05 16:55:22,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-07-05 16:55:22,155 INFO L87 Difference]: Start difference. First operand 151 states and 182 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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-07-05 16:55:28,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:55:28,737 INFO L93 Difference]: Finished difference Result 296 states and 356 transitions. [2021-07-05 16:55:28,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-05 16:55:28,737 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-07-05 16:55:28,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:55:28,738 INFO L225 Difference]: With dead ends: 296 [2021-07-05 16:55:28,738 INFO L226 Difference]: Without dead ends: 200 [2021-07-05 16:55:28,738 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 239.3ms TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2021-07-05 16:55:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-07-05 16:55:28,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 159. [2021-07-05 16:55:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.2088607594936709) internal successors, (191), 158 states have internal predecessors, (191), 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-07-05 16:55:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 191 transitions. [2021-07-05 16:55:28,742 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 191 transitions. Word has length 62 [2021-07-05 16:55:28,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:55:28,742 INFO L442 AbstractCegarLoop]: Abstraction has 159 states and 191 transitions. [2021-07-05 16:55:28,742 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 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-07-05 16:55:28,742 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 191 transitions. [2021-07-05 16:55:28,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-07-05 16:55:28,743 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:55:28,743 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:55:28,743 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2021-07-05 16:55:28,743 INFO L374 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:55:28,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:55:28,743 INFO L82 PathProgramCache]: Analyzing trace with hash -42731075, now seen corresponding path program 1 times [2021-07-05 16:55:28,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:55:28,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744586807] [2021-07-05 16:55:28,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:55:28,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:55:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:55:28,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:28,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:28,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:28,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:28,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:28,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:28,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:28,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:28,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:28,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:55:28,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:28,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:55:28,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:28,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:55:28,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:55:28,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744586807] [2021-07-05 16:55:28,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744586807] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:55:28,973 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:55:28,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:55:28,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187341459] [2021-07-05 16:55:28,973 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:55:28,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:55:28,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:55:28,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:55:28,973 INFO L87 Difference]: Start difference. First operand 159 states and 191 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-07-05 16:55:29,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:55:29,122 INFO L93 Difference]: Finished difference Result 287 states and 340 transitions. [2021-07-05 16:55:29,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 16:55:29,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-07-05 16:55:29,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:55:29,123 INFO L225 Difference]: With dead ends: 287 [2021-07-05 16:55:29,123 INFO L226 Difference]: Without dead ends: 180 [2021-07-05 16:55:29,123 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 71.6ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:55:29,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-07-05 16:55:29,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 159. [2021-07-05 16:55:29,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.2025316455696202) internal successors, (190), 158 states have internal predecessors, (190), 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-07-05 16:55:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 190 transitions. [2021-07-05 16:55:29,128 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 190 transitions. Word has length 70 [2021-07-05 16:55:29,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:55:29,128 INFO L442 AbstractCegarLoop]: Abstraction has 159 states and 190 transitions. [2021-07-05 16:55:29,128 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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-07-05 16:55:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 190 transitions. [2021-07-05 16:55:29,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-07-05 16:55:29,129 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:55:29,129 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:55:29,129 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2021-07-05 16:55:29,129 INFO L374 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:55:29,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:55:29,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1258416770, now seen corresponding path program 1 times [2021-07-05 16:55:29,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:55:29,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450481727] [2021-07-05 16:55:29,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:55:29,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:55:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:55:29,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:29,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:29,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:29,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:29,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:29,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:29,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:29,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:29,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:29,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:55:29,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:29,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-07-05 16:55:29,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:29,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:29,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:55:29,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:55:29,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450481727] [2021-07-05 16:55:29,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450481727] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:55:29,334 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:55:29,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:55:29,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508186567] [2021-07-05 16:55:29,334 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:55:29,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:55:29,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:55:29,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:55:29,334 INFO L87 Difference]: Start difference. First operand 159 states and 190 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-07-05 16:55:29,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:55:29,474 INFO L93 Difference]: Finished difference Result 180 states and 210 transitions. [2021-07-05 16:55:29,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 16:55:29,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-07-05 16:55:29,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:55:29,474 INFO L225 Difference]: With dead ends: 180 [2021-07-05 16:55:29,474 INFO L226 Difference]: Without dead ends: 159 [2021-07-05 16:55:29,475 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 58.5ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:55:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-07-05 16:55:29,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2021-07-05 16:55:29,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.1898734177215189) internal successors, (188), 158 states have internal predecessors, (188), 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-07-05 16:55:29,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 188 transitions. [2021-07-05 16:55:29,478 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 188 transitions. Word has length 72 [2021-07-05 16:55:29,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:55:29,478 INFO L442 AbstractCegarLoop]: Abstraction has 159 states and 188 transitions. [2021-07-05 16:55:29,478 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-07-05 16:55:29,478 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 188 transitions. [2021-07-05 16:55:29,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-05 16:55:29,478 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:55:29,478 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:55:29,478 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2021-07-05 16:55:29,478 INFO L374 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:55:29,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:55:29,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1350845213, now seen corresponding path program 1 times [2021-07-05 16:55:29,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:55:29,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009727311] [2021-07-05 16:55:29,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:55:29,479 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:55:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:55:29,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:29,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:29,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:29,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-05 16:55:29,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:29,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:55:29,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:29,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:29,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:29,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:55:29,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:55:29,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009727311] [2021-07-05 16:55:29,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009727311] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:55:29,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:55:29,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:55:29,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644463641] [2021-07-05 16:55:29,650 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:55:29,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:55:29,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:55:29,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:55:29,651 INFO L87 Difference]: Start difference. First operand 159 states and 188 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:55:31,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:55:31,966 INFO L93 Difference]: Finished difference Result 385 states and 451 transitions. [2021-07-05 16:55:31,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:55:31,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-07-05 16:55:31,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:55:31,967 INFO L225 Difference]: With dead ends: 385 [2021-07-05 16:55:31,967 INFO L226 Difference]: Without dead ends: 248 [2021-07-05 16:55:31,967 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 23.8ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:55:31,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-07-05 16:55:31,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 159. [2021-07-05 16:55:31,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.1645569620253164) internal successors, (184), 158 states have internal predecessors, (184), 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-07-05 16:55:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 184 transitions. [2021-07-05 16:55:31,970 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 184 transitions. Word has length 74 [2021-07-05 16:55:31,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:55:31,970 INFO L442 AbstractCegarLoop]: Abstraction has 159 states and 184 transitions. [2021-07-05 16:55:31,970 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:55:31,970 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 184 transitions. [2021-07-05 16:55:31,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-05 16:55:31,971 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:55:31,971 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:55:31,971 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2021-07-05 16:55:31,971 INFO L374 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:55:31,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:55:31,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1367457827, now seen corresponding path program 1 times [2021-07-05 16:55:31,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:55:31,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055015188] [2021-07-05 16:55:31,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:55:31,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:55:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:55:32,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:32,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:32,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:32,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:32,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:32,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:55:32,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:32,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:55:32,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:55:32,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055015188] [2021-07-05 16:55:32,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055015188] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:55:32,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:55:32,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:55:32,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116760676] [2021-07-05 16:55:32,082 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:55:32,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:55:32,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:55:32,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:55:32,082 INFO L87 Difference]: Start difference. First operand 159 states and 184 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:55:32,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:55:32,148 INFO L93 Difference]: Finished difference Result 302 states and 349 transitions. [2021-07-05 16:55:32,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:55:32,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-07-05 16:55:32,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:55:32,149 INFO L225 Difference]: With dead ends: 302 [2021-07-05 16:55:32,149 INFO L226 Difference]: Without dead ends: 139 [2021-07-05 16:55:32,149 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:55:32,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-07-05 16:55:32,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-07-05 16:55:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.1159420289855073) internal successors, (154), 138 states have internal predecessors, (154), 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-07-05 16:55:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2021-07-05 16:55:32,153 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 74 [2021-07-05 16:55:32,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:55:32,153 INFO L442 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2021-07-05 16:55:32,153 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:55:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2021-07-05 16:55:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-05 16:55:32,154 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:55:32,154 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:55:32,154 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2021-07-05 16:55:32,154 INFO L374 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:55:32,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:55:32,154 INFO L82 PathProgramCache]: Analyzing trace with hash 743085151, now seen corresponding path program 1 times [2021-07-05 16:55:32,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:55:32,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945688994] [2021-07-05 16:55:32,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:55:32,154 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:55:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:55:34,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:34,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:55:34,525 INFO L142 QuantifierPusher]: treesize reduction 42, result has 33.3 percent of original size [2021-07-05 16:55:34,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:55:34,550 INFO L142 QuantifierPusher]: treesize reduction 42, result has 40.0 percent of original size [2021-07-05 16:55:34,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-07-05 16:55:34,586 INFO L142 QuantifierPusher]: treesize reduction 42, result has 48.8 percent of original size [2021-07-05 16:55:34,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-07-05 16:55:34,628 INFO L142 QuantifierPusher]: treesize reduction 42, result has 54.3 percent of original size [2021-07-05 16:55:34,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-07-05 16:55:34,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:34,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-07-05 16:55:34,661 INFO L142 QuantifierPusher]: treesize reduction 21, result has 70.4 percent of original size [2021-07-05 16:55:34,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-07-05 16:55:34,713 INFO L142 QuantifierPusher]: treesize reduction 21, result has 64.4 percent of original size [2021-07-05 16:55:34,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-07-05 16:55:34,757 INFO L142 QuantifierPusher]: treesize reduction 17, result has 59.5 percent of original size [2021-07-05 16:55:34,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-07-05 16:55:34,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:34,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:34,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:55:34,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:55:34,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945688994] [2021-07-05 16:55:34,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945688994] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:55:34,770 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:55:34,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:55:34,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056336210] [2021-07-05 16:55:34,770 INFO L425 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-05 16:55:34,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:55:34,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-05 16:55:34,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-07-05 16:55:34,771 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:55:43,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:55:43,366 INFO L93 Difference]: Finished difference Result 273 states and 302 transitions. [2021-07-05 16:55:43,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 16:55:43,367 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-07-05 16:55:43,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:55:43,367 INFO L225 Difference]: With dead ends: 273 [2021-07-05 16:55:43,367 INFO L226 Difference]: Without dead ends: 139 [2021-07-05 16:55:43,367 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 324.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-05 16:55:43,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-07-05 16:55:43,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-07-05 16:55:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.108695652173913) internal successors, (153), 138 states have internal predecessors, (153), 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-07-05 16:55:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2021-07-05 16:55:43,371 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 74 [2021-07-05 16:55:43,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:55:43,371 INFO L442 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2021-07-05 16:55:43,371 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:55:43,371 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2021-07-05 16:55:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-07-05 16:55:43,371 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:55:43,371 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:55:43,371 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable205 [2021-07-05 16:55:43,372 INFO L374 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:55:43,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:55:43,372 INFO L82 PathProgramCache]: Analyzing trace with hash 366062748, now seen corresponding path program 1 times [2021-07-05 16:55:43,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:55:43,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786400799] [2021-07-05 16:55:43,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:55:43,372 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:55:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:55:45,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:45,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:55:45,737 INFO L142 QuantifierPusher]: treesize reduction 42, result has 33.3 percent of original size [2021-07-05 16:55:45,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:55:45,777 INFO L142 QuantifierPusher]: treesize reduction 42, result has 40.0 percent of original size [2021-07-05 16:55:45,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-07-05 16:55:45,843 INFO L142 QuantifierPusher]: treesize reduction 42, result has 40.0 percent of original size [2021-07-05 16:55:45,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-07-05 16:55:45,912 INFO L142 QuantifierPusher]: treesize reduction 42, result has 48.8 percent of original size [2021-07-05 16:55:45,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-07-05 16:55:45,993 INFO L142 QuantifierPusher]: treesize reduction 42, result has 54.3 percent of original size [2021-07-05 16:55:45,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-07-05 16:55:46,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:46,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-07-05 16:55:46,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:46,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:55:46,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:46,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:55:46,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:46,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:55:46,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:46,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:46,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:55:46,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:55:46,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786400799] [2021-07-05 16:55:46,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786400799] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:55:46,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:55:46,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-05 16:55:46,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692327834] [2021-07-05 16:55:46,130 INFO L425 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-05 16:55:46,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:55:46,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-05 16:55:46,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-07-05 16:55:46,131 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 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-07-05 16:55:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:55:48,627 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2021-07-05 16:55:48,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-05 16:55:48,628 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-07-05 16:55:48,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:55:48,628 INFO L225 Difference]: With dead ends: 148 [2021-07-05 16:55:48,628 INFO L226 Difference]: Without dead ends: 122 [2021-07-05 16:55:48,629 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 562.4ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-07-05 16:55:48,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-07-05 16:55:48,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-07-05 16:55:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.1074380165289257) internal successors, (134), 121 states have internal predecessors, (134), 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-07-05 16:55:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2021-07-05 16:55:48,632 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 75 [2021-07-05 16:55:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:55:48,632 INFO L442 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2021-07-05 16:55:48,632 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 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-07-05 16:55:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2021-07-05 16:55:48,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-07-05 16:55:48,632 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:55:48,632 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:55:48,632 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2021-07-05 16:55:48,632 INFO L374 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:55:48,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:55:48,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1772346898, now seen corresponding path program 1 times [2021-07-05 16:55:48,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:55:48,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79851537] [2021-07-05 16:55:48,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:55:48,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:55:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:55:48,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:48,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:48,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:48,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-07-05 16:55:48,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:48,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:55:48,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:55:48,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79851537] [2021-07-05 16:55:48,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79851537] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:55:48,848 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:55:48,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 16:55:48,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564076455] [2021-07-05 16:55:48,848 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 16:55:48,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:55:48,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 16:55:48,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 16:55:48,849 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:55:48,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:55:48,861 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2021-07-05 16:55:48,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 16:55:48,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-07-05 16:55:48,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:55:48,861 INFO L225 Difference]: With dead ends: 154 [2021-07-05 16:55:48,862 INFO L226 Difference]: Without dead ends: 116 [2021-07-05 16:55:48,862 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 16:55:48,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-07-05 16:55:48,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-07-05 16:55:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.0956521739130434) internal successors, (126), 115 states have internal predecessors, (126), 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-07-05 16:55:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2021-07-05 16:55:48,865 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 86 [2021-07-05 16:55:48,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:55:48,865 INFO L442 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2021-07-05 16:55:48,865 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:55:48,865 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2021-07-05 16:55:48,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-05 16:55:48,866 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:55:48,866 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:55:48,866 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2021-07-05 16:55:48,866 INFO L374 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:55:48,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:55:48,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1112483792, now seen corresponding path program 1 times [2021-07-05 16:55:48,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:55:48,866 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460500507] [2021-07-05 16:55:48,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:55:48,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:55:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:55:48,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:48,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:48,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:48,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:55:48,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:48,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:55:48,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:48,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:55:49,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:49,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:49,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:55:49,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:55:49,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460500507] [2021-07-05 16:55:49,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460500507] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:55:49,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:55:49,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:55:49,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160184204] [2021-07-05 16:55:49,003 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:55:49,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:55:49,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:55:49,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:55:49,004 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-07-05 16:55:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:55:49,044 INFO L93 Difference]: Finished difference Result 213 states and 226 transitions. [2021-07-05 16:55:49,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:55:49,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-07-05 16:55:49,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:55:49,045 INFO L225 Difference]: With dead ends: 213 [2021-07-05 16:55:49,045 INFO L226 Difference]: Without dead ends: 181 [2021-07-05 16:55:49,045 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:55:49,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-07-05 16:55:49,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 119. [2021-07-05 16:55:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.0932203389830508) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:55:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2021-07-05 16:55:49,049 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 87 [2021-07-05 16:55:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:55:49,049 INFO L442 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2021-07-05 16:55:49,049 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-07-05 16:55:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2021-07-05 16:55:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-07-05 16:55:49,050 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:55:49,050 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:55:49,050 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2021-07-05 16:55:49,050 INFO L374 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:55:49,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:55:49,051 INFO L82 PathProgramCache]: Analyzing trace with hash 2083663374, now seen corresponding path program 1 times [2021-07-05 16:55:49,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:55:49,051 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356248392] [2021-07-05 16:55:49,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:55:49,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:55:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:55:49,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:49,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:49,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:49,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-05 16:55:49,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:49,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-07-05 16:55:49,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:49,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:55:49,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:55:49,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356248392] [2021-07-05 16:55:49,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356248392] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:55:49,302 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:55:49,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:55:49,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307950025] [2021-07-05 16:55:49,303 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:55:49,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:55:49,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:55:49,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:55:49,304 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-07-05 16:55:49,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:55:49,335 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2021-07-05 16:55:49,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:55:49,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-07-05 16:55:49,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:55:49,336 INFO L225 Difference]: With dead ends: 159 [2021-07-05 16:55:49,336 INFO L226 Difference]: Without dead ends: 115 [2021-07-05 16:55:49,337 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:55:49,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-07-05 16:55:49,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-07-05 16:55:49,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.0789473684210527) internal successors, (123), 114 states have internal predecessors, (123), 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-07-05 16:55:49,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2021-07-05 16:55:49,342 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 88 [2021-07-05 16:55:49,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:55:49,343 INFO L442 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2021-07-05 16:55:49,343 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-07-05 16:55:49,343 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2021-07-05 16:55:49,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-07-05 16:55:49,343 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:55:49,344 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:55:49,344 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209 [2021-07-05 16:55:49,344 INFO L374 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:55:49,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:55:49,344 INFO L82 PathProgramCache]: Analyzing trace with hash -506108074, now seen corresponding path program 1 times [2021-07-05 16:55:49,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:55:49,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846603584] [2021-07-05 16:55:49,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:55:49,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:55:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:55:51,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:51,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:51,359 INFO L142 QuantifierPusher]: treesize reduction 17, result has 37.0 percent of original size [2021-07-05 16:55:51,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:55:51,370 INFO L142 QuantifierPusher]: treesize reduction 17, result has 45.2 percent of original size [2021-07-05 16:55:51,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:55:51,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:51,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:55:51,395 INFO L142 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-07-05 16:55:51,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:55:51,414 INFO L142 QuantifierPusher]: treesize reduction 9, result has 57.1 percent of original size [2021-07-05 16:55:51,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:55:51,431 INFO L142 QuantifierPusher]: treesize reduction 9, result has 47.1 percent of original size [2021-07-05 16:55:51,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-05 16:55:51,448 INFO L142 QuantifierPusher]: treesize reduction 9, result has 47.1 percent of original size [2021-07-05 16:55:51,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-05 16:55:51,463 INFO L142 QuantifierPusher]: treesize reduction 12, result has 7.7 percent of original size [2021-07-05 16:55:51,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:51,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:55:51,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:55:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:55:51,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:55:51,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846603584] [2021-07-05 16:55:51,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846603584] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:55:51,465 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:55:51,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-05 16:55:51,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904050352] [2021-07-05 16:55:51,465 INFO L425 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-05 16:55:51,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:55:51,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-05 16:55:51,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-07-05 16:55:51,466 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-07-05 16:55:58,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:55:58,039 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2021-07-05 16:55:58,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-05 16:55:58,040 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-07-05 16:55:58,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:55:58,040 INFO L225 Difference]: With dead ends: 177 [2021-07-05 16:55:58,040 INFO L226 Difference]: Without dead ends: 135 [2021-07-05 16:55:58,041 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 267.1ms TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2021-07-05 16:55:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-07-05 16:55:58,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2021-07-05 16:55:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.0636363636363637) internal successors, (117), 110 states have internal predecessors, (117), 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-07-05 16:55:58,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2021-07-05 16:55:58,045 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 89 [2021-07-05 16:55:58,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:55:58,045 INFO L442 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2021-07-05 16:55:58,045 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 states have internal predecessors, (89), 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-07-05 16:55:58,045 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2021-07-05 16:55:58,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-07-05 16:55:58,045 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:55:58,046 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:55:58,046 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2021-07-05 16:55:58,046 INFO L374 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:55:58,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:55:58,046 INFO L82 PathProgramCache]: Analyzing trace with hash -444068460, now seen corresponding path program 1 times [2021-07-05 16:55:58,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:55:58,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604504668] [2021-07-05 16:55:58,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:55:58,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:56:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:56:00,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:00,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:00,437 INFO L142 QuantifierPusher]: treesize reduction 15, result has 31.8 percent of original size [2021-07-05 16:56:00,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:56:00,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:00,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:56:00,451 INFO L142 QuantifierPusher]: treesize reduction 33, result has 8.3 percent of original size [2021-07-05 16:56:00,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:56:00,459 INFO L142 QuantifierPusher]: treesize reduction 26, result has 38.1 percent of original size [2021-07-05 16:56:00,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-07-05 16:56:00,484 INFO L142 QuantifierPusher]: treesize reduction 26, result has 43.5 percent of original size [2021-07-05 16:56:00,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:56:00,520 INFO L142 QuantifierPusher]: treesize reduction 26, result has 43.5 percent of original size [2021-07-05 16:56:00,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:56:00,550 INFO L142 QuantifierPusher]: treesize reduction 26, result has 43.5 percent of original size [2021-07-05 16:56:00,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:56:00,581 INFO L142 QuantifierPusher]: treesize reduction 26, result has 43.5 percent of original size [2021-07-05 16:56:00,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:56:00,613 INFO L142 QuantifierPusher]: treesize reduction 26, result has 31.6 percent of original size [2021-07-05 16:56:00,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:56:00,632 INFO L142 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-07-05 16:56:00,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:56:00,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:00,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:56:00,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:00,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:56:00,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:00,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:56:00,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:56:00,684 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604504668] [2021-07-05 16:56:00,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604504668] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:56:00,684 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:56:00,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-07-05 16:56:00,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223795713] [2021-07-05 16:56:00,684 INFO L425 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-07-05 16:56:00,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:56:00,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-07-05 16:56:00,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-07-05 16:56:00,685 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 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-07-05 16:56:05,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:56:05,536 INFO L93 Difference]: Finished difference Result 167 states and 174 transitions. [2021-07-05 16:56:05,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-07-05 16:56:05,537 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-07-05 16:56:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:56:05,537 INFO L225 Difference]: With dead ends: 167 [2021-07-05 16:56:05,537 INFO L226 Difference]: Without dead ends: 129 [2021-07-05 16:56:05,538 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 600.4ms TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2021-07-05 16:56:05,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-07-05 16:56:05,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 101. [2021-07-05 16:56:05,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.05) internal successors, (105), 100 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:56:05,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2021-07-05 16:56:05,543 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 89 [2021-07-05 16:56:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:56:05,543 INFO L442 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2021-07-05 16:56:05,543 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 14 states have internal predecessors, (89), 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-07-05 16:56:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2021-07-05 16:56:05,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-07-05 16:56:05,544 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:56:05,544 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:56:05,544 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211 [2021-07-05 16:56:05,544 INFO L374 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:56:05,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:56:05,545 INFO L82 PathProgramCache]: Analyzing trace with hash 480482659, now seen corresponding path program 1 times [2021-07-05 16:56:05,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:56:05,545 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632448614] [2021-07-05 16:56:05,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:56:05,545 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:56:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:56:05,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:05,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:05,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:05,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 16:56:05,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:05,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 16:56:05,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:05,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 16:56:05,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:05,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:05,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:56:05,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:56:05,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632448614] [2021-07-05 16:56:05,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632448614] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:56:05,737 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:56:05,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:56:05,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148586257] [2021-07-05 16:56:05,737 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:56:05,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:56:05,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:56:05,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:56:05,738 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:56:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:56:05,780 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2021-07-05 16:56:05,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:56:05,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-07-05 16:56:05,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:56:05,781 INFO L225 Difference]: With dead ends: 129 [2021-07-05 16:56:05,781 INFO L226 Difference]: Without dead ends: 96 [2021-07-05 16:56:05,781 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:56:05,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-07-05 16:56:05,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-07-05 16:56:05,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.0421052631578946) internal successors, (99), 95 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:56:05,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2021-07-05 16:56:05,785 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 95 [2021-07-05 16:56:05,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:56:05,785 INFO L442 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2021-07-05 16:56:05,785 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:56:05,785 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2021-07-05 16:56:05,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-07-05 16:56:05,785 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:56:05,785 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:56:05,785 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable212 [2021-07-05 16:56:05,785 INFO L374 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:56:05,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:56:05,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1281217789, now seen corresponding path program 1 times [2021-07-05 16:56:05,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:56:05,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504781350] [2021-07-05 16:56:05,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:56:05,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:56:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:56:09,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:09,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:09,531 INFO L142 QuantifierPusher]: treesize reduction 5, result has 75.0 percent of original size [2021-07-05 16:56:09,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:56:09,544 INFO L142 QuantifierPusher]: treesize reduction 5, result has 80.8 percent of original size [2021-07-05 16:56:09,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:56:09,562 INFO L142 QuantifierPusher]: treesize reduction 5, result has 80.8 percent of original size [2021-07-05 16:56:09,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:56:09,586 INFO L142 QuantifierPusher]: treesize reduction 5, result has 86.8 percent of original size [2021-07-05 16:56:09,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-07-05 16:56:09,610 INFO L142 QuantifierPusher]: treesize reduction 5, result has 89.6 percent of original size [2021-07-05 16:56:09,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-07-05 16:56:09,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:09,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-05 16:56:09,639 INFO L142 QuantifierPusher]: treesize reduction 23, result has 55.8 percent of original size [2021-07-05 16:56:09,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-07-05 16:56:09,669 INFO L142 QuantifierPusher]: treesize reduction 22, result has 63.9 percent of original size [2021-07-05 16:56:09,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-07-05 16:56:09,720 INFO L142 QuantifierPusher]: treesize reduction 38, result has 44.9 percent of original size [2021-07-05 16:56:09,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:56:09,750 INFO L142 QuantifierPusher]: treesize reduction 22, result has 58.5 percent of original size [2021-07-05 16:56:09,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:56:09,751 INFO L142 QuantifierPusher]: treesize reduction 22, result has 60.0 percent of original size [2021-07-05 16:56:09,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-07-05 16:56:09,781 INFO L142 QuantifierPusher]: treesize reduction 22, result has 52.2 percent of original size [2021-07-05 16:56:09,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-07-05 16:56:09,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:09,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-07-05 16:56:09,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:09,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:56:09,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:09,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:56:09,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:09,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:56:09,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:09,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:56:09,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:56:09,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504781350] [2021-07-05 16:56:09,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504781350] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:56:09,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:56:09,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-07-05 16:56:09,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053145224] [2021-07-05 16:56:09,906 INFO L425 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-07-05 16:56:09,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:56:09,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-07-05 16:56:09,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-07-05 16:56:09,907 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:56:18,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:56:18,786 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2021-07-05 16:56:18,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-05 16:56:18,787 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-07-05 16:56:18,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:56:18,787 INFO L225 Difference]: With dead ends: 96 [2021-07-05 16:56:18,787 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 16:56:18,787 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 736.7ms TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2021-07-05 16:56:18,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 16:56:18,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 16:56:18,787 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-07-05 16:56:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 16:56:18,788 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2021-07-05 16:56:18,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:56:18,788 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 16:56:18,788 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:56:18,788 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 16:56:18,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 16:56:18,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 16:56:18,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,789 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,789 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,790 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,830 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,848 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,852 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,872 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,878 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,914 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:18,921 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:56:19,146 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2021-07-05 16:56:19,557 WARN L205 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 105 [2021-07-05 16:56:19,751 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2021-07-05 16:56:20,121 WARN L205 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2021-07-05 16:56:20,311 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 40 [2021-07-05 16:56:20,511 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 42 [2021-07-05 16:56:20,657 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2021-07-05 16:56:21,065 WARN L205 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 78 [2021-07-05 16:56:21,287 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2021-07-05 16:56:21,505 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2021-07-05 16:56:21,710 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 40 [2021-07-05 16:56:21,876 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2021-07-05 16:56:22,119 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2021-07-05 16:56:22,121 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,122 INFO L762 garLoopResultBuilder]: For program point L9153(lines 9153 9155) no Hoare annotation was computed. [2021-07-05 16:56:22,122 INFO L762 garLoopResultBuilder]: For program point L9153-2(lines 9153 9155) no Hoare annotation was computed. [2021-07-05 16:56:22,122 INFO L762 garLoopResultBuilder]: For program point L6973(lines 6973 6978) no Hoare annotation was computed. [2021-07-05 16:56:22,122 INFO L758 garLoopResultBuilder]: At program point L268(line 268) the Hoare annotation is: false [2021-07-05 16:56:22,122 INFO L762 garLoopResultBuilder]: For program point L6974(lines 6974 6976) no Hoare annotation was computed. [2021-07-05 16:56:22,122 INFO L762 garLoopResultBuilder]: For program point L6974-2(lines 6974 6976) no Hoare annotation was computed. [2021-07-05 16:56:22,122 INFO L762 garLoopResultBuilder]: For program point L7141-2(line 7141) no Hoare annotation was computed. [2021-07-05 16:56:22,122 INFO L762 garLoopResultBuilder]: For program point L7141(line 7141) no Hoare annotation was computed. [2021-07-05 16:56:22,122 INFO L765 garLoopResultBuilder]: At program point L9157(line 9157) the Hoare annotation is: true [2021-07-05 16:56:22,122 INFO L762 garLoopResultBuilder]: For program point L6979(lines 6979 6981) no Hoare annotation was computed. [2021-07-05 16:56:22,122 INFO L758 garLoopResultBuilder]: At program point L6979-3(lines 6965 6982) the Hoare annotation is: (let ((.cse32 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse31 (select .cse32 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse25 (= |ULTIMATE.start_can_fail_realloc_#res.base| 0)) (.cse28 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296))) (let ((.cse27 (+ |#StackHeapBarrier| 1)) (.cse13 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse20 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse8 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse22 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse9 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse23 (= |ULTIMATE.start_can_fail_realloc_#res.offset| 0)) (.cse16 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse26 (<= (+ (* 4294967296 .cse28) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse19 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse21 (not .cse25)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse3 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse39 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse12 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse14 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse24 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse29 (* .cse31 (- 1))) (.cse18 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse15 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and .cse0 (let ((.cse11 (select (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse1 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse2 (let ((.cse30 (select .cse32 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= (* 4294967296 (div (+ (* (div (+ .cse29 4294967295 .cse30) 4294967296) 4294967296) .cse31) 4294967296)) .cse30))) (.cse10 (<= (* 4294967296 (div (+ .cse11 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse28 4294967296)) 4294967296)) .cse11)) (.cse17 (<= .cse27 ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse11 (* 4294967296 (div .cse11 4294967296))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse19 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18) (and .cse4 .cse22 .cse9 .cse23 .cse24 .cse15 .cse25 .cse26)))) .cse3 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) .cse5 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse22 (let ((.cse40 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse33 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse40))) (.cse34 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse40) |~#s_can_fail_allocator_static~0.base|)) (.cse35 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse36 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|)) (.cse37 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|)) (.cse38 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse3 .cse4 .cse19 .cse20 .cse33 (<= .cse27 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse34 .cse35 .cse36 .cse6 .cse8 .cse37 .cse22 .cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) .cse12 .cse13 .cse15 .cse21 .cse16 .cse38 .cse26) (and .cse0 .cse3 .cse4 .cse20 .cse33 .cse34 .cse35 .cse36 .cse6 .cse8 .cse37 .cse22 .cse9 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse39 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0)) .cse23 .cse12 .cse24 .cse15 .cse25 .cse16 .cse38 .cse18 .cse26)))) .cse12 .cse14 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) (let ((.cse47 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse43 (select .cse47 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse41 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse42 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse45 (let ((.cse46 (select .cse47 12))) (<= .cse46 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse46) 4294967296)))))) (.cse44 (div .cse43 4294967296))) (or (and .cse0 .cse3 .cse19 .cse5 .cse6 .cse7 .cse12 .cse14 .cse24 .cse15 .cse21 .cse18) (and .cse41 .cse0 .cse3 .cse42 .cse5 .cse6 .cse7 .cse12 (<= .cse43 (* 4294967296 .cse44)) .cse14 .cse45 .cse24 .cse15 .cse18) (and .cse41 .cse0 .cse3 .cse42 .cse5 .cse6 .cse7 .cse39 .cse12 .cse14 .cse45 .cse24 .cse15 (<= .cse43 (+ (* 4294967296 (div (+ .cse29 (* .cse44 4294967296) 4294967295) 4294967296)) .cse31)) .cse18))))) .cse15)))) [2021-07-05 16:56:22,122 INFO L762 garLoopResultBuilder]: For program point L6979-2(lines 6979 6981) no Hoare annotation was computed. [2021-07-05 16:56:22,122 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,122 INFO L762 garLoopResultBuilder]: For program point L7145(lines 7145 7151) no Hoare annotation was computed. [2021-07-05 16:56:22,123 INFO L758 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse7 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and .cse0 .cse1 .cse2 (let ((.cse10 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse4 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse10)) (.cse3 (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse10)) (.cse5 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse9 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 (= .cse3 0) .cse1 (= .cse4 0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| .cse4) .cse2 (= .cse3 |~#s_can_fail_allocator_static~0.base|) .cse5 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse6 .cse7 .cse8 .cse9)))) .cse6 .cse7 .cse8)) [2021-07-05 16:56:22,123 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,123 INFO L762 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:56:22,123 INFO L762 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:56:22,123 INFO L762 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:56:22,123 INFO L762 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:56:22,123 INFO L762 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:56:22,123 INFO L762 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:56:22,123 INFO L762 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:56:22,123 INFO L762 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:56:22,123 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,123 INFO L762 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-07-05 16:56:22,124 INFO L762 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-07-05 16:56:22,124 INFO L762 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-07-05 16:56:22,124 INFO L762 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-07-05 16:56:22,124 INFO L762 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-07-05 16:56:22,124 INFO L762 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-07-05 16:56:22,124 INFO L762 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-07-05 16:56:22,124 INFO L762 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-07-05 16:56:22,124 INFO L758 garLoopResultBuilder]: At program point L6951-1(lines 6950 6952) the Hoare annotation is: (let ((.cse0 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse0)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse0) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |ULTIMATE.start_aws_byte_buf_has_allocator_#t~mem500.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (= |ULTIMATE.start_can_fail_allocator_#res.base| |ULTIMATE.start_aws_byte_buf_has_allocator_#t~mem500.base|) (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-07-05 16:56:22,124 INFO L758 garLoopResultBuilder]: At program point L6951(lines 6950 6952) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2021-07-05 16:56:22,124 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,124 INFO L758 garLoopResultBuilder]: At program point L6655(lines 6653 6656) the Hoare annotation is: (let ((.cse0 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (<= 1 |ULTIMATE.start_aws_byte_buf_has_allocator_#res|) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= |ULTIMATE.start_aws_byte_buf_has_allocator_#res| 1) (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse0)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse0) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-07-05 16:56:22,124 INFO L758 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:56:22,124 INFO L758 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:56:22,124 INFO L758 garLoopResultBuilder]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: (let ((.cse2 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse3 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse16 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse11 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse13 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse14 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse15 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse0 .cse1 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize) (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4) (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse2)) .cse3 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse2) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (let ((.cse19 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse9 (select .cse19 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse5 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse6 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse12 (let ((.cse18 (select .cse19 12))) (<= .cse18 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse18) 4294967296)))))) (.cse10 (div .cse9 4294967296))) (or (and .cse5 .cse0 .cse1 .cse6 .cse3 .cse4 .cse7 .cse8 (<= .cse9 (* 4294967296 .cse10)) .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse5 .cse0 .cse1 .cse6 .cse3 .cse4 .cse7 .cse16 .cse8 .cse11 .cse12 .cse13 .cse14 (<= .cse9 (let ((.cse17 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse17 (- 1)) (* .cse10 4294967296) 4294967295) 4294967296)) .cse17))) .cse15))))) (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse16 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0)) .cse8 .cse11 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse13 .cse14 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse15 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity) (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0))) [2021-07-05 16:56:22,125 INFO L762 garLoopResultBuilder]: For program point L8176-1(line 8176) no Hoare annotation was computed. [2021-07-05 16:56:22,125 INFO L758 garLoopResultBuilder]: At program point L8176-4(line 8176) the Hoare annotation is: (let ((.cse40 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse25 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse38 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse36 (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse39 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 16)) (.cse34 (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse40))) (let ((.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse28 (= .cse34 0)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse29 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse40) 0)) (.cse30 (= (select .cse36 .cse39) 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse10 (not (= (select .cse38 4) 0))) (.cse11 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse15 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse27 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse16 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse17 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse21 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse32 (= (select .cse38 .cse39) 0)) (.cse13 (select .cse25 12))) (let ((.cse23 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse13) 4294967296)))) (.cse7 (let ((.cse37 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (<= .cse37 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse37) 4294967296)))))) (.cse0 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse3 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse33 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse26 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse35 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse22 (and .cse1 .cse28 .cse2 .cse29 .cse30 .cse4 .cse6 .cse10 .cse11 .cse15 .cse27 .cse16 .cse17 .cse21 .cse32))) (and (let ((.cse24 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse5 (select .cse25 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse20 (select .cse24 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse18 (select .cse24 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (let ((.cse19 (div .cse18 4294967296)) (.cse8 (<= .cse13 .cse23)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse12 (<= .cse20 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse20) 4294967296))))) (.cse14 (div .cse5 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse5) 4294967296)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse5 (+ .cse13 (* 4294967296 (div (+ (* .cse14 4294967296) 4294967295 (* .cse13 (- 1))) 4294967296)))) .cse15 .cse16 .cse17 (<= .cse18 (+ (* 4294967296 (div (+ (* .cse19 4294967296) (* .cse20 (- 1)) 4294967295) 4294967296)) .cse20)) .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse18 (* 4294967296 .cse19)) .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 (<= .cse5 (* 4294967296 .cse14)) .cse16 .cse17 .cse21) .cse22)))) (or .cse22 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse26 .cse11 (<= (select .cse25 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 12)) .cse23) .cse15 .cse27 .cse16 .cse17 .cse21)) (let ((.cse31 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse1 .cse28 .cse2 .cse29 .cse30 .cse4 .cse6 .cse10 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |~#s_can_fail_allocator_static~0.offset| 1)) .cse11 .cse15 .cse27 .cse16 .cse17 .cse31 .cse21 .cse32) (and .cse1 .cse2 .cse4 .cse33 (= .cse34 |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse6 .cse35 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse11 .cse15 .cse27 (= (select .cse36 16) |~#s_can_fail_allocator_static~0.offset|) .cse17 .cse31 .cse21))) (or (and .cse1 .cse2 .cse4 .cse33 .cse6 .cse26 .cse7 .cse10 .cse11 .cse15 .cse27 .cse16 .cse17 .cse21) (and .cse1 .cse28 .cse2 .cse29 .cse30 .cse4 .cse33 .cse6 .cse10 .cse11 .cse15 .cse27 .cse16 .cse17 .cse21 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse33 .cse6 .cse26 .cse10 .cse11 .cse15 .cse27 .cse16 .cse17 .cse21)) (or (and .cse1 .cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) .cse4 .cse35 .cse11 .cse15 .cse27 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse17 .cse21) .cse22)))))) [2021-07-05 16:56:22,125 INFO L762 garLoopResultBuilder]: For program point L8176-3(line 8176) no Hoare annotation was computed. [2021-07-05 16:56:22,125 INFO L762 garLoopResultBuilder]: For program point L8177-3(lines 8175 8193) no Hoare annotation was computed. [2021-07-05 16:56:22,125 INFO L762 garLoopResultBuilder]: For program point L8177-2(line 8177) no Hoare annotation was computed. [2021-07-05 16:56:22,125 INFO L762 garLoopResultBuilder]: For program point L8177(line 8177) no Hoare annotation was computed. [2021-07-05 16:56:22,125 INFO L762 garLoopResultBuilder]: For program point L8177-4(line 8177) no Hoare annotation was computed. [2021-07-05 16:56:22,125 INFO L762 garLoopResultBuilder]: For program point L6658(lines 6658 6663) no Hoare annotation was computed. [2021-07-05 16:56:22,125 INFO L762 garLoopResultBuilder]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:56:22,125 INFO L762 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:56:22,125 INFO L762 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:56:22,125 INFO L762 garLoopResultBuilder]: For program point L7154(lines 7154 7156) no Hoare annotation was computed. [2021-07-05 16:56:22,125 INFO L762 garLoopResultBuilder]: For program point L6659(lines 6659 6661) no Hoare annotation was computed. [2021-07-05 16:56:22,125 INFO L762 garLoopResultBuilder]: For program point L6659-2(lines 6659 6661) no Hoare annotation was computed. [2021-07-05 16:56:22,125 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 16:56:22,126 INFO L762 garLoopResultBuilder]: For program point L7122(lines 7122 7135) no Hoare annotation was computed. [2021-07-05 16:56:22,126 INFO L762 garLoopResultBuilder]: For program point L8179(lines 8179 8182) no Hoare annotation was computed. [2021-07-05 16:56:22,126 INFO L762 garLoopResultBuilder]: For program point L9137(lines 9137 9156) no Hoare annotation was computed. [2021-07-05 16:56:22,126 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,126 INFO L758 garLoopResultBuilder]: At program point L7158(lines 7137 7159) the Hoare annotation is: (let ((.cse30 (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0)) (.cse38 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296))) (let ((.cse4 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0)) (.cse5 (<= (+ |ULTIMATE.start_aws_mem_realloc_#res| 1) 0)) (.cse27 (<= (+ (* 4294967296 .cse38) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse8 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse9 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse10 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse14 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse17 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse18 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0))) (.cse19 (not .cse30)) (.cse21 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse24 (not (= |ULTIMATE.start_can_fail_realloc_#res.base| 0))) (.cse25 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse2 (+ |#StackHeapBarrier| 1)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse7 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse32 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse13 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse34 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse28 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse20 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse39 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse29 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse16 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse22 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse23 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and (let ((.cse31 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse1 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse31))) (.cse3 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse31) |~#s_can_fail_allocator_static~0.base|))) (let ((.cse0 (let ((.cse11 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse12 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|)) (.cse15 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|)) (.cse26 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) .cse6 .cse7 .cse8 .cse10 .cse1 .cse3 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse28 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0)) .cse20 .cse22 .cse23 .cse25 .cse26 .cse29 .cse27 .cse30))))) (or (and .cse0 .cse1 (<= .cse2 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse3 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (and .cse4 .cse0 .cse5))))) .cse6 .cse7 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) .cse32 (let ((.cse36 (select (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse33 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse35 (<= (* 4294967296 (div (+ .cse36 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse38 4294967296)) 4294967296)) .cse36)) (.cse37 (<= .cse2 ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and .cse4 .cse8 .cse16 .cse17 .cse5 .cse22 .cse23 .cse27) (and .cse33 .cse6 .cse7 .cse8 .cse32 .cse13 .cse34 .cse14 .cse16 .cse17 .cse35 (<= .cse36 (* 4294967296 (div .cse36 4294967296))) .cse20 .cse21 .cse22 .cse23 .cse25 .cse37 .cse29) (and .cse33 .cse6 .cse7 .cse8 .cse9 .cse10 .cse32 .cse13 .cse34 .cse14 .cse16 .cse17 .cse18 .cse35 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse37 .cse29)))) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse16 .cse20 .cse39 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse23 (let ((.cse47 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse42 (select .cse47 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse40 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse41 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse44 (let ((.cse46 (select .cse47 12))) (<= .cse46 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse46) 4294967296)))))) (.cse43 (div .cse42 4294967296))) (or (and .cse40 .cse6 .cse7 .cse41 .cse32 .cse13 .cse34 .cse20 (<= .cse42 (* 4294967296 .cse43)) .cse39 .cse44 .cse22 .cse23 .cse29) (and .cse40 .cse6 .cse7 .cse41 .cse32 .cse13 .cse34 .cse28 .cse20 .cse39 .cse44 .cse22 .cse23 (<= .cse42 (let ((.cse45 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse45 (- 1)) (* .cse43 4294967296) 4294967295) 4294967296)) .cse45))) .cse29) (and .cse16 .cse22 .cse23 (= |ULTIMATE.start_aws_mem_realloc_#res| 0))))))))) [2021-07-05 16:56:22,126 INFO L762 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:56:22,126 INFO L762 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:56:22,126 INFO L762 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:56:22,126 INFO L762 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:56:22,126 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,126 INFO L762 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:56:22,126 INFO L762 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:56:22,126 INFO L762 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:56:22,126 INFO L762 garLoopResultBuilder]: For program point L222-7(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:56:22,126 INFO L762 garLoopResultBuilder]: For program point L222-8(lines 7162 7172) no Hoare annotation was computed. [2021-07-05 16:56:22,126 INFO L762 garLoopResultBuilder]: For program point L222-9(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:56:22,127 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 16:56:22,127 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,127 INFO L762 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,127 INFO L762 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,127 INFO L762 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,127 INFO L762 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,127 INFO L762 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,127 INFO L762 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,127 INFO L762 garLoopResultBuilder]: For program point L8184(lines 8184 8187) no Hoare annotation was computed. [2021-07-05 16:56:22,127 INFO L762 garLoopResultBuilder]: For program point L7160(lines 7160 7173) no Hoare annotation was computed. [2021-07-05 16:56:22,127 INFO L762 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,127 INFO L762 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,127 INFO L762 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,127 INFO L762 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,127 INFO L762 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,127 INFO L762 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,127 INFO L762 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,127 INFO L762 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,127 INFO L762 garLoopResultBuilder]: For program point L223-21(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,128 INFO L762 garLoopResultBuilder]: For program point L223-22(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,128 INFO L762 garLoopResultBuilder]: For program point L223-24(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,128 INFO L762 garLoopResultBuilder]: For program point L223-25(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,128 INFO L762 garLoopResultBuilder]: For program point L7491-1(line 7491) no Hoare annotation was computed. [2021-07-05 16:56:22,128 INFO L762 garLoopResultBuilder]: For program point L7491(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,128 INFO L762 garLoopResultBuilder]: For program point L223-27(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,128 INFO L762 garLoopResultBuilder]: For program point L223-28(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,128 INFO L762 garLoopResultBuilder]: For program point L7491-4(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:56:22,128 INFO L762 garLoopResultBuilder]: For program point L7491-3(line 7491) no Hoare annotation was computed. [2021-07-05 16:56:22,128 INFO L762 garLoopResultBuilder]: For program point L7491-9(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,128 INFO L762 garLoopResultBuilder]: For program point L7491-7(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,128 INFO L762 garLoopResultBuilder]: For program point L7491-6(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:56:22,128 INFO L762 garLoopResultBuilder]: For program point L7491-13(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,128 INFO L758 garLoopResultBuilder]: At program point L7491-12(lines 7489 7495) the Hoare annotation is: (let ((.cse24 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse22 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse13 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse24)) (.cse15 (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse24))) (let ((.cse3 (= .cse15 0)) (.cse4 (= .cse13 0)) (.cse21 (select .cse22 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse7 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse12 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (let ((.cse14 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse2 (and (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 .cse5 .cse7 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse8 .cse9 .cse10 .cse12)) (.cse17 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse18 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse19 (<= .cse21 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse21) 4294967296))))) (.cse23 (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12))) (and .cse0 .cse1 (let ((.cse6 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse11 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or .cse2 (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| .cse13) .cse5 .cse14 (= .cse15 |~#s_can_fail_allocator_static~0.base|) .cse6 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) .cse5 .cse7 .cse8 .cse9 .cse10 (or (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse14 .cse7 .cse8 .cse9 .cse10 .cse12) .cse2 (and .cse0 .cse1 .cse5 .cse14 (let ((.cse16 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (<= .cse16 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse16) 4294967296))))) .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse17 .cse0 .cse1 .cse18 .cse5 .cse14 .cse7 .cse8 .cse9 .cse10 .cse12)) (or .cse2 (and .cse17 .cse0 .cse1 .cse18 .cse5 .cse7 .cse19 .cse8 .cse9 .cse10 (let ((.cse20 (select .cse22 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= .cse20 (+ (* 4294967296 (div (+ (* (div .cse20 4294967296) 4294967296) (* .cse21 (- 1)) 4294967295) 4294967296)) .cse21))) .cse12) .cse23) (or .cse2 (and .cse17 .cse0 .cse1 .cse18 .cse5 .cse7 .cse19 .cse8 .cse9 .cse10 .cse12) .cse23) .cse12))))) [2021-07-05 16:56:22,128 INFO L762 garLoopResultBuilder]: For program point L7491-11(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,128 INFO L762 garLoopResultBuilder]: For program point L7491-17(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:56:22,128 INFO L762 garLoopResultBuilder]: For program point L7491-16(line 7491) no Hoare annotation was computed. [2021-07-05 16:56:22,128 INFO L762 garLoopResultBuilder]: For program point L7491-14(line 7491) no Hoare annotation was computed. [2021-07-05 16:56:22,129 INFO L762 garLoopResultBuilder]: For program point L7491-20(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,129 INFO L762 garLoopResultBuilder]: For program point L7491-19(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:56:22,129 INFO L758 garLoopResultBuilder]: At program point L7491-25(lines 7489 7495) the Hoare annotation is: (let ((.cse32 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse19 (select .cse32 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse31 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse33 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse4 (select .cse33 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse30 (select .cse31 12)) (.cse24 (div .cse19 4294967296)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse5 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse8 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse27 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0))) (.cse11 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0))) (.cse22 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse12 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse13 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse14 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse15 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (let ((.cse9 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse6 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse7 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse21 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse16 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse17 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse0 (and (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse1 .cse5 .cse8 .cse10 .cse27 .cse11 .cse22 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse12 .cse13 .cse14 .cse15)) (.cse20 (* .cse24 4294967296)) (.cse18 (<= .cse30 (+ (* 4294967296 (div (+ (- 1) .cse30) 4294967296)) 4294967295))) (.cse3 (select .cse33 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse2 (* .cse4 (- 1)))) (and (or .cse0 (and .cse1 (<= (* 4294967296 (div (+ (* (div (+ .cse2 4294967295 .cse3) 4294967296) 4294967296) .cse4) 4294967296)) .cse3) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)) (or (and .cse16 .cse1 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 (<= .cse19 (+ (* 4294967296 (div (+ .cse2 .cse20 4294967295) 4294967296)) .cse4)) .cse15) .cse0) (or (and .cse1 .cse5 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) .cse6 .cse21 .cse22 .cse12 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse14 .cse15) .cse0) (or (and .cse1 .cse5 .cse7 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse8 .cse21 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse10 .cse11 .cse22 .cse12 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 16) |~#s_can_fail_allocator_static~0.offset|) .cse14 (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse15) .cse0) (let ((.cse23 (let ((.cse29 (select .cse32 12))) (let ((.cse26 (<= .cse29 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse29) 4294967296))))) (.cse28 (<= .cse4 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse4) 4294967296))))) (.cse25 (select .cse31 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (or (and .cse1 .cse5 (<= (* 4294967296 (div (+ .cse25 4294967295) 4294967296)) .cse25) (<= (* 4294967296 (div (+ 4294967295 .cse3) 4294967296)) .cse3) (<= (* 4294967296 (div (+ .cse19 4294967295) 4294967296)) .cse19) .cse8 .cse26 .cse10 .cse27 .cse11 .cse22 .cse28 .cse12 .cse13 .cse14 .cse18 .cse15) (and (<= .cse3 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse3) 4294967296)))) .cse1 .cse5 (<= .cse19 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse19) 4294967296)))) .cse8 (<= .cse25 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse25) 4294967296)))) .cse26 .cse10 .cse27 .cse11 .cse22 .cse28 (<= .cse19 (+ .cse29 (* 4294967296 (div (+ .cse20 4294967295 (* .cse29 (- 1))) 4294967296)))) .cse12 .cse13 (<= .cse25 (+ (* 4294967296 (div (+ (* (div .cse25 4294967296) 4294967296) 4294967295 (* .cse30 (- 1))) 4294967296)) .cse30)) .cse14 .cse18 (<= .cse3 (+ (* 4294967296 (div (+ (* (div .cse3 4294967296) 4294967296) .cse2 4294967295) 4294967296)) .cse4)) .cse15)))))) (or (and .cse23 (<= .cse19 (* 4294967296 .cse24))) (and .cse16 .cse17 .cse23) .cse0))))))) [2021-07-05 16:56:22,129 INFO L762 garLoopResultBuilder]: For program point L7491-24(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,129 INFO L762 garLoopResultBuilder]: For program point L7491-22(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,129 INFO L762 garLoopResultBuilder]: For program point L7491-29(line 7491) no Hoare annotation was computed. [2021-07-05 16:56:22,129 INFO L762 garLoopResultBuilder]: For program point L7491-27(line 7491) no Hoare annotation was computed. [2021-07-05 16:56:22,129 INFO L762 garLoopResultBuilder]: For program point L7491-26(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,129 INFO L762 garLoopResultBuilder]: For program point L7491-33(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,129 INFO L762 garLoopResultBuilder]: For program point L7491-32(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:56:22,129 INFO L762 garLoopResultBuilder]: For program point L7491-30(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:56:22,129 INFO L762 garLoopResultBuilder]: For program point L7491-37(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,129 INFO L762 garLoopResultBuilder]: For program point L7491-35(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,129 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,129 INFO L762 garLoopResultBuilder]: For program point L7491-40(line 7491) no Hoare annotation was computed. [2021-07-05 16:56:22,130 INFO L762 garLoopResultBuilder]: For program point L7491-39(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,130 INFO L758 garLoopResultBuilder]: At program point L7491-38(lines 7489 7495) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse11 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0))) (.cse12 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0))) (.cse4 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse5 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse13 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (let ((.cse9 (and (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 .cse2 .cse3 .cse11 .cse12 .cse4 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse5 .cse13 .cse6 .cse7))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (or (and .cse0 .cse1 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse8 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse8 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse8 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) 4294967296)) 4294967295)))) .cse9) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (or .cse9 (let ((.cse10 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse10)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse10) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse2 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse3 .cse11 .cse12 .cse4 .cse5 .cse13 .cse6 (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse7))) .cse3 .cse13 .cse6))) [2021-07-05 16:56:22,130 INFO L762 garLoopResultBuilder]: For program point L7491-45(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:56:22,130 INFO L762 garLoopResultBuilder]: For program point L7491-43(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:56:22,130 INFO L762 garLoopResultBuilder]: For program point L7491-42(line 7491) no Hoare annotation was computed. [2021-07-05 16:56:22,130 INFO L762 garLoopResultBuilder]: For program point L7491-48(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,130 INFO L762 garLoopResultBuilder]: For program point L7491-46(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,130 INFO L762 garLoopResultBuilder]: For program point L7491-53(line 7491) no Hoare annotation was computed. [2021-07-05 16:56:22,130 INFO L762 garLoopResultBuilder]: For program point L7491-52(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,130 INFO L758 garLoopResultBuilder]: At program point L7491-51(lines 7489 7495) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:56:22,130 INFO L762 garLoopResultBuilder]: For program point L7491-50(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,130 INFO L762 garLoopResultBuilder]: For program point L7491-56(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:56:22,130 INFO L762 garLoopResultBuilder]: For program point L7491-55(line 7491) no Hoare annotation was computed. [2021-07-05 16:56:22,130 INFO L762 garLoopResultBuilder]: For program point L7491-61(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,130 INFO L762 garLoopResultBuilder]: For program point L7491-59(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,130 INFO L762 garLoopResultBuilder]: For program point L7491-58(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:56:22,130 INFO L762 garLoopResultBuilder]: For program point L7491-65(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,131 INFO L758 garLoopResultBuilder]: At program point L7491-64(lines 7489 7495) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse6 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse7 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (let ((.cse13 (and (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 .cse4 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse6 .cse7 .cse8))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (or (let ((.cse12 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and (let ((.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse5 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse9 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse10 (<= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse11 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0)) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4) (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse12)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse12) |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base))) .cse13) .cse4 .cse7 .cse8 (or .cse13 (and .cse0 .cse1 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse4 .cse6 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse7 .cse8 (let ((.cse14 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse14 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse14 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) 4294967296)) 4294967295)))))))) [2021-07-05 16:56:22,131 INFO L762 garLoopResultBuilder]: For program point L7491-63(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,131 INFO L762 garLoopResultBuilder]: For program point L7491-69(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:56:22,131 INFO L762 garLoopResultBuilder]: For program point L7491-68(line 7491) no Hoare annotation was computed. [2021-07-05 16:56:22,131 INFO L762 garLoopResultBuilder]: For program point L7491-66(line 7491) no Hoare annotation was computed. [2021-07-05 16:56:22,131 INFO L762 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2021-07-05 16:56:22,131 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 16:56:22,131 INFO L762 garLoopResultBuilder]: For program point L7491-72(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,131 INFO L762 garLoopResultBuilder]: For program point L7491-71(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:56:22,131 INFO L765 garLoopResultBuilder]: At program point L7491-77(lines 7489 7495) the Hoare annotation is: true [2021-07-05 16:56:22,131 INFO L762 garLoopResultBuilder]: For program point L7491-76(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,131 INFO L762 garLoopResultBuilder]: For program point L7491-74(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,131 INFO L762 garLoopResultBuilder]: For program point L9145(lines 9145 9148) no Hoare annotation was computed. [2021-07-05 16:56:22,131 INFO L762 garLoopResultBuilder]: For program point L9145-2(lines 9145 9148) no Hoare annotation was computed. [2021-07-05 16:56:22,131 INFO L762 garLoopResultBuilder]: For program point L7494(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,131 INFO L762 garLoopResultBuilder]: For program point L7494-4(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,131 INFO L762 garLoopResultBuilder]: For program point L7494-3(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,132 INFO L762 garLoopResultBuilder]: For program point L7494-2(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,132 INFO L762 garLoopResultBuilder]: For program point L7494-8(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,132 INFO L762 garLoopResultBuilder]: For program point L7494-6(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,132 INFO L762 garLoopResultBuilder]: For program point L7494-12(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,132 INFO L762 garLoopResultBuilder]: For program point L7494-11(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,132 INFO L762 garLoopResultBuilder]: For program point L7494-9(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,132 INFO L762 garLoopResultBuilder]: For program point L6966(lines 6966 6972) no Hoare annotation was computed. [2021-07-05 16:56:22,132 INFO L762 garLoopResultBuilder]: For program point L7494-15(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,132 INFO L762 garLoopResultBuilder]: For program point L7494-13(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,132 INFO L762 garLoopResultBuilder]: For program point L7494-20(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,132 INFO L762 garLoopResultBuilder]: For program point L7494-18(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,132 INFO L762 garLoopResultBuilder]: For program point L7494-17(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,132 INFO L762 garLoopResultBuilder]: For program point L7494-24(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,132 INFO L762 garLoopResultBuilder]: For program point L7494-22(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,132 INFO L762 garLoopResultBuilder]: For program point L7494-21(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,132 INFO L762 garLoopResultBuilder]: For program point L7494-27(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,132 INFO L762 garLoopResultBuilder]: For program point L7494-26(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,132 INFO L762 garLoopResultBuilder]: For program point L7494-31(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,132 INFO L762 garLoopResultBuilder]: For program point L7494-30(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,132 INFO L762 garLoopResultBuilder]: For program point L7494-29(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,133 INFO L758 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2021-07-05 16:56:22,133 INFO L762 garLoopResultBuilder]: For program point L7494-36(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,133 INFO L758 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: false [2021-07-05 16:56:22,133 INFO L762 garLoopResultBuilder]: For program point L7494-35(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,133 INFO L758 garLoopResultBuilder]: At program point L261-2(line 261) the Hoare annotation is: (let ((.cse33 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse35 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse17 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse32 (select .cse33 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (let ((.cse4 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse3 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse7 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse8 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse10 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse11 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0))) (.cse12 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse13 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0))) (.cse14 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse15 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse18 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse19 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse6 (+ |#StackHeapBarrier| 1)) (.cse30 (* .cse32 (- 1))) (.cse34 (select .cse17 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse28 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse29 (<= (+ (* 4294967296 .cse35) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 .cse2 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) .cse3 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse4)) .cse5 (<= .cse6 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse4) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse7 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse8 .cse9 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) .cse10 .cse11 .cse12 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) .cse13 .cse14 .cse15 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) (let ((.cse16 (select .cse17 12))) (<= .cse16 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse16) 4294967296))))) .cse18 .cse19 (let ((.cse21 (select (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse20 (let ((.cse36 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse22 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse23 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse24 (not (= (select .cse36 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 4)) 0))) (.cse25 (not (= (select .cse36 4) 0))) (.cse26 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse27 (<= .cse6 ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and .cse22 .cse0 .cse1 .cse2 (<= (* 4294967296 (div (+ .cse23 4294967295) 4294967296)) .cse23) .cse5 .cse8 .cse24 .cse10 .cse25 .cse11 .cse12 .cse13 .cse14 (<= (* 4294967296 (div (+ 4294967295 .cse21) 4294967296)) .cse21) .cse15 .cse26 .cse18 .cse19 .cse27 .cse28 .cse29) (and .cse22 .cse0 (let ((.cse31 (select .cse33 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= (* 4294967296 (div (+ (* (div (+ .cse30 4294967295 .cse31) 4294967296) 4294967296) .cse32) 4294967296)) .cse31)) .cse1 .cse2 .cse5 (<= .cse34 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse34) 4294967296)))) .cse8 (<= .cse23 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse23) 4294967296)))) .cse24 .cse10 .cse25 (<= (* 4294967296 (div (+ .cse21 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse35 4294967296)) 4294967296)) .cse21) .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse18 .cse19 .cse27 .cse28 .cse29)))))) (or (and .cse3 .cse20 .cse7 .cse9) (and .cse20 .cse7 .cse9 (<= .cse21 (* 4294967296 (div .cse21 4294967296))))))) (<= .cse34 (+ (* 4294967296 (div (+ .cse30 (* (div .cse34 4294967296) 4294967296) 4294967295) 4294967296)) .cse32)) (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse28 .cse29)))) [2021-07-05 16:56:22,133 INFO L762 garLoopResultBuilder]: For program point L7494-33(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,133 INFO L762 garLoopResultBuilder]: For program point L7494-40(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,133 INFO L762 garLoopResultBuilder]: For program point L7494-39(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,133 INFO L762 garLoopResultBuilder]: For program point L7494-38(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,133 INFO L762 garLoopResultBuilder]: For program point L7494-44(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,133 INFO L762 garLoopResultBuilder]: For program point L7494-42(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,133 INFO L762 garLoopResultBuilder]: For program point L7494-48(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,133 INFO L762 garLoopResultBuilder]: For program point L7494-47(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,133 INFO L762 garLoopResultBuilder]: For program point L7494-45(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,133 INFO L762 garLoopResultBuilder]: For program point L7494-51(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,134 INFO L762 garLoopResultBuilder]: For program point L7494-49(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,134 INFO L762 garLoopResultBuilder]: For program point L7494-53(line 7494) no Hoare annotation was computed. [2021-07-05 16:56:22,134 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 16:56:22,134 INFO L762 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2021-07-05 16:56:22,134 INFO L758 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: (let ((.cse16 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse3 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse15 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse17 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse5 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse6 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse18 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse19 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse20 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse7 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse21 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse22 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse11 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse27 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296))) (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (let ((.cse9 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)))) (or (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse13 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse4 .cse5 .cse6 .cse7 (let ((.cse12 (select .cse13 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (<= .cse12 (* 4294967296 (div .cse12 4294967296)))) .cse8 (let ((.cse14 (select .cse13 12))) (<= .cse14 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse14) 4294967296))))) .cse9 .cse10 .cse11)))) .cse15 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse16)) .cse4 .cse17 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse16) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse5 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse18 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse19 .cse20 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) .cse7 .cse21 .cse8 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse10 .cse22 (<= |~#s_can_fail_allocator_static~0.offset| 0) (let ((.cse26 (select (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse23 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse24 (let ((.cse30 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse29 (select .cse30 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= (* 4294967296 (div (let ((.cse28 (select .cse30 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* (div (+ (* .cse28 (- 1)) 4294967295 .cse29) 4294967296) 4294967296) .cse28)) 4294967296)) .cse29)))) (.cse25 (<= (* 4294967296 (div (+ .cse26 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse27 4294967296)) 4294967296)) .cse26))) (or (and .cse23 .cse0 .cse24 .cse1 .cse2 .cse3 .cse15 .cse4 .cse17 .cse5 .cse6 .cse18 .cse19 .cse20 .cse25 .cse7 .cse21 .cse10 .cse22 .cse11) (and .cse23 .cse0 .cse24 .cse1 .cse2 .cse4 .cse17 .cse5 .cse6 .cse18 .cse19 .cse20 .cse25 (<= .cse26 (* 4294967296 (div .cse26 4294967296))) .cse7 .cse21 .cse10 .cse22 .cse11)))) (<= (+ (* 4294967296 .cse27) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity))) [2021-07-05 16:56:22,134 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:56:22,134 INFO L758 garLoopResultBuilder]: At program point L8192(lines 8175 8193) the Hoare annotation is: (let ((.cse5 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (let ((.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse4 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse0 (and (<= (+ |ULTIMATE.start_aws_byte_buf_reserve_#res| 1) 0) .cse5))) (and (or .cse0 (and .cse1 .cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse5 (let ((.cse6 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse6 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse6 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) 4294967296)) 4294967295))))) (or (let ((.cse7 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and .cse1 .cse2 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse7)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse7) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse3 .cse4 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) .cse5 (<= |~#s_can_fail_allocator_static~0.offset| 0))) .cse0)))) [2021-07-05 16:56:22,134 INFO L765 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: true [2021-07-05 16:56:22,134 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable213 [2021-07-05 16:56:22,134 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 16:56:22,134 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION was SAFE (5/10) [2021-07-05 16:56:22,135 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 16:56:22,136 INFO L329 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 16:56:22,136 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 16:56:22,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 200 states have internal predecessors, (281), 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-07-05 16:56:22,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-07-05 16:56:22,137 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:56:22,137 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:56:22,137 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:56:22,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:56:22,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1840473936, now seen corresponding path program 1 times [2021-07-05 16:56:22,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:56:22,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681972205] [2021-07-05 16:56:22,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:56:22,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:56:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:56:22,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:22,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:22,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:22,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:56:22,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:56:22,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681972205] [2021-07-05 16:56:22,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681972205] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:56:22,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:56:22,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 16:56:22,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262591780] [2021-07-05 16:56:22,221 INFO L425 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-05 16:56:22,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:56:22,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-05 16:56:22,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-05 16:56:22,222 INFO L87 Difference]: Start difference. First operand has 201 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 200 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-07-05 16:56:22,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:56:22,224 INFO L93 Difference]: Finished difference Result 395 states and 553 transitions. [2021-07-05 16:56:22,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-05 16:56:22,224 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-07-05 16:56:22,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:56:22,224 INFO L225 Difference]: With dead ends: 395 [2021-07-05 16:56:22,224 INFO L226 Difference]: Without dead ends: 164 [2021-07-05 16:56:22,225 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-05 16:56:22,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-07-05 16:56:22,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2021-07-05 16:56:22,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.343558282208589) internal successors, (219), 163 states have internal predecessors, (219), 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-07-05 16:56:22,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 219 transitions. [2021-07-05 16:56:22,227 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 219 transitions. Word has length 26 [2021-07-05 16:56:22,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:56:22,227 INFO L442 AbstractCegarLoop]: Abstraction has 164 states and 219 transitions. [2021-07-05 16:56:22,227 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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-07-05 16:56:22,228 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 219 transitions. [2021-07-05 16:56:22,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-07-05 16:56:22,228 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:56:22,228 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:56:22,228 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable238 [2021-07-05 16:56:22,228 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:56:22,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:56:22,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1417772110, now seen corresponding path program 1 times [2021-07-05 16:56:22,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:56:22,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163060557] [2021-07-05 16:56:22,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:56:22,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:56:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:56:22,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:22,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:22,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:22,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:56:22,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:22,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-07-05 16:56:22,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:22,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:56:22,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:56:22,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163060557] [2021-07-05 16:56:22,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163060557] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:56:22,361 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:56:22,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:56:22,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342796904] [2021-07-05 16:56:22,361 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:56:22,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:56:22,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:56:22,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:56:22,362 INFO L87 Difference]: Start difference. First operand 164 states and 219 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-07-05 16:56:22,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:56:22,421 INFO L93 Difference]: Finished difference Result 305 states and 407 transitions. [2021-07-05 16:56:22,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:56:22,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-07-05 16:56:22,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:56:22,422 INFO L225 Difference]: With dead ends: 305 [2021-07-05 16:56:22,422 INFO L226 Difference]: Without dead ends: 164 [2021-07-05 16:56:22,422 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:56:22,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-07-05 16:56:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2021-07-05 16:56:22,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.3312883435582823) internal successors, (217), 163 states have internal predecessors, (217), 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-07-05 16:56:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 217 transitions. [2021-07-05 16:56:22,424 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 217 transitions. Word has length 26 [2021-07-05 16:56:22,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:56:22,425 INFO L442 AbstractCegarLoop]: Abstraction has 164 states and 217 transitions. [2021-07-05 16:56:22,425 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-07-05 16:56:22,425 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 217 transitions. [2021-07-05 16:56:22,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-07-05 16:56:22,425 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:56:22,425 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:56:22,426 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable239 [2021-07-05 16:56:22,426 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:56:22,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:56:22,426 INFO L82 PathProgramCache]: Analyzing trace with hash -65548262, now seen corresponding path program 1 times [2021-07-05 16:56:22,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:56:22,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251975386] [2021-07-05 16:56:22,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:56:22,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:56:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:56:22,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:22,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:22,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:22,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:56:22,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:22,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:56:22,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:22,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:22,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:56:22,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:56:22,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251975386] [2021-07-05 16:56:22,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251975386] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:56:22,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:56:22,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:56:22,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766465220] [2021-07-05 16:56:22,537 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:56:22,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:56:22,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:56:22,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:56:22,538 INFO L87 Difference]: Start difference. First operand 164 states and 217 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:56:22,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:56:22,708 INFO L93 Difference]: Finished difference Result 446 states and 603 transitions. [2021-07-05 16:56:22,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:56:22,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-07-05 16:56:22,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:56:22,709 INFO L225 Difference]: With dead ends: 446 [2021-07-05 16:56:22,709 INFO L226 Difference]: Without dead ends: 296 [2021-07-05 16:56:22,709 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:56:22,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-07-05 16:56:22,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 176. [2021-07-05 16:56:22,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.3085714285714285) internal successors, (229), 175 states have internal predecessors, (229), 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-07-05 16:56:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 229 transitions. [2021-07-05 16:56:22,711 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 229 transitions. Word has length 38 [2021-07-05 16:56:22,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:56:22,711 INFO L442 AbstractCegarLoop]: Abstraction has 176 states and 229 transitions. [2021-07-05 16:56:22,711 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:56:22,711 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 229 transitions. [2021-07-05 16:56:22,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-07-05 16:56:22,712 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:56:22,712 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:56:22,712 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240 [2021-07-05 16:56:22,712 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:56:22,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:56:22,712 INFO L82 PathProgramCache]: Analyzing trace with hash -3508648, now seen corresponding path program 1 times [2021-07-05 16:56:22,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:56:22,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280680092] [2021-07-05 16:56:22,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:56:22,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:56:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:56:22,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:22,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:22,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:22,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:56:22,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:22,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:56:22,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:22,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:56:22,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:56:22,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280680092] [2021-07-05 16:56:22,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280680092] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:56:22,805 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:56:22,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:56:22,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876228263] [2021-07-05 16:56:22,805 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:56:22,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:56:22,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:56:22,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:56:22,806 INFO L87 Difference]: Start difference. First operand 176 states and 229 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:56:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:56:22,954 INFO L93 Difference]: Finished difference Result 388 states and 511 transitions. [2021-07-05 16:56:22,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:56:22,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-07-05 16:56:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:56:22,955 INFO L225 Difference]: With dead ends: 388 [2021-07-05 16:56:22,955 INFO L226 Difference]: Without dead ends: 236 [2021-07-05 16:56:22,955 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:56:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-07-05 16:56:22,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 188. [2021-07-05 16:56:22,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.2887700534759359) internal successors, (241), 187 states have internal predecessors, (241), 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-07-05 16:56:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 241 transitions. [2021-07-05 16:56:22,957 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 241 transitions. Word has length 38 [2021-07-05 16:56:22,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:56:22,957 INFO L442 AbstractCegarLoop]: Abstraction has 188 states and 241 transitions. [2021-07-05 16:56:22,957 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:56:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 241 transitions. [2021-07-05 16:56:22,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-07-05 16:56:22,958 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:56:22,958 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:56:22,958 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241 [2021-07-05 16:56:22,958 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:56:22,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:56:22,958 INFO L82 PathProgramCache]: Analyzing trace with hash 443924828, now seen corresponding path program 1 times [2021-07-05 16:56:22,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:56:22,958 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680834792] [2021-07-05 16:56:22,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:56:22,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:56:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:56:23,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:23,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:23,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:23,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:23,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:23,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:23,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:23,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:56:23,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:23,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:56:23,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:23,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:56:23,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:56:23,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680834792] [2021-07-05 16:56:23,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680834792] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:56:23,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:56:23,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-05 16:56:23,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907448935] [2021-07-05 16:56:23,127 INFO L425 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-05 16:56:23,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:56:23,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-05 16:56:23,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:56:23,127 INFO L87 Difference]: Start difference. First operand 188 states and 241 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:56:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:56:23,384 INFO L93 Difference]: Finished difference Result 295 states and 367 transitions. [2021-07-05 16:56:23,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-05 16:56:23,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-07-05 16:56:23,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:56:23,385 INFO L225 Difference]: With dead ends: 295 [2021-07-05 16:56:23,385 INFO L226 Difference]: Without dead ends: 286 [2021-07-05 16:56:23,385 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 86.1ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:56:23,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-07-05 16:56:23,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 186. [2021-07-05 16:56:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.2864864864864864) internal successors, (238), 185 states have internal predecessors, (238), 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-07-05 16:56:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 238 transitions. [2021-07-05 16:56:23,387 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 238 transitions. Word has length 38 [2021-07-05 16:56:23,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:56:23,387 INFO L442 AbstractCegarLoop]: Abstraction has 186 states and 238 transitions. [2021-07-05 16:56:23,387 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:56:23,387 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 238 transitions. [2021-07-05 16:56:23,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-07-05 16:56:23,387 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:56:23,387 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:56:23,387 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242 [2021-07-05 16:56:23,387 INFO L374 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:56:23,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:56:23,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1894660332, now seen corresponding path program 1 times [2021-07-05 16:56:23,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:56:23,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397095933] [2021-07-05 16:56:23,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:56:23,388 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:56:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:56:23,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:23,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:23,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:23,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-05 16:56:23,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:23,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:56:23,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:23,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:56:23,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:23,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:23,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:56:23,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:56:23,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397095933] [2021-07-05 16:56:23,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397095933] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:56:23,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:56:23,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:56:23,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054775630] [2021-07-05 16:56:23,534 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:56:23,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:56:23,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:56:23,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:56:23,534 INFO L87 Difference]: Start difference. First operand 186 states and 238 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-07-05 16:56:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:56:26,050 INFO L93 Difference]: Finished difference Result 537 states and 678 transitions. [2021-07-05 16:56:26,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:56:26,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-07-05 16:56:26,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:56:26,051 INFO L225 Difference]: With dead ends: 537 [2021-07-05 16:56:26,051 INFO L226 Difference]: Without dead ends: 372 [2021-07-05 16:56:26,052 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 47.0ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:56:26,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-07-05 16:56:26,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 204. [2021-07-05 16:56:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.2610837438423645) internal successors, (256), 203 states have internal predecessors, (256), 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-07-05 16:56:26,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 256 transitions. [2021-07-05 16:56:26,054 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 256 transitions. Word has length 42 [2021-07-05 16:56:26,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:56:26,054 INFO L442 AbstractCegarLoop]: Abstraction has 204 states and 256 transitions. [2021-07-05 16:56:26,055 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-07-05 16:56:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 256 transitions. [2021-07-05 16:56:26,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-07-05 16:56:26,055 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:56:26,055 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:56:26,055 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable243 [2021-07-05 16:56:26,055 INFO L374 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:56:26,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:56:26,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1214601962, now seen corresponding path program 1 times [2021-07-05 16:56:26,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:56:26,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714857128] [2021-07-05 16:56:26,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:56:26,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:56:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:56:27,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:27,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:27,679 INFO L142 QuantifierPusher]: treesize reduction 17, result has 37.0 percent of original size [2021-07-05 16:56:27,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:56:27,688 INFO L142 QuantifierPusher]: treesize reduction 17, result has 45.2 percent of original size [2021-07-05 16:56:27,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:56:27,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:27,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:56:27,708 INFO L142 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-07-05 16:56:27,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:56:27,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:27,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:56:27,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:27,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:56:27,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:27,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:27,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:56:27,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:56:27,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714857128] [2021-07-05 16:56:27,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714857128] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:56:27,738 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:56:27,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:56:27,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588724007] [2021-07-05 16:56:27,739 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 16:56:27,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:56:27,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 16:56:27,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:56:27,739 INFO L87 Difference]: Start difference. First operand 204 states and 256 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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-07-05 16:56:32,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:56:32,456 INFO L93 Difference]: Finished difference Result 502 states and 626 transitions. [2021-07-05 16:56:32,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-05 16:56:32,457 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-07-05 16:56:32,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:56:32,457 INFO L225 Difference]: With dead ends: 502 [2021-07-05 16:56:32,457 INFO L226 Difference]: Without dead ends: 327 [2021-07-05 16:56:32,458 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 247.3ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-07-05 16:56:32,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-07-05 16:56:32,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 202. [2021-07-05 16:56:32,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.2587064676616915) internal successors, (253), 201 states have internal predecessors, (253), 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-07-05 16:56:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 253 transitions. [2021-07-05 16:56:32,461 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 253 transitions. Word has length 42 [2021-07-05 16:56:32,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:56:32,461 INFO L442 AbstractCegarLoop]: Abstraction has 202 states and 253 transitions. [2021-07-05 16:56:32,461 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 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-07-05 16:56:32,461 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 253 transitions. [2021-07-05 16:56:32,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-07-05 16:56:32,461 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:56:32,461 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:56:32,461 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable244 [2021-07-05 16:56:32,461 INFO L374 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:56:32,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:56:32,462 INFO L82 PathProgramCache]: Analyzing trace with hash 362256074, now seen corresponding path program 1 times [2021-07-05 16:56:32,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:56:32,462 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121255832] [2021-07-05 16:56:32,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:56:32,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:56:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:56:32,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:32,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:32,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:32,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:56:32,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:32,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:56:32,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:32,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:56:32,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:32,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:56:32,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:32,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-07-05 16:56:32,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:32,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:32,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:56:32,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:56:32,641 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121255832] [2021-07-05 16:56:32,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121255832] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:56:32,641 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:56:32,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:56:32,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145399342] [2021-07-05 16:56:32,641 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:56:32,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:56:32,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:56:32,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:56:32,642 INFO L87 Difference]: Start difference. First operand 202 states and 253 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-07-05 16:56:32,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:56:32,918 INFO L93 Difference]: Finished difference Result 458 states and 565 transitions. [2021-07-05 16:56:32,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 16:56:32,919 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-07-05 16:56:32,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:56:32,919 INFO L225 Difference]: With dead ends: 458 [2021-07-05 16:56:32,919 INFO L226 Difference]: Without dead ends: 282 [2021-07-05 16:56:32,920 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 72.8ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:56:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-07-05 16:56:32,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 202. [2021-07-05 16:56:32,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.2537313432835822) internal successors, (252), 201 states have internal predecessors, (252), 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-07-05 16:56:32,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 252 transitions. [2021-07-05 16:56:32,923 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 252 transitions. Word has length 46 [2021-07-05 16:56:32,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:56:32,923 INFO L442 AbstractCegarLoop]: Abstraction has 202 states and 252 transitions. [2021-07-05 16:56:32,923 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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-07-05 16:56:32,923 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 252 transitions. [2021-07-05 16:56:32,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-07-05 16:56:32,923 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:56:32,923 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:56:32,923 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable245 [2021-07-05 16:56:32,923 INFO L374 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:56:32,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:56:32,924 INFO L82 PathProgramCache]: Analyzing trace with hash 50966821, now seen corresponding path program 1 times [2021-07-05 16:56:32,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:56:32,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039583724] [2021-07-05 16:56:32,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:56:32,924 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:56:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:56:35,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:35,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:35,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:35,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:56:35,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:35,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:56:35,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:35,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-07-05 16:56:35,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:35,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-07-05 16:56:35,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:35,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-05 16:56:35,214 INFO L142 QuantifierPusher]: treesize reduction 5, result has 84.4 percent of original size [2021-07-05 16:56:35,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-07-05 16:56:35,230 INFO L142 QuantifierPusher]: treesize reduction 5, result has 54.5 percent of original size [2021-07-05 16:56:35,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-07-05 16:56:35,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:35,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:56:35,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:56:35,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039583724] [2021-07-05 16:56:35,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039583724] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:56:35,242 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:56:35,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-05 16:56:35,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982589998] [2021-07-05 16:56:35,242 INFO L425 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-05 16:56:35,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:56:35,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-05 16:56:35,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-07-05 16:56:35,243 INFO L87 Difference]: Start difference. First operand 202 states and 252 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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-07-05 16:56:37,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:56:37,774 INFO L93 Difference]: Finished difference Result 382 states and 473 transitions. [2021-07-05 16:56:37,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 16:56:37,774 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-07-05 16:56:37,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:56:37,775 INFO L225 Difference]: With dead ends: 382 [2021-07-05 16:56:37,775 INFO L226 Difference]: Without dead ends: 366 [2021-07-05 16:56:37,775 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 130.9ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:56:37,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-07-05 16:56:37,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 331. [2021-07-05 16:56:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.2575757575757576) internal successors, (415), 330 states have internal predecessors, (415), 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-07-05 16:56:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 415 transitions. [2021-07-05 16:56:37,780 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 415 transitions. Word has length 48 [2021-07-05 16:56:37,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:56:37,781 INFO L442 AbstractCegarLoop]: Abstraction has 331 states and 415 transitions. [2021-07-05 16:56:37,781 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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-07-05 16:56:37,781 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 415 transitions. [2021-07-05 16:56:37,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-07-05 16:56:37,782 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:56:37,782 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:56:37,782 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable246 [2021-07-05 16:56:37,782 INFO L374 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:56:37,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:56:37,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1382043361, now seen corresponding path program 1 times [2021-07-05 16:56:37,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:56:37,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266861216] [2021-07-05 16:56:37,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:56:37,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:56:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:56:37,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:37,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:37,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:37,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:56:37,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:37,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-07-05 16:56:38,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:38,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:56:38,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:38,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:56:38,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:38,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:56:38,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:38,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-07-05 16:56:38,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:38,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-07-05 16:56:38,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:38,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-07-05 16:56:38,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:38,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:38,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:38,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:38,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:38,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:56:38,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:56:38,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266861216] [2021-07-05 16:56:38,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266861216] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:56:38,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:56:38,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-05 16:56:38,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334962254] [2021-07-05 16:56:38,117 INFO L425 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-05 16:56:38,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:56:38,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-05 16:56:38,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-07-05 16:56:38,118 INFO L87 Difference]: Start difference. First operand 331 states and 415 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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-07-05 16:56:42,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:56:42,927 INFO L93 Difference]: Finished difference Result 660 states and 820 transitions. [2021-07-05 16:56:42,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-05 16:56:42,928 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-07-05 16:56:42,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:56:42,929 INFO L225 Difference]: With dead ends: 660 [2021-07-05 16:56:42,929 INFO L226 Difference]: Without dead ends: 653 [2021-07-05 16:56:42,930 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 237.1ms TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2021-07-05 16:56:42,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2021-07-05 16:56:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 590. [2021-07-05 16:56:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 589 states have (on average 1.259762308998302) internal successors, (742), 589 states have internal predecessors, (742), 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-07-05 16:56:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 742 transitions. [2021-07-05 16:56:42,941 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 742 transitions. Word has length 48 [2021-07-05 16:56:42,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:56:42,942 INFO L442 AbstractCegarLoop]: Abstraction has 590 states and 742 transitions. [2021-07-05 16:56:42,942 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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-07-05 16:56:42,942 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 742 transitions. [2021-07-05 16:56:42,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-07-05 16:56:42,943 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:56:42,943 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:56:42,943 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable247 [2021-07-05 16:56:42,943 INFO L374 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:56:42,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:56:42,943 INFO L82 PathProgramCache]: Analyzing trace with hash -701984991, now seen corresponding path program 1 times [2021-07-05 16:56:42,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:56:42,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704506] [2021-07-05 16:56:42,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:56:42,944 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:56:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:56:43,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:43,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:43,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:43,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-07-05 16:56:43,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:43,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-05 16:56:43,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:43,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:43,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:43,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:56:43,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:56:43,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704506] [2021-07-05 16:56:43,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704506] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:56:43,097 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:56:43,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:56:43,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066518675] [2021-07-05 16:56:43,097 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:56:43,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:56:43,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:56:43,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:56:43,098 INFO L87 Difference]: Start difference. First operand 590 states and 742 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-07-05 16:56:45,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:56:45,547 INFO L93 Difference]: Finished difference Result 1404 states and 1763 transitions. [2021-07-05 16:56:45,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:56:45,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-07-05 16:56:45,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:56:45,549 INFO L225 Difference]: With dead ends: 1404 [2021-07-05 16:56:45,549 INFO L226 Difference]: Without dead ends: 893 [2021-07-05 16:56:45,550 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 34.2ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:56:45,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2021-07-05 16:56:45,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 590. [2021-07-05 16:56:45,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 589 states have (on average 1.232597623089983) internal successors, (726), 589 states have internal predecessors, (726), 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-07-05 16:56:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 726 transitions. [2021-07-05 16:56:45,564 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 726 transitions. Word has length 48 [2021-07-05 16:56:45,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:56:45,564 INFO L442 AbstractCegarLoop]: Abstraction has 590 states and 726 transitions. [2021-07-05 16:56:45,564 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-07-05 16:56:45,564 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 726 transitions. [2021-07-05 16:56:45,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-07-05 16:56:45,564 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:56:45,564 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:56:45,564 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable248 [2021-07-05 16:56:45,565 INFO L374 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:56:45,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:56:45,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1359411107, now seen corresponding path program 1 times [2021-07-05 16:56:45,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:56:45,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710318346] [2021-07-05 16:56:45,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:56:45,565 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:56:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:56:48,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:48,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:48,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:48,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:56:48,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:48,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:56:48,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:48,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-05 16:56:48,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:48,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 111 [2021-07-05 16:56:48,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:48,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 111 [2021-07-05 16:56:48,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:48,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-07-05 16:56:48,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:48,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-07-05 16:56:48,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:48,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-07-05 16:56:48,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:48,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-07-05 16:56:48,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:48,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:48,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:48,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:48,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:48,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:56:48,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:56:48,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710318346] [2021-07-05 16:56:48,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710318346] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:56:48,513 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:56:48,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-05 16:56:48,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632102176] [2021-07-05 16:56:48,514 INFO L425 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-05 16:56:48,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:56:48,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-05 16:56:48,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-07-05 16:56:48,514 INFO L87 Difference]: Start difference. First operand 590 states and 726 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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-07-05 16:56:51,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:56:51,388 INFO L93 Difference]: Finished difference Result 702 states and 854 transitions. [2021-07-05 16:56:51,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-05 16:56:51,389 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-07-05 16:56:51,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:56:51,390 INFO L225 Difference]: With dead ends: 702 [2021-07-05 16:56:51,390 INFO L226 Difference]: Without dead ends: 695 [2021-07-05 16:56:51,390 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 421.8ms TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2021-07-05 16:56:51,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2021-07-05 16:56:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 381. [2021-07-05 16:56:51,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 1.2263157894736842) internal successors, (466), 380 states have internal predecessors, (466), 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-07-05 16:56:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 466 transitions. [2021-07-05 16:56:51,398 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 466 transitions. Word has length 48 [2021-07-05 16:56:51,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:56:51,398 INFO L442 AbstractCegarLoop]: Abstraction has 381 states and 466 transitions. [2021-07-05 16:56:51,398 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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-07-05 16:56:51,398 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 466 transitions. [2021-07-05 16:56:51,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-07-05 16:56:51,399 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:56:51,399 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:56:51,399 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable249 [2021-07-05 16:56:51,399 INFO L374 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:56:51,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:56:51,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1402306347, now seen corresponding path program 1 times [2021-07-05 16:56:51,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:56:51,399 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896539608] [2021-07-05 16:56:51,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:56:51,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:56:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:56:51,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:51,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:51,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:51,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:56:51,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:51,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:56:51,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:51,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:56:51,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:56:51,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896539608] [2021-07-05 16:56:51,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896539608] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:56:51,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:56:51,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:56:51,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065539337] [2021-07-05 16:56:51,497 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:56:51,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:56:51,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:56:51,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:56:51,498 INFO L87 Difference]: Start difference. First operand 381 states and 466 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-07-05 16:56:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:56:51,641 INFO L93 Difference]: Finished difference Result 627 states and 761 transitions. [2021-07-05 16:56:51,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:56:51,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-07-05 16:56:51,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:56:51,642 INFO L225 Difference]: With dead ends: 627 [2021-07-05 16:56:51,642 INFO L226 Difference]: Without dead ends: 295 [2021-07-05 16:56:51,642 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:56:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-07-05 16:56:51,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 259. [2021-07-05 16:56:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 1.2015503875968991) internal successors, (310), 258 states have internal predecessors, (310), 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-07-05 16:56:51,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 310 transitions. [2021-07-05 16:56:51,648 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 310 transitions. Word has length 48 [2021-07-05 16:56:51,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:56:51,648 INFO L442 AbstractCegarLoop]: Abstraction has 259 states and 310 transitions. [2021-07-05 16:56:51,648 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-07-05 16:56:51,648 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 310 transitions. [2021-07-05 16:56:51,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-07-05 16:56:51,648 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:56:51,648 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:56:51,649 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250 [2021-07-05 16:56:51,649 INFO L374 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:56:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:56:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash 118326138, now seen corresponding path program 1 times [2021-07-05 16:56:51,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:56:51,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924214499] [2021-07-05 16:56:51,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:56:51,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:56:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:56:51,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:51,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:51,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:51,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:51,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:51,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:51,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:51,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:51,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:51,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:51,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:51,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:56:51,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:51,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:56:51,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:51,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:56:51,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:56:51,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924214499] [2021-07-05 16:56:51,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924214499] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:56:51,846 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:56:51,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:56:51,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939318994] [2021-07-05 16:56:51,847 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 16:56:51,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:56:51,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 16:56:51,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:56:51,847 INFO L87 Difference]: Start difference. First operand 259 states and 310 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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-07-05 16:56:52,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:56:52,385 INFO L93 Difference]: Finished difference Result 427 states and 498 transitions. [2021-07-05 16:56:52,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-05 16:56:52,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-07-05 16:56:52,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:56:52,386 INFO L225 Difference]: With dead ends: 427 [2021-07-05 16:56:52,386 INFO L226 Difference]: Without dead ends: 414 [2021-07-05 16:56:52,386 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 172.2ms TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-07-05 16:56:52,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-07-05 16:56:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 259. [2021-07-05 16:56:52,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 1.197674418604651) internal successors, (309), 258 states have internal predecessors, (309), 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-07-05 16:56:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 309 transitions. [2021-07-05 16:56:52,394 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 309 transitions. Word has length 50 [2021-07-05 16:56:52,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:56:52,394 INFO L442 AbstractCegarLoop]: Abstraction has 259 states and 309 transitions. [2021-07-05 16:56:52,395 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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-07-05 16:56:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 309 transitions. [2021-07-05 16:56:52,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-07-05 16:56:52,395 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:56:52,395 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:56:52,395 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable251 [2021-07-05 16:56:52,395 INFO L374 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:56:52,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:56:52,396 INFO L82 PathProgramCache]: Analyzing trace with hash -691020488, now seen corresponding path program 1 times [2021-07-05 16:56:52,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:56:52,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265744366] [2021-07-05 16:56:52,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:56:52,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:56:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:56:52,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:52,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:52,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:52,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:56:52,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:52,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:56:52,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:52,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-07-05 16:56:52,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:52,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:56:52,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:52,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:56:52,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:52,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-07-05 16:56:52,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:52,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:56:52,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:52,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:56:52,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:52,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:52,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:56:52,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:56:52,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:56:52,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:56:52,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265744366] [2021-07-05 16:56:52,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265744366] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:56:52,707 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:56:52,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-05 16:56:52,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397660626] [2021-07-05 16:56:52,707 INFO L425 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-05 16:56:52,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:56:52,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-05 16:56:52,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:56:52,708 INFO L87 Difference]: Start difference. First operand 259 states and 309 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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-07-05 16:57:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:57:01,993 INFO L93 Difference]: Finished difference Result 517 states and 599 transitions. [2021-07-05 16:57:01,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-07-05 16:57:01,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-07-05 16:57:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:57:01,994 INFO L225 Difference]: With dead ends: 517 [2021-07-05 16:57:01,994 INFO L226 Difference]: Without dead ends: 405 [2021-07-05 16:57:01,994 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 390.8ms TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2021-07-05 16:57:01,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-07-05 16:57:02,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 324. [2021-07-05 16:57:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.1981424148606812) internal successors, (387), 323 states have internal predecessors, (387), 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-07-05 16:57:02,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 387 transitions. [2021-07-05 16:57:02,001 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 387 transitions. Word has length 50 [2021-07-05 16:57:02,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:57:02,001 INFO L442 AbstractCegarLoop]: Abstraction has 324 states and 387 transitions. [2021-07-05 16:57:02,001 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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-07-05 16:57:02,001 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 387 transitions. [2021-07-05 16:57:02,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-07-05 16:57:02,001 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:57:02,001 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:57:02,002 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable252 [2021-07-05 16:57:02,002 INFO L374 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:57:02,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:57:02,002 INFO L82 PathProgramCache]: Analyzing trace with hash -416260874, now seen corresponding path program 1 times [2021-07-05 16:57:02,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:57:02,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347338063] [2021-07-05 16:57:02,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:57:02,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:57:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:57:04,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:04,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:04,293 INFO L142 QuantifierPusher]: treesize reduction 15, result has 40.0 percent of original size [2021-07-05 16:57:04,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:57:04,303 INFO L142 QuantifierPusher]: treesize reduction 15, result has 48.3 percent of original size [2021-07-05 16:57:04,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:57:04,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:04,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:57:04,327 INFO L142 QuantifierPusher]: treesize reduction 14, result has 41.7 percent of original size [2021-07-05 16:57:04,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:57:04,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:04,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:04,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:04,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:04,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:04,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:04,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:04,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:04,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:04,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:57:04,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:04,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:57:04,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:04,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:57:04,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:57:04,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347338063] [2021-07-05 16:57:04,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347338063] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:57:04,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:57:04,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-05 16:57:04,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26751312] [2021-07-05 16:57:04,429 INFO L425 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-05 16:57:04,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:57:04,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-05 16:57:04,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-07-05 16:57:04,429 INFO L87 Difference]: Start difference. First operand 324 states and 387 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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-07-05 16:57:10,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:57:10,126 INFO L93 Difference]: Finished difference Result 527 states and 616 transitions. [2021-07-05 16:57:10,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-07-05 16:57:10,126 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-07-05 16:57:10,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:57:10,127 INFO L225 Difference]: With dead ends: 527 [2021-07-05 16:57:10,127 INFO L226 Difference]: Without dead ends: 388 [2021-07-05 16:57:10,127 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 797.8ms TimeCoverageRelationStatistics Valid=401, Invalid=1321, Unknown=0, NotChecked=0, Total=1722 [2021-07-05 16:57:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-07-05 16:57:10,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 185. [2021-07-05 16:57:10,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.184782608695652) internal successors, (218), 184 states have internal predecessors, (218), 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-07-05 16:57:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 218 transitions. [2021-07-05 16:57:10,131 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 218 transitions. Word has length 50 [2021-07-05 16:57:10,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:57:10,132 INFO L442 AbstractCegarLoop]: Abstraction has 185 states and 218 transitions. [2021-07-05 16:57:10,132 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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-07-05 16:57:10,132 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 218 transitions. [2021-07-05 16:57:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-07-05 16:57:10,132 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:57:10,132 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:57:10,132 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253 [2021-07-05 16:57:10,133 INFO L374 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:57:10,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:57:10,133 INFO L82 PathProgramCache]: Analyzing trace with hash 719680038, now seen corresponding path program 1 times [2021-07-05 16:57:10,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:57:10,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046514964] [2021-07-05 16:57:10,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:57:10,134 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:57:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:57:10,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:10,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:57:10,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:57:10,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:57:10,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:57:10,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:10,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:57:10,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:57:10,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046514964] [2021-07-05 16:57:10,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046514964] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:57:10,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:57:10,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:57:10,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528309415] [2021-07-05 16:57:10,265 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:57:10,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:57:10,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:57:10,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:57:10,265 INFO L87 Difference]: Start difference. First operand 185 states and 218 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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-07-05 16:57:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:57:10,363 INFO L93 Difference]: Finished difference Result 317 states and 375 transitions. [2021-07-05 16:57:10,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:57:10,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-07-05 16:57:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:57:10,364 INFO L225 Difference]: With dead ends: 317 [2021-07-05 16:57:10,364 INFO L226 Difference]: Without dead ends: 185 [2021-07-05 16:57:10,364 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 64.2ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-07-05 16:57:10,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-07-05 16:57:10,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-07-05 16:57:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.1684782608695652) internal successors, (215), 184 states have internal predecessors, (215), 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-07-05 16:57:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 215 transitions. [2021-07-05 16:57:10,368 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 215 transitions. Word has length 77 [2021-07-05 16:57:10,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:57:10,368 INFO L442 AbstractCegarLoop]: Abstraction has 185 states and 215 transitions. [2021-07-05 16:57:10,368 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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-07-05 16:57:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 215 transitions. [2021-07-05 16:57:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-07-05 16:57:10,368 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:57:10,368 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:57:10,368 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable254 [2021-07-05 16:57:10,369 INFO L374 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:57:10,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:57:10,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1937031568, now seen corresponding path program 1 times [2021-07-05 16:57:10,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:57:10,369 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155126322] [2021-07-05 16:57:10,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:57:10,369 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:57:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:57:10,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:10,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:57:10,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:57:10,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:10,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:57:10,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:57:10,486 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155126322] [2021-07-05 16:57:10,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155126322] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:57:10,486 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:57:10,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:57:10,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579415288] [2021-07-05 16:57:10,486 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:57:10,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:57:10,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:57:10,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:57:10,487 INFO L87 Difference]: Start difference. First operand 185 states and 215 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-07-05 16:57:10,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:57:10,512 INFO L93 Difference]: Finished difference Result 245 states and 280 transitions. [2021-07-05 16:57:10,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:57:10,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-07-05 16:57:10,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:57:10,513 INFO L225 Difference]: With dead ends: 245 [2021-07-05 16:57:10,513 INFO L226 Difference]: Without dead ends: 219 [2021-07-05 16:57:10,513 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:57:10,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-07-05 16:57:10,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 187. [2021-07-05 16:57:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.1666666666666667) internal successors, (217), 186 states have internal predecessors, (217), 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-07-05 16:57:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 217 transitions. [2021-07-05 16:57:10,520 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 217 transitions. Word has length 89 [2021-07-05 16:57:10,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:57:10,520 INFO L442 AbstractCegarLoop]: Abstraction has 187 states and 217 transitions. [2021-07-05 16:57:10,520 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-07-05 16:57:10,520 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 217 transitions. [2021-07-05 16:57:10,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-07-05 16:57:10,521 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:57:10,521 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:57:10,521 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable255 [2021-07-05 16:57:10,521 INFO L374 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:57:10,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:57:10,522 INFO L82 PathProgramCache]: Analyzing trace with hash 746700784, now seen corresponding path program 1 times [2021-07-05 16:57:10,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:57:10,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593679149] [2021-07-05 16:57:10,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:57:10,522 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:57:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:57:10,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:10,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:57:10,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:57:10,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:57:10,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:57:10,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593679149] [2021-07-05 16:57:10,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593679149] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:57:10,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:57:10,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:57:10,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848361435] [2021-07-05 16:57:10,632 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:57:10,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:57:10,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:57:10,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:57:10,633 INFO L87 Difference]: Start difference. First operand 187 states and 217 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-07-05 16:57:10,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:57:10,657 INFO L93 Difference]: Finished difference Result 309 states and 355 transitions. [2021-07-05 16:57:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:57:10,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-07-05 16:57:10,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:57:10,658 INFO L225 Difference]: With dead ends: 309 [2021-07-05 16:57:10,658 INFO L226 Difference]: Without dead ends: 249 [2021-07-05 16:57:10,658 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:57:10,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-07-05 16:57:10,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 187. [2021-07-05 16:57:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.1666666666666667) internal successors, (217), 186 states have internal predecessors, (217), 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-07-05 16:57:10,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 217 transitions. [2021-07-05 16:57:10,662 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 217 transitions. Word has length 89 [2021-07-05 16:57:10,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:57:10,663 INFO L442 AbstractCegarLoop]: Abstraction has 187 states and 217 transitions. [2021-07-05 16:57:10,663 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-07-05 16:57:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 217 transitions. [2021-07-05 16:57:10,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-07-05 16:57:10,663 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:57:10,663 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:57:10,663 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable256 [2021-07-05 16:57:10,663 INFO L374 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:57:10,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:57:10,663 INFO L82 PathProgramCache]: Analyzing trace with hash -992000770, now seen corresponding path program 1 times [2021-07-05 16:57:10,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:57:10,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484733314] [2021-07-05 16:57:10,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:57:10,664 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:57:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:57:10,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:10,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:57:10,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:57:10,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:57:10,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:57:10,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:10,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:10,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:57:10,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:57:10,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484733314] [2021-07-05 16:57:10,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484733314] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:57:10,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:57:10,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-05 16:57:10,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783871214] [2021-07-05 16:57:10,783 INFO L425 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-05 16:57:10,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:57:10,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-05 16:57:10,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:57:10,784 INFO L87 Difference]: Start difference. First operand 187 states and 217 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:57:10,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:57:10,835 INFO L93 Difference]: Finished difference Result 316 states and 361 transitions. [2021-07-05 16:57:10,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:57:10,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-07-05 16:57:10,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:57:10,836 INFO L225 Difference]: With dead ends: 316 [2021-07-05 16:57:10,836 INFO L226 Difference]: Without dead ends: 220 [2021-07-05 16:57:10,836 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 42.3ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-07-05 16:57:10,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-07-05 16:57:10,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 154. [2021-07-05 16:57:10,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.1503267973856208) internal successors, (176), 153 states have internal predecessors, (176), 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-07-05 16:57:10,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2021-07-05 16:57:10,840 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 94 [2021-07-05 16:57:10,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:57:10,840 INFO L442 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2021-07-05 16:57:10,840 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:57:10,840 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2021-07-05 16:57:10,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-07-05 16:57:10,840 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:57:10,841 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:57:10,841 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable257 [2021-07-05 16:57:10,841 INFO L374 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:57:10,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:57:10,841 INFO L82 PathProgramCache]: Analyzing trace with hash -509574626, now seen corresponding path program 1 times [2021-07-05 16:57:10,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:57:10,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561126861] [2021-07-05 16:57:10,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:57:10,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:57:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:57:11,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:11,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:11,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:11,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-07-05 16:57:11,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:11,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:57:11,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:57:11,118 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561126861] [2021-07-05 16:57:11,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561126861] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:57:11,118 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:57:11,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 16:57:11,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023128394] [2021-07-05 16:57:11,118 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 16:57:11,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:57:11,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 16:57:11,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 16:57:11,119 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:57:11,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:57:11,134 INFO L93 Difference]: Finished difference Result 216 states and 245 transitions. [2021-07-05 16:57:11,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 16:57:11,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-07-05 16:57:11,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:57:11,135 INFO L225 Difference]: With dead ends: 216 [2021-07-05 16:57:11,136 INFO L226 Difference]: Without dead ends: 148 [2021-07-05 16:57:11,136 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 16:57:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-07-05 16:57:11,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2021-07-05 16:57:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.1428571428571428) internal successors, (168), 147 states have internal predecessors, (168), 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-07-05 16:57:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2021-07-05 16:57:11,142 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 95 [2021-07-05 16:57:11,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:57:11,142 INFO L442 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2021-07-05 16:57:11,142 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:57:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2021-07-05 16:57:11,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-07-05 16:57:11,143 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:57:11,143 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:57:11,143 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable258 [2021-07-05 16:57:11,143 INFO L374 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:57:11,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:57:11,144 INFO L82 PathProgramCache]: Analyzing trace with hash -298546812, now seen corresponding path program 1 times [2021-07-05 16:57:11,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:57:11,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121784234] [2021-07-05 16:57:11,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:57:11,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:57:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:57:11,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:11,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:11,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:11,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:57:11,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:11,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:57:11,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:11,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:57:11,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:11,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:57:11,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:57:11,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121784234] [2021-07-05 16:57:11,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121784234] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:57:11,279 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:57:11,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:57:11,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254984177] [2021-07-05 16:57:11,279 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:57:11,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:57:11,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:57:11,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:57:11,280 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-07-05 16:57:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:57:11,330 INFO L93 Difference]: Finished difference Result 338 states and 380 transitions. [2021-07-05 16:57:11,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:57:11,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-07-05 16:57:11,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:57:11,331 INFO L225 Difference]: With dead ends: 338 [2021-07-05 16:57:11,331 INFO L226 Difference]: Without dead ends: 276 [2021-07-05 16:57:11,331 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:57:11,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-07-05 16:57:11,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 150. [2021-07-05 16:57:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.1409395973154361) internal successors, (170), 149 states have internal predecessors, (170), 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-07-05 16:57:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2021-07-05 16:57:11,335 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 96 [2021-07-05 16:57:11,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:57:11,335 INFO L442 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2021-07-05 16:57:11,335 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 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-07-05 16:57:11,335 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2021-07-05 16:57:11,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-07-05 16:57:11,336 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:57:11,336 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:57:11,336 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable259 [2021-07-05 16:57:11,336 INFO L374 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:57:11,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:57:11,336 INFO L82 PathProgramCache]: Analyzing trace with hash 454881982, now seen corresponding path program 1 times [2021-07-05 16:57:11,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:57:11,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346758933] [2021-07-05 16:57:11,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:57:11,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:57:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:57:11,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:11,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:11,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:11,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-05 16:57:11,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:11,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-07-05 16:57:11,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:11,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:57:11,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:57:11,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346758933] [2021-07-05 16:57:11,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346758933] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:57:11,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:57:11,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:57:11,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569907148] [2021-07-05 16:57:11,620 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:57:11,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:57:11,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:57:11,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:57:11,620 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:57:11,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:57:11,657 INFO L93 Difference]: Finished difference Result 214 states and 241 transitions. [2021-07-05 16:57:11,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:57:11,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-07-05 16:57:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:57:11,658 INFO L225 Difference]: With dead ends: 214 [2021-07-05 16:57:11,658 INFO L226 Difference]: Without dead ends: 144 [2021-07-05 16:57:11,659 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 62.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:57:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-07-05 16:57:11,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-07-05 16:57:11,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.1258741258741258) internal successors, (161), 143 states have internal predecessors, (161), 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-07-05 16:57:11,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 161 transitions. [2021-07-05 16:57:11,664 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 161 transitions. Word has length 97 [2021-07-05 16:57:11,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:57:11,664 INFO L442 AbstractCegarLoop]: Abstraction has 144 states and 161 transitions. [2021-07-05 16:57:11,664 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:57:11,664 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 161 transitions. [2021-07-05 16:57:11,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-07-05 16:57:11,665 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:57:11,665 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:57:11,665 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable260 [2021-07-05 16:57:11,665 INFO L374 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:57:11,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:57:11,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1698059464, now seen corresponding path program 1 times [2021-07-05 16:57:11,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:57:11,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775731208] [2021-07-05 16:57:11,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:57:11,666 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:57:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:57:11,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:11,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:11,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:11,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 16:57:11,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:11,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 16:57:11,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:11,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 16:57:11,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:11,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:57:11,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:57:11,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775731208] [2021-07-05 16:57:11,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775731208] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:57:11,860 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:57:11,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:57:11,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086517103] [2021-07-05 16:57:11,860 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:57:11,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:57:11,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:57:11,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:57:11,861 INFO L87 Difference]: Start difference. First operand 144 states and 161 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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-07-05 16:57:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:57:11,899 INFO L93 Difference]: Finished difference Result 206 states and 230 transitions. [2021-07-05 16:57:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:57:11,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-07-05 16:57:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:57:11,900 INFO L225 Difference]: With dead ends: 206 [2021-07-05 16:57:11,900 INFO L226 Difference]: Without dead ends: 139 [2021-07-05 16:57:11,901 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:57:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-07-05 16:57:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-07-05 16:57:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.1231884057971016) internal successors, (155), 138 states have internal predecessors, (155), 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-07-05 16:57:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 155 transitions. [2021-07-05 16:57:11,904 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 155 transitions. Word has length 98 [2021-07-05 16:57:11,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:57:11,904 INFO L442 AbstractCegarLoop]: Abstraction has 139 states and 155 transitions. [2021-07-05 16:57:11,904 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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-07-05 16:57:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 155 transitions. [2021-07-05 16:57:11,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-07-05 16:57:11,904 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:57:11,904 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:57:11,905 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261 [2021-07-05 16:57:11,905 INFO L374 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:57:11,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:57:11,905 INFO L82 PathProgramCache]: Analyzing trace with hash -219940822, now seen corresponding path program 1 times [2021-07-05 16:57:11,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:57:11,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722497484] [2021-07-05 16:57:11,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:57:11,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:57:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:57:13,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:13,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:13,681 INFO L142 QuantifierPusher]: treesize reduction 17, result has 37.0 percent of original size [2021-07-05 16:57:13,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:57:13,693 INFO L142 QuantifierPusher]: treesize reduction 17, result has 45.2 percent of original size [2021-07-05 16:57:13,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:57:13,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:13,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:57:13,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:13,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:57:13,727 INFO L142 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-07-05 16:57:13,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:57:13,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:13,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:57:13,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:13,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:57:13,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:13,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:57:13,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:57:13,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722497484] [2021-07-05 16:57:13,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722497484] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:57:13,770 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:57:13,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-05 16:57:13,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010062768] [2021-07-05 16:57:13,771 INFO L425 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-05 16:57:13,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:57:13,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-05 16:57:13,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-07-05 16:57:13,771 INFO L87 Difference]: Start difference. First operand 139 states and 155 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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-07-05 16:57:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:57:20,440 INFO L93 Difference]: Finished difference Result 244 states and 269 transitions. [2021-07-05 16:57:20,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-05 16:57:20,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2021-07-05 16:57:20,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:57:20,441 INFO L225 Difference]: With dead ends: 244 [2021-07-05 16:57:20,441 INFO L226 Difference]: Without dead ends: 157 [2021-07-05 16:57:20,442 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 311.1ms TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2021-07-05 16:57:20,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-07-05 16:57:20,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 137. [2021-07-05 16:57:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.1176470588235294) internal successors, (152), 136 states have internal predecessors, (152), 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-07-05 16:57:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2021-07-05 16:57:20,445 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 98 [2021-07-05 16:57:20,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:57:20,445 INFO L442 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2021-07-05 16:57:20,445 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 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-07-05 16:57:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2021-07-05 16:57:20,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-07-05 16:57:20,446 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:57:20,446 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:57:20,446 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable262 [2021-07-05 16:57:20,446 INFO L374 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:57:20,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:57:20,446 INFO L82 PathProgramCache]: Analyzing trace with hash 146918576, now seen corresponding path program 1 times [2021-07-05 16:57:20,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:57:20,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548381248] [2021-07-05 16:57:20,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:57:20,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:57:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:57:20,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:20,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:20,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:20,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:57:20,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:20,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:57:20,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:20,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:57:20,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:20,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:57:20,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:20,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-07-05 16:57:20,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:20,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:57:20,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:57:20,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548381248] [2021-07-05 16:57:20,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548381248] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:57:20,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:57:20,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:57:20,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375648563] [2021-07-05 16:57:20,679 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:57:20,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:57:20,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:57:20,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:57:20,679 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:57:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:57:20,869 INFO L93 Difference]: Finished difference Result 247 states and 270 transitions. [2021-07-05 16:57:20,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 16:57:20,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-07-05 16:57:20,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:57:20,869 INFO L225 Difference]: With dead ends: 247 [2021-07-05 16:57:20,869 INFO L226 Difference]: Without dead ends: 152 [2021-07-05 16:57:20,870 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 80.1ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:57:20,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-07-05 16:57:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 130. [2021-07-05 16:57:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.1007751937984496) internal successors, (142), 129 states have internal predecessors, (142), 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-07-05 16:57:20,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2021-07-05 16:57:20,873 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 102 [2021-07-05 16:57:20,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:57:20,873 INFO L442 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2021-07-05 16:57:20,873 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:57:20,874 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2021-07-05 16:57:20,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-07-05 16:57:20,874 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:57:20,874 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:57:20,874 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable263 [2021-07-05 16:57:20,874 INFO L374 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:57:20,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:57:20,874 INFO L82 PathProgramCache]: Analyzing trace with hash 2040761787, now seen corresponding path program 1 times [2021-07-05 16:57:20,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:57:20,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533050244] [2021-07-05 16:57:20,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:57:20,875 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:57:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:57:22,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:22,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:22,707 INFO L142 QuantifierPusher]: treesize reduction 15, result has 40.0 percent of original size [2021-07-05 16:57:22,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:57:22,720 INFO L142 QuantifierPusher]: treesize reduction 15, result has 48.3 percent of original size [2021-07-05 16:57:22,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:57:22,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:22,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:57:22,750 INFO L142 QuantifierPusher]: treesize reduction 9, result has 60.9 percent of original size [2021-07-05 16:57:22,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 16:57:22,767 INFO L142 QuantifierPusher]: treesize reduction 9, result has 57.1 percent of original size [2021-07-05 16:57:22,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:57:22,783 INFO L142 QuantifierPusher]: treesize reduction 9, result has 47.1 percent of original size [2021-07-05 16:57:22,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-05 16:57:22,802 INFO L142 QuantifierPusher]: treesize reduction 9, result has 47.1 percent of original size [2021-07-05 16:57:22,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-05 16:57:22,821 INFO L142 QuantifierPusher]: treesize reduction 12, result has 7.7 percent of original size [2021-07-05 16:57:22,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:22,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:22,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:57:22,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:57:22,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533050244] [2021-07-05 16:57:22,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533050244] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:57:22,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:57:22,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-05 16:57:22,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718396639] [2021-07-05 16:57:22,823 INFO L425 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-05 16:57:22,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:57:22,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-05 16:57:22,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-07-05 16:57:22,823 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:57:29,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:57:29,264 INFO L93 Difference]: Finished difference Result 196 states and 215 transitions. [2021-07-05 16:57:29,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-05 16:57:29,265 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-07-05 16:57:29,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:57:29,265 INFO L225 Difference]: With dead ends: 196 [2021-07-05 16:57:29,265 INFO L226 Difference]: Without dead ends: 130 [2021-07-05 16:57:29,266 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 226.5ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-07-05 16:57:29,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-07-05 16:57:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-07-05 16:57:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.0930232558139534) internal successors, (141), 129 states have internal predecessors, (141), 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-07-05 16:57:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2021-07-05 16:57:29,269 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 104 [2021-07-05 16:57:29,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:57:29,269 INFO L442 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2021-07-05 16:57:29,269 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:57:29,269 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2021-07-05 16:57:29,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-07-05 16:57:29,270 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:57:29,270 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:57:29,270 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable264 [2021-07-05 16:57:29,270 INFO L374 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:57:29,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:57:29,270 INFO L82 PathProgramCache]: Analyzing trace with hash -2006059015, now seen corresponding path program 1 times [2021-07-05 16:57:29,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:57:29,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015373249] [2021-07-05 16:57:29,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:57:29,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:57:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:57:32,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:32,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 16:57:32,515 INFO L142 QuantifierPusher]: treesize reduction 16, result has 44.8 percent of original size [2021-07-05 16:57:32,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-05 16:57:32,527 INFO L142 QuantifierPusher]: treesize reduction 12, result has 66.7 percent of original size [2021-07-05 16:57:32,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-07-05 16:57:32,556 INFO L142 QuantifierPusher]: treesize reduction 12, result has 75.0 percent of original size [2021-07-05 16:57:32,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-07-05 16:57:32,592 INFO L142 QuantifierPusher]: treesize reduction 12, result has 79.3 percent of original size [2021-07-05 16:57:32,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-07-05 16:57:32,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:32,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-05 16:57:32,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:32,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-07-05 16:57:32,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:32,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-07-05 16:57:32,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:32,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:32,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:32,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:32,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:57:32,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:57:32,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015373249] [2021-07-05 16:57:32,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015373249] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:57:32,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:57:32,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:57:32,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038215945] [2021-07-05 16:57:32,652 INFO L425 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-05 16:57:32,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:57:32,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-05 16:57:32,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-07-05 16:57:32,653 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:57:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:57:41,194 INFO L93 Difference]: Finished difference Result 255 states and 276 transitions. [2021-07-05 16:57:41,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 16:57:41,194 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-07-05 16:57:41,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:57:41,195 INFO L225 Difference]: With dead ends: 255 [2021-07-05 16:57:41,195 INFO L226 Difference]: Without dead ends: 130 [2021-07-05 16:57:41,195 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 186.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-05 16:57:41,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-07-05 16:57:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-07-05 16:57:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.0852713178294573) internal successors, (140), 129 states have internal predecessors, (140), 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-07-05 16:57:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2021-07-05 16:57:41,199 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 104 [2021-07-05 16:57:41,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:57:41,199 INFO L442 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2021-07-05 16:57:41,199 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:57:41,199 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2021-07-05 16:57:41,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-07-05 16:57:41,199 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:57:41,199 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:57:41,199 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable265 [2021-07-05 16:57:41,199 INFO L374 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:57:41,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:57:41,200 INFO L82 PathProgramCache]: Analyzing trace with hash 435341174, now seen corresponding path program 1 times [2021-07-05 16:57:41,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:57:41,200 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557929799] [2021-07-05 16:57:41,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:57:41,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:57:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:57:43,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:43,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:43,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:43,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:57:43,681 INFO L142 QuantifierPusher]: treesize reduction 6, result has 33.3 percent of original size [2021-07-05 16:57:43,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:57:43,688 INFO L142 QuantifierPusher]: treesize reduction 5, result has 76.2 percent of original size [2021-07-05 16:57:43,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-07-05 16:57:43,723 INFO L142 QuantifierPusher]: treesize reduction 5, result has 80.0 percent of original size [2021-07-05 16:57:43,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:57:43,761 INFO L142 QuantifierPusher]: treesize reduction 5, result has 80.0 percent of original size [2021-07-05 16:57:43,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:57:43,796 INFO L142 QuantifierPusher]: treesize reduction 5, result has 80.0 percent of original size [2021-07-05 16:57:43,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:57:43,822 INFO L142 QuantifierPusher]: treesize reduction 5, result has 80.0 percent of original size [2021-07-05 16:57:43,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:57:43,850 INFO L142 QuantifierPusher]: treesize reduction 11, result has 52.2 percent of original size [2021-07-05 16:57:43,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:57:43,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:43,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:57:43,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:43,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:57:43,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:43,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:57:43,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:43,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:43,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:57:43,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:57:43,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557929799] [2021-07-05 16:57:43,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557929799] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:57:43,902 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:57:43,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-05 16:57:43,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361446480] [2021-07-05 16:57:43,902 INFO L425 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-05 16:57:43,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:57:43,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-05 16:57:43,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-07-05 16:57:43,903 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:57:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:57:48,674 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2021-07-05 16:57:48,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-07-05 16:57:48,674 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-07-05 16:57:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:57:48,674 INFO L225 Difference]: With dead ends: 177 [2021-07-05 16:57:48,675 INFO L226 Difference]: Without dead ends: 138 [2021-07-05 16:57:48,675 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 595.7ms TimeCoverageRelationStatistics Valid=245, Invalid=625, Unknown=0, NotChecked=0, Total=870 [2021-07-05 16:57:48,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-07-05 16:57:48,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 128. [2021-07-05 16:57:48,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.078740157480315) internal successors, (137), 127 states have internal predecessors, (137), 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-07-05 16:57:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2021-07-05 16:57:48,679 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 105 [2021-07-05 16:57:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:57:48,679 INFO L442 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2021-07-05 16:57:48,679 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:57:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2021-07-05 16:57:48,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-07-05 16:57:48,679 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:57:48,679 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:57:48,679 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable266 [2021-07-05 16:57:48,679 INFO L374 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:57:48,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:57:48,680 INFO L82 PathProgramCache]: Analyzing trace with hash -229183254, now seen corresponding path program 1 times [2021-07-05 16:57:48,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:57:48,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808011984] [2021-07-05 16:57:48,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:57:48,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:57:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:57:48,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:48,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:48,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:48,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:57:48,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:48,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:57:48,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:48,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:57:48,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:48,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:57:48,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:48,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:57:48,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:48,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:57:48,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:57:48,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808011984] [2021-07-05 16:57:48,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808011984] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:57:48,999 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:57:48,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:57:48,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581289761] [2021-07-05 16:57:48,999 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:57:48,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:57:48,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:57:48,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:57:48,999 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 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-07-05 16:57:49,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:57:49,164 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2021-07-05 16:57:49,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 16:57:49,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-07-05 16:57:49,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:57:49,164 INFO L225 Difference]: With dead ends: 175 [2021-07-05 16:57:49,164 INFO L226 Difference]: Without dead ends: 128 [2021-07-05 16:57:49,165 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 90.3ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-05 16:57:49,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-07-05 16:57:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2021-07-05 16:57:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.0583333333333333) internal successors, (127), 120 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:57:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2021-07-05 16:57:49,168 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 109 [2021-07-05 16:57:49,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:57:49,169 INFO L442 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2021-07-05 16:57:49,169 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 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-07-05 16:57:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2021-07-05 16:57:49,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-07-05 16:57:49,169 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:57:49,169 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:57:49,169 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable267 [2021-07-05 16:57:49,169 INFO L374 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:57:49,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:57:49,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1411766555, now seen corresponding path program 1 times [2021-07-05 16:57:49,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:57:49,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064929193] [2021-07-05 16:57:49,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:57:49,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:57:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:57:53,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:53,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:53,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:53,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:57:53,511 INFO L142 QuantifierPusher]: treesize reduction 7, result has 58.8 percent of original size [2021-07-05 16:57:53,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:57:53,528 INFO L142 QuantifierPusher]: treesize reduction 7, result has 65.0 percent of original size [2021-07-05 16:57:53,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-05 16:57:53,548 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-07-05 16:57:53,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-07-05 16:57:53,572 INFO L142 QuantifierPusher]: treesize reduction 12, result has 70.7 percent of original size [2021-07-05 16:57:53,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-07-05 16:57:53,625 INFO L142 QuantifierPusher]: treesize reduction 7, result has 73.1 percent of original size [2021-07-05 16:57:53,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:57:53,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:53,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:57:53,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:53,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-07-05 16:57:53,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:53,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-05 16:57:53,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:53,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:57:53,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:57:53,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064929193] [2021-07-05 16:57:53,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064929193] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:57:53,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:57:53,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-05 16:57:53,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738374085] [2021-07-05 16:57:53,729 INFO L425 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-05 16:57:53,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:57:53,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-05 16:57:53,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-07-05 16:57:53,729 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 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-07-05 16:57:56,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:57:56,226 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2021-07-05 16:57:56,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 16:57:56,226 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-07-05 16:57:56,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:57:56,227 INFO L225 Difference]: With dead ends: 128 [2021-07-05 16:57:56,227 INFO L226 Difference]: Without dead ends: 114 [2021-07-05 16:57:56,227 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 362.0ms TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-07-05 16:57:56,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-07-05 16:57:56,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-07-05 16:57:56,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:57:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2021-07-05 16:57:56,231 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 111 [2021-07-05 16:57:56,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:57:56,231 INFO L442 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2021-07-05 16:57:56,232 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 11 states have internal predecessors, (111), 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-07-05 16:57:56,232 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2021-07-05 16:57:56,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-07-05 16:57:56,232 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:57:56,232 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:57:56,232 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable268 [2021-07-05 16:57:56,232 INFO L374 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:57:56,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:57:56,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1450190559, now seen corresponding path program 1 times [2021-07-05 16:57:56,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:57:56,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075433327] [2021-07-05 16:57:56,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:57:56,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:57:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:57:56,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:56,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:56,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:56,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:57:56,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:56,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:57:56,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:56,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-07-05 16:57:56,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:56,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:57:56,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:56,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:57:56,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:56,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:57:56,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:56,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-07-05 16:57:56,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:56,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-07-05 16:57:56,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:56,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-07-05 16:57:56,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:56,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:56,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:56,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:56,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:57:56,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:57:56,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:57:56,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:57:56,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075433327] [2021-07-05 16:57:56,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075433327] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:57:56,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:57:56,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-05 16:57:56,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136314873] [2021-07-05 16:57:56,833 INFO L425 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-05 16:57:56,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:57:56,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-05 16:57:56,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-07-05 16:57:56,833 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 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-07-05 16:58:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:58:01,639 INFO L93 Difference]: Finished difference Result 203 states and 208 transitions. [2021-07-05 16:58:01,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-05 16:58:01,639 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-07-05 16:58:01,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:58:01,640 INFO L225 Difference]: With dead ends: 203 [2021-07-05 16:58:01,640 INFO L226 Difference]: Without dead ends: 196 [2021-07-05 16:58:01,640 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 486.4ms TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2021-07-05 16:58:01,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-07-05 16:58:01,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 139. [2021-07-05 16:58:01,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.036231884057971) internal successors, (143), 138 states have internal predecessors, (143), 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-07-05 16:58:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2021-07-05 16:58:01,645 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 111 [2021-07-05 16:58:01,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:58:01,645 INFO L442 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2021-07-05 16:58:01,646 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 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-07-05 16:58:01,646 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2021-07-05 16:58:01,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-07-05 16:58:01,646 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:58:01,646 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:58:01,646 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable269 [2021-07-05 16:58:01,646 INFO L374 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:58:01,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:58:01,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1724950173, now seen corresponding path program 1 times [2021-07-05 16:58:01,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:58:01,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460779434] [2021-07-05 16:58:01,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:58:01,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:58:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:58:02,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:02,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:58:02,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:02,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:58:02,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:02,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-05 16:58:02,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:02,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:58:02,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:02,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:58:02,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:02,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-07-05 16:58:02,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:02,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-07-05 16:58:02,114 INFO L142 QuantifierPusher]: treesize reduction 16, result has 65.2 percent of original size [2021-07-05 16:58:02,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-07-05 16:58:02,149 INFO L142 QuantifierPusher]: treesize reduction 35, result has 60.7 percent of original size [2021-07-05 16:58:02,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-07-05 16:58:02,243 INFO L142 QuantifierPusher]: treesize reduction 26, result has 55.9 percent of original size [2021-07-05 16:58:02,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-07-05 16:58:02,267 INFO L142 QuantifierPusher]: treesize reduction 26, result has 60.6 percent of original size [2021-07-05 16:58:02,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-07-05 16:58:02,376 INFO L142 QuantifierPusher]: treesize reduction 42, result has 43.2 percent of original size [2021-07-05 16:58:02,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-07-05 16:58:02,437 INFO L142 QuantifierPusher]: treesize reduction 26, result has 55.2 percent of original size [2021-07-05 16:58:02,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-07-05 16:58:02,438 INFO L142 QuantifierPusher]: treesize reduction 20, result has 63.6 percent of original size [2021-07-05 16:58:02,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-07-05 16:58:02,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:02,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-05 16:58:02,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:02,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-07-05 16:58:02,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:02,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-07-05 16:58:02,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:02,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-07-05 16:58:02,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:02,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-07-05 16:58:02,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:02,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:58:02,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:02,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:58:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:58:02,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:58:02,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460779434] [2021-07-05 16:58:02,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460779434] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:58:02,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:58:02,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-07-05 16:58:02,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733424716] [2021-07-05 16:58:02,698 INFO L425 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-07-05 16:58:02,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:58:02,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-07-05 16:58:02,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-07-05 16:58:02,698 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand has 17 states, 17 states have (on average 6.529411764705882) internal successors, (111), 17 states have internal predecessors, (111), 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-07-05 16:58:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:58:20,433 INFO L93 Difference]: Finished difference Result 330 states and 339 transitions. [2021-07-05 16:58:20,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-05 16:58:20,433 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.529411764705882) internal successors, (111), 17 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-07-05 16:58:20,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:58:20,434 INFO L225 Difference]: With dead ends: 330 [2021-07-05 16:58:20,434 INFO L226 Difference]: Without dead ends: 146 [2021-07-05 16:58:20,434 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1156.0ms TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2021-07-05 16:58:20,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-07-05 16:58:20,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 139. [2021-07-05 16:58:20,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.0289855072463767) internal successors, (142), 138 states have internal predecessors, (142), 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-07-05 16:58:20,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2021-07-05 16:58:20,440 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 111 [2021-07-05 16:58:20,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:58:20,440 INFO L442 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2021-07-05 16:58:20,440 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 6.529411764705882) internal successors, (111), 17 states have internal predecessors, (111), 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-07-05 16:58:20,440 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2021-07-05 16:58:20,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-07-05 16:58:20,440 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:58:20,440 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:58:20,441 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable270 [2021-07-05 16:58:20,441 INFO L374 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:58:20,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:58:20,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1696449883, now seen corresponding path program 1 times [2021-07-05 16:58:20,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:58:20,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135418015] [2021-07-05 16:58:20,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:58:20,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:58:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:58:20,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:20,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:58:20,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:20,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:58:20,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:20,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-07-05 16:58:20,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:20,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-07-05 16:58:20,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:20,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-07-05 16:58:20,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:20,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-07-05 16:58:20,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:20,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:58:20,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:20,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:58:20,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:20,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 16:58:20,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:20,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:58:20,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:20,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:58:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:58:20,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:58:20,872 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135418015] [2021-07-05 16:58:20,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135418015] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:58:20,872 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:58:20,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:58:20,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997483964] [2021-07-05 16:58:20,872 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 16:58:20,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:58:20,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 16:58:20,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:58:20,873 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 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-07-05 16:58:27,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:58:27,438 INFO L93 Difference]: Finished difference Result 244 states and 248 transitions. [2021-07-05 16:58:27,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 16:58:27,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-07-05 16:58:27,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:58:27,439 INFO L225 Difference]: With dead ends: 244 [2021-07-05 16:58:27,439 INFO L226 Difference]: Without dead ends: 146 [2021-07-05 16:58:27,440 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 177.8ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-07-05 16:58:27,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-07-05 16:58:27,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 139. [2021-07-05 16:58:27,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.0217391304347827) internal successors, (141), 138 states have internal predecessors, (141), 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-07-05 16:58:27,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2021-07-05 16:58:27,445 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 111 [2021-07-05 16:58:27,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:58:27,445 INFO L442 AbstractCegarLoop]: Abstraction has 139 states and 141 transitions. [2021-07-05 16:58:27,445 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 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-07-05 16:58:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 141 transitions. [2021-07-05 16:58:27,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-07-05 16:58:27,446 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:58:27,446 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:58:27,446 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable271 [2021-07-05 16:58:27,446 INFO L374 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:58:27,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:58:27,446 INFO L82 PathProgramCache]: Analyzing trace with hash 729099229, now seen corresponding path program 1 times [2021-07-05 16:58:27,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:58:27,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786096963] [2021-07-05 16:58:27,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:58:27,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:58:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:58:32,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:32,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:58:32,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:32,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:58:32,318 INFO L142 QuantifierPusher]: treesize reduction 22, result has 42.1 percent of original size [2021-07-05 16:58:32,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-07-05 16:58:32,343 INFO L142 QuantifierPusher]: treesize reduction 22, result has 71.8 percent of original size [2021-07-05 16:58:32,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-07-05 16:58:32,379 INFO L142 QuantifierPusher]: treesize reduction 26, result has 70.8 percent of original size [2021-07-05 16:58:32,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-07-05 16:58:32,418 INFO L142 QuantifierPusher]: treesize reduction 26, result has 75.2 percent of original size [2021-07-05 16:58:32,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 79 [2021-07-05 16:58:32,434 INFO L142 QuantifierPusher]: treesize reduction 22, result has 70.7 percent of original size [2021-07-05 16:58:32,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-07-05 16:58:32,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:32,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-07-05 16:58:32,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:32,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 58 [2021-07-05 16:58:32,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:32,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 58 [2021-07-05 16:58:32,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:32,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-07-05 16:58:32,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:32,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-07-05 16:58:32,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:32,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 69 [2021-07-05 16:58:32,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:32,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-07-05 16:58:32,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:32,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-07-05 16:58:32,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:32,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-07-05 16:58:32,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:32,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:58:32,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:32,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:58:32,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:32,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:58:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:58:32,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:58:32,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786096963] [2021-07-05 16:58:32,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786096963] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:58:32,969 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:58:32,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-07-05 16:58:32,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506722094] [2021-07-05 16:58:32,969 INFO L425 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-07-05 16:58:32,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:58:32,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-07-05 16:58:32,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-07-05 16:58:32,970 INFO L87 Difference]: Start difference. First operand 139 states and 141 transitions. Second operand has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 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-07-05 16:58:42,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:58:42,281 INFO L93 Difference]: Finished difference Result 146 states and 147 transitions. [2021-07-05 16:58:42,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-05 16:58:42,282 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-07-05 16:58:42,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:58:42,282 INFO L225 Difference]: With dead ends: 146 [2021-07-05 16:58:42,282 INFO L226 Difference]: Without dead ends: 139 [2021-07-05 16:58:42,283 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1147.3ms TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2021-07-05 16:58:42,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-07-05 16:58:42,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 114. [2021-07-05 16:58:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.0176991150442478) internal successors, (115), 113 states have internal predecessors, (115), 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-07-05 16:58:42,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2021-07-05 16:58:42,288 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 111 [2021-07-05 16:58:42,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:58:42,288 INFO L442 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2021-07-05 16:58:42,288 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 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-07-05 16:58:42,288 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2021-07-05 16:58:42,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-07-05 16:58:42,288 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:58:42,288 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:58:42,288 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272 [2021-07-05 16:58:42,289 INFO L374 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:58:42,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:58:42,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1158539208, now seen corresponding path program 1 times [2021-07-05 16:58:42,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:58:42,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325238633] [2021-07-05 16:58:42,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:58:42,289 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:58:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:58:42,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:42,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:58:42,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:42,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:58:42,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:42,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:58:42,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:42,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:58:42,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:42,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-07-05 16:58:42,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:42,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:58:42,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:42,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:58:42,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:42,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:58:42,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:42,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:58:42,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:58:42,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:58:42,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325238633] [2021-07-05 16:58:42,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325238633] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:58:42,814 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:58:42,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-05 16:58:42,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808623876] [2021-07-05 16:58:42,815 INFO L425 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-05 16:58:42,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:58:42,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-05 16:58:42,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:58:42,815 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 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-07-05 16:58:47,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:58:47,255 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2021-07-05 16:58:47,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 16:58:47,256 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2021-07-05 16:58:47,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:58:47,256 INFO L225 Difference]: With dead ends: 148 [2021-07-05 16:58:47,256 INFO L226 Difference]: Without dead ends: 114 [2021-07-05 16:58:47,257 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 158.0ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-07-05 16:58:47,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-07-05 16:58:47,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-07-05 16:58:47,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.008849557522124) internal successors, (114), 113 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:58:47,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2021-07-05 16:58:47,261 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 113 [2021-07-05 16:58:47,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:58:47,261 INFO L442 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2021-07-05 16:58:47,261 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 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-07-05 16:58:47,261 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2021-07-05 16:58:47,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-07-05 16:58:47,261 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:58:47,261 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:58:47,261 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273 [2021-07-05 16:58:47,261 INFO L374 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:58:47,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:58:47,262 INFO L82 PathProgramCache]: Analyzing trace with hash 892444790, now seen corresponding path program 1 times [2021-07-05 16:58:47,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:58:47,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901123566] [2021-07-05 16:58:47,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:58:47,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:58:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:58:50,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:50,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:58:50,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:50,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:58:50,375 INFO L142 QuantifierPusher]: treesize reduction 24, result has 29.4 percent of original size [2021-07-05 16:58:50,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:58:50,385 INFO L142 QuantifierPusher]: treesize reduction 23, result has 48.9 percent of original size [2021-07-05 16:58:50,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-05 16:58:50,410 INFO L142 QuantifierPusher]: treesize reduction 23, result has 53.1 percent of original size [2021-07-05 16:58:50,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-07-05 16:58:50,440 INFO L142 QuantifierPusher]: treesize reduction 23, result has 53.1 percent of original size [2021-07-05 16:58:50,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-07-05 16:58:50,473 INFO L142 QuantifierPusher]: treesize reduction 23, result has 53.1 percent of original size [2021-07-05 16:58:50,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-07-05 16:58:50,515 INFO L142 QuantifierPusher]: treesize reduction 23, result has 53.1 percent of original size [2021-07-05 16:58:50,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-07-05 16:58:50,559 INFO L142 QuantifierPusher]: treesize reduction 21, result has 46.2 percent of original size [2021-07-05 16:58:50,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-07-05 16:58:50,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:50,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:58:50,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:50,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-05 16:58:50,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:50,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:58:50,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:50,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:58:50,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:50,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:58:50,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:50,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:58:50,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:50,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:58:50,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:50,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:58:50,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:58:50,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:58:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:58:50,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:58:50,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901123566] [2021-07-05 16:58:50,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901123566] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:58:50,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:58:50,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-07-05 16:58:50,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738687330] [2021-07-05 16:58:50,712 INFO L425 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-07-05 16:58:50,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:58:50,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-07-05 16:58:50,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-07-05 16:58:50,713 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand has 18 states, 18 states have (on average 6.277777777777778) internal successors, (113), 18 states have internal predecessors, (113), 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-07-05 16:58:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:58:53,645 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2021-07-05 16:58:53,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-07-05 16:58:53,645 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.277777777777778) internal successors, (113), 18 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2021-07-05 16:58:53,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:58:53,646 INFO L225 Difference]: With dead ends: 114 [2021-07-05 16:58:53,646 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 16:58:53,646 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 775.2ms TimeCoverageRelationStatistics Valid=250, Invalid=806, Unknown=0, NotChecked=0, Total=1056 [2021-07-05 16:58:53,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 16:58:53,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 16:58:53,646 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-07-05 16:58:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 16:58:53,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2021-07-05 16:58:53,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:58:53,647 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 16:58:53,647 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 6.277777777777778) internal successors, (113), 18 states have internal predecessors, (113), 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-07-05 16:58:53,647 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 16:58:53,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 16:58:53,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 16:58:53,656 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:53,662 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:53,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:53,699 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:53,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:53,737 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:53,754 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:53,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:53,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:53,900 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:53,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:53,921 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:53,946 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:53,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:53,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:53,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:53,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:53,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:54,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:54,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:54,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:54,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:54,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:54,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:58:54,306 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2021-07-05 16:58:54,854 WARN L205 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 90 [2021-07-05 16:58:55,547 WARN L205 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 114 [2021-07-05 16:58:55,996 WARN L205 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 84 [2021-07-05 16:58:56,527 WARN L205 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 104 [2021-07-05 16:58:57,506 WARN L205 SmtUtils]: Spent 976.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 47 [2021-07-05 16:58:58,171 WARN L205 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 47 [2021-07-05 16:58:58,574 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2021-07-05 16:58:59,482 WARN L205 SmtUtils]: Spent 906.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 112 [2021-07-05 16:58:59,690 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 64 [2021-07-05 16:59:00,002 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2021-07-05 16:59:00,674 WARN L205 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 47 [2021-07-05 16:59:00,832 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2021-07-05 16:59:01,351 WARN L205 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 82 [2021-07-05 16:59:01,473 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-07-05 16:59:01,475 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,475 INFO L762 garLoopResultBuilder]: For program point L9153(lines 9153 9155) no Hoare annotation was computed. [2021-07-05 16:59:01,475 INFO L762 garLoopResultBuilder]: For program point L9153-2(lines 9153 9155) no Hoare annotation was computed. [2021-07-05 16:59:01,475 INFO L762 garLoopResultBuilder]: For program point L6973(lines 6973 6978) no Hoare annotation was computed. [2021-07-05 16:59:01,475 INFO L758 garLoopResultBuilder]: At program point L268(line 268) the Hoare annotation is: false [2021-07-05 16:59:01,475 INFO L762 garLoopResultBuilder]: For program point L6974(lines 6974 6976) no Hoare annotation was computed. [2021-07-05 16:59:01,475 INFO L762 garLoopResultBuilder]: For program point L6974-2(lines 6974 6976) no Hoare annotation was computed. [2021-07-05 16:59:01,475 INFO L762 garLoopResultBuilder]: For program point L7141-2(line 7141) no Hoare annotation was computed. [2021-07-05 16:59:01,475 INFO L762 garLoopResultBuilder]: For program point L7141(line 7141) no Hoare annotation was computed. [2021-07-05 16:59:01,475 INFO L765 garLoopResultBuilder]: At program point L9157(line 9157) the Hoare annotation is: true [2021-07-05 16:59:01,475 INFO L762 garLoopResultBuilder]: For program point L6979(lines 6979 6981) no Hoare annotation was computed. [2021-07-05 16:59:01,476 INFO L758 garLoopResultBuilder]: At program point L6979-3(lines 6965 6982) the Hoare annotation is: (let ((.cse58 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse31 (select .cse58 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse25 (= |ULTIMATE.start_can_fail_realloc_#res.base| 0)) (.cse28 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse27 (+ |#StackHeapBarrier| 1))) (let ((.cse32 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse33 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse30 (select .cse58 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse35 (<= .cse27 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse42 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse13 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse20 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse8 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse22 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse9 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse38 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0))) (.cse23 (= |ULTIMATE.start_can_fail_realloc_#res.offset| 0)) (.cse16 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse26 (<= (+ (* 4294967296 .cse28) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse37 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse19 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse21 (not .cse25)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse3 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse49 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse12 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse14 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse24 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse29 (* .cse31 (- 1))) (.cse18 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse15 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and .cse0 (let ((.cse11 (select (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse1 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse2 (<= (* 4294967296 (div (+ (* (div (+ .cse29 4294967295 .cse30) 4294967296) 4294967296) .cse31) 4294967296)) .cse30)) (.cse10 (<= (* 4294967296 (div (+ .cse11 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse28 4294967296)) 4294967296)) .cse11)) (.cse17 (<= .cse27 ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse11 (* 4294967296 (div .cse11 4294967296))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse19 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18) (and .cse4 .cse22 .cse9 .cse23 .cse24 .cse15 .cse25 .cse26)))) .cse3 .cse32 .cse5 .cse33 .cse22 (let ((.cse34 (< (* 4294967296 (div ULTIMATE.start_can_fail_realloc_~newsize 4294967296)) ULTIMATE.start_can_fail_realloc_~newsize)) (.cse36 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse3 .cse4 .cse19 .cse32 .cse34 .cse20 .cse5 .cse35 .cse36 .cse33 .cse8 .cse22 .cse9 .cse12 .cse13 .cse14 .cse37 .cse15 .cse21 .cse16) (let ((.cse41 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse40 (select .cse41 12))) (and .cse0 .cse3 .cse4 .cse22 .cse9 .cse38 .cse23 .cse12 .cse24 (let ((.cse39 (select .cse41 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (<= .cse39 (+ (* 4294967296 (div (+ (* (div .cse39 4294967296) 4294967296) 4294967295 (* .cse40 (- 1))) 4294967296)) .cse40))) .cse15 .cse25 (<= .cse40 (+ (* 4294967296 (div (+ (- 1) .cse40) 4294967296)) 4294967295)) .cse26))) (and .cse0 .cse3 .cse4 .cse19 .cse34 .cse20 .cse5 .cse35 (<= .cse30 (* 4294967296 (div .cse30 4294967296))) .cse36 .cse8 .cse9 .cse42 .cse12 .cse13 .cse14 .cse37 .cse15 .cse21 .cse16 .cse18))) (let ((.cse50 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse43 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse50))) (.cse44 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse50) |~#s_can_fail_allocator_static~0.base|)) (.cse45 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse46 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|)) (.cse47 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|)) (.cse48 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse3 .cse4 .cse19 .cse20 .cse43 .cse35 .cse44 .cse45 .cse46 .cse6 .cse8 .cse47 .cse22 .cse9 .cse42 .cse12 .cse13 .cse15 .cse21 .cse16 .cse48 .cse26) (and .cse0 .cse3 .cse4 .cse20 .cse43 .cse44 .cse45 .cse46 .cse6 .cse8 .cse47 .cse22 .cse9 .cse38 .cse49 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0)) .cse23 .cse12 .cse24 .cse15 .cse25 .cse16 .cse48 .cse18 .cse26)))) .cse12 .cse14 .cse37 (let ((.cse57 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse53 (select .cse57 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse51 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse52 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse55 (let ((.cse56 (select .cse57 12))) (<= .cse56 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse56) 4294967296)))))) (.cse54 (div .cse53 4294967296))) (or (and .cse0 .cse3 .cse19 .cse5 .cse6 .cse7 .cse12 .cse14 .cse24 .cse15 .cse21 .cse18) (and .cse51 .cse0 .cse3 .cse52 .cse5 .cse6 .cse7 .cse12 (<= .cse53 (* 4294967296 .cse54)) .cse14 .cse55 .cse24 .cse15 .cse18) (and .cse51 .cse0 .cse3 .cse52 .cse5 .cse6 .cse7 .cse49 .cse12 .cse14 .cse55 .cse24 .cse15 (<= .cse53 (+ (* 4294967296 (div (+ .cse29 (* .cse54 4294967296) 4294967295) 4294967296)) .cse31)) .cse18))))) .cse15)))) [2021-07-05 16:59:01,476 INFO L762 garLoopResultBuilder]: For program point L6979-2(lines 6979 6981) no Hoare annotation was computed. [2021-07-05 16:59:01,476 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,476 INFO L762 garLoopResultBuilder]: For program point L7145(lines 7145 7151) no Hoare annotation was computed. [2021-07-05 16:59:01,476 INFO L758 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: (let ((.cse13 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse10 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse13)) (.cse11 (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse13))) (let ((.cse2 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse3 (= .cse11 0)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse4 (= .cse10 0)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse7 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and .cse0 .cse1 .cse2 (let ((.cse5 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse9 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| .cse10) .cse2 (= .cse11 |~#s_can_fail_allocator_static~0.base|) .cse5 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse6 .cse7 .cse8 .cse9))) .cse6 .cse7 .cse8 (let ((.cse12 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse12 .cse6 .cse7 .cse8) (and .cse0 .cse3 .cse1 .cse4 .cse12 .cse6 .cse7 .cse8))))))) [2021-07-05 16:59:01,476 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,476 INFO L762 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:59:01,476 INFO L762 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:59:01,476 INFO L762 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:59:01,476 INFO L762 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:59:01,476 INFO L762 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:59:01,476 INFO L762 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:59:01,476 INFO L762 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:59:01,476 INFO L762 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:59:01,477 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,477 INFO L762 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-07-05 16:59:01,477 INFO L762 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-07-05 16:59:01,477 INFO L762 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-07-05 16:59:01,477 INFO L762 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-07-05 16:59:01,477 INFO L762 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-07-05 16:59:01,477 INFO L762 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-07-05 16:59:01,477 INFO L762 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-07-05 16:59:01,477 INFO L762 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-07-05 16:59:01,477 INFO L758 garLoopResultBuilder]: At program point L6951-1(lines 6950 6952) the Hoare annotation is: (let ((.cse2 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse4 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse5 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse2)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse2) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |ULTIMATE.start_aws_byte_buf_has_allocator_#t~mem500.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse3 .cse4 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) .cse5 (let ((.cse11 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse8 (select .cse11 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (let ((.cse9 (div .cse8 4294967296)) (.cse10 (select .cse11 12))) (let ((.cse6 (<= .cse8 (+ (* 4294967296 (div (+ (* .cse9 4294967296) 4294967295 (* .cse10 (- 1))) 4294967296)) .cse10))) (.cse7 (<= .cse10 (+ (* 4294967296 (div (+ (- 1) .cse10) 4294967296)) 4294967295)))) (or (and .cse0 .cse1 .cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse4 .cse6 .cse5 .cse7) (and .cse0 .cse1 (<= .cse8 (* 4294967296 .cse9)) .cse3 .cse4 .cse6 .cse5 .cse7)))))) (= |ULTIMATE.start_can_fail_allocator_#res.base| |ULTIMATE.start_aws_byte_buf_has_allocator_#t~mem500.base|) (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-07-05 16:59:01,477 INFO L758 garLoopResultBuilder]: At program point L6951(lines 6950 6952) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2021-07-05 16:59:01,477 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,477 INFO L758 garLoopResultBuilder]: At program point L6655(lines 6653 6656) the Hoare annotation is: (let ((.cse2 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse4 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse5 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and .cse0 (<= 1 |ULTIMATE.start_aws_byte_buf_has_allocator_#res|) .cse1 (<= |ULTIMATE.start_aws_byte_buf_has_allocator_#res| 1) (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse2)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse2) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse3 .cse4 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) .cse5 (let ((.cse11 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse8 (select .cse11 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (let ((.cse9 (div .cse8 4294967296)) (.cse10 (select .cse11 12))) (let ((.cse6 (<= .cse8 (+ (* 4294967296 (div (+ (* .cse9 4294967296) 4294967295 (* .cse10 (- 1))) 4294967296)) .cse10))) (.cse7 (<= .cse10 (+ (* 4294967296 (div (+ (- 1) .cse10) 4294967296)) 4294967295)))) (or (and .cse0 .cse1 .cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse4 .cse6 .cse5 .cse7) (and .cse0 .cse1 (<= .cse8 (* 4294967296 .cse9)) .cse3 .cse4 .cse6 .cse5 .cse7)))))) (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-07-05 16:59:01,478 INFO L758 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (let ((.cse9 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (let ((.cse12 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse3 (select .cse12 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse11 (select .cse12 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse5 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse6 (<= .cse11 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse11) 4294967296))))) (.cse7 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse8 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse4 (div .cse3 4294967296)) (.cse10 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (or (and .cse0 .cse1 .cse2 (<= .cse3 (* 4294967296 .cse4)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse3 (+ (* 4294967296 (div (+ (* .cse4 4294967296) (* .cse11 (- 1)) 4294967295) 4294967296)) .cse11)) .cse10))))) .cse9)) [2021-07-05 16:59:01,478 INFO L758 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (let ((.cse2 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse1 (select .cse2 12))) (and (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (let ((.cse0 (select .cse2 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (<= .cse0 (+ (* 4294967296 (div (+ (* (div .cse0 4294967296) 4294967296) 4294967295 (* .cse1 (- 1))) 4294967296)) .cse1))) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (<= .cse1 (+ (* 4294967296 (div (+ (- 1) .cse1) 4294967296)) 4294967295))))) [2021-07-05 16:59:01,478 INFO L758 garLoopResultBuilder]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: (let ((.cse22 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse2 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse3 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse16 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse11 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse13 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse14 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse21 (select .cse22 12)) (.cse15 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse0 .cse1 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize) (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4) (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse2)) .cse3 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse2) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (let ((.cse19 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse9 (select .cse19 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse5 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse6 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse12 (let ((.cse18 (select .cse19 12))) (<= .cse18 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse18) 4294967296)))))) (.cse10 (div .cse9 4294967296))) (or (and .cse5 .cse0 .cse1 .cse6 .cse3 .cse4 .cse7 .cse8 (<= .cse9 (* 4294967296 .cse10)) .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse5 .cse0 .cse1 .cse6 .cse3 .cse4 .cse7 .cse16 .cse8 .cse11 .cse12 .cse13 .cse14 (<= .cse9 (let ((.cse17 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse17 (- 1)) (* .cse10 4294967296) 4294967295) 4294967296)) .cse17))) .cse15))))) (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse16 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0)) .cse8 .cse11 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse13 (let ((.cse20 (select .cse22 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (<= .cse20 (+ (* 4294967296 (div (+ (* (div .cse20 4294967296) 4294967296) 4294967295 (* .cse21 (- 1))) 4294967296)) .cse21))) .cse14 (<= .cse21 (+ (* 4294967296 (div (+ (- 1) .cse21) 4294967296)) 4294967295)) (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse15 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity) (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0)))) [2021-07-05 16:59:01,478 INFO L762 garLoopResultBuilder]: For program point L8176-1(line 8176) no Hoare annotation was computed. [2021-07-05 16:59:01,479 INFO L758 garLoopResultBuilder]: At program point L8176-4(line 8176) the Hoare annotation is: (let ((.cse45 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse42 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse23 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse40 (select .cse42 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse43 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse34 (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse44 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 16)) (.cse32 (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse45))) (let ((.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse26 (= .cse32 0)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse27 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse45) 0)) (.cse28 (= (select .cse34 .cse44) 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse10 (not (= (select .cse43 4) 0))) (.cse11 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse15 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse25 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse16 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse17 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse19 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse30 (= (select .cse43 .cse44) 0)) (.cse41 (div .cse40 4294967296)) (.cse39 (select .cse42 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse13 (select .cse23 12))) (let ((.cse22 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse13) 4294967296)))) (.cse18 (<= .cse40 (+ (* 4294967296 (div (+ (* .cse41 4294967296) (* .cse39 (- 1)) 4294967295) 4294967296)) .cse39))) (.cse20 (<= .cse40 (* 4294967296 .cse41))) (.cse12 (<= .cse39 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse39) 4294967296))))) (.cse7 (let ((.cse38 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (<= .cse38 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse38) 4294967296)))))) (.cse0 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse3 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse31 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse24 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse35 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse33 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse37 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse21 (and .cse1 .cse26 .cse2 .cse27 .cse28 .cse4 .cse6 .cse10 .cse11 .cse15 .cse25 .cse16 .cse17 .cse19 .cse30))) (and (let ((.cse5 (select .cse23 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse8 (<= .cse13 .cse22)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse14 (div .cse5 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse5) 4294967296)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse5 (+ .cse13 (* 4294967296 (div (+ (* .cse14 4294967296) 4294967295 (* .cse13 (- 1))) 4294967296)))) .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 (<= .cse5 (* 4294967296 .cse14)) .cse16 .cse17 .cse19) .cse21))) (or .cse21 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse24 .cse11 (<= (select .cse23 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 12)) .cse22) .cse15 .cse25 .cse16 .cse17 .cse19)) (let ((.cse29 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse1 .cse26 .cse2 .cse27 .cse28 .cse4 .cse6 .cse10 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |~#s_can_fail_allocator_static~0.offset| 1)) .cse11 .cse15 .cse25 .cse16 .cse17 .cse29 .cse19 .cse30) (and .cse1 .cse2 .cse4 .cse31 (= .cse32 |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse6 .cse33 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse11 .cse15 .cse25 (= (select .cse34 16) |~#s_can_fail_allocator_static~0.offset|) .cse17 .cse29 .cse19))) (let ((.cse36 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse35 .cse4 .cse31 .cse36 .cse33 .cse11 .cse12 .cse15 .cse25 .cse37 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse26 .cse2 .cse3 .cse27 .cse28 .cse4 .cse36 .cse6 .cse10 .cse11 .cse12 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 .cse30) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse20 .cse36 .cse33 .cse11 .cse12 .cse15 .cse25 .cse37 .cse17 .cse19))) (or (and .cse1 .cse2 .cse4 .cse31 .cse6 .cse24 .cse7 .cse10 .cse11 .cse15 .cse25 .cse16 .cse17 .cse19) (and .cse1 .cse26 .cse2 .cse27 .cse28 .cse4 .cse31 .cse6 .cse10 .cse11 .cse15 .cse25 .cse16 .cse17 .cse19 .cse30) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 .cse6 .cse24 .cse10 .cse11 .cse15 .cse25 .cse16 .cse17 .cse19)) (or (and .cse1 .cse2 .cse35 .cse4 .cse33 .cse11 .cse15 .cse25 .cse37 .cse17 .cse19) .cse21)))))) [2021-07-05 16:59:01,479 INFO L762 garLoopResultBuilder]: For program point L8176-3(line 8176) no Hoare annotation was computed. [2021-07-05 16:59:01,479 INFO L762 garLoopResultBuilder]: For program point L8177-3(lines 8175 8193) no Hoare annotation was computed. [2021-07-05 16:59:01,479 INFO L762 garLoopResultBuilder]: For program point L8177-2(line 8177) no Hoare annotation was computed. [2021-07-05 16:59:01,479 INFO L762 garLoopResultBuilder]: For program point L8177(line 8177) no Hoare annotation was computed. [2021-07-05 16:59:01,479 INFO L762 garLoopResultBuilder]: For program point L8177-4(line 8177) no Hoare annotation was computed. [2021-07-05 16:59:01,479 INFO L762 garLoopResultBuilder]: For program point L6658(lines 6658 6663) no Hoare annotation was computed. [2021-07-05 16:59:01,479 INFO L762 garLoopResultBuilder]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:59:01,479 INFO L762 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:59:01,479 INFO L762 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:59:01,479 INFO L762 garLoopResultBuilder]: For program point L7154(lines 7154 7156) no Hoare annotation was computed. [2021-07-05 16:59:01,479 INFO L762 garLoopResultBuilder]: For program point L6659(lines 6659 6661) no Hoare annotation was computed. [2021-07-05 16:59:01,479 INFO L762 garLoopResultBuilder]: For program point L6659-2(lines 6659 6661) no Hoare annotation was computed. [2021-07-05 16:59:01,479 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 16:59:01,479 INFO L762 garLoopResultBuilder]: For program point L7122(lines 7122 7135) no Hoare annotation was computed. [2021-07-05 16:59:01,479 INFO L762 garLoopResultBuilder]: For program point L8179(lines 8179 8182) no Hoare annotation was computed. [2021-07-05 16:59:01,479 INFO L762 garLoopResultBuilder]: For program point L9137(lines 9137 9156) no Hoare annotation was computed. [2021-07-05 16:59:01,479 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,480 INFO L758 garLoopResultBuilder]: At program point L7158(lines 7137 7159) the Hoare annotation is: (let ((.cse42 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse32 (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0)) (.cse41 (+ |#StackHeapBarrier| 1))) (let ((.cse34 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse43 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse5 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0)) (.cse6 (<= (+ |ULTIMATE.start_aws_mem_realloc_#res| 1) 0)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse10 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse11 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse2 (<= .cse41 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse15 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse18 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse19 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0))) (.cse4 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse20 (not .cse32)) (.cse22 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse25 (not (= |ULTIMATE.start_can_fail_realloc_#res.base| 0))) (.cse26 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse28 (<= (+ (* 4294967296 .cse42) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse29 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0))) (.cse47 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse8 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse35 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse14 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse37 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse30 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse21 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse46 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse49 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse31 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse17 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse23 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse24 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse53 (= |ULTIMATE.start_aws_mem_realloc_#res| 0))) (and (let ((.cse33 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse1 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse33))) (.cse3 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse33) |~#s_can_fail_allocator_static~0.base|))) (let ((.cse0 (let ((.cse12 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse13 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|)) (.cse16 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|)) (.cse27 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) .cse7 .cse8 .cse9 .cse11 .cse1 .cse3 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse30 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0)) .cse21 .cse23 .cse24 .cse26 .cse27 .cse31 .cse28 .cse32))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6))))) .cse7 .cse8 .cse34 .cse35 (let ((.cse39 (select (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse36 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse38 (<= (* 4294967296 (div (+ .cse39 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse42 4294967296)) 4294967296)) .cse39)) (.cse40 (<= .cse41 ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and .cse5 .cse9 .cse17 .cse18 .cse6 .cse23 .cse24 .cse28) (and .cse36 .cse7 .cse8 .cse9 .cse35 .cse14 .cse37 .cse15 .cse17 .cse18 .cse38 (<= .cse39 (* 4294967296 (div .cse39 4294967296))) .cse21 .cse22 .cse23 .cse24 .cse26 .cse40 .cse31) (and .cse36 .cse7 .cse8 .cse9 .cse10 .cse11 .cse35 .cse14 .cse37 .cse15 .cse17 .cse18 .cse19 .cse38 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse40 .cse31)))) .cse43 .cse17 .cse21 (let ((.cse44 (= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse45 (or (let ((.cse52 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse51 (select .cse52 12))) (and .cse7 .cse8 .cse17 .cse29 .cse21 .cse23 (let ((.cse50 (select .cse52 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (<= .cse50 (+ (* 4294967296 (div (+ (* (div .cse50 4294967296) 4294967296) 4294967295 (* .cse51 (- 1))) 4294967296)) .cse51))) .cse24 (<= .cse51 (+ (* 4294967296 (div (+ (- 1) .cse51) 4294967296)) 4294967295))))) (and .cse7 .cse8 .cse17 .cse21 .cse23 .cse24 .cse53)))) (or (and .cse9 .cse10 .cse34 .cse11 .cse35 .cse2 .cse44 .cse43 .cse15 .cse18 .cse19 .cse20 .cse22 .cse45 .cse46 .cse47 .cse25 .cse26 .cse28) (and .cse5 .cse9 .cse18 .cse6 .cse45 .cse28) (and .cse9 .cse10 .cse11 .cse35 .cse2 (let ((.cse48 (select .cse49 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= .cse48 (* 4294967296 (div .cse48 4294967296)))) .cse44 .cse15 .cse18 .cse19 .cse4 .cse20 .cse22 .cse45 .cse47 .cse25 .cse26 .cse31 .cse28))) .cse46 .cse47 .cse24 (let ((.cse61 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse56 (select .cse61 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse54 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse55 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse58 (let ((.cse60 (select .cse61 12))) (<= .cse60 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse60) 4294967296)))))) (.cse57 (div .cse56 4294967296))) (or (and .cse54 .cse7 .cse8 .cse55 .cse35 .cse14 .cse37 .cse21 (<= .cse56 (* 4294967296 .cse57)) .cse46 .cse58 .cse23 .cse24 .cse31) (and .cse54 .cse7 .cse8 .cse55 .cse35 .cse14 .cse37 .cse30 .cse21 .cse46 .cse58 .cse23 .cse24 (<= .cse56 (let ((.cse59 (select .cse49 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse59 (- 1)) (* .cse57 4294967296) 4294967295) 4294967296)) .cse59))) .cse31) (and .cse17 .cse23 .cse24 .cse53)))))))) [2021-07-05 16:59:01,480 INFO L762 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:59:01,480 INFO L762 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:59:01,480 INFO L762 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:59:01,480 INFO L762 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:59:01,480 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,480 INFO L762 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:59:01,480 INFO L762 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:59:01,480 INFO L762 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:59:01,480 INFO L762 garLoopResultBuilder]: For program point L222-7(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:59:01,480 INFO L762 garLoopResultBuilder]: For program point L222-8(lines 7162 7172) no Hoare annotation was computed. [2021-07-05 16:59:01,480 INFO L762 garLoopResultBuilder]: For program point L222-9(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:59:01,480 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 16:59:01,480 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,480 INFO L762 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,481 INFO L762 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,481 INFO L762 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,481 INFO L762 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,481 INFO L762 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,481 INFO L762 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,481 INFO L762 garLoopResultBuilder]: For program point L8184(lines 8184 8187) no Hoare annotation was computed. [2021-07-05 16:59:01,481 INFO L762 garLoopResultBuilder]: For program point L7160(lines 7160 7173) no Hoare annotation was computed. [2021-07-05 16:59:01,481 INFO L762 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,481 INFO L762 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,481 INFO L762 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,481 INFO L762 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,481 INFO L762 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,481 INFO L762 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,481 INFO L762 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,481 INFO L762 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,481 INFO L762 garLoopResultBuilder]: For program point L223-21(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,481 INFO L762 garLoopResultBuilder]: For program point L223-22(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,481 INFO L762 garLoopResultBuilder]: For program point L223-24(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,481 INFO L762 garLoopResultBuilder]: For program point L223-25(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,481 INFO L762 garLoopResultBuilder]: For program point L7491-1(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:01,482 INFO L762 garLoopResultBuilder]: For program point L7491(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,482 INFO L762 garLoopResultBuilder]: For program point L223-27(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,482 INFO L762 garLoopResultBuilder]: For program point L223-28(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,482 INFO L762 garLoopResultBuilder]: For program point L7491-4(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:01,482 INFO L762 garLoopResultBuilder]: For program point L7491-3(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:01,482 INFO L762 garLoopResultBuilder]: For program point L7491-9(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,482 INFO L762 garLoopResultBuilder]: For program point L7491-7(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,482 INFO L762 garLoopResultBuilder]: For program point L7491-6(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:01,482 INFO L762 garLoopResultBuilder]: For program point L7491-13(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,482 INFO L758 garLoopResultBuilder]: At program point L7491-12(lines 7489 7495) the Hoare annotation is: (let ((.cse28 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse27 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse13 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse28)) (.cse15 (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse28))) (let ((.cse3 (= .cse15 0)) (.cse4 (= .cse13 0)) (.cse16 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse7 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse17 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0)) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse12 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse25 (select .cse27 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (let ((.cse14 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse22 (let ((.cse26 (select .cse27 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= .cse26 (+ (* 4294967296 (div (+ (* (div .cse26 4294967296) 4294967296) (* .cse25 (- 1)) 4294967295) 4294967296)) .cse25)))) (.cse2 (and .cse16 .cse0 .cse1 .cse5 .cse7 .cse17 .cse8 .cse9 .cse10 .cse12)) (.cse18 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse19 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse21 (<= .cse25 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse25) 4294967296))))) (.cse24 (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12))) (and .cse0 .cse1 (let ((.cse6 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse11 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or .cse2 (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| .cse13) .cse5 .cse14 (= .cse15 |~#s_can_fail_allocator_static~0.base|) .cse6 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) .cse5 (let ((.cse20 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse16 .cse0 .cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse7 .cse17 .cse8 .cse10 .cse12) (and .cse18 .cse0 .cse3 .cse1 .cse19 .cse4 .cse5 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse22 .cse12) (and .cse18 .cse0 .cse1 .cse19 .cse5 .cse14 .cse20 .cse7 .cse21 .cse8 .cse9 .cse10 .cse22 .cse12))) .cse7 .cse8 .cse9 .cse10 (or (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse14 .cse7 .cse8 .cse9 .cse10 .cse12) .cse2 (and .cse0 .cse1 .cse5 .cse14 (let ((.cse23 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (<= .cse23 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse23) 4294967296))))) .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse18 .cse0 .cse1 .cse19 .cse5 .cse14 .cse7 .cse8 .cse9 .cse10 .cse12)) (or .cse2 (and .cse18 .cse0 .cse1 .cse19 .cse5 .cse7 .cse21 .cse8 .cse9 .cse10 .cse22 .cse12) .cse24) (or .cse2 (and .cse18 .cse0 .cse1 .cse19 .cse5 .cse7 .cse21 .cse8 .cse9 .cse10 .cse12) .cse24) .cse12))))) [2021-07-05 16:59:01,482 INFO L762 garLoopResultBuilder]: For program point L7491-11(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,482 INFO L762 garLoopResultBuilder]: For program point L7491-17(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:01,482 INFO L762 garLoopResultBuilder]: For program point L7491-16(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:01,482 INFO L762 garLoopResultBuilder]: For program point L7491-14(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:01,482 INFO L762 garLoopResultBuilder]: For program point L7491-20(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,482 INFO L762 garLoopResultBuilder]: For program point L7491-19(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:01,483 INFO L758 garLoopResultBuilder]: At program point L7491-25(lines 7489 7495) the Hoare annotation is: (let ((.cse38 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse30 (select .cse38 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse40 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse41 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse26 (select .cse41 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse17 (select .cse41 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse34 (select .cse40 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse39 (select .cse40 12)) (.cse33 (div .cse30 4294967296)) (.cse0 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse3 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse5 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0))) (.cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0))) (.cse7 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse8 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0)) (.cse9 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse10 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse12 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse14 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (let ((.cse27 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse23 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse15 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse21 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse22 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse16 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse20 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse28 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse29 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse24 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14)) (.cse31 (* .cse33 4294967296)) (.cse11 (<= .cse34 (+ (* 4294967296 (div (+ (* (div .cse34 4294967296) 4294967296) 4294967295 (* .cse39 (- 1))) 4294967296)) .cse39))) (.cse13 (<= .cse39 (+ (* 4294967296 (div (+ (- 1) .cse39) 4294967296)) 4294967295))) (.cse18 (div .cse17 4294967296)) (.cse25 (* .cse26 (- 1)))) (and (let ((.cse19 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse16 (<= .cse17 (* 4294967296 .cse18)) .cse19 .cse20 .cse6 .cse7 .cse9 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse23 .cse15 .cse16 .cse19 .cse20 .cse6 .cse7 .cse9 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14))) (or .cse24 (and .cse1 (<= (* 4294967296 (div (+ (* (div (+ .cse25 4294967295 .cse17) 4294967296) 4294967296) .cse26) 4294967296)) .cse17) .cse2 .cse15 .cse16 .cse3 .cse27 .cse4 .cse6 .cse9 .cse10 .cse12 .cse14)) (or (and .cse28 .cse1 .cse2 .cse29 .cse15 .cse3 .cse27 .cse4 .cse6 .cse9 .cse10 .cse12 .cse13 (<= .cse30 (+ (* 4294967296 (div (+ .cse25 .cse31 4294967295) 4294967296)) .cse26)) .cse14) .cse24) (or (and .cse1 .cse2 .cse23 .cse15 .cse20 .cse7 .cse9 .cse21 .cse22 .cse12 .cse14) .cse24) (or (and .cse1 .cse2 .cse16 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse3 .cse20 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse4 .cse6 .cse7 .cse9 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 16) |~#s_can_fail_allocator_static~0.offset|) .cse12 (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse14) .cse24) (let ((.cse32 (let ((.cse37 (select .cse38 12))) (let ((.cse35 (<= .cse37 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse37) 4294967296))))) (.cse36 (<= .cse26 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse26) 4294967296)))))) (or (and .cse1 .cse2 (<= (* 4294967296 (div (+ .cse34 4294967295) 4294967296)) .cse34) (<= (* 4294967296 (div (+ 4294967295 .cse17) 4294967296)) .cse17) (<= (* 4294967296 (div (+ .cse30 4294967295) 4294967296)) .cse30) .cse3 .cse35 .cse4 .cse5 .cse6 .cse7 .cse36 .cse9 .cse10 .cse12 .cse13 .cse14) (and (<= .cse17 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse17) 4294967296)))) .cse1 .cse2 (<= .cse30 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse30) 4294967296)))) .cse3 (<= .cse34 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse34) 4294967296)))) .cse35 .cse4 .cse5 .cse6 .cse7 .cse36 (<= .cse30 (+ .cse37 (* 4294967296 (div (+ .cse31 4294967295 (* .cse37 (- 1))) 4294967296)))) .cse9 .cse10 .cse11 .cse12 .cse13 (<= .cse17 (+ (* 4294967296 (div (+ (* .cse18 4294967296) .cse25 4294967295) 4294967296)) .cse26)) .cse14)))))) (or (and .cse32 (<= .cse30 (* 4294967296 .cse33))) (and .cse28 .cse29 .cse32) .cse24))))))) [2021-07-05 16:59:01,483 INFO L762 garLoopResultBuilder]: For program point L7491-24(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,483 INFO L762 garLoopResultBuilder]: For program point L7491-22(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,483 INFO L762 garLoopResultBuilder]: For program point L7491-29(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:01,483 INFO L762 garLoopResultBuilder]: For program point L7491-27(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:01,483 INFO L762 garLoopResultBuilder]: For program point L7491-26(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,483 INFO L762 garLoopResultBuilder]: For program point L7491-33(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,483 INFO L762 garLoopResultBuilder]: For program point L7491-32(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:01,483 INFO L762 garLoopResultBuilder]: For program point L7491-30(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:01,483 INFO L762 garLoopResultBuilder]: For program point L7491-37(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,483 INFO L762 garLoopResultBuilder]: For program point L7491-35(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,483 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,483 INFO L762 garLoopResultBuilder]: For program point L7491-40(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:01,483 INFO L762 garLoopResultBuilder]: For program point L7491-39(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,484 INFO L758 garLoopResultBuilder]: At program point L7491-38(lines 7489 7495) the Hoare annotation is: (let ((.cse9 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse12 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0))) (.cse13 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0))) (.cse4 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse5 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse14 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (let ((.cse10 (and (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 .cse2 .cse3 .cse12 .cse13 .cse4 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse5 .cse14 .cse6 .cse7)) (.cse16 (select .cse9 12))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 (or (and .cse0 .cse1 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse8 (select .cse9 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse8 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse8 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) 4294967296)) 4294967295)))) .cse10) .cse1 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (or .cse10 (let ((.cse11 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse11)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse11) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse2 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse3 .cse12 .cse13 .cse4 .cse5 .cse14 .cse6 (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse7))) .cse3 .cse13 .cse5 .cse14 (let ((.cse15 (select .cse9 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (<= .cse15 (+ (* 4294967296 (div (+ (* (div .cse15 4294967296) 4294967296) 4294967295 (* .cse16 (- 1))) 4294967296)) .cse16))) .cse6 (<= .cse16 (+ (* 4294967296 (div (+ (- 1) .cse16) 4294967296)) 4294967295))))) [2021-07-05 16:59:01,484 INFO L762 garLoopResultBuilder]: For program point L7491-45(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:01,484 INFO L762 garLoopResultBuilder]: For program point L7491-43(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:01,484 INFO L762 garLoopResultBuilder]: For program point L7491-42(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:01,484 INFO L762 garLoopResultBuilder]: For program point L7491-48(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,484 INFO L762 garLoopResultBuilder]: For program point L7491-46(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,484 INFO L762 garLoopResultBuilder]: For program point L7491-53(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:01,484 INFO L762 garLoopResultBuilder]: For program point L7491-52(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,484 INFO L758 garLoopResultBuilder]: At program point L7491-51(lines 7489 7495) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse1 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse0 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) .cse1 (let ((.cse10 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse7 (select .cse10 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (let ((.cse8 (div .cse7 4294967296)) (.cse9 (select .cse10 12))) (let ((.cse2 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse3 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse4 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse5 (<= .cse7 (+ (* 4294967296 (div (+ (* .cse8 4294967296) 4294967295 (* .cse9 (- 1))) 4294967296)) .cse9))) (.cse6 (<= .cse9 (+ (* 4294967296 (div (+ (- 1) .cse9) 4294967296)) 4294967295)))) (or (and .cse2 .cse3 .cse0 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse4 .cse5 .cse1 .cse6) (and .cse2 .cse3 (<= .cse7 (* 4294967296 .cse8)) .cse0 .cse4 .cse5 .cse1 .cse6)))))))) [2021-07-05 16:59:01,484 INFO L762 garLoopResultBuilder]: For program point L7491-50(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,484 INFO L762 garLoopResultBuilder]: For program point L7491-56(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:01,484 INFO L762 garLoopResultBuilder]: For program point L7491-55(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:01,484 INFO L762 garLoopResultBuilder]: For program point L7491-61(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,484 INFO L762 garLoopResultBuilder]: For program point L7491-59(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,485 INFO L762 garLoopResultBuilder]: For program point L7491-58(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:01,485 INFO L762 garLoopResultBuilder]: For program point L7491-65(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,485 INFO L758 garLoopResultBuilder]: At program point L7491-64(lines 7489 7495) the Hoare annotation is: (let ((.cse33 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse34 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0)) (.cse15 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse19 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse20 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (let ((.cse25 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse26 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse16 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse11 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse22 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse24 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse4 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse6 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse28 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse40 (and .cse33 .cse0 .cse1 .cse10 .cse34 .cse15 .cse19 .cse20)) (.cse27 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse29 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse17 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse30 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) (.cse32 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (and (let ((.cse35 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse18 (let ((.cse36 (select .cse35 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (<= (+ (* 4294967296 (div .cse36 4294967296)) 1) .cse36))) (.cse23 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse7 (select .cse35 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse3 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse8 (= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse12 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse14 (not (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0))) (.cse21 (not (= |ULTIMATE.start_can_fail_realloc_#res.base| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= .cse7 (* 4294967296 (div .cse7 4294967296))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (let ((.cse31 (select .cse32 12))) (and .cse25 .cse0 .cse1 .cse2 .cse26 .cse3 .cse27 .cse4 .cse5 .cse6 .cse8 .cse28 .cse29 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= (* 4294967296 (div (+ 4294967295 .cse30 .cse7 (* .cse31 (- 1))) 4294967296)) .cse7) (<= .cse31 ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) .cse24)) (and .cse33 .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse28 .cse9 .cse10 .cse11 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0)) .cse12 .cse34 .cse14 .cse15 .cse16 .cse19 .cse20 .cse21 .cse22 .cse24)))) .cse25 .cse26 (or (let ((.cse39 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and (let ((.cse37 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse38 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse37 .cse10 .cse11 .cse15 .cse16 .cse19 .cse20 .cse22 .cse38 .cse24) (and .cse0 .cse1 .cse2 .cse37 .cse10 .cse11 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse15 .cse19 .cse20 .cse22 .cse38 .cse24))) .cse4 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse39)) .cse6 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse39) |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse28 .cse9 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse13)) .cse40) .cse10 .cse19 .cse20 (or .cse40 (and .cse0 .cse1 .cse27 .cse5 .cse29 .cse10 .cse15 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) .cse17 .cse19 .cse20 (let ((.cse41 (select .cse32 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse41 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse41 .cse30) 4294967296)) 4294967295)))))))) [2021-07-05 16:59:01,485 INFO L762 garLoopResultBuilder]: For program point L7491-63(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,485 INFO L762 garLoopResultBuilder]: For program point L7491-69(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:01,485 INFO L762 garLoopResultBuilder]: For program point L7491-68(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:01,485 INFO L762 garLoopResultBuilder]: For program point L7491-66(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:01,485 INFO L762 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2021-07-05 16:59:01,485 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 16:59:01,485 INFO L762 garLoopResultBuilder]: For program point L7491-72(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,485 INFO L762 garLoopResultBuilder]: For program point L7491-71(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:01,485 INFO L758 garLoopResultBuilder]: At program point L7491-77(lines 7489 7495) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) [2021-07-05 16:59:01,485 INFO L762 garLoopResultBuilder]: For program point L7491-76(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,485 INFO L762 garLoopResultBuilder]: For program point L7491-74(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,485 INFO L762 garLoopResultBuilder]: For program point L9145(lines 9145 9148) no Hoare annotation was computed. [2021-07-05 16:59:01,485 INFO L762 garLoopResultBuilder]: For program point L9145-2(lines 9145 9148) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L7494(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L7494-4(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L7494-3(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L7494-2(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L7494-8(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L7494-6(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L7494-12(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L7494-11(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L7494-9(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L6966(lines 6966 6972) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L7494-15(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L7494-13(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L7494-20(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L7494-18(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L7494-17(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L7494-24(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L7494-22(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L7494-21(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L7494-27(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L7494-26(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,486 INFO L762 garLoopResultBuilder]: For program point L7494-31(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,487 INFO L762 garLoopResultBuilder]: For program point L7494-30(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,487 INFO L762 garLoopResultBuilder]: For program point L7494-29(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,487 INFO L758 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2021-07-05 16:59:01,487 INFO L762 garLoopResultBuilder]: For program point L7494-36(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,487 INFO L758 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: false [2021-07-05 16:59:01,487 INFO L762 garLoopResultBuilder]: For program point L7494-35(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,487 INFO L758 garLoopResultBuilder]: At program point L261-2(line 261) the Hoare annotation is: (let ((.cse46 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse43 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse32 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse41 (select .cse46 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse30 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse44 (+ |#StackHeapBarrier| 1))) (let ((.cse5 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse3 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse7 (<= .cse44 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse21 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse4 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse8 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse11 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse17 (select .cse46 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse6 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse10 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse29 (select .cse30 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse12 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse13 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0))) (.cse14 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse16 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0))) (.cse19 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse20 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse23 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse25 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse40 (* .cse41 (- 1))) (.cse42 (select .cse32 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse26 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse27 (<= (+ (* 4294967296 .cse43) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 .cse2 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse3 .cse4 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse5)) .cse6 .cse7 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse5) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) .cse12 .cse13 .cse14 .cse15 .cse16 (let ((.cse28 (select .cse30 12))) (let ((.cse18 (= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse22 (<= .cse29 (+ (* 4294967296 (div (+ (* (div .cse29 4294967296) 4294967296) 4294967295 (* .cse28 (- 1))) 4294967296)) .cse28))) (.cse24 (<= .cse28 (+ (* 4294967296 (div (+ (- 1) .cse28) 4294967296)) 4294967295)))) (or (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 (<= .cse17 (* 4294967296 (div .cse17 4294967296))) .cse18 .cse11 .cse12 .cse15 .cse16 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse18 .cse9 .cse11 .cse12 .cse16 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27)))) .cse19 .cse20 .cse21 (let ((.cse31 (select .cse32 12))) (<= .cse31 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse31) 4294967296))))) .cse23 .cse25 (let ((.cse34 (select (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse33 (let ((.cse45 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse35 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse36 (not (= (select .cse45 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 4)) 0))) (.cse37 (not (= (select .cse45 4) 0))) (.cse38 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse39 (<= .cse44 ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and .cse35 .cse0 .cse1 .cse2 (<= (* 4294967296 (div (+ .cse29 4294967295) 4294967296)) .cse29) .cse6 .cse10 .cse36 .cse12 .cse37 .cse13 .cse14 .cse16 .cse19 (<= (* 4294967296 (div (+ 4294967295 .cse34) 4294967296)) .cse34) .cse20 .cse38 .cse23 .cse25 .cse39 .cse26 .cse27) (and .cse35 .cse0 (<= (* 4294967296 (div (+ (* (div (+ .cse40 4294967295 .cse17) 4294967296) 4294967296) .cse41) 4294967296)) .cse17) .cse1 .cse2 .cse6 (<= .cse42 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse42) 4294967296)))) .cse10 (<= .cse29 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse29) 4294967296)))) .cse36 .cse12 .cse37 (<= (* 4294967296 (div (+ .cse34 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse43 4294967296)) 4294967296)) .cse34) .cse13 .cse14 .cse16 .cse19 .cse20 .cse38 .cse23 .cse25 .cse39 .cse26 .cse27)))))) (or (and .cse4 .cse33 .cse8 .cse11) (and .cse33 .cse8 .cse11 (<= .cse34 (* 4294967296 (div .cse34 4294967296))))))) (<= .cse42 (+ (* 4294967296 (div (+ .cse40 (* (div .cse42 4294967296) 4294967296) 4294967295) 4294967296)) .cse41)) (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse26 .cse27)))) [2021-07-05 16:59:01,487 INFO L762 garLoopResultBuilder]: For program point L7494-33(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,487 INFO L762 garLoopResultBuilder]: For program point L7494-40(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,487 INFO L762 garLoopResultBuilder]: For program point L7494-39(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,487 INFO L762 garLoopResultBuilder]: For program point L7494-38(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,487 INFO L762 garLoopResultBuilder]: For program point L7494-44(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,487 INFO L762 garLoopResultBuilder]: For program point L7494-42(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,488 INFO L762 garLoopResultBuilder]: For program point L7494-48(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,488 INFO L762 garLoopResultBuilder]: For program point L7494-47(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,488 INFO L762 garLoopResultBuilder]: For program point L7494-45(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,488 INFO L762 garLoopResultBuilder]: For program point L7494-51(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,488 INFO L762 garLoopResultBuilder]: For program point L7494-49(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,488 INFO L762 garLoopResultBuilder]: For program point L7494-53(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:01,488 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 16:59:01,488 INFO L762 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2021-07-05 16:59:01,488 INFO L758 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: (let ((.cse34 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse36 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse29 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse19 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse28 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse24 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse3 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse16 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse17 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse20 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse21 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse22 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse23 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse25 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse12 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse27 (select .cse36 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse26 (<= (+ (* 4294967296 .cse34) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (let ((.cse10 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)))) (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse14 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse5 .cse6 .cse7 .cse8 (let ((.cse13 (select .cse14 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (<= .cse13 (* 4294967296 (div .cse13 4294967296)))) .cse9 (let ((.cse15 (select .cse14 12))) (<= .cse15 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse15) 4294967296))))) .cse10 .cse11 .cse12)))) (let ((.cse18 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse8 .cse23 .cse9 .cse24 .cse11 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse17 (<= .cse27 (* 4294967296 (div .cse27 4294967296))) .cse18 .cse20 .cse22 .cse28 .cse8 .cse23 .cse9 .cse24 .cse11 .cse25 .cse12 .cse26))) .cse16 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse29)) .cse5 .cse17 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse29) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse6 .cse19 .cse20 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse21 .cse22 .cse28 .cse8 .cse23 .cse9 .cse24 .cse11 .cse25 (<= |~#s_can_fail_allocator_static~0.offset| 0) (let ((.cse33 (select (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse30 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse31 (<= (* 4294967296 (div (let ((.cse35 (select .cse36 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* (div (+ (* .cse35 (- 1)) 4294967295 .cse27) 4294967296) 4294967296) .cse35)) 4294967296)) .cse27)) (.cse32 (<= (* 4294967296 (div (+ .cse33 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse34 4294967296)) 4294967296)) .cse33))) (or (and .cse30 .cse0 .cse31 .cse1 .cse2 .cse3 .cse16 .cse5 .cse17 .cse6 .cse7 .cse20 .cse21 .cse22 .cse32 .cse8 .cse23 .cse11 .cse25 .cse12) (and .cse30 .cse0 .cse31 .cse1 .cse2 .cse5 .cse17 .cse6 .cse7 .cse20 .cse21 .cse22 .cse32 (<= .cse33 (* 4294967296 (div .cse33 4294967296))) .cse8 .cse23 .cse11 .cse25 .cse12)))) .cse26))) [2021-07-05 16:59:01,488 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:59:01,488 INFO L758 garLoopResultBuilder]: At program point L8192(lines 8175 8193) the Hoare annotation is: (let ((.cse5 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (let ((.cse0 (and (<= (+ |ULTIMATE.start_aws_byte_buf_reserve_#res| 1) 0) .cse5)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse4 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse7 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (and (or .cse0 (and .cse1 .cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse5 (let ((.cse6 (select .cse7 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse6 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse6 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) 4294967296)) 4294967295))))) (or (let ((.cse8 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and .cse1 .cse2 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse8)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse8) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse3 .cse4 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) .cse5 (<= |~#s_can_fail_allocator_static~0.offset| 0))) .cse0) (let ((.cse11 (select .cse7 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (let ((.cse12 (div .cse11 4294967296)) (.cse13 (select .cse7 12))) (let ((.cse9 (<= .cse11 (+ (* 4294967296 (div (+ (* .cse12 4294967296) 4294967295 (* .cse13 (- 1))) 4294967296)) .cse13))) (.cse10 (<= .cse13 (+ (* 4294967296 (div (+ (- 1) .cse13) 4294967296)) 4294967295)))) (or (and .cse1 .cse2 .cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse4 .cse9 .cse5 .cse10) (and .cse1 .cse2 (<= .cse11 (* 4294967296 .cse12)) .cse3 .cse4 .cse9 .cse5 .cse10)))))))) [2021-07-05 16:59:01,488 INFO L765 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: true [2021-07-05 16:59:01,489 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable274 [2021-07-05 16:59:01,489 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 16:59:01,489 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION was SAFE (6/10) [2021-07-05 16:59:01,490 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 16:59:01,490 INFO L329 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 16:59:01,490 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 16:59:01,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 200 states have internal predecessors, (281), 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-07-05 16:59:01,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-07-05 16:59:01,492 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:01,492 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:01,492 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:01,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:01,493 INFO L82 PathProgramCache]: Analyzing trace with hash 831215442, now seen corresponding path program 1 times [2021-07-05 16:59:01,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:01,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171744918] [2021-07-05 16:59:01,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:01,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:01,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:01,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:01,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:01,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:01,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:01,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171744918] [2021-07-05 16:59:01,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171744918] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:01,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:01,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 16:59:01,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625806112] [2021-07-05 16:59:01,572 INFO L425 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-05 16:59:01,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:01,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-05 16:59:01,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-05 16:59:01,572 INFO L87 Difference]: Start difference. First operand has 201 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 200 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-07-05 16:59:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:01,574 INFO L93 Difference]: Finished difference Result 395 states and 553 transitions. [2021-07-05 16:59:01,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-05 16:59:01,574 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-07-05 16:59:01,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:01,575 INFO L225 Difference]: With dead ends: 395 [2021-07-05 16:59:01,575 INFO L226 Difference]: Without dead ends: 166 [2021-07-05 16:59:01,575 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-05 16:59:01,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-07-05 16:59:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2021-07-05 16:59:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.3393939393939394) internal successors, (221), 165 states have internal predecessors, (221), 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-07-05 16:59:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 221 transitions. [2021-07-05 16:59:01,577 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 221 transitions. Word has length 28 [2021-07-05 16:59:01,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:01,577 INFO L442 AbstractCegarLoop]: Abstraction has 166 states and 221 transitions. [2021-07-05 16:59:01,578 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-07-05 16:59:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 221 transitions. [2021-07-05 16:59:01,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-07-05 16:59:01,578 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:01,578 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:01,578 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable299 [2021-07-05 16:59:01,578 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:01,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:01,579 INFO L82 PathProgramCache]: Analyzing trace with hash -974222892, now seen corresponding path program 1 times [2021-07-05 16:59:01,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:01,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127058853] [2021-07-05 16:59:01,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:01,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:01,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:01,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:01,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:01,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:59:01,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:01,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-07-05 16:59:01,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:01,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:01,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:01,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:01,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127058853] [2021-07-05 16:59:01,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127058853] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:01,681 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:01,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:59:01,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270358003] [2021-07-05 16:59:01,681 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:59:01,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:01,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:59:01,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:59:01,681 INFO L87 Difference]: Start difference. First operand 166 states and 221 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-07-05 16:59:01,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:01,738 INFO L93 Difference]: Finished difference Result 309 states and 411 transitions. [2021-07-05 16:59:01,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:59:01,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-07-05 16:59:01,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:01,739 INFO L225 Difference]: With dead ends: 309 [2021-07-05 16:59:01,739 INFO L226 Difference]: Without dead ends: 166 [2021-07-05 16:59:01,739 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:59:01,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-07-05 16:59:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2021-07-05 16:59:01,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.3272727272727274) internal successors, (219), 165 states have internal predecessors, (219), 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-07-05 16:59:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 219 transitions. [2021-07-05 16:59:01,741 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 219 transitions. Word has length 28 [2021-07-05 16:59:01,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:01,741 INFO L442 AbstractCegarLoop]: Abstraction has 166 states and 219 transitions. [2021-07-05 16:59:01,741 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-07-05 16:59:01,741 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 219 transitions. [2021-07-05 16:59:01,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-07-05 16:59:01,741 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:01,741 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:01,741 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable300 [2021-07-05 16:59:01,741 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:01,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:01,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1432771644, now seen corresponding path program 1 times [2021-07-05 16:59:01,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:01,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005135227] [2021-07-05 16:59:01,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:01,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:01,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:01,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:01,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:01,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:59:01,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:01,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:59:01,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:01,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:01,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:01,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:01,833 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005135227] [2021-07-05 16:59:01,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005135227] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:01,834 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:01,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:59:01,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517563637] [2021-07-05 16:59:01,834 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:59:01,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:01,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:59:01,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:59:01,834 INFO L87 Difference]: Start difference. First operand 166 states and 219 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:59:01,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:01,956 INFO L93 Difference]: Finished difference Result 450 states and 607 transitions. [2021-07-05 16:59:01,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:59:01,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-07-05 16:59:01,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:01,956 INFO L225 Difference]: With dead ends: 450 [2021-07-05 16:59:01,957 INFO L226 Difference]: Without dead ends: 298 [2021-07-05 16:59:01,957 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:59:01,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-07-05 16:59:01,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 178. [2021-07-05 16:59:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.305084745762712) internal successors, (231), 177 states have internal predecessors, (231), 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-07-05 16:59:01,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 231 transitions. [2021-07-05 16:59:01,959 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 231 transitions. Word has length 40 [2021-07-05 16:59:01,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:01,959 INFO L442 AbstractCegarLoop]: Abstraction has 178 states and 231 transitions. [2021-07-05 16:59:01,959 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:59:01,959 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 231 transitions. [2021-07-05 16:59:01,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-07-05 16:59:01,959 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:01,959 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:01,959 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable301 [2021-07-05 16:59:01,959 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:01,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:01,960 INFO L82 PathProgramCache]: Analyzing trace with hash 923298554, now seen corresponding path program 1 times [2021-07-05 16:59:01,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:01,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233039594] [2021-07-05 16:59:01,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:01,960 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:02,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:02,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:02,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:02,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:59:02,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:02,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:59:02,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:02,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:02,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:02,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233039594] [2021-07-05 16:59:02,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233039594] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:02,054 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:02,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:59:02,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034538545] [2021-07-05 16:59:02,055 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:59:02,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:02,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:59:02,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:59:02,055 INFO L87 Difference]: Start difference. First operand 178 states and 231 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:59:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:02,192 INFO L93 Difference]: Finished difference Result 392 states and 515 transitions. [2021-07-05 16:59:02,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:59:02,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-07-05 16:59:02,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:02,193 INFO L225 Difference]: With dead ends: 392 [2021-07-05 16:59:02,193 INFO L226 Difference]: Without dead ends: 238 [2021-07-05 16:59:02,194 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:59:02,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-07-05 16:59:02,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 190. [2021-07-05 16:59:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.2857142857142858) internal successors, (243), 189 states have internal predecessors, (243), 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-07-05 16:59:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 243 transitions. [2021-07-05 16:59:02,196 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 243 transitions. Word has length 40 [2021-07-05 16:59:02,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:02,196 INFO L442 AbstractCegarLoop]: Abstraction has 190 states and 243 transitions. [2021-07-05 16:59:02,197 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:59:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 243 transitions. [2021-07-05 16:59:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-07-05 16:59:02,197 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:02,197 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:02,197 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable302 [2021-07-05 16:59:02,198 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:02,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:02,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1410139390, now seen corresponding path program 1 times [2021-07-05 16:59:02,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:02,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707195752] [2021-07-05 16:59:02,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:02,199 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:03,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:03,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:03,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:03,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-07-05 16:59:03,839 INFO L142 QuantifierPusher]: treesize reduction 30, result has 34.8 percent of original size [2021-07-05 16:59:03,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-07-05 16:59:03,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:03,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:03,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:03,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-05 16:59:03,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:03,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:59:03,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:03,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:03,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:03,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:03,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707195752] [2021-07-05 16:59:03,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707195752] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:03,871 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:03,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:59:03,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451195636] [2021-07-05 16:59:03,872 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:59:03,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:03,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:59:03,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:59:03,872 INFO L87 Difference]: Start difference. First operand 190 states and 243 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:59:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:06,263 INFO L93 Difference]: Finished difference Result 261 states and 330 transitions. [2021-07-05 16:59:06,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:59:06,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-07-05 16:59:06,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:06,264 INFO L225 Difference]: With dead ends: 261 [2021-07-05 16:59:06,264 INFO L226 Difference]: Without dead ends: 173 [2021-07-05 16:59:06,264 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 69.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:59:06,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-07-05 16:59:06,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2021-07-05 16:59:06,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.2616279069767442) internal successors, (217), 172 states have internal predecessors, (217), 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-07-05 16:59:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 217 transitions. [2021-07-05 16:59:06,266 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 217 transitions. Word has length 40 [2021-07-05 16:59:06,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:06,266 INFO L442 AbstractCegarLoop]: Abstraction has 173 states and 217 transitions. [2021-07-05 16:59:06,266 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:59:06,266 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 217 transitions. [2021-07-05 16:59:06,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-07-05 16:59:06,266 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:06,266 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:06,266 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable303 [2021-07-05 16:59:06,266 INFO L374 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:06,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:06,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1694567555, now seen corresponding path program 1 times [2021-07-05 16:59:06,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:06,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146449057] [2021-07-05 16:59:06,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:06,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:06,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:06,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:59:06,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:59:06,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:59:06,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:59:06,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:06,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:06,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:06,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:06,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146449057] [2021-07-05 16:59:06,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146449057] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:06,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:06,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:59:06,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595088336] [2021-07-05 16:59:06,404 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:59:06,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:06,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:59:06,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:59:06,405 INFO L87 Difference]: Start difference. First operand 173 states and 217 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:59:06,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:06,498 INFO L93 Difference]: Finished difference Result 294 states and 368 transitions. [2021-07-05 16:59:06,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:59:06,498 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-07-05 16:59:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:06,499 INFO L225 Difference]: With dead ends: 294 [2021-07-05 16:59:06,499 INFO L226 Difference]: Without dead ends: 173 [2021-07-05 16:59:06,499 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 62.4ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-07-05 16:59:06,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-07-05 16:59:06,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2021-07-05 16:59:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.244186046511628) internal successors, (214), 172 states have internal predecessors, (214), 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-07-05 16:59:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 214 transitions. [2021-07-05 16:59:06,501 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 214 transitions. Word has length 69 [2021-07-05 16:59:06,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:06,501 INFO L442 AbstractCegarLoop]: Abstraction has 173 states and 214 transitions. [2021-07-05 16:59:06,501 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:59:06,501 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 214 transitions. [2021-07-05 16:59:06,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-07-05 16:59:06,501 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:06,501 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:06,502 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable304 [2021-07-05 16:59:06,502 INFO L374 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:06,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:06,502 INFO L82 PathProgramCache]: Analyzing trace with hash 996907975, now seen corresponding path program 1 times [2021-07-05 16:59:06,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:06,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542687693] [2021-07-05 16:59:06,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:06,502 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:06,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:06,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:59:06,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:59:06,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:06,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:06,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542687693] [2021-07-05 16:59:06,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542687693] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:06,622 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:06,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:59:06,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123866738] [2021-07-05 16:59:06,623 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:59:06,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:06,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:59:06,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:59:06,624 INFO L87 Difference]: Start difference. First operand 173 states and 214 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-07-05 16:59:06,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:06,649 INFO L93 Difference]: Finished difference Result 231 states and 283 transitions. [2021-07-05 16:59:06,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:59:06,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-07-05 16:59:06,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:06,650 INFO L225 Difference]: With dead ends: 231 [2021-07-05 16:59:06,650 INFO L226 Difference]: Without dead ends: 206 [2021-07-05 16:59:06,650 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:59:06,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-07-05 16:59:06,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 175. [2021-07-05 16:59:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.2413793103448276) internal successors, (216), 174 states have internal predecessors, (216), 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-07-05 16:59:06,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 216 transitions. [2021-07-05 16:59:06,652 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 216 transitions. Word has length 81 [2021-07-05 16:59:06,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:06,652 INFO L442 AbstractCegarLoop]: Abstraction has 175 states and 216 transitions. [2021-07-05 16:59:06,652 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-07-05 16:59:06,652 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2021-07-05 16:59:06,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-07-05 16:59:06,652 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:06,652 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:06,653 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable305 [2021-07-05 16:59:06,653 INFO L374 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:06,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:06,653 INFO L82 PathProgramCache]: Analyzing trace with hash -501973689, now seen corresponding path program 1 times [2021-07-05 16:59:06,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:06,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350222396] [2021-07-05 16:59:06,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:06,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:06,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:06,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:59:06,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:59:06,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:06,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:06,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:06,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350222396] [2021-07-05 16:59:06,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350222396] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:06,765 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:06,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:59:06,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660056880] [2021-07-05 16:59:06,766 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:59:06,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:06,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:59:06,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:59:06,766 INFO L87 Difference]: Start difference. First operand 175 states and 216 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-07-05 16:59:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:06,788 INFO L93 Difference]: Finished difference Result 285 states and 350 transitions. [2021-07-05 16:59:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:59:06,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-07-05 16:59:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:06,789 INFO L225 Difference]: With dead ends: 285 [2021-07-05 16:59:06,789 INFO L226 Difference]: Without dead ends: 231 [2021-07-05 16:59:06,790 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:59:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-07-05 16:59:06,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 175. [2021-07-05 16:59:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.2413793103448276) internal successors, (216), 174 states have internal predecessors, (216), 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-07-05 16:59:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 216 transitions. [2021-07-05 16:59:06,792 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 216 transitions. Word has length 81 [2021-07-05 16:59:06,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:06,792 INFO L442 AbstractCegarLoop]: Abstraction has 175 states and 216 transitions. [2021-07-05 16:59:06,792 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-07-05 16:59:06,792 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2021-07-05 16:59:06,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-07-05 16:59:06,792 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:06,792 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:06,793 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable306 [2021-07-05 16:59:06,793 INFO L374 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:06,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:06,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1221594455, now seen corresponding path program 1 times [2021-07-05 16:59:06,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:06,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801676227] [2021-07-05 16:59:06,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:06,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:06,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:06,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:59:06,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:59:06,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:59:06,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:59:06,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:06,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:06,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:06,922 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801676227] [2021-07-05 16:59:06,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801676227] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:06,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:06,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-05 16:59:06,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736000927] [2021-07-05 16:59:06,923 INFO L425 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-05 16:59:06,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:06,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-05 16:59:06,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:59:06,923 INFO L87 Difference]: Start difference. First operand 175 states and 216 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:59:06,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:06,973 INFO L93 Difference]: Finished difference Result 292 states and 356 transitions. [2021-07-05 16:59:06,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:59:06,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-07-05 16:59:06,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:06,974 INFO L225 Difference]: With dead ends: 292 [2021-07-05 16:59:06,974 INFO L226 Difference]: Without dead ends: 207 [2021-07-05 16:59:06,975 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 41.0ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-07-05 16:59:06,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-07-05 16:59:06,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 147. [2021-07-05 16:59:06,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.226027397260274) internal successors, (179), 146 states have internal predecessors, (179), 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-07-05 16:59:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 179 transitions. [2021-07-05 16:59:06,977 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 179 transitions. Word has length 86 [2021-07-05 16:59:06,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:06,977 INFO L442 AbstractCegarLoop]: Abstraction has 147 states and 179 transitions. [2021-07-05 16:59:06,977 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:59:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 179 transitions. [2021-07-05 16:59:06,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-05 16:59:06,977 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:06,977 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:06,978 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable307 [2021-07-05 16:59:06,978 INFO L374 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:06,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:06,978 INFO L82 PathProgramCache]: Analyzing trace with hash -52378699, now seen corresponding path program 1 times [2021-07-05 16:59:06,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:06,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949480878] [2021-07-05 16:59:06,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:06,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:07,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:07,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:07,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:07,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-07-05 16:59:07,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:07,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:07,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:07,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:07,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949480878] [2021-07-05 16:59:07,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949480878] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:07,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:07,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 16:59:07,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712863046] [2021-07-05 16:59:07,234 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 16:59:07,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:07,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 16:59:07,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 16:59:07,235 INFO L87 Difference]: Start difference. First operand 147 states and 179 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-07-05 16:59:07,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:07,244 INFO L93 Difference]: Finished difference Result 203 states and 246 transitions. [2021-07-05 16:59:07,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 16:59:07,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-07-05 16:59:07,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:07,245 INFO L225 Difference]: With dead ends: 203 [2021-07-05 16:59:07,245 INFO L226 Difference]: Without dead ends: 141 [2021-07-05 16:59:07,245 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 16:59:07,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-07-05 16:59:07,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-07-05 16:59:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.2214285714285715) internal successors, (171), 140 states have internal predecessors, (171), 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-07-05 16:59:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 171 transitions. [2021-07-05 16:59:07,247 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 171 transitions. Word has length 87 [2021-07-05 16:59:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:07,247 INFO L442 AbstractCegarLoop]: Abstraction has 141 states and 171 transitions. [2021-07-05 16:59:07,247 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-07-05 16:59:07,247 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 171 transitions. [2021-07-05 16:59:07,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-07-05 16:59:07,247 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:07,247 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:07,247 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable308 [2021-07-05 16:59:07,247 INFO L374 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:07,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:07,248 INFO L82 PathProgramCache]: Analyzing trace with hash -34675939, now seen corresponding path program 1 times [2021-07-05 16:59:07,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:07,248 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268021271] [2021-07-05 16:59:07,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:07,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:07,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:07,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:07,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:07,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:59:07,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:07,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:59:07,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:07,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:59:07,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:07,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:07,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:07,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268021271] [2021-07-05 16:59:07,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268021271] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:07,372 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:07,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:59:07,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252190925] [2021-07-05 16:59:07,373 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:59:07,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:07,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:59:07,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:59:07,373 INFO L87 Difference]: Start difference. First operand 141 states and 171 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-07-05 16:59:07,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:07,409 INFO L93 Difference]: Finished difference Result 313 states and 377 transitions. [2021-07-05 16:59:07,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:59:07,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-07-05 16:59:07,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:07,410 INFO L225 Difference]: With dead ends: 313 [2021-07-05 16:59:07,410 INFO L226 Difference]: Without dead ends: 257 [2021-07-05 16:59:07,410 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:59:07,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-07-05 16:59:07,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 143. [2021-07-05 16:59:07,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.2183098591549295) internal successors, (173), 142 states have internal predecessors, (173), 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-07-05 16:59:07,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 173 transitions. [2021-07-05 16:59:07,412 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 173 transitions. Word has length 88 [2021-07-05 16:59:07,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:07,412 INFO L442 AbstractCegarLoop]: Abstraction has 143 states and 173 transitions. [2021-07-05 16:59:07,412 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-07-05 16:59:07,412 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 173 transitions. [2021-07-05 16:59:07,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-07-05 16:59:07,413 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:07,413 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:07,413 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable309 [2021-07-05 16:59:07,413 INFO L374 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:07,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:07,413 INFO L82 PathProgramCache]: Analyzing trace with hash 208645269, now seen corresponding path program 1 times [2021-07-05 16:59:07,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:07,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390233759] [2021-07-05 16:59:07,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:07,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:07,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:07,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:07,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:07,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-07-05 16:59:07,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:07,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-07-05 16:59:07,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:07,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:07,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:07,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390233759] [2021-07-05 16:59:07,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390233759] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:07,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:07,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:59:07,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162802975] [2021-07-05 16:59:07,696 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:59:07,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:07,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:59:07,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:59:07,697 INFO L87 Difference]: Start difference. First operand 143 states and 173 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-07-05 16:59:07,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:07,719 INFO L93 Difference]: Finished difference Result 201 states and 242 transitions. [2021-07-05 16:59:07,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:59:07,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-07-05 16:59:07,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:07,720 INFO L225 Difference]: With dead ends: 201 [2021-07-05 16:59:07,720 INFO L226 Difference]: Without dead ends: 137 [2021-07-05 16:59:07,720 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:59:07,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-07-05 16:59:07,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-07-05 16:59:07,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.2058823529411764) internal successors, (164), 136 states have internal predecessors, (164), 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-07-05 16:59:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 164 transitions. [2021-07-05 16:59:07,722 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 164 transitions. Word has length 89 [2021-07-05 16:59:07,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:07,722 INFO L442 AbstractCegarLoop]: Abstraction has 137 states and 164 transitions. [2021-07-05 16:59:07,722 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-07-05 16:59:07,722 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 164 transitions. [2021-07-05 16:59:07,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-07-05 16:59:07,723 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:07,723 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:07,723 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable310 [2021-07-05 16:59:07,723 INFO L374 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:07,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:07,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1444800289, now seen corresponding path program 1 times [2021-07-05 16:59:07,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:07,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626992313] [2021-07-05 16:59:07,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:07,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:07,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:07,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:07,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:07,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 16:59:07,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:07,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 16:59:07,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:07,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 16:59:07,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:07,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:07,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:07,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:07,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626992313] [2021-07-05 16:59:07,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626992313] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:07,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:07,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 16:59:07,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082242088] [2021-07-05 16:59:07,867 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 16:59:07,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:07,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 16:59:07,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:59:07,868 INFO L87 Difference]: Start difference. First operand 137 states and 164 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-07-05 16:59:07,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:07,897 INFO L93 Difference]: Finished difference Result 193 states and 231 transitions. [2021-07-05 16:59:07,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:59:07,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-07-05 16:59:07,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:07,898 INFO L225 Difference]: With dead ends: 193 [2021-07-05 16:59:07,898 INFO L226 Difference]: Without dead ends: 132 [2021-07-05 16:59:07,898 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:59:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-07-05 16:59:07,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-07-05 16:59:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.2061068702290076) internal successors, (158), 131 states have internal predecessors, (158), 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-07-05 16:59:07,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 158 transitions. [2021-07-05 16:59:07,900 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 158 transitions. Word has length 90 [2021-07-05 16:59:07,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:07,900 INFO L442 AbstractCegarLoop]: Abstraction has 132 states and 158 transitions. [2021-07-05 16:59:07,900 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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-07-05 16:59:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 158 transitions. [2021-07-05 16:59:07,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-07-05 16:59:07,901 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:07,901 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:07,901 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable311 [2021-07-05 16:59:07,902 INFO L374 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:07,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:07,902 INFO L82 PathProgramCache]: Analyzing trace with hash -532612349, now seen corresponding path program 1 times [2021-07-05 16:59:07,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:07,902 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722146548] [2021-07-05 16:59:07,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:07,903 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:09,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:09,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:09,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:09,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-05 16:59:09,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:09,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-05 16:59:09,741 INFO L142 QuantifierPusher]: treesize reduction 12, result has 55.6 percent of original size [2021-07-05 16:59:09,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:59:09,758 INFO L142 QuantifierPusher]: treesize reduction 7, result has 84.4 percent of original size [2021-07-05 16:59:09,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-07-05 16:59:09,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:09,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-05 16:59:09,768 INFO L142 QuantifierPusher]: treesize reduction 9, result has 80.0 percent of original size [2021-07-05 16:59:09,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-07-05 16:59:09,801 INFO L142 QuantifierPusher]: treesize reduction 18, result has 76.6 percent of original size [2021-07-05 16:59:09,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-07-05 16:59:09,914 INFO L142 QuantifierPusher]: treesize reduction 16, result has 72.4 percent of original size [2021-07-05 16:59:09,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-07-05 16:59:09,926 INFO L142 QuantifierPusher]: treesize reduction 12, result has 80.6 percent of original size [2021-07-05 16:59:09,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-07-05 16:59:09,984 INFO L142 QuantifierPusher]: treesize reduction 12, result has 84.0 percent of original size [2021-07-05 16:59:09,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-07-05 16:59:10,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:10,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-05 16:59:10,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:10,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-07-05 16:59:10,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:10,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:59:10,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:10,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:10,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:10,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:10,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722146548] [2021-07-05 16:59:10,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722146548] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:10,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:10,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-05 16:59:10,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918504734] [2021-07-05 16:59:10,103 INFO L425 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-05 16:59:10,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:10,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-05 16:59:10,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-07-05 16:59:10,104 INFO L87 Difference]: Start difference. First operand 132 states and 158 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 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-07-05 16:59:20,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:20,968 INFO L93 Difference]: Finished difference Result 192 states and 229 transitions. [2021-07-05 16:59:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 16:59:20,968 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-07-05 16:59:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:20,969 INFO L225 Difference]: With dead ends: 192 [2021-07-05 16:59:20,969 INFO L226 Difference]: Without dead ends: 132 [2021-07-05 16:59:20,969 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 538.9ms TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-07-05 16:59:20,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-07-05 16:59:20,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-07-05 16:59:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.1984732824427482) internal successors, (157), 131 states have internal predecessors, (157), 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-07-05 16:59:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 157 transitions. [2021-07-05 16:59:20,971 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 157 transitions. Word has length 90 [2021-07-05 16:59:20,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:20,971 INFO L442 AbstractCegarLoop]: Abstraction has 132 states and 157 transitions. [2021-07-05 16:59:20,971 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 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-07-05 16:59:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 157 transitions. [2021-07-05 16:59:20,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-07-05 16:59:20,972 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:20,972 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:20,972 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable312 [2021-07-05 16:59:20,972 INFO L374 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:20,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:20,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1904419647, now seen corresponding path program 1 times [2021-07-05 16:59:20,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:20,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515881360] [2021-07-05 16:59:20,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:20,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:22,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:22,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:22,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:22,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:59:22,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:22,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-05 16:59:23,008 INFO L142 QuantifierPusher]: treesize reduction 12, result has 55.6 percent of original size [2021-07-05 16:59:23,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:59:23,023 INFO L142 QuantifierPusher]: treesize reduction 12, result has 55.6 percent of original size [2021-07-05 16:59:23,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 16:59:23,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:23,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-05 16:59:23,026 INFO L142 QuantifierPusher]: treesize reduction 49, result has 59.2 percent of original size [2021-07-05 16:59:23,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 71 [2021-07-05 16:59:23,101 INFO L142 QuantifierPusher]: treesize reduction 55, result has 65.0 percent of original size [2021-07-05 16:59:23,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 102 [2021-07-05 16:59:23,250 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2021-07-05 16:59:23,253 INFO L142 QuantifierPusher]: treesize reduction 53, result has 59.2 percent of original size [2021-07-05 16:59:23,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 77 [2021-07-05 16:59:23,270 INFO L142 QuantifierPusher]: treesize reduction 57, result has 63.0 percent of original size [2021-07-05 16:59:23,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 97 [2021-07-05 16:59:23,365 INFO L142 QuantifierPusher]: treesize reduction 91, result has 52.1 percent of original size [2021-07-05 16:59:23,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 99 [2021-07-05 16:59:23,479 INFO L142 QuantifierPusher]: treesize reduction 56, result has 62.9 percent of original size [2021-07-05 16:59:23,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 95 [2021-07-05 16:59:23,577 INFO L142 QuantifierPusher]: treesize reduction 47, result has 72.5 percent of original size [2021-07-05 16:59:23,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 124 [2021-07-05 16:59:23,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:23,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-05 16:59:23,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:23,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-07-05 16:59:23,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:23,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:59:23,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:23,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:23,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:23,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515881360] [2021-07-05 16:59:23,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515881360] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:23,730 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:23,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-07-05 16:59:23,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411791080] [2021-07-05 16:59:23,731 INFO L425 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-07-05 16:59:23,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:23,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-07-05 16:59:23,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-07-05 16:59:23,731 INFO L87 Difference]: Start difference. First operand 132 states and 157 transitions. Second operand has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 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-07-05 16:59:36,578 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-07-05 16:59:36,734 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2021-07-05 16:59:36,990 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2021-07-05 16:59:36,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:36,991 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2021-07-05 16:59:36,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 16:59:36,992 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-07-05 16:59:36,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:36,992 INFO L225 Difference]: With dead ends: 132 [2021-07-05 16:59:36,992 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 16:59:36,992 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1215.1ms TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2021-07-05 16:59:36,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 16:59:36,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 16:59:36,993 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-07-05 16:59:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 16:59:36,993 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2021-07-05 16:59:36,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:36,993 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 16:59:36,993 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 14 states have internal predecessors, (90), 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-07-05 16:59:36,993 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 16:59:36,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 16:59:36,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 16:59:36,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:36,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,023 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,034 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,041 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,041 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,050 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,050 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,050 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:37,179 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 19 [2021-07-05 16:59:37,302 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2021-07-05 16:59:37,758 WARN L205 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2021-07-05 16:59:37,864 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2021-07-05 16:59:38,298 WARN L205 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 79 [2021-07-05 16:59:38,791 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2021-07-05 16:59:39,082 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2021-07-05 16:59:39,377 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2021-07-05 16:59:39,399 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,400 INFO L762 garLoopResultBuilder]: For program point L9153(lines 9153 9155) no Hoare annotation was computed. [2021-07-05 16:59:39,400 INFO L762 garLoopResultBuilder]: For program point L9153-2(lines 9153 9155) no Hoare annotation was computed. [2021-07-05 16:59:39,400 INFO L762 garLoopResultBuilder]: For program point L6973(lines 6973 6978) no Hoare annotation was computed. [2021-07-05 16:59:39,400 INFO L758 garLoopResultBuilder]: At program point L268(line 268) the Hoare annotation is: false [2021-07-05 16:59:39,400 INFO L762 garLoopResultBuilder]: For program point L6974(lines 6974 6976) no Hoare annotation was computed. [2021-07-05 16:59:39,400 INFO L762 garLoopResultBuilder]: For program point L6974-2(lines 6974 6976) no Hoare annotation was computed. [2021-07-05 16:59:39,400 INFO L762 garLoopResultBuilder]: For program point L7141-2(line 7141) no Hoare annotation was computed. [2021-07-05 16:59:39,400 INFO L762 garLoopResultBuilder]: For program point L7141(line 7141) no Hoare annotation was computed. [2021-07-05 16:59:39,400 INFO L765 garLoopResultBuilder]: At program point L9157(line 9157) the Hoare annotation is: true [2021-07-05 16:59:39,400 INFO L762 garLoopResultBuilder]: For program point L6979(lines 6979 6981) no Hoare annotation was computed. [2021-07-05 16:59:39,400 INFO L758 garLoopResultBuilder]: At program point L6979-3(lines 6965 6982) the Hoare annotation is: (let ((.cse64 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse31 (select .cse64 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse25 (= |ULTIMATE.start_can_fail_realloc_#res.base| 0)) (.cse28 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse27 (+ |#StackHeapBarrier| 1)) (.cse42 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse33 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse40 (select .cse42 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse34 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse30 (select .cse64 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse32 (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse36 (<= .cse27 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse43 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse13 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse20 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse8 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse22 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse9 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse39 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0))) (.cse23 (= |ULTIMATE.start_can_fail_realloc_#res.offset| 0)) (.cse16 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse26 (<= (+ (* 4294967296 .cse28) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse38 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse19 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse21 (not .cse25)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse3 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse55 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse12 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse14 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse24 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse29 (* .cse31 (- 1))) (.cse18 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse15 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and .cse0 (let ((.cse11 (select .cse32 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse1 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse2 (<= (* 4294967296 (div (+ (* (div (+ .cse29 4294967295 .cse30) 4294967296) 4294967296) .cse31) 4294967296)) .cse30)) (.cse10 (<= (* 4294967296 (div (+ .cse11 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse28 4294967296)) 4294967296)) .cse11)) (.cse17 (<= .cse27 ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse11 (* 4294967296 (div .cse11 4294967296))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse19 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18) (and .cse4 .cse22 .cse9 .cse23 .cse24 .cse15 .cse25 .cse26)))) .cse3 .cse33 .cse5 .cse34 .cse22 (let ((.cse35 (< (* 4294967296 (div ULTIMATE.start_can_fail_realloc_~newsize 4294967296)) ULTIMATE.start_can_fail_realloc_~newsize)) (.cse37 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse3 .cse4 .cse19 .cse33 .cse35 .cse20 .cse5 .cse36 .cse37 .cse34 .cse8 .cse22 .cse9 .cse12 .cse13 .cse14 .cse38 .cse15 .cse21 .cse16) (let ((.cse41 (select .cse42 12))) (and .cse0 .cse3 .cse4 .cse22 .cse9 .cse39 .cse23 .cse12 .cse24 (<= .cse40 (+ (* 4294967296 (div (+ (* (div .cse40 4294967296) 4294967296) 4294967295 (* .cse41 (- 1))) 4294967296)) .cse41)) .cse15 .cse25 (<= .cse41 (+ (* 4294967296 (div (+ (- 1) .cse41) 4294967296)) 4294967295)) .cse26)) (and .cse0 .cse3 .cse4 .cse19 .cse35 .cse20 .cse5 .cse36 (<= .cse30 (* 4294967296 (div .cse30 4294967296))) .cse37 .cse8 .cse9 .cse43 .cse12 .cse13 .cse14 .cse38 .cse15 .cse21 .cse16 .cse18))) (let ((.cse48 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse45 (<= (select .cse32 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse48)) (.cse46 (<= .cse48 .cse30)) (.cse44 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse47 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)))) (or (and .cse0 .cse4 .cse19 (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) .cse44) .cse5 .cse36 (<= .cse27 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse6 .cse8 .cse9 .cse45 .cse43 .cse46 .cse14 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) .cse15 .cse21 .cse47 .cse18 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) .cse26) (and .cse4 (<= .cse40 .cse48) .cse22 .cse9 .cse23 .cse24 .cse15 .cse25 .cse26 (<= .cse48 .cse40)) (and .cse4 .cse19 .cse6 .cse34 .cse7 .cse8 .cse9 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse45 .cse46 .cse14 .cse44 .cse15 .cse21 .cse47 .cse18 .cse26)))) (let ((.cse56 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse49 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse56))) (.cse50 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse56) |~#s_can_fail_allocator_static~0.base|)) (.cse51 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse52 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|)) (.cse53 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|)) (.cse54 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse3 .cse4 .cse19 .cse20 .cse49 .cse36 .cse50 .cse51 .cse52 .cse6 .cse8 .cse53 .cse22 .cse9 .cse43 .cse12 .cse13 .cse15 .cse21 .cse16 .cse54 .cse26) (and .cse0 .cse3 .cse4 .cse20 .cse49 .cse50 .cse51 .cse52 .cse6 .cse8 .cse53 .cse22 .cse9 .cse39 .cse55 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0)) .cse23 .cse12 .cse24 .cse15 .cse25 .cse16 .cse54 .cse18 .cse26)))) .cse12 .cse14 .cse38 (let ((.cse63 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse59 (select .cse63 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse57 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse58 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse61 (let ((.cse62 (select .cse63 12))) (<= .cse62 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse62) 4294967296)))))) (.cse60 (div .cse59 4294967296))) (or (and .cse0 .cse3 .cse19 .cse5 .cse6 .cse7 .cse12 .cse14 .cse24 .cse15 .cse21 .cse18) (and .cse57 .cse0 .cse3 .cse58 .cse5 .cse6 .cse7 .cse12 (<= .cse59 (* 4294967296 .cse60)) .cse14 .cse61 .cse24 .cse15 .cse18) (and .cse57 .cse0 .cse3 .cse58 .cse5 .cse6 .cse7 .cse55 .cse12 .cse14 .cse61 .cse24 .cse15 (<= .cse59 (+ (* 4294967296 (div (+ .cse29 (* .cse60 4294967296) 4294967295) 4294967296)) .cse31)) .cse18))))) .cse15)))) [2021-07-05 16:59:39,401 INFO L762 garLoopResultBuilder]: For program point L6979-2(lines 6979 6981) no Hoare annotation was computed. [2021-07-05 16:59:39,401 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,401 INFO L762 garLoopResultBuilder]: For program point L7145(lines 7145 7151) no Hoare annotation was computed. [2021-07-05 16:59:39,401 INFO L758 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: (let ((.cse13 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse10 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse13)) (.cse11 (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse13))) (let ((.cse2 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse3 (= .cse11 0)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse4 (= .cse10 0)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse7 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and .cse0 .cse1 .cse2 (let ((.cse5 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse9 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| .cse10) .cse2 (= .cse11 |~#s_can_fail_allocator_static~0.base|) .cse5 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse6 .cse7 .cse8 .cse9))) .cse6 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse7 .cse8 (let ((.cse12 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse12 .cse6 .cse7 .cse8) (and .cse0 .cse3 .cse1 .cse4 .cse12 .cse6 .cse7 .cse8))))))) [2021-07-05 16:59:39,401 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,401 INFO L762 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:59:39,401 INFO L762 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:59:39,401 INFO L762 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:59:39,401 INFO L762 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:59:39,401 INFO L762 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:59:39,401 INFO L762 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:59:39,401 INFO L762 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:59:39,401 INFO L762 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-07-05 16:59:39,401 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,401 INFO L762 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-07-05 16:59:39,401 INFO L762 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-07-05 16:59:39,401 INFO L762 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-07-05 16:59:39,402 INFO L762 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-07-05 16:59:39,402 INFO L762 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-07-05 16:59:39,402 INFO L762 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-07-05 16:59:39,402 INFO L762 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-07-05 16:59:39,402 INFO L762 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-07-05 16:59:39,402 INFO L758 garLoopResultBuilder]: At program point L6951-1(lines 6950 6952) the Hoare annotation is: (let ((.cse12 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse2 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse6 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse7 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse4 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse3 (select .cse12 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse2)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse2) |~#s_can_fail_allocator_static~0.base|) (<= .cse3 .cse4) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |ULTIMATE.start_aws_byte_buf_has_allocator_#t~mem500.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse5 .cse6 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) .cse7 (let ((.cse10 (div .cse3 4294967296)) (.cse11 (select .cse12 12))) (let ((.cse8 (<= .cse3 (+ (* 4294967296 (div (+ (* .cse10 4294967296) 4294967295 (* .cse11 (- 1))) 4294967296)) .cse11))) (.cse9 (<= .cse11 (+ (* 4294967296 (div (+ (- 1) .cse11) 4294967296)) 4294967295)))) (or (and .cse0 .cse1 .cse5 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 (<= .cse3 (* 4294967296 .cse10)) .cse5 .cse6 .cse8 .cse7 .cse9)))) (= |ULTIMATE.start_can_fail_allocator_#res.base| |ULTIMATE.start_aws_byte_buf_has_allocator_#t~mem500.base|) (<= |~#s_can_fail_allocator_static~0.offset| 0) (<= .cse4 .cse3)))) [2021-07-05 16:59:39,402 INFO L758 garLoopResultBuilder]: At program point L6951(lines 6950 6952) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2021-07-05 16:59:39,402 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,402 INFO L758 garLoopResultBuilder]: At program point L6655(lines 6653 6656) the Hoare annotation is: (let ((.cse12 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse2 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse6 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse7 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse4 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse3 (select .cse12 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and .cse0 (<= 1 |ULTIMATE.start_aws_byte_buf_has_allocator_#res|) .cse1 (<= |ULTIMATE.start_aws_byte_buf_has_allocator_#res| 1) (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse2)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse2) |~#s_can_fail_allocator_static~0.base|) (<= .cse3 .cse4) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse5 .cse6 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) .cse7 (let ((.cse10 (div .cse3 4294967296)) (.cse11 (select .cse12 12))) (let ((.cse8 (<= .cse3 (+ (* 4294967296 (div (+ (* .cse10 4294967296) 4294967295 (* .cse11 (- 1))) 4294967296)) .cse11))) (.cse9 (<= .cse11 (+ (* 4294967296 (div (+ (- 1) .cse11) 4294967296)) 4294967295)))) (or (and .cse0 .cse1 .cse5 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 (<= .cse3 (* 4294967296 .cse10)) .cse5 .cse6 .cse8 .cse7 .cse9)))) (<= |~#s_can_fail_allocator_static~0.offset| 0) (<= .cse4 .cse3)))) [2021-07-05 16:59:39,402 INFO L758 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse2 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse1 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse0 (<= .cse1 .cse2) (let ((.cse14 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse5 (select .cse14 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse13 (select .cse14 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (let ((.cse3 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse4 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse7 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse8 (<= .cse13 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse13) 4294967296))))) (.cse9 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse6 (div .cse5 4294967296)) (.cse12 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (or (and .cse3 .cse4 .cse0 (<= .cse5 (* 4294967296 .cse6)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse3 .cse4 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse5 (+ (* 4294967296 (div (+ (* .cse6 4294967296) (* .cse13 (- 1)) 4294967295) 4294967296)) .cse13)) .cse12))))) .cse10 .cse11 (<= .cse2 .cse1))) [2021-07-05 16:59:39,402 INFO L758 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (let ((.cse3 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse2 (select .cse3 12)) (.cse1 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse0 (select .cse3 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= .cse0 .cse1) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (<= .cse0 (+ (* 4294967296 (div (+ (* (div .cse0 4294967296) 4294967296) 4294967295 (* .cse2 (- 1))) 4294967296)) .cse2)) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (<= .cse2 (+ (* 4294967296 (div (+ (- 1) .cse2) 4294967296)) 4294967295)) (<= .cse1 .cse0)))) [2021-07-05 16:59:39,403 INFO L758 garLoopResultBuilder]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: (let ((.cse23 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse2 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse3 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse18 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse10 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse13 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse15 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse16 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse22 (select .cse23 12)) (.cse17 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse5 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse4 (select .cse23 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse0 .cse1 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize) (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4) (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse2)) .cse3 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse2) |~#s_can_fail_allocator_static~0.base|) (<= .cse4 .cse5) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (let ((.cse21 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse11 (select .cse21 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse7 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse8 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse9 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse14 (let ((.cse20 (select .cse21 12))) (<= .cse20 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse20) 4294967296)))))) (.cse12 (div .cse11 4294967296))) (or (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse6 .cse9 .cse10 (<= .cse11 (* 4294967296 .cse12)) .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse6 .cse9 .cse18 .cse10 .cse13 .cse14 .cse15 .cse16 (<= .cse11 (let ((.cse19 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse19 (- 1)) (* .cse12 4294967296) 4294967295) 4294967296)) .cse19))) .cse17))))) (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse18 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0)) .cse10 .cse13 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse15 (<= .cse4 (+ (* 4294967296 (div (+ (* (div .cse4 4294967296) 4294967296) 4294967295 (* .cse22 (- 1))) 4294967296)) .cse22)) .cse16 (<= .cse22 (+ (* 4294967296 (div (+ (- 1) .cse22) 4294967296)) 4294967295)) (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse17 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity) (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0) (<= .cse5 .cse4)))) [2021-07-05 16:59:39,403 INFO L762 garLoopResultBuilder]: For program point L8176-1(line 8176) no Hoare annotation was computed. [2021-07-05 16:59:39,403 INFO L758 garLoopResultBuilder]: At program point L8176-4(line 8176) the Hoare annotation is: (let ((.cse47 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse44 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse23 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse42 (select .cse44 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse45 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse37 (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse46 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 16)) (.cse36 (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse47))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse31 (= .cse36 0)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse32 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse47) 0)) (.cse33 (= (select .cse37 .cse46) 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse10 (not (= (select .cse45 4) 0))) (.cse11 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse15 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse25 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse16 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse17 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse19 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse35 (= (select .cse45 .cse46) 0)) (.cse29 (+ |#StackHeapBarrier| 1)) (.cse27 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse43 (div .cse42 4294967296)) (.cse41 (select .cse44 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse13 (select .cse23 12))) (let ((.cse22 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse13) 4294967296)))) (.cse18 (<= .cse42 (+ (* 4294967296 (div (+ (* .cse43 4294967296) (* .cse41 (- 1)) 4294967295) 4294967296)) .cse41))) (.cse20 (<= .cse42 (* 4294967296 .cse43))) (.cse12 (<= .cse41 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse41) 4294967296))))) (.cse7 (<= .cse27 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse27) 4294967296))))) (.cse1 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse3 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse26 (<= .cse29 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse24 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse38 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse30 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse40 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse21 (and .cse0 .cse31 .cse2 .cse32 .cse33 .cse4 .cse6 .cse10 .cse11 .cse15 .cse25 .cse16 .cse17 .cse19 .cse35)) (.cse28 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (and .cse0 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (let ((.cse5 (select .cse23 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse8 (<= .cse13 .cse22)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse14 (div .cse5 4294967296))) (or (and .cse1 .cse0 .cse2 .cse3 .cse4 (<= .cse5 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse5) 4294967296)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse5 (+ .cse13 (* 4294967296 (div (+ (* .cse14 4294967296) 4294967295 (* .cse13 (- 1))) 4294967296)))) .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse20 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 (<= .cse5 (* 4294967296 .cse14)) .cse16 .cse17 .cse19) .cse21))) (or .cse21 (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse6 .cse24 .cse11 (<= (select .cse23 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 12)) .cse22) .cse15 .cse25 .cse16 .cse17 .cse19)) .cse26 (<= .cse27 .cse28) (<= .cse29 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse6 .cse30 .cse24 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse25 (let ((.cse34 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse31 .cse2 .cse32 .cse33 .cse4 .cse6 .cse10 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |~#s_can_fail_allocator_static~0.offset| 1)) .cse11 .cse15 .cse25 .cse16 .cse17 .cse34 .cse19 .cse35) (and .cse0 .cse2 .cse4 .cse26 (= .cse36 |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse6 .cse30 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse11 .cse15 .cse25 (= (select .cse37 16) |~#s_can_fail_allocator_static~0.offset|) .cse17 .cse34 .cse19))) (let ((.cse39 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse1 .cse0 .cse2 .cse3 .cse38 .cse4 .cse26 .cse39 .cse30 .cse11 .cse12 .cse15 .cse25 .cse40 .cse17 .cse18 .cse19) (and .cse1 .cse0 .cse31 .cse2 .cse3 .cse32 .cse33 .cse4 .cse39 .cse6 .cse10 .cse11 .cse12 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 .cse35) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse26 .cse20 .cse39 .cse30 .cse11 .cse12 .cse15 .cse25 .cse40 .cse17 .cse19))) .cse17 (or (and .cse0 .cse2 .cse4 .cse26 .cse6 .cse24 .cse7 .cse10 .cse11 .cse15 .cse25 .cse16 .cse17 .cse19) (and .cse0 .cse31 .cse2 .cse32 .cse33 .cse4 .cse26 .cse6 .cse10 .cse11 .cse15 .cse25 .cse16 .cse17 .cse19 .cse35) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse26 .cse6 .cse24 .cse10 .cse11 .cse15 .cse25 .cse16 .cse17 .cse19)) .cse19 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) (or (and .cse0 .cse2 .cse38 .cse4 .cse30 .cse11 .cse15 .cse25 .cse40 .cse17 .cse19) .cse21) (<= .cse28 .cse27)))))) [2021-07-05 16:59:39,403 INFO L762 garLoopResultBuilder]: For program point L8176-3(line 8176) no Hoare annotation was computed. [2021-07-05 16:59:39,403 INFO L762 garLoopResultBuilder]: For program point L8177-3(lines 8175 8193) no Hoare annotation was computed. [2021-07-05 16:59:39,403 INFO L762 garLoopResultBuilder]: For program point L8177-2(line 8177) no Hoare annotation was computed. [2021-07-05 16:59:39,403 INFO L762 garLoopResultBuilder]: For program point L8177(line 8177) no Hoare annotation was computed. [2021-07-05 16:59:39,403 INFO L762 garLoopResultBuilder]: For program point L8177-4(line 8177) no Hoare annotation was computed. [2021-07-05 16:59:39,403 INFO L762 garLoopResultBuilder]: For program point L6658(lines 6658 6663) no Hoare annotation was computed. [2021-07-05 16:59:39,403 INFO L762 garLoopResultBuilder]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:59:39,403 INFO L762 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:59:39,403 INFO L762 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 16:59:39,403 INFO L762 garLoopResultBuilder]: For program point L7154(lines 7154 7156) no Hoare annotation was computed. [2021-07-05 16:59:39,403 INFO L762 garLoopResultBuilder]: For program point L6659(lines 6659 6661) no Hoare annotation was computed. [2021-07-05 16:59:39,404 INFO L762 garLoopResultBuilder]: For program point L6659-2(lines 6659 6661) no Hoare annotation was computed. [2021-07-05 16:59:39,404 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 16:59:39,404 INFO L762 garLoopResultBuilder]: For program point L7122(lines 7122 7135) no Hoare annotation was computed. [2021-07-05 16:59:39,404 INFO L762 garLoopResultBuilder]: For program point L8179(lines 8179 8182) no Hoare annotation was computed. [2021-07-05 16:59:39,404 INFO L762 garLoopResultBuilder]: For program point L9137(lines 9137 9156) no Hoare annotation was computed. [2021-07-05 16:59:39,404 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,404 INFO L758 garLoopResultBuilder]: At program point L7158(lines 7137 7159) the Hoare annotation is: (let ((.cse17 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse23 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse24 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse53 (= |ULTIMATE.start_aws_mem_realloc_#res| 0)) (.cse67 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse52 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse42 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse41 (+ |#StackHeapBarrier| 1)) (.cse32 (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0))) (let ((.cse34 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse10 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse11 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse19 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0))) (.cse20 (not .cse32)) (.cse22 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse25 (not (= |ULTIMATE.start_can_fail_realloc_#res.base| 0))) (.cse26 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse29 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0))) (.cse48 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse44 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse5 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0)) (.cse6 (<= (+ |ULTIMATE.start_aws_mem_realloc_#res| 1) 0)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse2 (<= .cse41 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse15 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse18 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse28 (<= (+ (* 4294967296 .cse42) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse50 (select .cse52 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse49 (select .cse67 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse43 (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse8 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse35 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse14 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse37 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse30 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse21 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse47 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse31 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse60 (and .cse17 .cse23 .cse24 .cse53))) (and (let ((.cse33 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse1 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse33))) (.cse3 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse33) |~#s_can_fail_allocator_static~0.base|))) (let ((.cse0 (let ((.cse12 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse13 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|)) (.cse16 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|)) (.cse27 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) .cse7 .cse8 .cse9 .cse11 .cse1 .cse3 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse30 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0)) .cse21 .cse23 .cse24 .cse26 .cse27 .cse31 .cse28 .cse32))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6))))) .cse7 .cse8 .cse34 .cse35 (let ((.cse39 (select .cse43 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse36 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse38 (<= (* 4294967296 (div (+ .cse39 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse42 4294967296)) 4294967296)) .cse39)) (.cse40 (<= .cse41 ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and .cse5 .cse9 .cse17 .cse18 .cse6 .cse23 .cse24 .cse28) (and .cse36 .cse7 .cse8 .cse9 .cse35 .cse14 .cse37 .cse15 .cse17 .cse18 .cse38 (<= .cse39 (* 4294967296 (div .cse39 4294967296))) .cse21 .cse22 .cse23 .cse24 .cse26 .cse40 .cse31) (and .cse36 .cse7 .cse8 .cse9 .cse10 .cse11 .cse35 .cse14 .cse37 .cse15 .cse17 .cse18 .cse19 .cse38 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse40 .cse31)))) .cse44 .cse17 .cse21 (let ((.cse45 (= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse46 (or (let ((.cse51 (select .cse52 12))) (and .cse7 .cse8 .cse17 .cse29 .cse21 .cse23 (<= .cse50 (+ (* 4294967296 (div (+ (* (div .cse50 4294967296) 4294967296) 4294967295 (* .cse51 (- 1))) 4294967296)) .cse51)) .cse24 (<= .cse51 (+ (* 4294967296 (div (+ (- 1) .cse51) 4294967296)) 4294967295)))) (and .cse7 .cse8 .cse17 .cse21 .cse23 .cse24 .cse53)))) (or (and .cse9 .cse10 .cse34 .cse11 .cse35 .cse2 .cse45 .cse44 .cse15 .cse18 .cse19 .cse20 .cse22 .cse46 .cse47 .cse48 .cse25 .cse26 .cse28) (and .cse5 .cse9 .cse18 .cse6 .cse46 .cse28) (and .cse9 .cse10 .cse11 .cse35 .cse2 (<= .cse49 (* 4294967296 (div .cse49 4294967296))) .cse45 .cse15 .cse18 .cse19 .cse4 .cse20 .cse22 .cse46 .cse48 .cse25 .cse26 .cse31 .cse28))) .cse47 .cse48 .cse24 (let ((.cse59 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse56 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse54 (<= (select .cse43 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse59)) (.cse55 (<= .cse59 .cse49)) (.cse57 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (.cse58 (or (and (<= .cse50 .cse59) .cse17 .cse23 .cse24 (<= .cse59 .cse50)) .cse60))) (or (and .cse9 .cse14 .cse44 .cse37 .cse15 .cse18 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse54 .cse55 .cse56 .cse57 .cse31 .cse28 .cse58) (and .cse5 .cse9 .cse18 .cse6 .cse28 .cse58) (and .cse7 .cse9 (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) .cse56) .cse35 .cse2 (<= .cse41 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse14 .cse15 .cse18 .cse54 .cse4 .cse55 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) .cse57 .cse31 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) .cse28 .cse58)))) (let ((.cse69 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse63 (select .cse69 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse61 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse62 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse65 (let ((.cse68 (select .cse69 12))) (<= .cse68 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse68) 4294967296)))))) (.cse64 (div .cse63 4294967296))) (or (and .cse61 .cse7 .cse8 .cse62 .cse35 .cse14 .cse37 .cse21 (<= .cse63 (* 4294967296 .cse64)) .cse47 .cse65 .cse23 .cse24 .cse31) (and .cse61 .cse7 .cse8 .cse62 .cse35 .cse14 .cse37 .cse30 .cse21 .cse47 .cse65 .cse23 .cse24 (<= .cse63 (let ((.cse66 (select .cse67 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse66 (- 1)) (* .cse64 4294967296) 4294967295) 4294967296)) .cse66))) .cse31) .cse60))))))) [2021-07-05 16:59:39,404 INFO L762 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:59:39,404 INFO L762 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:59:39,404 INFO L762 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:59:39,404 INFO L762 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:59:39,404 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,404 INFO L762 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:59:39,405 INFO L762 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:59:39,405 INFO L762 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:59:39,405 INFO L762 garLoopResultBuilder]: For program point L222-7(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:59:39,405 INFO L762 garLoopResultBuilder]: For program point L222-8(lines 7162 7172) no Hoare annotation was computed. [2021-07-05 16:59:39,405 INFO L762 garLoopResultBuilder]: For program point L222-9(lines 222 224) no Hoare annotation was computed. [2021-07-05 16:59:39,405 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 16:59:39,405 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,405 INFO L762 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,405 INFO L762 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,405 INFO L762 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,406 INFO L762 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,406 INFO L762 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,406 INFO L762 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,406 INFO L762 garLoopResultBuilder]: For program point L8184(lines 8184 8187) no Hoare annotation was computed. [2021-07-05 16:59:39,406 INFO L762 garLoopResultBuilder]: For program point L7160(lines 7160 7173) no Hoare annotation was computed. [2021-07-05 16:59:39,406 INFO L762 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,406 INFO L762 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,406 INFO L762 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,406 INFO L762 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,406 INFO L762 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,407 INFO L762 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,407 INFO L762 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,407 INFO L762 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,407 INFO L762 garLoopResultBuilder]: For program point L223-21(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,407 INFO L762 garLoopResultBuilder]: For program point L223-22(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,407 INFO L762 garLoopResultBuilder]: For program point L223-24(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,407 INFO L762 garLoopResultBuilder]: For program point L223-25(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,407 INFO L762 garLoopResultBuilder]: For program point L7491-1(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:39,407 INFO L762 garLoopResultBuilder]: For program point L7491(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,407 INFO L762 garLoopResultBuilder]: For program point L223-27(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,407 INFO L762 garLoopResultBuilder]: For program point L223-28(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,407 INFO L762 garLoopResultBuilder]: For program point L7491-4(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:39,407 INFO L762 garLoopResultBuilder]: For program point L7491-3(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:39,407 INFO L762 garLoopResultBuilder]: For program point L7491-9(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,407 INFO L762 garLoopResultBuilder]: For program point L7491-7(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,407 INFO L762 garLoopResultBuilder]: For program point L7491-6(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:39,407 INFO L762 garLoopResultBuilder]: For program point L7491-13(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,408 INFO L758 garLoopResultBuilder]: At program point L7491-12(lines 7489 7495) the Hoare annotation is: (let ((.cse29 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse28 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse13 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse29)) (.cse15 (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse29))) (let ((.cse3 (= .cse15 0)) (.cse4 (= .cse13 0)) (.cse16 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse7 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse18 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0)) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse12 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse26 (select .cse28 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (let ((.cse17 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse14 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse23 (let ((.cse27 (select .cse28 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= .cse27 (+ (* 4294967296 (div (+ (* (div .cse27 4294967296) 4294967296) (* .cse26 (- 1)) 4294967295) 4294967296)) .cse26)))) (.cse2 (and .cse16 .cse0 .cse1 .cse5 .cse7 .cse18 .cse8 .cse9 .cse10 .cse12)) (.cse19 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse20 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse22 (<= .cse26 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse26) 4294967296))))) (.cse25 (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12))) (and .cse0 .cse1 (let ((.cse6 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse11 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or .cse2 (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| .cse13) .cse5 .cse14 (= .cse15 |~#s_can_fail_allocator_static~0.base|) .cse6 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) .cse5 .cse14 (let ((.cse21 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse16 .cse0 .cse1 .cse17 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse7 .cse18 .cse8 .cse10 .cse12) (and .cse19 .cse0 .cse3 .cse1 .cse20 .cse4 .cse5 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse23 .cse12) (and .cse19 .cse0 .cse1 .cse20 .cse5 .cse14 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse23 .cse12))) .cse17 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse7 .cse8 .cse9 .cse10 (or (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse14 .cse7 .cse8 .cse9 .cse10 .cse12) .cse2 (and .cse0 .cse1 .cse5 .cse14 (let ((.cse24 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (<= .cse24 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse24) 4294967296))))) .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse19 .cse0 .cse1 .cse20 .cse5 .cse14 .cse7 .cse8 .cse9 .cse10 .cse12)) (or .cse2 (and .cse19 .cse0 .cse1 .cse20 .cse5 .cse7 .cse22 .cse8 .cse9 .cse10 .cse23 .cse12) .cse25) (or .cse2 (and .cse19 .cse0 .cse1 .cse20 .cse5 .cse7 .cse22 .cse8 .cse9 .cse10 .cse12) .cse25) .cse12))))) [2021-07-05 16:59:39,408 INFO L762 garLoopResultBuilder]: For program point L7491-11(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,408 INFO L762 garLoopResultBuilder]: For program point L7491-17(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:39,408 INFO L762 garLoopResultBuilder]: For program point L7491-16(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:39,408 INFO L762 garLoopResultBuilder]: For program point L7491-14(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:39,408 INFO L762 garLoopResultBuilder]: For program point L7491-20(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,408 INFO L762 garLoopResultBuilder]: For program point L7491-19(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:39,408 INFO L758 garLoopResultBuilder]: At program point L7491-25(lines 7489 7495) the Hoare annotation is: (let ((.cse40 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse30 (select .cse40 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse42 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse43 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse26 (select .cse43 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse17 (select .cse43 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse32 (select .cse42 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse41 (select .cse42 12)) (.cse36 (div .cse30 4294967296)) (.cse0 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse3 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse5 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0))) (.cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0))) (.cse7 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse8 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0)) (.cse9 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse10 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse12 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse14 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse34 (+ |#StackHeapBarrier| 1))) (let ((.cse27 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse23 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse15 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse22 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse16 (<= .cse34 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse20 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse21 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse28 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse29 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse24 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14)) (.cse31 (* .cse36 4294967296)) (.cse11 (<= .cse32 (+ (* 4294967296 (div (+ (* (div .cse32 4294967296) 4294967296) 4294967295 (* .cse41 (- 1))) 4294967296)) .cse41))) (.cse13 (<= .cse41 (+ (* 4294967296 (div (+ (- 1) .cse41) 4294967296)) 4294967295))) (.cse18 (div .cse17 4294967296)) (.cse25 (* .cse26 (- 1))) (.cse33 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (and (let ((.cse19 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse16 (<= .cse17 (* 4294967296 .cse18)) .cse19 .cse20 .cse6 .cse7 .cse9 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse23 .cse15 .cse16 .cse19 .cse20 .cse6 .cse7 .cse9 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14))) (or .cse24 (and .cse1 (<= (* 4294967296 (div (+ (* (div (+ .cse25 4294967295 .cse17) 4294967296) 4294967296) .cse26) 4294967296)) .cse17) .cse2 .cse15 .cse16 .cse3 .cse27 .cse4 .cse6 .cse9 .cse10 .cse12 .cse14)) .cse1 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (or (and .cse28 .cse1 .cse2 .cse29 .cse15 .cse3 .cse27 .cse4 .cse6 .cse9 .cse10 .cse12 .cse13 (<= .cse30 (+ (* 4294967296 (div (+ .cse25 .cse31 4294967295) 4294967296)) .cse26)) .cse14) .cse24) .cse16 (<= .cse32 .cse33) (<= .cse34 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse3 .cse20 .cse27 (or (and .cse1 .cse2 .cse23 .cse15 .cse20 .cse7 .cse9 .cse21 .cse22 .cse12 .cse14) .cse24) (or (and .cse1 .cse2 .cse16 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse3 .cse20 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse4 .cse6 .cse7 .cse9 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 16) |~#s_can_fail_allocator_static~0.offset|) .cse12 (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse14) .cse24) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse21 .cse12 .cse14 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) (let ((.cse35 (let ((.cse39 (select .cse40 12))) (let ((.cse37 (<= .cse39 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse39) 4294967296))))) (.cse38 (<= .cse26 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse26) 4294967296)))))) (or (and .cse1 .cse2 (<= (* 4294967296 (div (+ .cse32 4294967295) 4294967296)) .cse32) (<= (* 4294967296 (div (+ 4294967295 .cse17) 4294967296)) .cse17) (<= (* 4294967296 (div (+ .cse30 4294967295) 4294967296)) .cse30) .cse3 .cse37 .cse4 .cse5 .cse6 .cse7 .cse38 .cse9 .cse10 .cse12 .cse13 .cse14) (and (<= .cse17 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse17) 4294967296)))) .cse1 .cse2 (<= .cse30 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse30) 4294967296)))) .cse3 (<= .cse32 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse32) 4294967296)))) .cse37 .cse4 .cse5 .cse6 .cse7 .cse38 (<= .cse30 (+ .cse39 (* 4294967296 (div (+ .cse31 4294967295 (* .cse39 (- 1))) 4294967296)))) .cse9 .cse10 .cse11 .cse12 .cse13 (<= .cse17 (+ (* 4294967296 (div (+ (* .cse18 4294967296) .cse25 4294967295) 4294967296)) .cse26)) .cse14)))))) (or (and .cse35 (<= .cse30 (* 4294967296 .cse36))) (and .cse28 .cse29 .cse35) .cse24)) (<= .cse33 .cse32)))))) [2021-07-05 16:59:39,408 INFO L762 garLoopResultBuilder]: For program point L7491-24(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,408 INFO L762 garLoopResultBuilder]: For program point L7491-22(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,408 INFO L762 garLoopResultBuilder]: For program point L7491-29(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:39,408 INFO L762 garLoopResultBuilder]: For program point L7491-27(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:39,408 INFO L762 garLoopResultBuilder]: For program point L7491-26(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,408 INFO L762 garLoopResultBuilder]: For program point L7491-33(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,409 INFO L762 garLoopResultBuilder]: For program point L7491-32(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:39,409 INFO L762 garLoopResultBuilder]: For program point L7491-30(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:39,409 INFO L762 garLoopResultBuilder]: For program point L7491-37(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,409 INFO L762 garLoopResultBuilder]: For program point L7491-35(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,409 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,409 INFO L762 garLoopResultBuilder]: For program point L7491-40(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:39,409 INFO L762 garLoopResultBuilder]: For program point L7491-39(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,409 INFO L758 garLoopResultBuilder]: At program point L7491-38(lines 7489 7495) the Hoare annotation is: (let ((.cse9 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse12 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0))) (.cse13 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0))) (.cse4 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse5 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse14 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (let ((.cse10 (and (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 .cse2 .cse3 .cse12 .cse13 .cse4 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse5 .cse14 .cse6 .cse7)) (.cse17 (select .cse9 12)) (.cse16 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse15 (select .cse9 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 (or (and .cse0 .cse1 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse8 (select .cse9 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse8 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse8 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) 4294967296)) 4294967295)))) .cse10) .cse1 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (or .cse10 (let ((.cse11 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse11)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse11) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse2 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse3 .cse12 .cse13 .cse4 .cse5 .cse14 .cse6 (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse7))) (<= .cse15 .cse16) .cse3 .cse13 .cse5 .cse14 (<= .cse15 (+ (* 4294967296 (div (+ (* (div .cse15 4294967296) 4294967296) 4294967295 (* .cse17 (- 1))) 4294967296)) .cse17)) .cse6 (<= .cse17 (+ (* 4294967296 (div (+ (- 1) .cse17) 4294967296)) 4294967295)) (<= .cse16 .cse15)))) [2021-07-05 16:59:39,409 INFO L762 garLoopResultBuilder]: For program point L7491-45(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:39,409 INFO L762 garLoopResultBuilder]: For program point L7491-43(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:39,409 INFO L762 garLoopResultBuilder]: For program point L7491-42(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:39,409 INFO L762 garLoopResultBuilder]: For program point L7491-48(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,409 INFO L762 garLoopResultBuilder]: For program point L7491-46(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,409 INFO L762 garLoopResultBuilder]: For program point L7491-53(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:39,409 INFO L762 garLoopResultBuilder]: For program point L7491-52(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,409 INFO L758 garLoopResultBuilder]: At program point L7491-51(lines 7489 7495) the Hoare annotation is: (let ((.cse11 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse2 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse3 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse1 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse0 (select .cse11 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (<= .cse0 .cse1) .cse2 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) .cse3 (let ((.cse9 (div .cse0 4294967296)) (.cse10 (select .cse11 12))) (let ((.cse4 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse5 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse6 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse7 (<= .cse0 (+ (* 4294967296 (div (+ (* .cse9 4294967296) 4294967295 (* .cse10 (- 1))) 4294967296)) .cse10))) (.cse8 (<= .cse10 (+ (* 4294967296 (div (+ (- 1) .cse10) 4294967296)) 4294967295)))) (or (and .cse4 .cse5 .cse2 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse6 .cse7 .cse3 .cse8) (and .cse4 .cse5 (<= .cse0 (* 4294967296 .cse9)) .cse2 .cse6 .cse7 .cse3 .cse8)))) (<= .cse1 .cse0)))) [2021-07-05 16:59:39,410 INFO L762 garLoopResultBuilder]: For program point L7491-50(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,410 INFO L762 garLoopResultBuilder]: For program point L7491-56(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:39,410 INFO L762 garLoopResultBuilder]: For program point L7491-55(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:39,410 INFO L762 garLoopResultBuilder]: For program point L7491-61(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,410 INFO L762 garLoopResultBuilder]: For program point L7491-59(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,410 INFO L762 garLoopResultBuilder]: For program point L7491-58(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:39,410 INFO L762 garLoopResultBuilder]: For program point L7491-65(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,410 INFO L758 garLoopResultBuilder]: At program point L7491-64(lines 7489 7495) the Hoare annotation is: (let ((.cse33 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse34 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0)) (.cse15 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse19 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse20 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse36 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse46 (+ |#StackHeapBarrier| 1))) (let ((.cse25 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse26 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse16 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse22 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse4 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse6 (<= .cse46 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse28 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse11 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse23 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse24 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse7 (select .cse36 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse40 (and .cse33 .cse0 .cse1 .cse10 .cse34 .cse15 .cse19 .cse20)) (.cse27 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse29 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse43 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse17 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse30 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) (.cse32 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (and (let ((.cse18 (let ((.cse35 (select .cse36 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (<= (+ (* 4294967296 (div .cse35 4294967296)) 1) .cse35))) (.cse3 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse8 (= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse12 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse14 (not (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0))) (.cse21 (not (= |ULTIMATE.start_can_fail_realloc_#res.base| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= .cse7 (* 4294967296 (div .cse7 4294967296))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (let ((.cse31 (select .cse32 12))) (and .cse25 .cse0 .cse1 .cse2 .cse26 .cse3 .cse27 .cse4 .cse5 .cse6 .cse8 .cse28 .cse29 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= (* 4294967296 (div (+ 4294967295 .cse30 .cse7 (* .cse31 (- 1))) 4294967296)) .cse7) (<= .cse31 ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) .cse24)) (and .cse33 .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse28 .cse9 .cse10 .cse11 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0)) .cse12 .cse34 .cse14 .cse15 .cse16 .cse19 .cse20 .cse21 .cse22 .cse24))) .cse25 .cse26 (or (let ((.cse39 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and (let ((.cse37 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse38 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse37 .cse10 .cse11 .cse15 .cse16 .cse19 .cse20 .cse22 .cse38 .cse24) (and .cse0 .cse1 .cse2 .cse37 .cse10 .cse11 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse15 .cse19 .cse20 .cse22 .cse38 .cse24))) .cse4 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse39)) .cse6 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse39) |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse28 .cse9 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse13)) .cse40) .cse10 .cse19 .cse20 (let ((.cse47 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse44 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse41 (<= (select (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse47)) (.cse42 (<= .cse47 .cse7)) (.cse45 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)))) (or (and .cse2 .cse28 .cse29 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse9 .cse11 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse41 .cse42 .cse43 .cse19 .cse44 .cse20 .cse45 .cse23 .cse24) (and .cse0 .cse2 (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) .cse44) .cse5 .cse6 (<= .cse46 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse28 .cse9 .cse11 .cse41 .cse13 .cse42 .cse43 .cse19 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) .cse20 .cse45 .cse23 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) .cse24)))) (or .cse40 (and .cse0 .cse1 .cse27 .cse5 .cse29 .cse10 .cse15 .cse43 .cse17 .cse19 .cse20 (let ((.cse48 (select .cse32 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse48 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse48 .cse30) 4294967296)) 4294967295)))))))) [2021-07-05 16:59:39,410 INFO L762 garLoopResultBuilder]: For program point L7491-63(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,410 INFO L762 garLoopResultBuilder]: For program point L7491-69(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:39,410 INFO L762 garLoopResultBuilder]: For program point L7491-68(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:39,410 INFO L762 garLoopResultBuilder]: For program point L7491-66(line 7491) no Hoare annotation was computed. [2021-07-05 16:59:39,410 INFO L762 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2021-07-05 16:59:39,410 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 16:59:39,410 INFO L762 garLoopResultBuilder]: For program point L7491-72(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,411 INFO L762 garLoopResultBuilder]: For program point L7491-71(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 16:59:39,411 INFO L758 garLoopResultBuilder]: At program point L7491-77(lines 7489 7495) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (<= .cse0 .cse1) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (<= .cse1 .cse0))) [2021-07-05 16:59:39,411 INFO L762 garLoopResultBuilder]: For program point L7491-76(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,411 INFO L762 garLoopResultBuilder]: For program point L7491-74(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,411 INFO L762 garLoopResultBuilder]: For program point L9145(lines 9145 9148) no Hoare annotation was computed. [2021-07-05 16:59:39,411 INFO L762 garLoopResultBuilder]: For program point L9145-2(lines 9145 9148) no Hoare annotation was computed. [2021-07-05 16:59:39,411 INFO L762 garLoopResultBuilder]: For program point L7494(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,411 INFO L762 garLoopResultBuilder]: For program point L7494-4(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,411 INFO L762 garLoopResultBuilder]: For program point L7494-3(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,411 INFO L762 garLoopResultBuilder]: For program point L7494-2(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,411 INFO L762 garLoopResultBuilder]: For program point L7494-8(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,411 INFO L762 garLoopResultBuilder]: For program point L7494-6(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,411 INFO L762 garLoopResultBuilder]: For program point L7494-12(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,411 INFO L762 garLoopResultBuilder]: For program point L7494-11(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,411 INFO L762 garLoopResultBuilder]: For program point L7494-9(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,411 INFO L762 garLoopResultBuilder]: For program point L6966(lines 6966 6972) no Hoare annotation was computed. [2021-07-05 16:59:39,411 INFO L762 garLoopResultBuilder]: For program point L7494-15(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,411 INFO L762 garLoopResultBuilder]: For program point L7494-13(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,411 INFO L762 garLoopResultBuilder]: For program point L7494-20(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,411 INFO L762 garLoopResultBuilder]: For program point L7494-18(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,412 INFO L762 garLoopResultBuilder]: For program point L7494-17(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,412 INFO L762 garLoopResultBuilder]: For program point L7494-24(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,412 INFO L762 garLoopResultBuilder]: For program point L7494-22(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,412 INFO L762 garLoopResultBuilder]: For program point L7494-21(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,412 INFO L762 garLoopResultBuilder]: For program point L7494-27(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,412 INFO L762 garLoopResultBuilder]: For program point L7494-26(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,412 INFO L762 garLoopResultBuilder]: For program point L7494-31(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,412 INFO L762 garLoopResultBuilder]: For program point L7494-30(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,412 INFO L762 garLoopResultBuilder]: For program point L7494-29(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,412 INFO L758 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2021-07-05 16:59:39,412 INFO L762 garLoopResultBuilder]: For program point L7494-36(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,412 INFO L758 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: false [2021-07-05 16:59:39,412 INFO L762 garLoopResultBuilder]: For program point L7494-35(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,412 INFO L758 garLoopResultBuilder]: At program point L261-2(line 261) the Hoare annotation is: (let ((.cse48 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse33 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse46 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse35 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse44 (select .cse48 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse8 (+ |#StackHeapBarrier| 1))) (let ((.cse5 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse18 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse3 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse7 (<= .cse8 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse10 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse24 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse4 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse12 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse20 (select .cse48 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse6 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse11 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse13 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse14 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0))) (.cse15 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse19 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0))) (.cse22 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse23 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse26 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse28 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse16 (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse43 (* .cse44 (- 1))) (.cse45 (select .cse35 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse29 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse30 (<= (+ (* 4294967296 .cse46) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse17 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse32 (select .cse33 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 .cse2 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse3 .cse4 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse5)) .cse6 .cse7 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse5) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (<= .cse8 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) .cse13 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse14 .cse15 (<= (select .cse16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse17) .cse18 .cse19 (let ((.cse31 (select .cse33 12))) (let ((.cse21 (= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse25 (<= .cse32 (+ (* 4294967296 (div (+ (* (div .cse32 4294967296) 4294967296) 4294967295 (* .cse31 (- 1))) 4294967296)) .cse31))) (.cse27 (<= .cse31 (+ (* 4294967296 (div (+ (- 1) .cse31) 4294967296)) 4294967295)))) (or (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 (<= .cse20 (* 4294967296 (div .cse20 4294967296))) .cse21 .cse12 .cse13 .cse18 .cse19 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse21 .cse10 .cse12 .cse13 .cse19 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30)))) .cse22 .cse23 .cse24 (let ((.cse34 (select .cse35 12))) (<= .cse34 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse34) 4294967296))))) (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) .cse26 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) .cse28 (let ((.cse37 (select .cse16 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse36 (let ((.cse47 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse38 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse39 (not (= (select .cse47 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 4)) 0))) (.cse40 (not (= (select .cse47 4) 0))) (.cse41 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse42 (<= .cse8 ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and .cse38 .cse0 .cse1 .cse2 (<= (* 4294967296 (div (+ .cse32 4294967295) 4294967296)) .cse32) .cse6 .cse11 .cse39 .cse13 .cse40 .cse14 .cse15 .cse19 .cse22 (<= (* 4294967296 (div (+ 4294967295 .cse37) 4294967296)) .cse37) .cse23 .cse41 .cse26 .cse28 .cse42 .cse29 .cse30) (and .cse38 .cse0 (<= (* 4294967296 (div (+ (* (div (+ .cse43 4294967295 .cse20) 4294967296) 4294967296) .cse44) 4294967296)) .cse20) .cse1 .cse2 .cse6 (<= .cse45 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse45) 4294967296)))) .cse11 (<= .cse32 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse32) 4294967296)))) .cse39 .cse13 .cse40 (<= (* 4294967296 (div (+ .cse37 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse46 4294967296)) 4294967296)) .cse37) .cse14 .cse15 .cse19 .cse22 .cse23 .cse41 .cse26 .cse28 .cse42 .cse29 .cse30)))))) (or (and .cse4 .cse36 .cse9 .cse12) (and .cse36 .cse9 .cse12 (<= .cse37 (* 4294967296 (div .cse37 4294967296))))))) (<= .cse45 (+ (* 4294967296 (div (+ .cse43 (* (div .cse45 4294967296) 4294967296) 4294967295) 4294967296)) .cse44)) (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse29 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) .cse30 (<= .cse17 .cse32))))) [2021-07-05 16:59:39,413 INFO L762 garLoopResultBuilder]: For program point L7494-33(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,413 INFO L762 garLoopResultBuilder]: For program point L7494-40(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,413 INFO L762 garLoopResultBuilder]: For program point L7494-39(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,413 INFO L762 garLoopResultBuilder]: For program point L7494-38(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,413 INFO L762 garLoopResultBuilder]: For program point L7494-44(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,413 INFO L762 garLoopResultBuilder]: For program point L7494-42(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,413 INFO L762 garLoopResultBuilder]: For program point L7494-48(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,413 INFO L762 garLoopResultBuilder]: For program point L7494-47(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,413 INFO L762 garLoopResultBuilder]: For program point L7494-45(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,413 INFO L762 garLoopResultBuilder]: For program point L7494-51(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,413 INFO L762 garLoopResultBuilder]: For program point L7494-49(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,413 INFO L762 garLoopResultBuilder]: For program point L7494-53(line 7494) no Hoare annotation was computed. [2021-07-05 16:59:39,413 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 16:59:39,413 INFO L762 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2021-07-05 16:59:39,413 INFO L758 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: (let ((.cse36 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse34 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse39 (+ |#StackHeapBarrier| 1))) (let ((.cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse29 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse24 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse16 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse21 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse23 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse25 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse17 (<= .cse39 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse28 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse3 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse19 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse20 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse22 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse12 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse26 (<= (+ (* 4294967296 .cse34) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse27 (select .cse36 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse37 (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (let ((.cse10 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)))) (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse14 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse5 .cse6 .cse7 .cse8 (let ((.cse13 (select .cse14 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (<= .cse13 (* 4294967296 (div .cse13 4294967296)))) .cse9 (let ((.cse15 (select .cse14 12))) (<= .cse15 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse15) 4294967296))))) .cse10 .cse11 .cse12)))) (let ((.cse18 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse8 .cse23 .cse9 .cse24 .cse11 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse17 (<= .cse27 (* 4294967296 (div .cse27 4294967296))) .cse18 .cse20 .cse22 .cse28 .cse8 .cse23 .cse9 .cse24 .cse11 .cse25 .cse12 .cse26))) .cse16 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse29)) .cse5 .cse17 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse29) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse6 .cse19 .cse20 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse21 .cse22 .cse28 .cse8 .cse23 .cse9 .cse24 .cse11 .cse25 (<= |~#s_can_fail_allocator_static~0.offset| 0) (let ((.cse33 (select .cse37 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse30 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse31 (<= (* 4294967296 (div (let ((.cse35 (select .cse36 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* (div (+ (* .cse35 (- 1)) 4294967295 .cse27) 4294967296) 4294967296) .cse35)) 4294967296)) .cse27)) (.cse32 (<= (* 4294967296 (div (+ .cse33 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse34 4294967296)) 4294967296)) .cse33))) (or (and .cse30 .cse0 .cse31 .cse1 .cse2 .cse3 .cse16 .cse5 .cse17 .cse6 .cse7 .cse20 .cse21 .cse22 .cse32 .cse8 .cse23 .cse11 .cse25 .cse12) (and .cse30 .cse0 .cse31 .cse1 .cse2 .cse5 .cse17 .cse6 .cse7 .cse20 .cse21 .cse22 .cse32 (<= .cse33 (* 4294967296 (div .cse33 4294967296))) .cse8 .cse23 .cse11 .cse25 .cse12)))) .cse26 (let ((.cse43 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse40 (<= (select .cse37 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse43)) (.cse41 (<= .cse43 .cse27)) (.cse38 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse42 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)))) (or (and .cse0 .cse2 .cse3 (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) .cse38) .cse5 .cse17 (<= .cse39 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse6 .cse20 .cse22 .cse40 .cse28 .cse41 .cse9 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) .cse11 .cse42 .cse12 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) .cse26) (and .cse2 .cse3 .cse6 .cse19 .cse7 .cse20 .cse22 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse40 .cse41 .cse9 .cse38 .cse11 .cse42 .cse12 .cse26))))))) [2021-07-05 16:59:39,414 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 16:59:39,414 INFO L758 garLoopResultBuilder]: At program point L8192(lines 8175 8193) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse5 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (let ((.cse0 (and (<= (+ |ULTIMATE.start_aws_byte_buf_reserve_#res| 1) 0) .cse5)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse4 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse9 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse8 (select .cse7 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (or .cse0 (and .cse1 .cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse5 (let ((.cse6 (select .cse7 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse6 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse6 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) 4294967296)) 4294967295))))) (<= .cse8 .cse9) (or (let ((.cse10 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and .cse1 .cse2 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse10)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse10) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse3 .cse4 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) .cse5 (<= |~#s_can_fail_allocator_static~0.offset| 0))) .cse0) .cse5 (let ((.cse13 (div .cse8 4294967296)) (.cse14 (select .cse7 12))) (let ((.cse11 (<= .cse8 (+ (* 4294967296 (div (+ (* .cse13 4294967296) 4294967295 (* .cse14 (- 1))) 4294967296)) .cse14))) (.cse12 (<= .cse14 (+ (* 4294967296 (div (+ (- 1) .cse14) 4294967296)) 4294967295)))) (or (and .cse1 .cse2 .cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse4 .cse11 .cse5 .cse12) (and .cse1 .cse2 (<= .cse8 (* 4294967296 .cse13)) .cse3 .cse4 .cse11 .cse5 .cse12)))) (<= .cse9 .cse8)))) [2021-07-05 16:59:39,414 INFO L765 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: true [2021-07-05 16:59:39,414 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable313 [2021-07-05 16:59:39,414 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 16:59:39,414 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION was SAFE (7/10) [2021-07-05 16:59:39,415 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 16:59:39,415 INFO L329 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 16:59:39,415 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 16:59:39,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 200 states have internal predecessors, (281), 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-07-05 16:59:39,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-07-05 16:59:39,417 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:39,418 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:39,418 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:39,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:39,418 INFO L82 PathProgramCache]: Analyzing trace with hash -65735020, now seen corresponding path program 1 times [2021-07-05 16:59:39,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:39,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350783102] [2021-07-05 16:59:39,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:39,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:39,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:39,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:39,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:39,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:39,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:39,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350783102] [2021-07-05 16:59:39,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350783102] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:39,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:39,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 16:59:39,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344808445] [2021-07-05 16:59:39,512 INFO L425 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-05 16:59:39,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:39,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-05 16:59:39,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-05 16:59:39,512 INFO L87 Difference]: Start difference. First operand has 201 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 200 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-07-05 16:59:39,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:39,513 INFO L93 Difference]: Finished difference Result 395 states and 553 transitions. [2021-07-05 16:59:39,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-05 16:59:39,513 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-07-05 16:59:39,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:39,514 INFO L225 Difference]: With dead ends: 395 [2021-07-05 16:59:39,514 INFO L226 Difference]: Without dead ends: 168 [2021-07-05 16:59:39,514 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-05 16:59:39,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-07-05 16:59:39,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2021-07-05 16:59:39,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.3353293413173652) internal successors, (223), 167 states have internal predecessors, (223), 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-07-05 16:59:39,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 223 transitions. [2021-07-05 16:59:39,515 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 223 transitions. Word has length 30 [2021-07-05 16:59:39,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:39,515 INFO L442 AbstractCegarLoop]: Abstraction has 168 states and 223 transitions. [2021-07-05 16:59:39,516 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-07-05 16:59:39,516 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 223 transitions. [2021-07-05 16:59:39,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-07-05 16:59:39,516 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:39,516 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:39,516 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable338 [2021-07-05 16:59:39,516 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:39,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:39,516 INFO L82 PathProgramCache]: Analyzing trace with hash 74813590, now seen corresponding path program 1 times [2021-07-05 16:59:39,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:39,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403131759] [2021-07-05 16:59:39,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:39,517 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:39,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:39,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:39,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:39,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:59:39,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:39,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-07-05 16:59:39,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:39,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:39,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:39,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:39,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403131759] [2021-07-05 16:59:39,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403131759] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:39,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:39,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:59:39,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201279125] [2021-07-05 16:59:39,619 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:59:39,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:39,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:59:39,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:59:39,620 INFO L87 Difference]: Start difference. First operand 168 states and 223 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-07-05 16:59:39,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:39,684 INFO L93 Difference]: Finished difference Result 313 states and 415 transitions. [2021-07-05 16:59:39,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:59:39,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-07-05 16:59:39,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:39,685 INFO L225 Difference]: With dead ends: 313 [2021-07-05 16:59:39,685 INFO L226 Difference]: Without dead ends: 168 [2021-07-05 16:59:39,685 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:59:39,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-07-05 16:59:39,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2021-07-05 16:59:39,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.3233532934131738) internal successors, (221), 167 states have internal predecessors, (221), 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-07-05 16:59:39,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 221 transitions. [2021-07-05 16:59:39,686 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 221 transitions. Word has length 30 [2021-07-05 16:59:39,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:39,687 INFO L442 AbstractCegarLoop]: Abstraction has 168 states and 221 transitions. [2021-07-05 16:59:39,687 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-07-05 16:59:39,687 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 221 transitions. [2021-07-05 16:59:39,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-07-05 16:59:39,687 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:39,687 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:39,687 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable339 [2021-07-05 16:59:39,687 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:39,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:39,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1790809858, now seen corresponding path program 1 times [2021-07-05 16:59:39,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:39,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596500870] [2021-07-05 16:59:39,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:39,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:39,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:39,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:39,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:39,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:59:39,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:39,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:59:39,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:39,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:39,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:39,786 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596500870] [2021-07-05 16:59:39,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596500870] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:39,787 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:39,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:59:39,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638996014] [2021-07-05 16:59:39,787 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:59:39,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:39,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:59:39,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:59:39,787 INFO L87 Difference]: Start difference. First operand 168 states and 221 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-07-05 16:59:39,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:39,956 INFO L93 Difference]: Finished difference Result 454 states and 611 transitions. [2021-07-05 16:59:39,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:59:39,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-07-05 16:59:39,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:39,956 INFO L225 Difference]: With dead ends: 454 [2021-07-05 16:59:39,957 INFO L226 Difference]: Without dead ends: 300 [2021-07-05 16:59:39,957 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:59:39,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-07-05 16:59:39,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 180. [2021-07-05 16:59:39,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.3016759776536313) internal successors, (233), 179 states have internal predecessors, (233), 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-07-05 16:59:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 233 transitions. [2021-07-05 16:59:39,959 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 233 transitions. Word has length 42 [2021-07-05 16:59:39,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:39,959 INFO L442 AbstractCegarLoop]: Abstraction has 180 states and 233 transitions. [2021-07-05 16:59:39,959 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-07-05 16:59:39,959 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 233 transitions. [2021-07-05 16:59:39,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-07-05 16:59:39,959 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:39,959 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:39,959 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable340 [2021-07-05 16:59:39,959 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:39,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:39,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1768177604, now seen corresponding path program 1 times [2021-07-05 16:59:39,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:39,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192776721] [2021-07-05 16:59:39,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:39,960 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:40,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:40,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:40,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:40,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:59:40,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:40,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 16:59:40,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:40,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:40,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:40,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192776721] [2021-07-05 16:59:40,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192776721] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:40,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:40,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:59:40,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941081088] [2021-07-05 16:59:40,061 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:59:40,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:40,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:59:40,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:59:40,062 INFO L87 Difference]: Start difference. First operand 180 states and 233 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-07-05 16:59:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:40,219 INFO L93 Difference]: Finished difference Result 396 states and 519 transitions. [2021-07-05 16:59:40,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 16:59:40,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-07-05 16:59:40,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:40,220 INFO L225 Difference]: With dead ends: 396 [2021-07-05 16:59:40,220 INFO L226 Difference]: Without dead ends: 240 [2021-07-05 16:59:40,220 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:59:40,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-07-05 16:59:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 192. [2021-07-05 16:59:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.2827225130890052) internal successors, (245), 191 states have internal predecessors, (245), 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-07-05 16:59:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 245 transitions. [2021-07-05 16:59:40,222 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 245 transitions. Word has length 42 [2021-07-05 16:59:40,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:40,222 INFO L442 AbstractCegarLoop]: Abstraction has 192 states and 245 transitions. [2021-07-05 16:59:40,222 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-07-05 16:59:40,222 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 245 transitions. [2021-07-05 16:59:40,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-07-05 16:59:40,222 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:40,222 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:40,223 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable341 [2021-07-05 16:59:40,223 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:40,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:40,223 INFO L82 PathProgramCache]: Analyzing trace with hash -2065569472, now seen corresponding path program 1 times [2021-07-05 16:59:40,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:40,223 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314994056] [2021-07-05 16:59:40,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:40,223 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:40,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:40,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:40,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:40,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 16:59:40,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:40,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:59:40,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:40,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:40,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:40,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314994056] [2021-07-05 16:59:40,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314994056] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:40,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:40,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:59:40,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829214840] [2021-07-05 16:59:40,395 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:59:40,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:40,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:59:40,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:59:40,396 INFO L87 Difference]: Start difference. First operand 192 states and 245 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-07-05 16:59:42,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:42,732 INFO L93 Difference]: Finished difference Result 256 states and 324 transitions. [2021-07-05 16:59:42,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:59:42,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-07-05 16:59:42,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:42,733 INFO L225 Difference]: With dead ends: 256 [2021-07-05 16:59:42,733 INFO L226 Difference]: Without dead ends: 175 [2021-07-05 16:59:42,733 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:59:42,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-07-05 16:59:42,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2021-07-05 16:59:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.2586206896551724) internal successors, (219), 174 states have internal predecessors, (219), 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-07-05 16:59:42,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 219 transitions. [2021-07-05 16:59:42,735 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 219 transitions. Word has length 42 [2021-07-05 16:59:42,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:42,735 INFO L442 AbstractCegarLoop]: Abstraction has 175 states and 219 transitions. [2021-07-05 16:59:42,735 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-07-05 16:59:42,735 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 219 transitions. [2021-07-05 16:59:42,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-05 16:59:42,735 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:42,735 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:42,735 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable342 [2021-07-05 16:59:42,735 INFO L374 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:42,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:42,736 INFO L82 PathProgramCache]: Analyzing trace with hash -686672897, now seen corresponding path program 1 times [2021-07-05 16:59:42,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:42,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228999017] [2021-07-05 16:59:42,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:42,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:42,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:42,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:42,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:42,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:59:42,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:42,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 16:59:42,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:42,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:59:42,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:42,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:59:42,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:42,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:42,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:42,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:42,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:42,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228999017] [2021-07-05 16:59:42,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228999017] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:42,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:42,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:59:42,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889572676] [2021-07-05 16:59:42,876 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:59:42,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:42,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:59:42,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:59:42,876 INFO L87 Difference]: Start difference. First operand 175 states and 219 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-07-05 16:59:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:42,998 INFO L93 Difference]: Finished difference Result 298 states and 372 transitions. [2021-07-05 16:59:42,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:59:42,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-07-05 16:59:42,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:42,998 INFO L225 Difference]: With dead ends: 298 [2021-07-05 16:59:42,998 INFO L226 Difference]: Without dead ends: 175 [2021-07-05 16:59:42,999 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 87.0ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-07-05 16:59:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-07-05 16:59:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2021-07-05 16:59:43,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.2413793103448276) internal successors, (216), 174 states have internal predecessors, (216), 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-07-05 16:59:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 216 transitions. [2021-07-05 16:59:43,001 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 216 transitions. Word has length 71 [2021-07-05 16:59:43,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:43,001 INFO L442 AbstractCegarLoop]: Abstraction has 175 states and 216 transitions. [2021-07-05 16:59:43,001 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-07-05 16:59:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2021-07-05 16:59:43,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-07-05 16:59:43,001 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:43,001 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:43,001 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable343 [2021-07-05 16:59:43,001 INFO L374 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:43,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:43,002 INFO L82 PathProgramCache]: Analyzing trace with hash 250999241, now seen corresponding path program 1 times [2021-07-05 16:59:43,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:43,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413310963] [2021-07-05 16:59:43,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:43,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:43,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:43,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:43,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:43,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:59:43,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:43,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:59:43,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:43,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:43,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:43,123 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413310963] [2021-07-05 16:59:43,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413310963] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:43,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:43,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:59:43,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804015810] [2021-07-05 16:59:43,124 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:59:43,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:43,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:59:43,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:59:43,124 INFO L87 Difference]: Start difference. First operand 175 states and 216 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:59:43,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:43,145 INFO L93 Difference]: Finished difference Result 237 states and 289 transitions. [2021-07-05 16:59:43,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:59:43,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-07-05 16:59:43,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:43,146 INFO L225 Difference]: With dead ends: 237 [2021-07-05 16:59:43,146 INFO L226 Difference]: Without dead ends: 210 [2021-07-05 16:59:43,146 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:59:43,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-07-05 16:59:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 177. [2021-07-05 16:59:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.2386363636363635) internal successors, (218), 176 states have internal predecessors, (218), 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-07-05 16:59:43,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 218 transitions. [2021-07-05 16:59:43,148 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 218 transitions. Word has length 83 [2021-07-05 16:59:43,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:43,148 INFO L442 AbstractCegarLoop]: Abstraction has 177 states and 218 transitions. [2021-07-05 16:59:43,148 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:59:43,149 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 218 transitions. [2021-07-05 16:59:43,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-07-05 16:59:43,149 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:43,149 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:43,149 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable344 [2021-07-05 16:59:43,149 INFO L374 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:43,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:43,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1360235703, now seen corresponding path program 1 times [2021-07-05 16:59:43,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:43,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346385986] [2021-07-05 16:59:43,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:43,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:43,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:43,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:43,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:43,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:59:43,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:43,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:59:43,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:43,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:43,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:43,264 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346385986] [2021-07-05 16:59:43,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346385986] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:43,265 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:43,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 16:59:43,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278813621] [2021-07-05 16:59:43,265 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 16:59:43,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:43,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 16:59:43,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 16:59:43,265 INFO L87 Difference]: Start difference. First operand 177 states and 218 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:59:43,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:43,286 INFO L93 Difference]: Finished difference Result 291 states and 356 transitions. [2021-07-05 16:59:43,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 16:59:43,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-07-05 16:59:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:43,287 INFO L225 Difference]: With dead ends: 291 [2021-07-05 16:59:43,287 INFO L226 Difference]: Without dead ends: 235 [2021-07-05 16:59:43,287 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 16:59:43,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-07-05 16:59:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 177. [2021-07-05 16:59:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.2386363636363635) internal successors, (218), 176 states have internal predecessors, (218), 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-07-05 16:59:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 218 transitions. [2021-07-05 16:59:43,289 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 218 transitions. Word has length 83 [2021-07-05 16:59:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:43,290 INFO L442 AbstractCegarLoop]: Abstraction has 177 states and 218 transitions. [2021-07-05 16:59:43,290 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 16:59:43,290 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 218 transitions. [2021-07-05 16:59:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-07-05 16:59:43,291 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:43,291 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:43,291 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable345 [2021-07-05 16:59:43,291 INFO L374 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:43,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:43,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1426341721, now seen corresponding path program 1 times [2021-07-05 16:59:43,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:43,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942202840] [2021-07-05 16:59:43,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:43,291 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:43,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:43,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:43,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:43,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:59:43,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:43,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:59:43,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:43,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:59:43,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:43,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 16:59:43,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:43,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:43,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:43,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942202840] [2021-07-05 16:59:43,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942202840] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:43,434 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:43,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-05 16:59:43,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081419245] [2021-07-05 16:59:43,434 INFO L425 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-05 16:59:43,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:43,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-05 16:59:43,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-05 16:59:43,435 INFO L87 Difference]: Start difference. First operand 177 states and 218 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-07-05 16:59:43,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:43,493 INFO L93 Difference]: Finished difference Result 298 states and 362 transitions. [2021-07-05 16:59:43,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:59:43,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-07-05 16:59:43,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:43,494 INFO L225 Difference]: With dead ends: 298 [2021-07-05 16:59:43,494 INFO L226 Difference]: Without dead ends: 211 [2021-07-05 16:59:43,494 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 44.2ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-07-05 16:59:43,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-07-05 16:59:43,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 149. [2021-07-05 16:59:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.222972972972973) internal successors, (181), 148 states have internal predecessors, (181), 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-07-05 16:59:43,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 181 transitions. [2021-07-05 16:59:43,496 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 181 transitions. Word has length 88 [2021-07-05 16:59:43,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:43,497 INFO L442 AbstractCegarLoop]: Abstraction has 149 states and 181 transitions. [2021-07-05 16:59:43,497 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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-07-05 16:59:43,497 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 181 transitions. [2021-07-05 16:59:43,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-07-05 16:59:43,497 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:43,497 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:43,497 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable346 [2021-07-05 16:59:43,497 INFO L374 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:43,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:43,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1203820087, now seen corresponding path program 1 times [2021-07-05 16:59:43,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:43,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438185628] [2021-07-05 16:59:43,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:43,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:43,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:43,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:43,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:43,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 16:59:43,797 INFO L142 QuantifierPusher]: treesize reduction 79, result has 57.1 percent of original size [2021-07-05 16:59:43,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 105 [2021-07-05 16:59:43,869 INFO L142 QuantifierPusher]: treesize reduction 83, result has 63.3 percent of original size [2021-07-05 16:59:43,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 143 [2021-07-05 16:59:44,013 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2021-07-05 16:59:44,016 INFO L142 QuantifierPusher]: treesize reduction 72, result has 60.4 percent of original size [2021-07-05 16:59:44,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 110 [2021-07-05 16:59:44,025 INFO L142 QuantifierPusher]: treesize reduction 12, result has 73.9 percent of original size [2021-07-05 16:59:44,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-05 16:59:44,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:44,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:59:44,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:44,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:44,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:44,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438185628] [2021-07-05 16:59:44,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438185628] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:44,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:44,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 16:59:44,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271580307] [2021-07-05 16:59:44,067 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 16:59:44,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:44,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 16:59:44,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 16:59:44,068 INFO L87 Difference]: Start difference. First operand 149 states and 181 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-07-05 16:59:44,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:44,297 INFO L93 Difference]: Finished difference Result 211 states and 254 transitions. [2021-07-05 16:59:44,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 16:59:44,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-07-05 16:59:44,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:44,298 INFO L225 Difference]: With dead ends: 211 [2021-07-05 16:59:44,298 INFO L226 Difference]: Without dead ends: 134 [2021-07-05 16:59:44,298 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 290.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-07-05 16:59:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-07-05 16:59:44,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2021-07-05 16:59:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.1954887218045114) internal successors, (159), 133 states have internal predecessors, (159), 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-07-05 16:59:44,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 159 transitions. [2021-07-05 16:59:44,300 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 159 transitions. Word has length 89 [2021-07-05 16:59:44,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:44,300 INFO L442 AbstractCegarLoop]: Abstraction has 134 states and 159 transitions. [2021-07-05 16:59:44,300 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 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-07-05 16:59:44,300 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 159 transitions. [2021-07-05 16:59:44,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-07-05 16:59:44,300 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 16:59:44,300 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 16:59:44,300 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable347 [2021-07-05 16:59:44,300 INFO L374 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 16:59:44,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 16:59:44,301 INFO L82 PathProgramCache]: Analyzing trace with hash -491070397, now seen corresponding path program 1 times [2021-07-05 16:59:44,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 16:59:44,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925562213] [2021-07-05 16:59:44,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 16:59:44,301 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 16:59:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 16:59:44,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:44,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:44,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:44,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:59:44,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:44,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-05 16:59:44,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:44,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-07-05 16:59:44,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:44,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-05 16:59:44,623 INFO L142 QuantifierPusher]: treesize reduction 67, result has 73.8 percent of original size [2021-07-05 16:59:44,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 189 [2021-07-05 16:59:44,744 INFO L142 QuantifierPusher]: treesize reduction 63, result has 78.5 percent of original size [2021-07-05 16:59:44,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 230 [2021-07-05 16:59:45,073 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2021-07-05 16:59:45,080 INFO L142 QuantifierPusher]: treesize reduction 108, result has 60.4 percent of original size [2021-07-05 16:59:45,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 165 [2021-07-05 16:59:45,362 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2021-07-05 16:59:45,366 INFO L142 QuantifierPusher]: treesize reduction 63, result has 71.4 percent of original size [2021-07-05 16:59:45,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 157 [2021-07-05 16:59:45,574 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2021-07-05 16:59:45,579 INFO L142 QuantifierPusher]: treesize reduction 63, result has 75.2 percent of original size [2021-07-05 16:59:45,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 191 [2021-07-05 16:59:45,603 INFO L142 QuantifierPusher]: treesize reduction 60, result has 66.3 percent of original size [2021-07-05 16:59:45,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 118 [2021-07-05 16:59:45,706 INFO L142 QuantifierPusher]: treesize reduction 12, result has 73.9 percent of original size [2021-07-05 16:59:45,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-05 16:59:45,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:45,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 16:59:45,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 16:59:45,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 16:59:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 16:59:45,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 16:59:45,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925562213] [2021-07-05 16:59:45,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925562213] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 16:59:45,768 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 16:59:45,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-05 16:59:45,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484988874] [2021-07-05 16:59:45,768 INFO L425 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-05 16:59:45,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 16:59:45,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-05 16:59:45,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-07-05 16:59:45,768 INFO L87 Difference]: Start difference. First operand 134 states and 159 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 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-07-05 16:59:58,649 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2021-07-05 16:59:58,886 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2021-07-05 16:59:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 16:59:58,887 INFO L93 Difference]: Finished difference Result 134 states and 159 transitions. [2021-07-05 16:59:58,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-05 16:59:58,887 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-07-05 16:59:58,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 16:59:58,887 INFO L225 Difference]: With dead ends: 134 [2021-07-05 16:59:58,887 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 16:59:58,887 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1513.6ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-07-05 16:59:58,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 16:59:58,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 16:59:58,888 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-07-05 16:59:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 16:59:58,888 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2021-07-05 16:59:58,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 16:59:58,888 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 16:59:58,888 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 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-07-05 16:59:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 16:59:58,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 16:59:58,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 16:59:58,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,900 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,905 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,913 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,914 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,914 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,916 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:58,916 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 16:59:59,191 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-07-05 16:59:59,558 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-07-05 16:59:59,895 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2021-07-05 17:00:00,143 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2021-07-05 17:00:00,461 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2021-07-05 17:00:00,539 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,539 INFO L762 garLoopResultBuilder]: For program point L9153(lines 9153 9155) no Hoare annotation was computed. [2021-07-05 17:00:00,539 INFO L762 garLoopResultBuilder]: For program point L9153-2(lines 9153 9155) no Hoare annotation was computed. [2021-07-05 17:00:00,539 INFO L762 garLoopResultBuilder]: For program point L6973(lines 6973 6978) no Hoare annotation was computed. [2021-07-05 17:00:00,539 INFO L758 garLoopResultBuilder]: At program point L268(line 268) the Hoare annotation is: false [2021-07-05 17:00:00,539 INFO L762 garLoopResultBuilder]: For program point L6974(lines 6974 6976) no Hoare annotation was computed. [2021-07-05 17:00:00,539 INFO L762 garLoopResultBuilder]: For program point L6974-2(lines 6974 6976) no Hoare annotation was computed. [2021-07-05 17:00:00,539 INFO L762 garLoopResultBuilder]: For program point L7141-2(line 7141) no Hoare annotation was computed. [2021-07-05 17:00:00,539 INFO L762 garLoopResultBuilder]: For program point L7141(line 7141) no Hoare annotation was computed. [2021-07-05 17:00:00,539 INFO L765 garLoopResultBuilder]: At program point L9157(line 9157) the Hoare annotation is: true [2021-07-05 17:00:00,539 INFO L762 garLoopResultBuilder]: For program point L6979(lines 6979 6981) no Hoare annotation was computed. [2021-07-05 17:00:00,540 INFO L758 garLoopResultBuilder]: At program point L6979-3(lines 6965 6982) the Hoare annotation is: (let ((.cse74 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse31 (select .cse74 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse25 (= |ULTIMATE.start_can_fail_realloc_#res.base| 0)) (.cse27 (+ |#StackHeapBarrier| 1)) (.cse28 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse65 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse42 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse33 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse40 (select .cse42 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse34 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse30 (select .cse74 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse32 (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse13 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse20 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse9 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse39 (not (= (select .cse65 4) 0))) (.cse23 (= |ULTIMATE.start_can_fail_realloc_#res.offset| 0)) (.cse16 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse26 (<= (+ (* 4294967296 .cse28) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse38 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse36 (<= .cse27 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse45 (<= .cse27 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse58 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse48 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse44 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse8 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse22 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse43 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse19 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse21 (not .cse25)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse3 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse57 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse12 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse14 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse24 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse29 (* .cse31 (- 1))) (.cse18 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse15 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and .cse0 (let ((.cse11 (select .cse32 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse1 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse2 (<= (* 4294967296 (div (+ (* (div (+ .cse29 4294967295 .cse30) 4294967296) 4294967296) .cse31) 4294967296)) .cse30)) (.cse10 (<= (* 4294967296 (div (+ .cse11 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse28 4294967296)) 4294967296)) .cse11)) (.cse17 (<= .cse27 ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse11 (* 4294967296 (div .cse11 4294967296))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse19 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18) (and .cse4 .cse22 .cse9 .cse23 .cse24 .cse15 .cse25 .cse26)))) .cse3 .cse33 .cse5 .cse34 .cse22 (let ((.cse35 (< (* 4294967296 (div ULTIMATE.start_can_fail_realloc_~newsize 4294967296)) ULTIMATE.start_can_fail_realloc_~newsize)) (.cse37 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse3 .cse4 .cse19 .cse33 .cse35 .cse20 .cse5 .cse36 .cse37 .cse34 .cse8 .cse22 .cse9 .cse12 .cse13 .cse14 .cse38 .cse15 .cse21 .cse16) (let ((.cse41 (select .cse42 12))) (and .cse0 .cse3 .cse4 .cse22 .cse9 .cse39 .cse23 .cse12 .cse24 (<= .cse40 (+ (* 4294967296 (div (+ (* (div .cse40 4294967296) 4294967296) 4294967295 (* .cse41 (- 1))) 4294967296)) .cse41)) .cse15 .cse25 (<= .cse41 (+ (* 4294967296 (div (+ (- 1) .cse41) 4294967296)) 4294967295)) .cse26)) (and .cse0 .cse3 .cse4 .cse19 .cse35 .cse20 .cse5 .cse36 (<= .cse30 (* 4294967296 (div .cse30 4294967296))) .cse37 .cse8 .cse9 .cse43 .cse12 .cse13 .cse14 .cse38 .cse15 .cse21 .cse16 .cse18))) (let ((.cse50 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse46 (<= (select .cse32 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse50)) (.cse47 (<= .cse50 .cse30)) (.cse49 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)))) (or (and .cse0 .cse4 .cse19 (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) .cse44) .cse5 .cse36 .cse45 .cse6 .cse8 .cse9 .cse46 .cse43 .cse47 .cse14 .cse48 .cse15 .cse21 .cse49 .cse18 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) .cse26) (and .cse4 (<= .cse40 .cse50) .cse22 .cse9 .cse23 .cse24 .cse15 .cse25 .cse26 (<= .cse50 .cse40)) (and .cse4 .cse19 .cse6 .cse34 .cse7 .cse8 .cse9 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse46 .cse47 .cse14 .cse44 .cse15 .cse21 .cse49 .cse18 .cse26)))) (let ((.cse59 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse51 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse59))) (.cse52 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse59) |~#s_can_fail_allocator_static~0.base|)) (.cse53 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse54 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|)) (.cse55 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|)) (.cse56 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse3 .cse4 .cse19 .cse20 .cse51 .cse36 .cse52 .cse53 .cse54 .cse6 .cse8 .cse55 .cse22 .cse9 .cse43 .cse12 .cse13 .cse15 .cse21 .cse16 .cse56 .cse26) (and .cse0 .cse3 .cse4 .cse20 .cse51 .cse52 .cse53 .cse54 .cse6 .cse8 .cse55 .cse22 .cse9 .cse39 .cse57 (not (= (select .cse58 ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0)) .cse23 .cse12 .cse24 .cse15 .cse25 .cse16 .cse56 .cse18 .cse26)))) .cse12 .cse14 .cse38 (let ((.cse62 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse66 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse60 (not (= .cse66 ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse63 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse66)) (.cse61 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse62))) (.cse64 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse62) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse66)))) (or (and .cse0 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) .cse60) .cse19 .cse5 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 12))) .cse36 .cse45 .cse6 .cse8 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4))) .cse22 .cse43 .cse61 (= (select .cse58 .cse62) .cse63) .cse48 .cse15 .cse21 .cse64) (and (or .cse60 .cse44) .cse6 .cse8 .cse22 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) (= .cse63 (select .cse65 .cse62)) .cse43 .cse61 .cse15 .cse64)))) (let ((.cse73 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse69 (select .cse73 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse67 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse68 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse71 (let ((.cse72 (select .cse73 12))) (<= .cse72 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse72) 4294967296)))))) (.cse70 (div .cse69 4294967296))) (or (and .cse0 .cse3 .cse19 .cse5 .cse6 .cse7 .cse12 .cse14 .cse24 .cse15 .cse21 .cse18) (and .cse67 .cse0 .cse3 .cse68 .cse5 .cse6 .cse7 .cse12 (<= .cse69 (* 4294967296 .cse70)) .cse14 .cse71 .cse24 .cse15 .cse18) (and .cse67 .cse0 .cse3 .cse68 .cse5 .cse6 .cse7 .cse57 .cse12 .cse14 .cse71 .cse24 .cse15 (<= .cse69 (+ (* 4294967296 (div (+ .cse29 (* .cse70 4294967296) 4294967295) 4294967296)) .cse31)) .cse18))))) .cse15)))) [2021-07-05 17:00:00,540 INFO L762 garLoopResultBuilder]: For program point L6979-2(lines 6979 6981) no Hoare annotation was computed. [2021-07-05 17:00:00,540 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,540 INFO L762 garLoopResultBuilder]: For program point L7145(lines 7145 7151) no Hoare annotation was computed. [2021-07-05 17:00:00,540 INFO L758 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: (let ((.cse13 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse10 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse13)) (.cse11 (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse13))) (let ((.cse2 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse3 (= .cse11 0)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse4 (= .cse10 0)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse7 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and .cse0 .cse1 .cse2 (let ((.cse5 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse9 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| .cse10) .cse2 (= .cse11 |~#s_can_fail_allocator_static~0.base|) .cse5 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse6 .cse7 .cse8 .cse9))) .cse6 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse7 .cse8 (let ((.cse12 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse12 .cse6 .cse7 .cse8) (and .cse0 .cse3 .cse1 .cse4 .cse12 .cse6 .cse7 .cse8))))))) [2021-07-05 17:00:00,540 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,540 INFO L762 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:00,540 INFO L762 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:00,540 INFO L762 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:00,540 INFO L762 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:00,540 INFO L762 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:00,540 INFO L762 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:00,540 INFO L762 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:00,541 INFO L762 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:00,541 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,541 INFO L762 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-07-05 17:00:00,541 INFO L762 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-07-05 17:00:00,541 INFO L762 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-07-05 17:00:00,541 INFO L762 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-07-05 17:00:00,541 INFO L762 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-07-05 17:00:00,541 INFO L762 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-07-05 17:00:00,541 INFO L762 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-07-05 17:00:00,541 INFO L762 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-07-05 17:00:00,541 INFO L758 garLoopResultBuilder]: At program point L6951-1(lines 6950 6952) the Hoare annotation is: (let ((.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse2 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse7 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse9 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse8 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse6 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse4 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse3 (select .cse15 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse2)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse2) |~#s_can_fail_allocator_static~0.base|) (<= .cse3 .cse4) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |ULTIMATE.start_aws_byte_buf_has_allocator_#t~mem500.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse5 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse6) (select .cse7 .cse8)) .cse9 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) .cse10 (let ((.cse13 (div .cse3 4294967296)) (.cse14 (select .cse15 12))) (let ((.cse11 (<= .cse3 (+ (* 4294967296 (div (+ (* .cse13 4294967296) 4294967295 (* .cse14 (- 1))) 4294967296)) .cse14))) (.cse12 (<= .cse14 (+ (* 4294967296 (div (+ (- 1) .cse14) 4294967296)) 4294967295)))) (or (and .cse0 .cse1 .cse5 (not (= (select .cse7 4) 0)) .cse9 .cse11 .cse10 .cse12) (and .cse0 .cse1 (<= .cse3 (* 4294967296 .cse13)) .cse5 .cse9 .cse11 .cse10 .cse12)))) (= |ULTIMATE.start_can_fail_allocator_#res.base| |ULTIMATE.start_aws_byte_buf_has_allocator_#t~mem500.base|) (<= |~#s_can_fail_allocator_static~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse8) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse6)) (<= .cse4 .cse3)))) [2021-07-05 17:00:00,541 INFO L758 garLoopResultBuilder]: At program point L6951(lines 6950 6952) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2021-07-05 17:00:00,542 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,542 INFO L758 garLoopResultBuilder]: At program point L6655(lines 6653 6656) the Hoare annotation is: (let ((.cse15 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse2 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse7 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse9 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse8 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse6 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse4 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse3 (select .cse15 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and .cse0 (<= 1 |ULTIMATE.start_aws_byte_buf_has_allocator_#res|) .cse1 (<= |ULTIMATE.start_aws_byte_buf_has_allocator_#res| 1) (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse2)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse2) |~#s_can_fail_allocator_static~0.base|) (<= .cse3 .cse4) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse5 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse6) (select .cse7 .cse8)) .cse9 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) .cse10 (let ((.cse13 (div .cse3 4294967296)) (.cse14 (select .cse15 12))) (let ((.cse11 (<= .cse3 (+ (* 4294967296 (div (+ (* .cse13 4294967296) 4294967295 (* .cse14 (- 1))) 4294967296)) .cse14))) (.cse12 (<= .cse14 (+ (* 4294967296 (div (+ (- 1) .cse14) 4294967296)) 4294967295)))) (or (and .cse0 .cse1 .cse5 (not (= (select .cse7 4) 0)) .cse9 .cse11 .cse10 .cse12) (and .cse0 .cse1 (<= .cse3 (* 4294967296 .cse13)) .cse5 .cse9 .cse11 .cse10 .cse12)))) (<= |~#s_can_fail_allocator_static~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse8) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse6)) (<= .cse4 .cse3)))) [2021-07-05 17:00:00,542 INFO L758 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse16 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse15 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse2 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse1 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse0 (<= .cse1 .cse2) (let ((.cse14 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse5 (select .cse14 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse13 (select .cse14 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (let ((.cse3 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse4 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse7 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse8 (<= .cse13 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse13) 4294967296))))) (.cse9 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse6 (div .cse5 4294967296)) (.cse12 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (or (and .cse3 .cse4 .cse0 (<= .cse5 (* 4294967296 .cse6)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse3 .cse4 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse5 (+ (* 4294967296 (div (+ (* .cse6 4294967296) (* .cse13 (- 1)) 4294967295) 4294967296)) .cse13)) .cse12))))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse15) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse16)) .cse10 .cse11 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse16) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse15)) (<= .cse2 .cse1))) [2021-07-05 17:00:00,542 INFO L758 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (let ((.cse6 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse5 (select .cse6 12)) (.cse4 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse3 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse1 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse0 (select .cse6 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= .cse0 .cse1) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= (select .cse2 4) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse3) (select .cse2 .cse4)) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (<= .cse0 (+ (* 4294967296 (div (+ (* (div .cse0 4294967296) 4294967296) 4294967295 (* .cse5 (- 1))) 4294967296)) .cse5)) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (<= .cse5 (+ (* 4294967296 (div (+ (- 1) .cse5) 4294967296)) 4294967295)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse4) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse3)) (<= .cse1 .cse0)))) [2021-07-05 17:00:00,543 INFO L758 garLoopResultBuilder]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: (let ((.cse26 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse3 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse7 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse19 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse23 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse11 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse14 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse16 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse17 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse25 (select .cse26 12)) (.cse18 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse24 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse2 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse6 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse5 (select .cse26 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse0 .cse1 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize) (or (not (= .cse2 ULTIMATE.start_aws_mem_realloc_~ptr.offset)) (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4) (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse3)) .cse4 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse3) |~#s_can_fail_allocator_static~0.base|) (<= .cse5 .cse6) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse7 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) (let ((.cse22 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse12 (select .cse22 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse8 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse9 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse10 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse15 (let ((.cse21 (select .cse22 12))) (<= .cse21 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse21) 4294967296)))))) (.cse13 (div .cse12 4294967296))) (or (and .cse8 .cse0 .cse1 .cse9 .cse4 .cse7 .cse10 .cse11 (<= .cse12 (* 4294967296 .cse13)) .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse8 .cse0 .cse1 .cse9 .cse4 .cse7 .cse10 .cse19 .cse11 .cse14 .cse15 .cse16 .cse17 (<= .cse12 (let ((.cse20 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse20 (- 1)) (* .cse13 4294967296) 4294967295) 4294967296)) .cse20))) .cse18))))) (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity) (not (= (select .cse23 4) 0)) .cse19 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse2) (select .cse23 .cse24)) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse24)) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0)) .cse11 .cse14 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse16 (<= .cse5 (+ (* 4294967296 (div (+ (* (div .cse5 4294967296) 4294967296) 4294967295 (* .cse25 (- 1))) 4294967296)) .cse25)) .cse17 (<= .cse25 (+ (* 4294967296 (div (+ (- 1) .cse25) 4294967296)) 4294967295)) (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse18 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse24) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse2)) (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0) (<= .cse6 .cse5)))) [2021-07-05 17:00:00,543 INFO L762 garLoopResultBuilder]: For program point L8176-1(line 8176) no Hoare annotation was computed. [2021-07-05 17:00:00,543 INFO L758 garLoopResultBuilder]: At program point L8176-4(line 8176) the Hoare annotation is: (let ((.cse49 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse46 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse23 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse44 (select .cse46 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse47 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse39 (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse48 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 16)) (.cse38 (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse49))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse33 (= .cse38 0)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse34 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse49) 0)) (.cse35 (= (select .cse39 .cse48) 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse10 (not (= (select .cse47 4) 0))) (.cse11 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse15 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse25 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse16 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse17 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse19 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse37 (= (select .cse47 .cse48) 0)) (.cse29 (+ |#StackHeapBarrier| 1)) (.cse27 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse45 (div .cse44 4294967296)) (.cse43 (select .cse46 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse13 (select .cse23 12))) (let ((.cse22 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse13) 4294967296)))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse18 (<= .cse44 (+ (* 4294967296 (div (+ (* .cse45 4294967296) (* .cse43 (- 1)) 4294967295) 4294967296)) .cse43))) (.cse20 (<= .cse44 (* 4294967296 .cse45))) (.cse12 (<= .cse43 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse43) 4294967296))))) (.cse7 (<= .cse27 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse27) 4294967296))))) (.cse1 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse3 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse26 (<= .cse29 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse24 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse40 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse30 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse42 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse21 (and .cse0 .cse33 .cse2 .cse34 .cse35 .cse4 .cse6 .cse10 .cse11 .cse15 .cse25 .cse16 .cse17 .cse19 .cse37)) (.cse32 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse31 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse28 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (and .cse0 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (let ((.cse5 (select .cse23 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse8 (<= .cse13 .cse22)) (.cse14 (div .cse5 4294967296))) (or (and .cse1 .cse0 .cse2 .cse3 .cse4 (<= .cse5 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse5) 4294967296)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse5 (+ .cse13 (* 4294967296 (div (+ (* .cse14 4294967296) 4294967295 (* .cse13 (- 1))) 4294967296)))) .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse20 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 (<= .cse5 (* 4294967296 .cse14)) .cse16 .cse17 .cse19) .cse21))) .cse4 (or .cse21 (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse6 .cse24 .cse11 (<= (select .cse23 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 12)) .cse22) .cse15 .cse25 .cse16 .cse17 .cse19)) .cse26 (<= .cse27 .cse28) (<= .cse29 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse6 .cse30 .cse24 .cse9 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse31) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse32)) .cse25 (let ((.cse36 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse33 .cse2 .cse34 .cse35 .cse4 .cse6 .cse10 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |~#s_can_fail_allocator_static~0.offset| 1)) .cse11 .cse15 .cse25 .cse16 .cse17 .cse36 .cse19 .cse37) (and .cse0 .cse2 .cse4 .cse26 (= .cse38 |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse6 .cse30 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse11 .cse15 .cse25 (= (select .cse39 16) |~#s_can_fail_allocator_static~0.offset|) .cse17 .cse36 .cse19))) (let ((.cse41 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse1 .cse0 .cse2 .cse3 .cse40 .cse4 .cse26 .cse41 .cse30 .cse11 .cse12 .cse15 .cse25 .cse42 .cse17 .cse18 .cse19) (and .cse1 .cse0 .cse33 .cse2 .cse3 .cse34 .cse35 .cse4 .cse41 .cse6 .cse10 .cse11 .cse12 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 .cse37) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse26 .cse20 .cse41 .cse30 .cse11 .cse12 .cse15 .cse25 .cse42 .cse17 .cse19))) .cse17 (or (and .cse0 .cse2 .cse4 .cse26 .cse6 .cse24 .cse7 .cse10 .cse11 .cse15 .cse25 .cse16 .cse17 .cse19) (and .cse0 .cse33 .cse2 .cse34 .cse35 .cse4 .cse26 .cse6 .cse10 .cse11 .cse15 .cse25 .cse16 .cse17 .cse19 .cse37) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse26 .cse6 .cse24 .cse10 .cse11 .cse15 .cse25 .cse16 .cse17 .cse19)) .cse19 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) (or (and .cse0 .cse2 .cse40 .cse4 .cse30 .cse11 .cse15 .cse25 .cse42 .cse17 .cse19) .cse21) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse31)) (<= .cse28 .cse27)))))) [2021-07-05 17:00:00,543 INFO L762 garLoopResultBuilder]: For program point L8176-3(line 8176) no Hoare annotation was computed. [2021-07-05 17:00:00,543 INFO L762 garLoopResultBuilder]: For program point L8177-3(lines 8175 8193) no Hoare annotation was computed. [2021-07-05 17:00:00,543 INFO L762 garLoopResultBuilder]: For program point L8177-2(line 8177) no Hoare annotation was computed. [2021-07-05 17:00:00,544 INFO L762 garLoopResultBuilder]: For program point L8177(line 8177) no Hoare annotation was computed. [2021-07-05 17:00:00,544 INFO L762 garLoopResultBuilder]: For program point L8177-4(line 8177) no Hoare annotation was computed. [2021-07-05 17:00:00,544 INFO L762 garLoopResultBuilder]: For program point L6658(lines 6658 6663) no Hoare annotation was computed. [2021-07-05 17:00:00,544 INFO L762 garLoopResultBuilder]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 17:00:00,544 INFO L762 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 17:00:00,544 INFO L762 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 17:00:00,544 INFO L762 garLoopResultBuilder]: For program point L7154(lines 7154 7156) no Hoare annotation was computed. [2021-07-05 17:00:00,544 INFO L762 garLoopResultBuilder]: For program point L6659(lines 6659 6661) no Hoare annotation was computed. [2021-07-05 17:00:00,544 INFO L762 garLoopResultBuilder]: For program point L6659-2(lines 6659 6661) no Hoare annotation was computed. [2021-07-05 17:00:00,544 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 17:00:00,544 INFO L762 garLoopResultBuilder]: For program point L7122(lines 7122 7135) no Hoare annotation was computed. [2021-07-05 17:00:00,544 INFO L762 garLoopResultBuilder]: For program point L8179(lines 8179 8182) no Hoare annotation was computed. [2021-07-05 17:00:00,545 INFO L762 garLoopResultBuilder]: For program point L9137(lines 9137 9156) no Hoare annotation was computed. [2021-07-05 17:00:00,545 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,545 INFO L758 garLoopResultBuilder]: At program point L7158(lines 7137 7159) the Hoare annotation is: (let ((.cse17 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse23 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse24 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse54 (= |ULTIMATE.start_aws_mem_realloc_#res| 0)) (.cse79 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse53 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse43 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse42 (+ |#StackHeapBarrier| 1)) (.cse66 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse33 (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0))) (let ((.cse35 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse10 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse11 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse19 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0))) (.cse20 (not .cse33)) (.cse22 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse25 (not (= |ULTIMATE.start_can_fail_realloc_#res.base| 0))) (.cse26 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse29 (not (= (select .cse66 4) 0))) (.cse49 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse31 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse45 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse5 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0)) (.cse6 (<= (+ |ULTIMATE.start_aws_mem_realloc_#res| 1) 0)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse63 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse2 (<= .cse42 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse56 (<= .cse42 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse15 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse18 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse60 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse28 (<= (+ (* 4294967296 .cse43) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse51 (select .cse53 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse50 (select .cse79 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse44 (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse8 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse36 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse14 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse38 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse30 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse21 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse48 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse32 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse72 (and .cse17 .cse23 .cse24 .cse54))) (and (let ((.cse34 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse1 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse34))) (.cse3 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse34) |~#s_can_fail_allocator_static~0.base|))) (let ((.cse0 (let ((.cse12 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse13 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|)) (.cse16 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|)) (.cse27 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) .cse7 .cse8 .cse9 .cse11 .cse1 .cse3 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse30 (not (= (select .cse31 ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0)) .cse21 .cse23 .cse24 .cse26 .cse27 .cse32 .cse28 .cse33))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6))))) .cse7 .cse8 .cse35 .cse36 (let ((.cse40 (select .cse44 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse37 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse39 (<= (* 4294967296 (div (+ .cse40 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse43 4294967296)) 4294967296)) .cse40)) (.cse41 (<= .cse42 ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and .cse5 .cse9 .cse17 .cse18 .cse6 .cse23 .cse24 .cse28) (and .cse37 .cse7 .cse8 .cse9 .cse36 .cse14 .cse38 .cse15 .cse17 .cse18 .cse39 (<= .cse40 (* 4294967296 (div .cse40 4294967296))) .cse21 .cse22 .cse23 .cse24 .cse26 .cse41 .cse32) (and .cse37 .cse7 .cse8 .cse9 .cse10 .cse11 .cse36 .cse14 .cse38 .cse15 .cse17 .cse18 .cse19 .cse39 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse41 .cse32)))) .cse45 .cse17 .cse21 (let ((.cse46 (= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse47 (or (let ((.cse52 (select .cse53 12))) (and .cse7 .cse8 .cse17 .cse29 .cse21 .cse23 (<= .cse51 (+ (* 4294967296 (div (+ (* (div .cse51 4294967296) 4294967296) 4294967295 (* .cse52 (- 1))) 4294967296)) .cse52)) .cse24 (<= .cse52 (+ (* 4294967296 (div (+ (- 1) .cse52) 4294967296)) 4294967295)))) (and .cse7 .cse8 .cse17 .cse21 .cse23 .cse24 .cse54)))) (or (and .cse9 .cse10 .cse35 .cse11 .cse36 .cse2 .cse46 .cse45 .cse15 .cse18 .cse19 .cse20 .cse22 .cse47 .cse48 .cse49 .cse25 .cse26 .cse28) (and .cse5 .cse9 .cse18 .cse6 .cse47 .cse28) (and .cse9 .cse10 .cse11 .cse36 .cse2 (<= .cse50 (* 4294967296 (div .cse50 4294967296))) .cse46 .cse15 .cse18 .cse19 .cse4 .cse20 .cse22 .cse47 .cse49 .cse25 .cse26 .cse32 .cse28))) .cse48 .cse49 .cse24 (let ((.cse65 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse59 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse65)) (.cse58 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (let ((.cse64 (= .cse59 (select .cse66 .cse58)))) (let ((.cse55 (not (= .cse65 ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse57 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse58))) (.cse61 (or (and .cse64 .cse23 .cse24) (and .cse23 .cse24 .cse54))) (.cse62 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse58) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse65)))) (or (and .cse7 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) .cse55) .cse36 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 12))) .cse2 .cse56 .cse14 .cse15 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4))) .cse17 .cse4 .cse57 (= (select .cse31 .cse58) .cse59) .cse60 .cse61 .cse62) (and (or .cse55 .cse63) .cse14 .cse15 .cse17 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) .cse64 .cse4 .cse57 .cse61 .cse62)))))) (let ((.cse71 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse67 (<= (select .cse44 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse71)) (.cse68 (<= .cse71 .cse50)) (.cse69 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (.cse70 (or (and (<= .cse51 .cse71) .cse17 .cse23 .cse24 (<= .cse71 .cse51)) .cse72))) (or (and .cse9 .cse14 .cse45 .cse38 .cse15 .cse18 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse67 .cse68 .cse63 .cse69 .cse32 .cse28 .cse70) (and .cse5 .cse9 .cse18 .cse6 .cse28 .cse70) (and .cse7 .cse9 (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) .cse63) .cse36 .cse2 .cse56 .cse14 .cse15 .cse18 .cse67 .cse4 .cse68 .cse60 .cse69 .cse32 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) .cse28 .cse70)))) (let ((.cse81 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse75 (select .cse81 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse73 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse74 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse77 (let ((.cse80 (select .cse81 12))) (<= .cse80 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse80) 4294967296)))))) (.cse76 (div .cse75 4294967296))) (or (and .cse73 .cse7 .cse8 .cse74 .cse36 .cse14 .cse38 .cse21 (<= .cse75 (* 4294967296 .cse76)) .cse48 .cse77 .cse23 .cse24 .cse32) (and .cse73 .cse7 .cse8 .cse74 .cse36 .cse14 .cse38 .cse30 .cse21 .cse48 .cse77 .cse23 .cse24 (<= .cse75 (let ((.cse78 (select .cse79 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse78 (- 1)) (* .cse76 4294967296) 4294967295) 4294967296)) .cse78))) .cse32) .cse72))))))) [2021-07-05 17:00:00,546 INFO L762 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:00,546 INFO L762 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:00,546 INFO L762 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:00,546 INFO L762 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:00,546 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,546 INFO L762 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:00,546 INFO L762 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:00,546 INFO L762 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:00,547 INFO L762 garLoopResultBuilder]: For program point L222-7(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:00,547 INFO L762 garLoopResultBuilder]: For program point L222-8(lines 7162 7172) no Hoare annotation was computed. [2021-07-05 17:00:00,547 INFO L762 garLoopResultBuilder]: For program point L222-9(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:00,547 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 17:00:00,547 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,547 INFO L762 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,547 INFO L762 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,547 INFO L762 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,547 INFO L762 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,548 INFO L762 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,548 INFO L762 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,548 INFO L762 garLoopResultBuilder]: For program point L8184(lines 8184 8187) no Hoare annotation was computed. [2021-07-05 17:00:00,548 INFO L762 garLoopResultBuilder]: For program point L7160(lines 7160 7173) no Hoare annotation was computed. [2021-07-05 17:00:00,548 INFO L762 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,548 INFO L762 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,548 INFO L762 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,548 INFO L762 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,549 INFO L762 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,549 INFO L762 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,549 INFO L762 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,549 INFO L762 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,549 INFO L762 garLoopResultBuilder]: For program point L223-21(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,549 INFO L762 garLoopResultBuilder]: For program point L223-22(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,549 INFO L762 garLoopResultBuilder]: For program point L223-24(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,549 INFO L762 garLoopResultBuilder]: For program point L223-25(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,550 INFO L762 garLoopResultBuilder]: For program point L7491-1(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:00,550 INFO L762 garLoopResultBuilder]: For program point L7491(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,550 INFO L762 garLoopResultBuilder]: For program point L223-27(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,550 INFO L762 garLoopResultBuilder]: For program point L223-28(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,550 INFO L762 garLoopResultBuilder]: For program point L7491-4(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:00,550 INFO L762 garLoopResultBuilder]: For program point L7491-3(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:00,550 INFO L762 garLoopResultBuilder]: For program point L7491-9(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,550 INFO L762 garLoopResultBuilder]: For program point L7491-7(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,550 INFO L762 garLoopResultBuilder]: For program point L7491-6(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:00,551 INFO L762 garLoopResultBuilder]: For program point L7491-13(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,551 INFO L758 garLoopResultBuilder]: At program point L7491-12(lines 7489 7495) the Hoare annotation is: (let ((.cse29 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse28 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse13 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse29)) (.cse15 (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse29))) (let ((.cse3 (= .cse15 0)) (.cse4 (= .cse13 0)) (.cse16 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse7 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse18 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0)) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse12 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse26 (select .cse28 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (let ((.cse17 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse14 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse23 (let ((.cse27 (select .cse28 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= .cse27 (+ (* 4294967296 (div (+ (* (div .cse27 4294967296) 4294967296) (* .cse26 (- 1)) 4294967295) 4294967296)) .cse26)))) (.cse2 (and .cse16 .cse0 .cse1 .cse5 .cse7 .cse18 .cse8 .cse9 .cse10 .cse12)) (.cse19 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse20 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse22 (<= .cse26 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse26) 4294967296))))) (.cse25 (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12))) (and .cse0 .cse1 (let ((.cse6 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse11 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or .cse2 (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| .cse13) .cse5 .cse14 (= .cse15 |~#s_can_fail_allocator_static~0.base|) .cse6 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) .cse5 .cse14 (let ((.cse21 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse16 .cse0 .cse1 .cse17 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse7 .cse18 .cse8 .cse10 .cse12) (and .cse19 .cse0 .cse3 .cse1 .cse20 .cse4 .cse5 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse23 .cse12) (and .cse19 .cse0 .cse1 .cse20 .cse5 .cse14 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse23 .cse12))) .cse17 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse7 .cse8 .cse9 .cse10 (or (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse14 .cse7 .cse8 .cse9 .cse10 .cse12) .cse2 (and .cse0 .cse1 .cse5 .cse14 (let ((.cse24 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (<= .cse24 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse24) 4294967296))))) .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse19 .cse0 .cse1 .cse20 .cse5 .cse14 .cse7 .cse8 .cse9 .cse10 .cse12)) (or .cse2 (and .cse19 .cse0 .cse1 .cse20 .cse5 .cse7 .cse22 .cse8 .cse9 .cse10 .cse23 .cse12) .cse25) (or .cse2 (and .cse19 .cse0 .cse1 .cse20 .cse5 .cse7 .cse22 .cse8 .cse9 .cse10 .cse12) .cse25) .cse12))))) [2021-07-05 17:00:00,551 INFO L762 garLoopResultBuilder]: For program point L7491-11(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,551 INFO L762 garLoopResultBuilder]: For program point L7491-17(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:00,551 INFO L762 garLoopResultBuilder]: For program point L7491-16(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:00,552 INFO L762 garLoopResultBuilder]: For program point L7491-14(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:00,552 INFO L762 garLoopResultBuilder]: For program point L7491-20(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,552 INFO L762 garLoopResultBuilder]: For program point L7491-19(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:00,552 INFO L758 garLoopResultBuilder]: At program point L7491-25(lines 7489 7495) the Hoare annotation is: (let ((.cse43 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse36 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse30 (select .cse43 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse45 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse46 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse26 (select .cse46 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse17 (select .cse46 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse32 (select .cse45 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse44 (select .cse45 12)) (.cse39 (div .cse30 4294967296)) (.cse0 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse3 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse5 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0))) (.cse6 (not (= (select .cse36 4) 0))) (.cse7 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse8 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0)) (.cse9 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse10 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse12 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse14 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse34 (+ |#StackHeapBarrier| 1))) (let ((.cse27 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse23 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse15 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse22 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse16 (<= .cse34 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse20 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse21 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse28 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse29 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse24 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14)) (.cse31 (* .cse39 4294967296)) (.cse11 (<= .cse32 (+ (* 4294967296 (div (+ (* (div .cse32 4294967296) 4294967296) 4294967295 (* .cse44 (- 1))) 4294967296)) .cse44))) (.cse13 (<= .cse44 (+ (* 4294967296 (div (+ (- 1) .cse44) 4294967296)) 4294967295))) (.cse18 (div .cse17 4294967296)) (.cse25 (* .cse26 (- 1))) (.cse37 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse35 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse33 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (and (let ((.cse19 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse16 (<= .cse17 (* 4294967296 .cse18)) .cse19 .cse20 .cse6 .cse7 .cse9 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse23 .cse15 .cse16 .cse19 .cse20 .cse6 .cse7 .cse9 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14))) (or .cse24 (and .cse1 (<= (* 4294967296 (div (+ (* (div (+ .cse25 4294967295 .cse17) 4294967296) 4294967296) .cse26) 4294967296)) .cse17) .cse2 .cse15 .cse16 .cse3 .cse27 .cse4 .cse6 .cse9 .cse10 .cse12 .cse14)) .cse1 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (or (and .cse28 .cse1 .cse2 .cse29 .cse15 .cse3 .cse27 .cse4 .cse6 .cse9 .cse10 .cse12 .cse13 (<= .cse30 (+ (* 4294967296 (div (+ .cse25 .cse31 4294967295) 4294967296)) .cse26)) .cse14) .cse24) .cse15 .cse16 (<= .cse32 .cse33) (<= .cse34 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse3 .cse20 .cse27 (or (and .cse1 .cse2 .cse23 .cse15 .cse20 .cse7 .cse9 .cse21 .cse22 .cse12 .cse14) .cse24) .cse4 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) (or (and .cse1 .cse2 .cse16 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse3 .cse20 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse4 .cse6 .cse7 .cse9 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 16) |~#s_can_fail_allocator_static~0.offset|) .cse12 (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse14) .cse24) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse35) (select .cse36 .cse37)) .cse21 .cse12 .cse14 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) (let ((.cse38 (let ((.cse42 (select .cse43 12))) (let ((.cse40 (<= .cse42 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse42) 4294967296))))) (.cse41 (<= .cse26 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse26) 4294967296)))))) (or (and .cse1 .cse2 (<= (* 4294967296 (div (+ .cse32 4294967295) 4294967296)) .cse32) (<= (* 4294967296 (div (+ 4294967295 .cse17) 4294967296)) .cse17) (<= (* 4294967296 (div (+ .cse30 4294967295) 4294967296)) .cse30) .cse3 .cse40 .cse4 .cse5 .cse6 .cse7 .cse41 .cse9 .cse10 .cse12 .cse13 .cse14) (and (<= .cse17 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse17) 4294967296)))) .cse1 .cse2 (<= .cse30 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse30) 4294967296)))) .cse3 (<= .cse32 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse32) 4294967296)))) .cse40 .cse4 .cse5 .cse6 .cse7 .cse41 (<= .cse30 (+ .cse42 (* 4294967296 (div (+ .cse31 4294967295 (* .cse42 (- 1))) 4294967296)))) .cse9 .cse10 .cse11 .cse12 .cse13 (<= .cse17 (+ (* 4294967296 (div (+ (* .cse18 4294967296) .cse25 4294967295) 4294967296)) .cse26)) .cse14)))))) (or (and .cse38 (<= .cse30 (* 4294967296 .cse39))) (and .cse28 .cse29 .cse38) .cse24)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse37) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse35)) (<= .cse33 .cse32)))))) [2021-07-05 17:00:00,552 INFO L762 garLoopResultBuilder]: For program point L7491-24(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,553 INFO L762 garLoopResultBuilder]: For program point L7491-22(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,553 INFO L762 garLoopResultBuilder]: For program point L7491-29(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:00,553 INFO L762 garLoopResultBuilder]: For program point L7491-27(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:00,553 INFO L762 garLoopResultBuilder]: For program point L7491-26(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,553 INFO L762 garLoopResultBuilder]: For program point L7491-33(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,553 INFO L762 garLoopResultBuilder]: For program point L7491-32(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:00,553 INFO L762 garLoopResultBuilder]: For program point L7491-30(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:00,553 INFO L762 garLoopResultBuilder]: For program point L7491-37(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,554 INFO L762 garLoopResultBuilder]: For program point L7491-35(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,554 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,554 INFO L762 garLoopResultBuilder]: For program point L7491-40(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:00,554 INFO L762 garLoopResultBuilder]: For program point L7491-39(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,554 INFO L758 garLoopResultBuilder]: At program point L7491-38(lines 7489 7495) the Hoare annotation is: (let ((.cse18 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse9 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse12 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0))) (.cse13 (not (= (select .cse18 4) 0))) (.cse4 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse5 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse14 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (let ((.cse10 (and (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 .cse2 .cse3 .cse12 .cse13 .cse4 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse5 .cse14 .cse6 .cse7)) (.cse20 (select .cse9 12)) (.cse19 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse17 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse16 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse15 (select .cse9 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 (or (and .cse0 .cse1 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse8 (select .cse9 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse8 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse8 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) 4294967296)) 4294967295)))) .cse10) .cse1 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (or .cse10 (let ((.cse11 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse11)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse11) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse2 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse3 .cse12 .cse13 .cse4 .cse5 .cse14 .cse6 (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse7))) (<= .cse15 .cse16) .cse3 .cse13 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse17) (select .cse18 .cse19)) .cse5 .cse14 (<= .cse15 (+ (* 4294967296 (div (+ (* (div .cse15 4294967296) 4294967296) 4294967295 (* .cse20 (- 1))) 4294967296)) .cse20)) .cse6 (<= .cse20 (+ (* 4294967296 (div (+ (- 1) .cse20) 4294967296)) 4294967295)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse19) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse17)) (<= .cse16 .cse15))))) [2021-07-05 17:00:00,554 INFO L762 garLoopResultBuilder]: For program point L7491-45(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:00,555 INFO L762 garLoopResultBuilder]: For program point L7491-43(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:00,555 INFO L762 garLoopResultBuilder]: For program point L7491-42(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:00,555 INFO L762 garLoopResultBuilder]: For program point L7491-48(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,555 INFO L762 garLoopResultBuilder]: For program point L7491-46(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,555 INFO L762 garLoopResultBuilder]: For program point L7491-53(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:00,555 INFO L762 garLoopResultBuilder]: For program point L7491-52(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,555 INFO L758 garLoopResultBuilder]: At program point L7491-51(lines 7489 7495) the Hoare annotation is: (let ((.cse14 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse5 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse3 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse1 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse0 (select .cse14 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (<= .cse0 .cse1) .cse2 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse3) (select .cse4 .cse5)) (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) .cse6 (let ((.cse12 (div .cse0 4294967296)) (.cse13 (select .cse14 12))) (let ((.cse7 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse8 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse9 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse10 (<= .cse0 (+ (* 4294967296 (div (+ (* .cse12 4294967296) 4294967295 (* .cse13 (- 1))) 4294967296)) .cse13))) (.cse11 (<= .cse13 (+ (* 4294967296 (div (+ (- 1) .cse13) 4294967296)) 4294967295)))) (or (and .cse7 .cse8 .cse2 (not (= (select .cse4 4) 0)) .cse9 .cse10 .cse6 .cse11) (and .cse7 .cse8 (<= .cse0 (* 4294967296 .cse12)) .cse2 .cse9 .cse10 .cse6 .cse11)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse5) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse3)) (<= .cse1 .cse0)))) [2021-07-05 17:00:00,556 INFO L762 garLoopResultBuilder]: For program point L7491-50(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,556 INFO L762 garLoopResultBuilder]: For program point L7491-56(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:00,556 INFO L762 garLoopResultBuilder]: For program point L7491-55(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:00,556 INFO L762 garLoopResultBuilder]: For program point L7491-61(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,556 INFO L762 garLoopResultBuilder]: For program point L7491-59(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,556 INFO L762 garLoopResultBuilder]: For program point L7491-58(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:00,556 INFO L762 garLoopResultBuilder]: For program point L7491-65(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,557 INFO L758 garLoopResultBuilder]: At program point L7491-64(lines 7489 7495) the Hoare annotation is: (let ((.cse33 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse34 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0)) (.cse15 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse19 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse20 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse36 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse57 (+ |#StackHeapBarrier| 1))) (let ((.cse25 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse26 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse16 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse22 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse4 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse39 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse49 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse6 (<= .cse57 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse43 (<= .cse57 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse28 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse11 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse47 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse23 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse24 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse7 (select .cse36 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse41 (and .cse33 .cse0 .cse1 .cse10 .cse34 .cse15 .cse19 .cse20)) (.cse27 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse29 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse53 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse17 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse30 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) (.cse32 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (and (let ((.cse18 (let ((.cse35 (select .cse36 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (<= (+ (* 4294967296 (div .cse35 4294967296)) 1) .cse35))) (.cse3 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse8 (= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse12 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse14 (not (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0))) (.cse21 (not (= |ULTIMATE.start_can_fail_realloc_#res.base| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= .cse7 (* 4294967296 (div .cse7 4294967296))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (let ((.cse31 (select .cse32 12))) (and .cse25 .cse0 .cse1 .cse2 .cse26 .cse3 .cse27 .cse4 .cse5 .cse6 .cse8 .cse28 .cse29 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= (* 4294967296 (div (+ 4294967295 .cse30 .cse7 (* .cse31 (- 1))) 4294967296)) .cse7) (<= .cse31 ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) .cse24)) (and .cse33 .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse28 .cse9 .cse10 .cse11 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0)) .cse12 .cse34 .cse14 .cse15 .cse16 .cse19 .cse20 .cse21 .cse22 .cse24))) .cse25 .cse26 (or (let ((.cse40 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and (let ((.cse37 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse38 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse37 .cse10 .cse11 .cse15 .cse16 .cse19 .cse20 .cse22 .cse38 .cse24) (and .cse0 .cse1 .cse2 .cse37 .cse10 .cse11 (not (= (select .cse39 4) 0)) .cse15 .cse19 .cse20 .cse22 .cse38 .cse24))) .cse4 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse40)) .cse6 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse40) |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse28 .cse9 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse13)) .cse41) .cse10 (let ((.cse45 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse50 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse42 (not (= .cse50 ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse46 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse50)) (.cse44 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse45))) (.cse48 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse45) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse50)))) (or (and .cse0 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) .cse42) .cse5 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 12))) .cse6 .cse43 .cse28 .cse9 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4))) .cse10 .cse13 .cse44 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) .cse45) .cse46) .cse47 .cse20 .cse48) (and (or .cse42 .cse49) .cse28 .cse9 .cse10 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) (= .cse46 (select .cse39 .cse45)) .cse13 .cse44 .cse20 .cse48)))) .cse19 .cse20 (let ((.cse55 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse51 (<= (select (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse55)) (.cse52 (<= .cse55 .cse7)) (.cse54 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)))) (or (and .cse2 .cse28 .cse29 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse9 .cse11 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse51 .cse52 .cse53 .cse19 .cse49 .cse20 .cse54 .cse23 .cse24) (and .cse0 .cse2 (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) .cse49) .cse5 .cse6 .cse43 .cse28 .cse9 .cse11 .cse51 .cse13 .cse52 .cse53 .cse19 .cse47 .cse20 .cse54 .cse23 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) .cse24)))) (or .cse41 (and .cse0 .cse1 .cse27 .cse5 .cse29 .cse10 .cse15 .cse53 .cse17 .cse19 .cse20 (let ((.cse56 (select .cse32 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse56 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse56 .cse30) 4294967296)) 4294967295)))))))) [2021-07-05 17:00:00,557 INFO L762 garLoopResultBuilder]: For program point L7491-63(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,557 INFO L762 garLoopResultBuilder]: For program point L7491-69(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:00,557 INFO L762 garLoopResultBuilder]: For program point L7491-68(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:00,557 INFO L762 garLoopResultBuilder]: For program point L7491-66(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:00,557 INFO L762 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2021-07-05 17:00:00,558 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 17:00:00,558 INFO L762 garLoopResultBuilder]: For program point L7491-72(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,558 INFO L762 garLoopResultBuilder]: For program point L7491-71(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:00,558 INFO L758 garLoopResultBuilder]: At program point L7491-77(lines 7489 7495) the Hoare annotation is: (let ((.cse3 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse2 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse1 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (<= .cse0 .cse1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse2) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse3)) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse3) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse2)) (<= .cse1 .cse0))) [2021-07-05 17:00:00,558 INFO L762 garLoopResultBuilder]: For program point L7491-76(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,558 INFO L762 garLoopResultBuilder]: For program point L7491-74(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,558 INFO L762 garLoopResultBuilder]: For program point L9145(lines 9145 9148) no Hoare annotation was computed. [2021-07-05 17:00:00,558 INFO L762 garLoopResultBuilder]: For program point L9145-2(lines 9145 9148) no Hoare annotation was computed. [2021-07-05 17:00:00,559 INFO L762 garLoopResultBuilder]: For program point L7494(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,559 INFO L762 garLoopResultBuilder]: For program point L7494-4(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,559 INFO L762 garLoopResultBuilder]: For program point L7494-3(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,559 INFO L762 garLoopResultBuilder]: For program point L7494-2(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,559 INFO L762 garLoopResultBuilder]: For program point L7494-8(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,559 INFO L762 garLoopResultBuilder]: For program point L7494-6(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,559 INFO L762 garLoopResultBuilder]: For program point L7494-12(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,559 INFO L762 garLoopResultBuilder]: For program point L7494-11(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,559 INFO L762 garLoopResultBuilder]: For program point L7494-9(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,559 INFO L762 garLoopResultBuilder]: For program point L6966(lines 6966 6972) no Hoare annotation was computed. [2021-07-05 17:00:00,559 INFO L762 garLoopResultBuilder]: For program point L7494-15(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,559 INFO L762 garLoopResultBuilder]: For program point L7494-13(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,559 INFO L762 garLoopResultBuilder]: For program point L7494-20(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,559 INFO L762 garLoopResultBuilder]: For program point L7494-18(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,559 INFO L762 garLoopResultBuilder]: For program point L7494-17(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,559 INFO L762 garLoopResultBuilder]: For program point L7494-24(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,559 INFO L762 garLoopResultBuilder]: For program point L7494-22(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,559 INFO L762 garLoopResultBuilder]: For program point L7494-21(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,559 INFO L762 garLoopResultBuilder]: For program point L7494-27(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,560 INFO L762 garLoopResultBuilder]: For program point L7494-26(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,560 INFO L762 garLoopResultBuilder]: For program point L7494-31(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,560 INFO L762 garLoopResultBuilder]: For program point L7494-30(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,560 INFO L762 garLoopResultBuilder]: For program point L7494-29(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,560 INFO L758 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2021-07-05 17:00:00,560 INFO L762 garLoopResultBuilder]: For program point L7494-36(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,560 INFO L758 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: false [2021-07-05 17:00:00,560 INFO L762 garLoopResultBuilder]: For program point L7494-35(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,560 INFO L758 garLoopResultBuilder]: At program point L261-2(line 261) the Hoare annotation is: (let ((.cse52 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse37 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse50 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse39 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse48 (select .cse52 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse20 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse10 (+ |#StackHeapBarrier| 1))) (let ((.cse7 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse22 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse5 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse9 (<= .cse10 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse12 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse28 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse4 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse6 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse11 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse14 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse24 (select .cse52 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse8 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse13 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse15 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse16 (not (= (select .cse20 4) 0))) (.cse17 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse23 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0))) (.cse26 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse27 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse30 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse32 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse18 (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse47 (* .cse48 (- 1))) (.cse49 (select .cse39 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse33 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse34 (<= (+ (* 4294967296 .cse50) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse3 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse19 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse36 (select .cse37 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 .cse2 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (or (not (= .cse3 ULTIMATE.start_aws_mem_realloc_~ptr.offset)) .cse4) .cse5 .cse6 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse7)) .cse8 .cse9 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse7) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (<= .cse10 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) .cse15 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse16 .cse17 (<= (select .cse18 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse19) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse3) (select .cse20 .cse21)) .cse22 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse21)) .cse23 (let ((.cse35 (select .cse37 12))) (let ((.cse25 (= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse29 (<= .cse36 (+ (* 4294967296 (div (+ (* (div .cse36 4294967296) 4294967296) 4294967295 (* .cse35 (- 1))) 4294967296)) .cse35))) (.cse31 (<= .cse35 (+ (* 4294967296 (div (+ (- 1) .cse35) 4294967296)) 4294967295)))) (or (and .cse0 .cse1 .cse2 .cse6 .cse8 .cse9 (<= .cse24 (* 4294967296 (div .cse24 4294967296))) .cse25 .cse14 .cse15 .cse22 .cse23 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse8 .cse9 .cse25 .cse12 .cse14 .cse15 .cse23 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34)))) .cse26 .cse27 .cse28 (let ((.cse38 (select .cse39 12))) (<= .cse38 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse38) 4294967296))))) .cse4 .cse30 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) .cse32 (let ((.cse41 (select .cse18 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse40 (let ((.cse51 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse42 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse43 (not (= (select .cse51 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 4)) 0))) (.cse44 (not (= (select .cse51 4) 0))) (.cse45 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse46 (<= .cse10 ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and .cse42 .cse0 .cse1 .cse2 (<= (* 4294967296 (div (+ .cse36 4294967295) 4294967296)) .cse36) .cse8 .cse13 .cse43 .cse15 .cse44 .cse16 .cse17 .cse23 .cse26 (<= (* 4294967296 (div (+ 4294967295 .cse41) 4294967296)) .cse41) .cse27 .cse45 .cse30 .cse32 .cse46 .cse33 .cse34) (and .cse42 .cse0 (<= (* 4294967296 (div (+ (* (div (+ .cse47 4294967295 .cse24) 4294967296) 4294967296) .cse48) 4294967296)) .cse24) .cse1 .cse2 .cse8 (<= .cse49 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse49) 4294967296)))) .cse13 (<= .cse36 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse36) 4294967296)))) .cse43 .cse15 .cse44 (<= (* 4294967296 (div (+ .cse41 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse50 4294967296)) 4294967296)) .cse41) .cse16 .cse17 .cse23 .cse26 .cse27 .cse45 .cse30 .cse32 .cse46 .cse33 .cse34)))))) (or (and .cse6 .cse40 .cse11 .cse14) (and .cse40 .cse11 .cse14 (<= .cse41 (* 4294967296 (div .cse41 4294967296))))))) (<= .cse49 (+ (* 4294967296 (div (+ .cse47 (* (div .cse49 4294967296) 4294967296) 4294967295) 4294967296)) .cse48)) (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse33 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) .cse34 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse21) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse3)) (<= .cse19 .cse36))))) [2021-07-05 17:00:00,560 INFO L762 garLoopResultBuilder]: For program point L7494-33(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,560 INFO L762 garLoopResultBuilder]: For program point L7494-40(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,560 INFO L762 garLoopResultBuilder]: For program point L7494-39(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,560 INFO L762 garLoopResultBuilder]: For program point L7494-38(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,561 INFO L762 garLoopResultBuilder]: For program point L7494-44(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,561 INFO L762 garLoopResultBuilder]: For program point L7494-42(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,561 INFO L762 garLoopResultBuilder]: For program point L7494-48(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,561 INFO L762 garLoopResultBuilder]: For program point L7494-47(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,561 INFO L762 garLoopResultBuilder]: For program point L7494-45(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,561 INFO L762 garLoopResultBuilder]: For program point L7494-51(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,561 INFO L762 garLoopResultBuilder]: For program point L7494-49(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,561 INFO L762 garLoopResultBuilder]: For program point L7494-53(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:00,561 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 17:00:00,561 INFO L762 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2021-07-05 17:00:00,561 INFO L758 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: (let ((.cse51 (+ |#StackHeapBarrier| 1)) (.cse36 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse34 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296))) (let ((.cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse29 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse24 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse16 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse23 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse25 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse19 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse22 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse12 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse26 (<= (+ (* 4294967296 .cse34) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse27 (select .cse36 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse37 (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse17 (<= .cse51 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse39 (<= .cse51 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse42 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse38 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse3 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse20 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse21 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse28 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (let ((.cse10 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)))) (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse14 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse5 .cse6 .cse7 .cse8 (let ((.cse13 (select .cse14 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (<= .cse13 (* 4294967296 (div .cse13 4294967296)))) .cse9 (let ((.cse15 (select .cse14 12))) (<= .cse15 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse15) 4294967296))))) .cse10 .cse11 .cse12)))) (let ((.cse18 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse8 .cse23 .cse9 .cse24 .cse11 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse17 (<= .cse27 (* 4294967296 (div .cse27 4294967296))) .cse18 .cse20 .cse22 .cse28 .cse8 .cse23 .cse9 .cse24 .cse11 .cse25 .cse12 .cse26))) .cse16 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse29)) .cse5 .cse17 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse29) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse6 .cse19 .cse20 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse21 .cse22 .cse28 .cse8 .cse23 .cse9 .cse24 .cse11 .cse25 (<= |~#s_can_fail_allocator_static~0.offset| 0) (let ((.cse33 (select .cse37 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse30 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse31 (<= (* 4294967296 (div (let ((.cse35 (select .cse36 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* (div (+ (* .cse35 (- 1)) 4294967295 .cse27) 4294967296) 4294967296) .cse35)) 4294967296)) .cse27)) (.cse32 (<= (* 4294967296 (div (+ .cse33 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse34 4294967296)) 4294967296)) .cse33))) (or (and .cse30 .cse0 .cse31 .cse1 .cse2 .cse3 .cse16 .cse5 .cse17 .cse6 .cse7 .cse20 .cse21 .cse22 .cse32 .cse8 .cse23 .cse11 .cse25 .cse12) (and .cse30 .cse0 .cse31 .cse1 .cse2 .cse5 .cse17 .cse6 .cse7 .cse20 .cse21 .cse22 .cse32 (<= .cse33 (* 4294967296 (div .cse33 4294967296))) .cse8 .cse23 .cse11 .cse25 .cse12)))) .cse26 (let ((.cse44 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse40 (<= (select .cse37 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse44)) (.cse41 (<= .cse44 .cse27)) (.cse43 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)))) (or (and .cse0 .cse2 .cse3 (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) .cse38) .cse5 .cse17 .cse39 .cse6 .cse20 .cse22 .cse40 .cse28 .cse41 .cse9 .cse42 .cse11 .cse43 .cse12 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) .cse26) (and .cse2 .cse3 .cse6 .cse19 .cse7 .cse20 .cse22 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse40 .cse41 .cse9 .cse38 .cse11 .cse43 .cse12 .cse26)))) (let ((.cse47 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse50 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse45 (not (= .cse50 ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse48 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse50)) (.cse46 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse47))) (.cse49 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse47) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse50)))) (or (and .cse0 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) .cse45) .cse3 .cse5 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 12))) .cse17 .cse39 .cse6 .cse20 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4))) .cse21 .cse28 .cse46 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) .cse47) .cse48) .cse42 .cse11 .cse49) (and (or .cse45 .cse38) .cse3 .cse6 .cse20 .cse21 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) (= .cse48 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse47)) .cse28 .cse46 .cse11 .cse49))))))) [2021-07-05 17:00:00,561 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:00,562 INFO L758 garLoopResultBuilder]: At program point L8192(lines 8175 8193) the Hoare annotation is: (let ((.cse7 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse5 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (let ((.cse0 (and (<= (+ |ULTIMATE.start_aws_byte_buf_reserve_#res| 1) 0) .cse5)) (.cse11 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse4 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse12 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse10 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse9 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse8 (select .cse7 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (or .cse0 (and .cse1 .cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse5 (let ((.cse6 (select .cse7 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse6 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse6 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) 4294967296)) 4294967295))))) (<= .cse8 .cse9) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse10) (select .cse11 .cse12)) (or (let ((.cse13 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and .cse1 .cse2 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse13)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse13) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse3 .cse4 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) .cse5 (<= |~#s_can_fail_allocator_static~0.offset| 0))) .cse0) .cse5 (let ((.cse16 (div .cse8 4294967296)) (.cse17 (select .cse7 12))) (let ((.cse14 (<= .cse8 (+ (* 4294967296 (div (+ (* .cse16 4294967296) 4294967295 (* .cse17 (- 1))) 4294967296)) .cse17))) (.cse15 (<= .cse17 (+ (* 4294967296 (div (+ (- 1) .cse17) 4294967296)) 4294967295)))) (or (and .cse1 .cse2 .cse3 (not (= (select .cse11 4) 0)) .cse4 .cse14 .cse5 .cse15) (and .cse1 .cse2 (<= .cse8 (* 4294967296 .cse16)) .cse3 .cse4 .cse14 .cse5 .cse15)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse12) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse10)) (<= .cse9 .cse8)))) [2021-07-05 17:00:00,562 INFO L765 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: true [2021-07-05 17:00:00,562 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable348 [2021-07-05 17:00:00,562 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 17:00:00,562 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION was SAFE (8/10) [2021-07-05 17:00:00,563 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 17:00:00,563 INFO L329 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 17:00:00,563 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 17:00:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 200 states have internal predecessors, (281), 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-07-05 17:00:00,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-07-05 17:00:00,565 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:00:00,565 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:00:00,566 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:00:00,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:00:00,566 INFO L82 PathProgramCache]: Analyzing trace with hash 197526225, now seen corresponding path program 1 times [2021-07-05 17:00:00,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:00:00,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327742571] [2021-07-05 17:00:00,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:00:00,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:00:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:00:00,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:00,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:00,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:00,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:00,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:00:00,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:00:00,658 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327742571] [2021-07-05 17:00:00,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327742571] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:00:00,658 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:00:00,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 17:00:00,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483320803] [2021-07-05 17:00:00,658 INFO L425 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-05 17:00:00,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:00:00,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-05 17:00:00,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-05 17:00:00,659 INFO L87 Difference]: Start difference. First operand has 201 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 200 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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-07-05 17:00:00,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:00:00,660 INFO L93 Difference]: Finished difference Result 395 states and 553 transitions. [2021-07-05 17:00:00,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-05 17:00:00,660 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-07-05 17:00:00,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:00:00,661 INFO L225 Difference]: With dead ends: 395 [2021-07-05 17:00:00,661 INFO L226 Difference]: Without dead ends: 171 [2021-07-05 17:00:00,661 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-05 17:00:00,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-07-05 17:00:00,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-07-05 17:00:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.3294117647058823) internal successors, (226), 170 states have internal predecessors, (226), 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-07-05 17:00:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 226 transitions. [2021-07-05 17:00:00,663 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 226 transitions. Word has length 33 [2021-07-05 17:00:00,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:00:00,663 INFO L442 AbstractCegarLoop]: Abstraction has 171 states and 226 transitions. [2021-07-05 17:00:00,663 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 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-07-05 17:00:00,663 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 226 transitions. [2021-07-05 17:00:00,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-07-05 17:00:00,663 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:00:00,663 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:00:00,663 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable373 [2021-07-05 17:00:00,663 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:00:00,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:00:00,664 INFO L82 PathProgramCache]: Analyzing trace with hash -311946865, now seen corresponding path program 1 times [2021-07-05 17:00:00,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:00:00,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752104551] [2021-07-05 17:00:00,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:00:00,664 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:00:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:00:00,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:00,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:00,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:00,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 17:00:00,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:00,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-07-05 17:00:00,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:00,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:00,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:00:00,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:00:00,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752104551] [2021-07-05 17:00:00,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752104551] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:00:00,768 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:00:00,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 17:00:00,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359476379] [2021-07-05 17:00:00,768 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:00:00,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:00:00,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:00:00,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:00:00,769 INFO L87 Difference]: Start difference. First operand 171 states and 226 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-07-05 17:00:00,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:00:00,829 INFO L93 Difference]: Finished difference Result 319 states and 421 transitions. [2021-07-05 17:00:00,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 17:00:00,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-07-05 17:00:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:00:00,829 INFO L225 Difference]: With dead ends: 319 [2021-07-05 17:00:00,829 INFO L226 Difference]: Without dead ends: 171 [2021-07-05 17:00:00,830 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:00:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-07-05 17:00:00,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-07-05 17:00:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.3176470588235294) internal successors, (224), 170 states have internal predecessors, (224), 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-07-05 17:00:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 224 transitions. [2021-07-05 17:00:00,832 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 224 transitions. Word has length 33 [2021-07-05 17:00:00,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:00:00,832 INFO L442 AbstractCegarLoop]: Abstraction has 171 states and 224 transitions. [2021-07-05 17:00:00,832 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-07-05 17:00:00,832 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 224 transitions. [2021-07-05 17:00:00,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-07-05 17:00:00,832 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:00:00,832 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:00:00,832 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable374 [2021-07-05 17:00:00,832 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:00:00,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:00:00,833 INFO L82 PathProgramCache]: Analyzing trace with hash 2071691303, now seen corresponding path program 1 times [2021-07-05 17:00:00,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:00:00,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230337875] [2021-07-05 17:00:00,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:00:00,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:00:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:00:00,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:00,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:00,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:00,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 17:00:00,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:00,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 17:00:00,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:00,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:00:00,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:00:00,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230337875] [2021-07-05 17:00:00,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230337875] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:00:00,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:00:00,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 17:00:00,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333437983] [2021-07-05 17:00:00,935 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:00:00,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:00:00,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:00:00,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:00:00,936 INFO L87 Difference]: Start difference. First operand 171 states and 224 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-07-05 17:00:01,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:00:01,069 INFO L93 Difference]: Finished difference Result 460 states and 617 transitions. [2021-07-05 17:00:01,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 17:00:01,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-07-05 17:00:01,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:00:01,070 INFO L225 Difference]: With dead ends: 460 [2021-07-05 17:00:01,070 INFO L226 Difference]: Without dead ends: 303 [2021-07-05 17:00:01,071 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:00:01,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-07-05 17:00:01,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 183. [2021-07-05 17:00:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.2967032967032968) internal successors, (236), 182 states have internal predecessors, (236), 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-07-05 17:00:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 236 transitions. [2021-07-05 17:00:01,073 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 236 transitions. Word has length 45 [2021-07-05 17:00:01,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:00:01,073 INFO L442 AbstractCegarLoop]: Abstraction has 183 states and 236 transitions. [2021-07-05 17:00:01,073 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-07-05 17:00:01,073 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 236 transitions. [2021-07-05 17:00:01,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-07-05 17:00:01,073 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:00:01,073 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:00:01,073 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable375 [2021-07-05 17:00:01,073 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:00:01,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:00:01,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1999304745, now seen corresponding path program 1 times [2021-07-05 17:00:01,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:00:01,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700660815] [2021-07-05 17:00:01,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:00:01,074 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:00:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:00:01,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:01,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:01,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:01,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 17:00:01,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:01,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 17:00:01,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:01,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:00:01,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:00:01,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700660815] [2021-07-05 17:00:01,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700660815] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:00:01,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:00:01,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 17:00:01,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301063804] [2021-07-05 17:00:01,172 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:00:01,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:00:01,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:00:01,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:00:01,173 INFO L87 Difference]: Start difference. First operand 183 states and 236 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-07-05 17:00:01,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:00:01,323 INFO L93 Difference]: Finished difference Result 402 states and 525 transitions. [2021-07-05 17:00:01,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 17:00:01,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-07-05 17:00:01,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:00:01,324 INFO L225 Difference]: With dead ends: 402 [2021-07-05 17:00:01,324 INFO L226 Difference]: Without dead ends: 243 [2021-07-05 17:00:01,324 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:00:01,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-07-05 17:00:01,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 195. [2021-07-05 17:00:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.2783505154639174) internal successors, (248), 194 states have internal predecessors, (248), 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-07-05 17:00:01,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 248 transitions. [2021-07-05 17:00:01,326 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 248 transitions. Word has length 45 [2021-07-05 17:00:01,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:00:01,326 INFO L442 AbstractCegarLoop]: Abstraction has 195 states and 248 transitions. [2021-07-05 17:00:01,326 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-07-05 17:00:01,326 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 248 transitions. [2021-07-05 17:00:01,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-07-05 17:00:01,326 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:00:01,326 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:00:01,326 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable376 [2021-07-05 17:00:01,327 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:00:01,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:00:01,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1379270491, now seen corresponding path program 1 times [2021-07-05 17:00:01,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:00:01,327 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709359105] [2021-07-05 17:00:01,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:00:01,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:00:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:00:03,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:03,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:03,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:03,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 17:00:03,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:03,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-07-05 17:00:03,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:03,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-07-05 17:00:03,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:03,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:03,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:00:03,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:00:03,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709359105] [2021-07-05 17:00:03,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709359105] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:00:03,079 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:00:03,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 17:00:03,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248183758] [2021-07-05 17:00:03,079 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 17:00:03,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:00:03,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 17:00:03,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:00:03,079 INFO L87 Difference]: Start difference. First operand 195 states and 248 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-07-05 17:00:05,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:00:05,538 INFO L93 Difference]: Finished difference Result 262 states and 330 transitions. [2021-07-05 17:00:05,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 17:00:05,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-07-05 17:00:05,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:00:05,540 INFO L225 Difference]: With dead ends: 262 [2021-07-05 17:00:05,540 INFO L226 Difference]: Without dead ends: 178 [2021-07-05 17:00:05,540 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 84.8ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-07-05 17:00:05,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-07-05 17:00:05,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2021-07-05 17:00:05,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.2542372881355932) internal successors, (222), 177 states have internal predecessors, (222), 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-07-05 17:00:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 222 transitions. [2021-07-05 17:00:05,542 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 222 transitions. Word has length 45 [2021-07-05 17:00:05,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:00:05,542 INFO L442 AbstractCegarLoop]: Abstraction has 178 states and 222 transitions. [2021-07-05 17:00:05,543 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-07-05 17:00:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 222 transitions. [2021-07-05 17:00:05,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-05 17:00:05,543 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:00:05,543 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:00:05,543 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable377 [2021-07-05 17:00:05,543 INFO L374 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:00:05,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:00:05,543 INFO L82 PathProgramCache]: Analyzing trace with hash 261376390, now seen corresponding path program 1 times [2021-07-05 17:00:05,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:00:05,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620332030] [2021-07-05 17:00:05,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:00:05,544 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:00:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:00:05,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:05,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:05,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:05,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:00:05,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:05,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:00:05,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:05,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 17:00:05,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:05,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 17:00:05,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:05,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:05,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:05,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:00:05,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:00:05,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620332030] [2021-07-05 17:00:05,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620332030] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:00:05,746 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:00:05,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-05 17:00:05,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830561053] [2021-07-05 17:00:05,746 INFO L425 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-05 17:00:05,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:00:05,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-05 17:00:05,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-05 17:00:05,747 INFO L87 Difference]: Start difference. First operand 178 states and 222 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:00:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:00:05,883 INFO L93 Difference]: Finished difference Result 304 states and 378 transitions. [2021-07-05 17:00:05,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 17:00:05,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-07-05 17:00:05,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:00:05,884 INFO L225 Difference]: With dead ends: 304 [2021-07-05 17:00:05,884 INFO L226 Difference]: Without dead ends: 178 [2021-07-05 17:00:05,884 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 101.7ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-07-05 17:00:05,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-07-05 17:00:05,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2021-07-05 17:00:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.2372881355932204) internal successors, (219), 177 states have internal predecessors, (219), 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-07-05 17:00:05,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 219 transitions. [2021-07-05 17:00:05,886 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 219 transitions. Word has length 74 [2021-07-05 17:00:05,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:00:05,886 INFO L442 AbstractCegarLoop]: Abstraction has 178 states and 219 transitions. [2021-07-05 17:00:05,886 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:00:05,886 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 219 transitions. [2021-07-05 17:00:05,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-07-05 17:00:05,887 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:00:05,887 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:00:05,887 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable378 [2021-07-05 17:00:05,887 INFO L374 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:00:05,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:00:05,887 INFO L82 PathProgramCache]: Analyzing trace with hash -15253636, now seen corresponding path program 1 times [2021-07-05 17:00:05,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:00:05,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193202919] [2021-07-05 17:00:05,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:00:05,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:00:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:00:06,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:06,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:06,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:06,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:00:06,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:06,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:00:06,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:06,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:00:06,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:00:06,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193202919] [2021-07-05 17:00:06,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193202919] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:00:06,021 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:00:06,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 17:00:06,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162183860] [2021-07-05 17:00:06,021 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:00:06,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:00:06,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:00:06,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:00:06,021 INFO L87 Difference]: Start difference. First operand 178 states and 219 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:00:06,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:00:06,056 INFO L93 Difference]: Finished difference Result 246 states and 298 transitions. [2021-07-05 17:00:06,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 17:00:06,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-07-05 17:00:06,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:00:06,072 INFO L225 Difference]: With dead ends: 246 [2021-07-05 17:00:06,073 INFO L226 Difference]: Without dead ends: 216 [2021-07-05 17:00:06,073 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:00:06,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-07-05 17:00:06,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 180. [2021-07-05 17:00:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.23463687150838) internal successors, (221), 179 states have internal predecessors, (221), 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-07-05 17:00:06,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 221 transitions. [2021-07-05 17:00:06,076 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 221 transitions. Word has length 86 [2021-07-05 17:00:06,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:00:06,076 INFO L442 AbstractCegarLoop]: Abstraction has 180 states and 221 transitions. [2021-07-05 17:00:06,077 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:00:06,077 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 221 transitions. [2021-07-05 17:00:06,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-07-05 17:00:06,077 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:00:06,077 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:00:06,077 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable379 [2021-07-05 17:00:06,078 INFO L374 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:00:06,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:00:06,078 INFO L82 PathProgramCache]: Analyzing trace with hash 239029756, now seen corresponding path program 1 times [2021-07-05 17:00:06,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:00:06,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205224301] [2021-07-05 17:00:06,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:00:06,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:00:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:00:06,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:06,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:06,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:06,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:00:06,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:06,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:00:06,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:06,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:00:06,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:00:06,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205224301] [2021-07-05 17:00:06,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205224301] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:00:06,391 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:00:06,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 17:00:06,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807404351] [2021-07-05 17:00:06,391 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:00:06,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:00:06,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:00:06,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:00:06,392 INFO L87 Difference]: Start difference. First operand 180 states and 221 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:00:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:00:06,441 INFO L93 Difference]: Finished difference Result 300 states and 365 transitions. [2021-07-05 17:00:06,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 17:00:06,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-07-05 17:00:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:00:06,442 INFO L225 Difference]: With dead ends: 300 [2021-07-05 17:00:06,442 INFO L226 Difference]: Without dead ends: 241 [2021-07-05 17:00:06,443 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:00:06,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-07-05 17:00:06,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 180. [2021-07-05 17:00:06,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.23463687150838) internal successors, (221), 179 states have internal predecessors, (221), 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-07-05 17:00:06,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 221 transitions. [2021-07-05 17:00:06,445 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 221 transitions. Word has length 86 [2021-07-05 17:00:06,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:00:06,446 INFO L442 AbstractCegarLoop]: Abstraction has 180 states and 221 transitions. [2021-07-05 17:00:06,446 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:00:06,446 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 221 transitions. [2021-07-05 17:00:06,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-07-05 17:00:06,446 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:00:06,446 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:00:06,446 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable380 [2021-07-05 17:00:06,446 INFO L374 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:00:06,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:00:06,447 INFO L82 PathProgramCache]: Analyzing trace with hash 2039171052, now seen corresponding path program 1 times [2021-07-05 17:00:06,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:00:06,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641475757] [2021-07-05 17:00:06,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:00:06,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:00:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:00:06,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:06,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:06,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:06,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 17:00:06,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:06,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 17:00:06,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:06,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 17:00:06,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:06,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 17:00:06,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:06,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:00:06,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:00:06,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641475757] [2021-07-05 17:00:06,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641475757] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:00:06,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:00:06,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-05 17:00:06,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816161978] [2021-07-05 17:00:06,652 INFO L425 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-05 17:00:06,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:00:06,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-05 17:00:06,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-05 17:00:06,653 INFO L87 Difference]: Start difference. First operand 180 states and 221 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-07-05 17:00:06,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:00:06,726 INFO L93 Difference]: Finished difference Result 307 states and 371 transitions. [2021-07-05 17:00:06,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 17:00:06,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-07-05 17:00:06,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:00:06,727 INFO L225 Difference]: With dead ends: 307 [2021-07-05 17:00:06,727 INFO L226 Difference]: Without dead ends: 217 [2021-07-05 17:00:06,727 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 62.0ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-07-05 17:00:06,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-07-05 17:00:06,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 152. [2021-07-05 17:00:06,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.218543046357616) internal successors, (184), 151 states have internal predecessors, (184), 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-07-05 17:00:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 184 transitions. [2021-07-05 17:00:06,730 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 184 transitions. Word has length 91 [2021-07-05 17:00:06,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:00:06,730 INFO L442 AbstractCegarLoop]: Abstraction has 152 states and 184 transitions. [2021-07-05 17:00:06,730 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-07-05 17:00:06,730 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 184 transitions. [2021-07-05 17:00:06,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-07-05 17:00:06,730 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:00:06,731 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:00:06,731 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable381 [2021-07-05 17:00:06,731 INFO L374 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:00:06,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:00:06,731 INFO L82 PathProgramCache]: Analyzing trace with hash 31710286, now seen corresponding path program 1 times [2021-07-05 17:00:06,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:00:06,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097261283] [2021-07-05 17:00:06,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:00:06,731 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:00:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:00:07,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:07,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:07,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:07,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-07-05 17:00:07,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:07,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:07,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:00:07,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:00:07,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097261283] [2021-07-05 17:00:07,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097261283] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:00:07,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:00:07,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 17:00:07,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924348626] [2021-07-05 17:00:07,192 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 17:00:07,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:00:07,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 17:00:07,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 17:00:07,193 INFO L87 Difference]: Start difference. First operand 152 states and 184 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-07-05 17:00:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:00:07,201 INFO L93 Difference]: Finished difference Result 213 states and 256 transitions. [2021-07-05 17:00:07,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 17:00:07,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-07-05 17:00:07,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:00:07,202 INFO L225 Difference]: With dead ends: 213 [2021-07-05 17:00:07,202 INFO L226 Difference]: Without dead ends: 146 [2021-07-05 17:00:07,202 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 17:00:07,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-07-05 17:00:07,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2021-07-05 17:00:07,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.2137931034482758) internal successors, (176), 145 states have internal predecessors, (176), 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-07-05 17:00:07,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 176 transitions. [2021-07-05 17:00:07,204 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 176 transitions. Word has length 92 [2021-07-05 17:00:07,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:00:07,204 INFO L442 AbstractCegarLoop]: Abstraction has 146 states and 176 transitions. [2021-07-05 17:00:07,204 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-07-05 17:00:07,204 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 176 transitions. [2021-07-05 17:00:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-07-05 17:00:07,205 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:00:07,205 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:00:07,205 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable382 [2021-07-05 17:00:07,205 INFO L374 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:00:07,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:00:07,205 INFO L82 PathProgramCache]: Analyzing trace with hash 290004454, now seen corresponding path program 1 times [2021-07-05 17:00:07,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:00:07,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649262424] [2021-07-05 17:00:07,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:00:07,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:00:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:00:07,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:07,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:07,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:07,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:00:07,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:07,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:00:07,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:07,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:00:07,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:07,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:00:07,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:00:07,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649262424] [2021-07-05 17:00:07,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649262424] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:00:07,339 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:00:07,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 17:00:07,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047577865] [2021-07-05 17:00:07,339 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 17:00:07,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:00:07,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 17:00:07,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:00:07,340 INFO L87 Difference]: Start difference. First operand 146 states and 176 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:00:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:00:07,375 INFO L93 Difference]: Finished difference Result 333 states and 397 transitions. [2021-07-05 17:00:07,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 17:00:07,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-07-05 17:00:07,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:00:07,376 INFO L225 Difference]: With dead ends: 333 [2021-07-05 17:00:07,376 INFO L226 Difference]: Without dead ends: 272 [2021-07-05 17:00:07,376 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-07-05 17:00:07,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-07-05 17:00:07,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 148. [2021-07-05 17:00:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.2108843537414966) internal successors, (178), 147 states have internal predecessors, (178), 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-07-05 17:00:07,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 178 transitions. [2021-07-05 17:00:07,379 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 178 transitions. Word has length 93 [2021-07-05 17:00:07,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:00:07,379 INFO L442 AbstractCegarLoop]: Abstraction has 148 states and 178 transitions. [2021-07-05 17:00:07,380 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:00:07,380 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 178 transitions. [2021-07-05 17:00:07,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-07-05 17:00:07,380 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:00:07,380 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:00:07,380 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable383 [2021-07-05 17:00:07,381 INFO L374 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:00:07,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:00:07,381 INFO L82 PathProgramCache]: Analyzing trace with hash -576487570, now seen corresponding path program 1 times [2021-07-05 17:00:07,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:00:07,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278568338] [2021-07-05 17:00:07,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:00:07,382 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:00:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:00:07,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:07,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:07,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:07,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:00:07,628 INFO L142 QuantifierPusher]: treesize reduction 37, result has 28.8 percent of original size [2021-07-05 17:00:07,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 17:00:07,659 INFO L142 QuantifierPusher]: treesize reduction 35, result has 47.0 percent of original size [2021-07-05 17:00:07,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 17:00:07,704 INFO L142 QuantifierPusher]: treesize reduction 35, result has 49.3 percent of original size [2021-07-05 17:00:07,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-05 17:00:07,751 INFO L142 QuantifierPusher]: treesize reduction 35, result has 49.3 percent of original size [2021-07-05 17:00:07,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-05 17:00:07,807 INFO L142 QuantifierPusher]: treesize reduction 35, result has 49.3 percent of original size [2021-07-05 17:00:07,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-05 17:00:07,859 INFO L142 QuantifierPusher]: treesize reduction 45, result has 36.6 percent of original size [2021-07-05 17:00:07,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-07-05 17:00:07,894 INFO L142 QuantifierPusher]: treesize reduction 12, result has 53.8 percent of original size [2021-07-05 17:00:07,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 17:00:07,912 INFO L142 QuantifierPusher]: treesize reduction 12, result has 40.0 percent of original size [2021-07-05 17:00:07,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-05 17:00:07,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:07,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:00:07,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:00:07,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278568338] [2021-07-05 17:00:07,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278568338] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:00:07,930 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:00:07,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-05 17:00:07,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908543851] [2021-07-05 17:00:07,930 INFO L425 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-05 17:00:07,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:00:07,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-05 17:00:07,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-07-05 17:00:07,930 INFO L87 Difference]: Start difference. First operand 148 states and 178 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:00:12,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:00:12,488 INFO L93 Difference]: Finished difference Result 333 states and 396 transitions. [2021-07-05 17:00:12,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-05 17:00:12,489 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-07-05 17:00:12,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:00:12,490 INFO L225 Difference]: With dead ends: 333 [2021-07-05 17:00:12,490 INFO L226 Difference]: Without dead ends: 272 [2021-07-05 17:00:12,490 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 431.4ms TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2021-07-05 17:00:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-07-05 17:00:12,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 146. [2021-07-05 17:00:12,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.206896551724138) internal successors, (175), 145 states have internal predecessors, (175), 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-07-05 17:00:12,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 175 transitions. [2021-07-05 17:00:12,493 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 175 transitions. Word has length 94 [2021-07-05 17:00:12,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:00:12,493 INFO L442 AbstractCegarLoop]: Abstraction has 146 states and 175 transitions. [2021-07-05 17:00:12,493 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:00:12,493 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 175 transitions. [2021-07-05 17:00:12,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-07-05 17:00:12,493 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:00:12,493 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:00:12,493 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable384 [2021-07-05 17:00:12,493 INFO L374 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:00:12,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:00:12,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1487928418, now seen corresponding path program 1 times [2021-07-05 17:00:12,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:00:12,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235421709] [2021-07-05 17:00:12,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:00:12,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:00:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:00:12,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:12,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:12,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:12,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 17:00:12,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:12,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 17:00:12,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:12,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 17:00:12,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:12,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:12,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:00:12,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:00:12,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235421709] [2021-07-05 17:00:12,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235421709] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:00:12,664 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:00:12,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 17:00:12,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545547379] [2021-07-05 17:00:12,664 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 17:00:12,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:00:12,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 17:00:12,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:00:12,664 INFO L87 Difference]: Start difference. First operand 146 states and 175 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:00:12,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:00:12,699 INFO L93 Difference]: Finished difference Result 207 states and 247 transitions. [2021-07-05 17:00:12,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 17:00:12,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-07-05 17:00:12,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:00:12,700 INFO L225 Difference]: With dead ends: 207 [2021-07-05 17:00:12,700 INFO L226 Difference]: Without dead ends: 137 [2021-07-05 17:00:12,701 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 17:00:12,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-07-05 17:00:12,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-07-05 17:00:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.1985294117647058) internal successors, (163), 136 states have internal predecessors, (163), 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-07-05 17:00:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 163 transitions. [2021-07-05 17:00:12,703 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 163 transitions. Word has length 95 [2021-07-05 17:00:12,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:00:12,703 INFO L442 AbstractCegarLoop]: Abstraction has 137 states and 163 transitions. [2021-07-05 17:00:12,703 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:00:12,704 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 163 transitions. [2021-07-05 17:00:12,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-07-05 17:00:12,704 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:00:12,704 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:00:12,704 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable385 [2021-07-05 17:00:12,704 INFO L374 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:00:12,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:00:12,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1708653120, now seen corresponding path program 1 times [2021-07-05 17:00:12,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:00:12,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986214826] [2021-07-05 17:00:12,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:00:12,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:00:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:00:12,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:12,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:12,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:12,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 17:00:12,965 INFO L142 QuantifierPusher]: treesize reduction 37, result has 28.8 percent of original size [2021-07-05 17:00:12,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-07-05 17:00:12,981 INFO L142 QuantifierPusher]: treesize reduction 35, result has 47.0 percent of original size [2021-07-05 17:00:12,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-07-05 17:00:13,033 INFO L142 QuantifierPusher]: treesize reduction 37, result has 47.9 percent of original size [2021-07-05 17:00:13,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-05 17:00:13,073 INFO L142 QuantifierPusher]: treesize reduction 37, result has 47.9 percent of original size [2021-07-05 17:00:13,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-05 17:00:13,129 INFO L142 QuantifierPusher]: treesize reduction 37, result has 47.9 percent of original size [2021-07-05 17:00:13,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-05 17:00:13,171 INFO L142 QuantifierPusher]: treesize reduction 37, result has 47.9 percent of original size [2021-07-05 17:00:13,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-05 17:00:13,220 INFO L142 QuantifierPusher]: treesize reduction 45, result has 36.6 percent of original size [2021-07-05 17:00:13,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-07-05 17:00:13,249 INFO L142 QuantifierPusher]: treesize reduction 12, result has 53.8 percent of original size [2021-07-05 17:00:13,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-07-05 17:00:13,265 INFO L142 QuantifierPusher]: treesize reduction 12, result has 40.0 percent of original size [2021-07-05 17:00:13,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-07-05 17:00:13,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:13,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:00:13,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:00:13,281 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986214826] [2021-07-05 17:00:13,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986214826] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:00:13,281 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:00:13,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-05 17:00:13,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483539454] [2021-07-05 17:00:13,282 INFO L425 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-05 17:00:13,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:00:13,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-05 17:00:13,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-07-05 17:00:13,282 INFO L87 Difference]: Start difference. First operand 137 states and 163 transitions. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:00:13,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:00:13,523 INFO L93 Difference]: Finished difference Result 137 states and 163 transitions. [2021-07-05 17:00:13,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-05 17:00:13,523 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-07-05 17:00:13,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:00:13,523 INFO L225 Difference]: With dead ends: 137 [2021-07-05 17:00:13,523 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 17:00:13,523 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 414.5ms TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2021-07-05 17:00:13,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 17:00:13,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 17:00:13,524 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-07-05 17:00:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 17:00:13,524 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2021-07-05 17:00:13,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:00:13,524 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 17:00:13,524 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:00:13,524 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 17:00:13,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 17:00:13,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 17:00:13,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,531 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,532 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,532 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,540 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,552 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,565 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,566 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,566 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:13,760 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2021-07-05 17:00:14,033 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2021-07-05 17:00:14,292 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2021-07-05 17:00:14,481 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2021-07-05 17:00:14,678 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2021-07-05 17:00:14,891 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2021-07-05 17:00:15,234 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2021-07-05 17:00:15,477 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,477 INFO L762 garLoopResultBuilder]: For program point L9153(lines 9153 9155) no Hoare annotation was computed. [2021-07-05 17:00:15,477 INFO L762 garLoopResultBuilder]: For program point L9153-2(lines 9153 9155) no Hoare annotation was computed. [2021-07-05 17:00:15,477 INFO L762 garLoopResultBuilder]: For program point L6973(lines 6973 6978) no Hoare annotation was computed. [2021-07-05 17:00:15,477 INFO L758 garLoopResultBuilder]: At program point L268(line 268) the Hoare annotation is: false [2021-07-05 17:00:15,477 INFO L762 garLoopResultBuilder]: For program point L6974(lines 6974 6976) no Hoare annotation was computed. [2021-07-05 17:00:15,477 INFO L762 garLoopResultBuilder]: For program point L6974-2(lines 6974 6976) no Hoare annotation was computed. [2021-07-05 17:00:15,477 INFO L762 garLoopResultBuilder]: For program point L7141-2(line 7141) no Hoare annotation was computed. [2021-07-05 17:00:15,477 INFO L762 garLoopResultBuilder]: For program point L7141(line 7141) no Hoare annotation was computed. [2021-07-05 17:00:15,477 INFO L765 garLoopResultBuilder]: At program point L9157(line 9157) the Hoare annotation is: true [2021-07-05 17:00:15,478 INFO L762 garLoopResultBuilder]: For program point L6979(lines 6979 6981) no Hoare annotation was computed. [2021-07-05 17:00:15,478 INFO L758 garLoopResultBuilder]: At program point L6979-3(lines 6965 6982) the Hoare annotation is: (let ((.cse82 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse31 (select .cse82 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse25 (= |ULTIMATE.start_can_fail_realloc_#res.base| 0)) (.cse27 (+ |#StackHeapBarrier| 1)) (.cse28 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse42 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse51 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse33 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse49 (select .cse51 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse35 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse30 (select .cse82 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse32 (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse13 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse20 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse9 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse48 (not (= (select .cse42 4) 0))) (.cse23 (= |ULTIMATE.start_can_fail_realloc_#res.offset| 0)) (.cse16 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse26 (<= (+ (* 4294967296 .cse28) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse47 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse45 (<= .cse27 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse54 (<= .cse27 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse39 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4)) (.cse67 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse57 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse53 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse8 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse22 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse52 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse40 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse38 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse43 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse19 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse21 (not .cse25)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse3 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse66 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse12 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse14 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse24 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse29 (* .cse31 (- 1))) (.cse18 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse15 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and .cse0 (let ((.cse11 (select .cse32 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse1 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse2 (<= (* 4294967296 (div (+ (* (div (+ .cse29 4294967295 .cse30) 4294967296) 4294967296) .cse31) 4294967296)) .cse30)) (.cse10 (<= (* 4294967296 (div (+ .cse11 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse28 4294967296)) 4294967296)) .cse11)) (.cse17 (<= .cse27 ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse11 (* 4294967296 (div .cse11 4294967296))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse19 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18) (and .cse4 .cse22 .cse9 .cse23 .cse24 .cse15 .cse25 .cse26)))) .cse3 .cse33 .cse5 (let ((.cse41 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4))) (let ((.cse34 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse41)) (.cse36 (= (select .cse42 .cse41) (select .cse43 .cse39))) (.cse37 (= (select .cse38 .cse39) (select .cse40 .cse41)))) (or (and .cse34 .cse19 .cse6 .cse35 .cse8 .cse22 .cse9 (= |ULTIMATE.start_#Ultimate.C_realloc_#res.offset| 0) .cse23 .cse15 .cse21 .cse26) (and .cse34 (= |ULTIMATE.start_nondet_voidp_#res.base| 0) .cse36 .cse37 .cse6 .cse35 .cse8 .cse22 .cse9 .cse15 .cse25 .cse26) (and .cse34 .cse36 .cse37 .cse6 .cse35 .cse8 .cse22 .cse9 .cse23 .cse15 .cse25 .cse26)))) .cse35 .cse22 (let ((.cse44 (< (* 4294967296 (div ULTIMATE.start_can_fail_realloc_~newsize 4294967296)) ULTIMATE.start_can_fail_realloc_~newsize)) (.cse46 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse3 .cse4 .cse19 .cse33 .cse44 .cse20 .cse5 .cse45 .cse46 .cse35 .cse8 .cse22 .cse9 .cse12 .cse13 .cse14 .cse47 .cse15 .cse21 .cse16) (let ((.cse50 (select .cse51 12))) (and .cse0 .cse3 .cse4 .cse22 .cse9 .cse48 .cse23 .cse12 .cse24 (<= .cse49 (+ (* 4294967296 (div (+ (* (div .cse49 4294967296) 4294967296) 4294967295 (* .cse50 (- 1))) 4294967296)) .cse50)) .cse15 .cse25 (<= .cse50 (+ (* 4294967296 (div (+ (- 1) .cse50) 4294967296)) 4294967295)) .cse26)) (and .cse0 .cse3 .cse4 .cse19 .cse44 .cse20 .cse5 .cse45 (<= .cse30 (* 4294967296 (div .cse30 4294967296))) .cse46 .cse8 .cse9 .cse52 .cse12 .cse13 .cse14 .cse47 .cse15 .cse21 .cse16 .cse18))) (let ((.cse59 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse55 (<= (select .cse32 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse59)) (.cse56 (<= .cse59 .cse30)) (.cse58 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)))) (or (and .cse0 .cse4 .cse19 (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) .cse53) .cse5 .cse45 .cse54 .cse6 .cse8 .cse9 .cse55 .cse52 .cse56 .cse14 .cse57 .cse15 .cse21 .cse58 .cse18 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) .cse26) (and .cse4 (<= .cse49 .cse59) .cse22 .cse9 .cse23 .cse24 .cse15 .cse25 .cse26 (<= .cse59 .cse49)) (and .cse4 .cse19 .cse6 .cse35 .cse7 .cse8 .cse9 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse55 .cse56 .cse14 .cse53 .cse15 .cse21 .cse58 .cse18 .cse26)))) (let ((.cse68 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse60 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse68))) (.cse61 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse68) |~#s_can_fail_allocator_static~0.base|)) (.cse62 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse63 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|)) (.cse64 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|)) (.cse65 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse3 .cse4 .cse19 .cse20 .cse60 .cse45 .cse61 .cse62 .cse63 .cse6 .cse8 .cse64 .cse22 .cse9 .cse52 .cse12 .cse13 .cse15 .cse21 .cse16 .cse65 .cse26) (and .cse0 .cse3 .cse4 .cse20 .cse60 .cse61 .cse62 .cse63 .cse6 .cse8 .cse64 .cse22 .cse9 .cse48 .cse66 (not (= (select .cse67 ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0)) .cse23 .cse12 .cse24 .cse15 .cse25 .cse16 .cse65 .cse18 .cse26)))) .cse12 .cse14 .cse47 (let ((.cse71 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse74 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse69 (not (= .cse74 ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse72 (select .cse43 .cse74)) (.cse70 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse71))) (.cse73 (= (select .cse40 .cse71) (select .cse38 .cse74)))) (or (and .cse0 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) .cse69) .cse19 .cse5 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 12))) .cse45 .cse54 .cse6 .cse8 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset .cse39)) .cse22 .cse52 .cse70 (= (select .cse67 .cse71) .cse72) .cse57 .cse15 .cse21 .cse73) (and (or .cse69 .cse53) .cse6 .cse8 .cse22 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) (= .cse72 (select .cse42 .cse71)) .cse52 .cse70 .cse15 .cse73)))) (let ((.cse81 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse77 (select .cse81 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse75 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse76 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse79 (let ((.cse80 (select .cse81 12))) (<= .cse80 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse80) 4294967296)))))) (.cse78 (div .cse77 4294967296))) (or (and .cse0 .cse3 .cse19 .cse5 .cse6 .cse7 .cse12 .cse14 .cse24 .cse15 .cse21 .cse18) (and .cse75 .cse0 .cse3 .cse76 .cse5 .cse6 .cse7 .cse12 (<= .cse77 (* 4294967296 .cse78)) .cse14 .cse79 .cse24 .cse15 .cse18) (and .cse75 .cse0 .cse3 .cse76 .cse5 .cse6 .cse7 .cse66 .cse12 .cse14 .cse79 .cse24 .cse15 (<= .cse77 (+ (* 4294967296 (div (+ .cse29 (* .cse78 4294967296) 4294967295) 4294967296)) .cse31)) .cse18))))) .cse15)))) [2021-07-05 17:00:15,478 INFO L762 garLoopResultBuilder]: For program point L6979-2(lines 6979 6981) no Hoare annotation was computed. [2021-07-05 17:00:15,478 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,478 INFO L762 garLoopResultBuilder]: For program point L7145(lines 7145 7151) no Hoare annotation was computed. [2021-07-05 17:00:15,478 INFO L758 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: (let ((.cse13 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse10 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse13)) (.cse11 (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse13))) (let ((.cse2 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse3 (= .cse11 0)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse4 (= .cse10 0)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse7 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and .cse0 .cse1 .cse2 (let ((.cse5 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse9 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| .cse10) .cse2 (= .cse11 |~#s_can_fail_allocator_static~0.base|) .cse5 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse6 .cse7 .cse8 .cse9))) .cse6 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse7 .cse8 (let ((.cse12 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse12 .cse6 .cse7 .cse8) (and .cse0 .cse3 .cse1 .cse4 .cse12 .cse6 .cse7 .cse8))))))) [2021-07-05 17:00:15,478 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,478 INFO L762 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:15,479 INFO L762 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:15,479 INFO L762 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:15,479 INFO L762 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:15,479 INFO L762 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:15,479 INFO L762 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:15,479 INFO L762 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:15,479 INFO L762 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:15,479 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,479 INFO L762 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-07-05 17:00:15,479 INFO L762 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-07-05 17:00:15,479 INFO L762 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-07-05 17:00:15,480 INFO L762 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-07-05 17:00:15,480 INFO L762 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-07-05 17:00:15,480 INFO L762 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-07-05 17:00:15,480 INFO L762 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-07-05 17:00:15,480 INFO L762 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-07-05 17:00:15,480 INFO L758 garLoopResultBuilder]: At program point L6951-1(lines 6950 6952) the Hoare annotation is: (let ((.cse27 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse17 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse14 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse16 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse22 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse7 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse6 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse5 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse20 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse19 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse18 (select .cse27 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and .cse0 (let ((.cse2 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4))) (let ((.cse8 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse2)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse10 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse11 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse13 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse15 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity))) (or (let ((.cse4 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4))) (and (= (select .cse1 .cse2) (select .cse3 .cse4)) (= (select .cse5 .cse4) (select .cse6 .cse2)) .cse7)) (and (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse2) 0)) .cse8 (= |ULTIMATE.start_nondet_voidp_#res.base| 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse7 (= |ULTIMATE.start_can_fail_realloc_#res.base| 0) .cse15 (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0)) (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse2) 0)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_#Ultimate.C_realloc_#res.offset| 0) (= |ULTIMATE.start_can_fail_realloc_#res.offset| 0) .cse14 .cse7 .cse15)))) .cse16 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse17)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse17) |~#s_can_fail_allocator_static~0.base|) (<= .cse18 .cse19) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |ULTIMATE.start_aws_byte_buf_has_allocator_#t~mem500.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse12 (= (select .cse3 .cse20) (select .cse1 .cse21)) .cse22 .cse14 .cse7 (let ((.cse25 (div .cse18 4294967296)) (.cse26 (select .cse27 12))) (let ((.cse23 (<= .cse18 (+ (* 4294967296 (div (+ (* .cse25 4294967296) 4294967295 (* .cse26 (- 1))) 4294967296)) .cse26))) (.cse24 (<= .cse26 (+ (* 4294967296 (div (+ (- 1) .cse26) 4294967296)) 4294967295)))) (or (and .cse0 .cse16 .cse12 (not (= (select .cse1 4) 0)) .cse22 .cse23 .cse7 .cse24) (and .cse0 .cse16 (<= .cse18 (* 4294967296 .cse25)) .cse12 .cse22 .cse23 .cse7 .cse24)))) (= |ULTIMATE.start_can_fail_allocator_#res.base| |ULTIMATE.start_aws_byte_buf_has_allocator_#t~mem500.base|) (<= |~#s_can_fail_allocator_static~0.offset| 0) (= (select .cse6 .cse21) (select .cse5 .cse20)) (<= .cse19 .cse18)))) [2021-07-05 17:00:15,481 INFO L758 garLoopResultBuilder]: At program point L6951(lines 6950 6952) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2021-07-05 17:00:15,481 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,481 INFO L758 garLoopResultBuilder]: At program point L6655(lines 6653 6656) the Hoare annotation is: (let ((.cse27 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse17 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse14 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse16 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse22 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse7 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse6 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse5 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse20 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse19 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse18 (select .cse27 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and .cse0 (let ((.cse2 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4))) (let ((.cse8 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse2)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse10 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse11 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse13 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse15 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity))) (or (let ((.cse4 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4))) (and (= (select .cse1 .cse2) (select .cse3 .cse4)) (= (select .cse5 .cse4) (select .cse6 .cse2)) .cse7)) (and (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse2) 0)) .cse8 (= |ULTIMATE.start_nondet_voidp_#res.base| 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse7 (= |ULTIMATE.start_can_fail_realloc_#res.base| 0) .cse15 (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0)) (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse2) 0)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_#Ultimate.C_realloc_#res.offset| 0) (= |ULTIMATE.start_can_fail_realloc_#res.offset| 0) .cse14 .cse7 .cse15)))) (<= 1 |ULTIMATE.start_aws_byte_buf_has_allocator_#res|) .cse16 (<= |ULTIMATE.start_aws_byte_buf_has_allocator_#res| 1) (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse17)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse17) |~#s_can_fail_allocator_static~0.base|) (<= .cse18 .cse19) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse12 (= (select .cse3 .cse20) (select .cse1 .cse21)) .cse22 .cse14 .cse7 (let ((.cse25 (div .cse18 4294967296)) (.cse26 (select .cse27 12))) (let ((.cse23 (<= .cse18 (+ (* 4294967296 (div (+ (* .cse25 4294967296) 4294967295 (* .cse26 (- 1))) 4294967296)) .cse26))) (.cse24 (<= .cse26 (+ (* 4294967296 (div (+ (- 1) .cse26) 4294967296)) 4294967295)))) (or (and .cse0 .cse16 .cse12 (not (= (select .cse1 4) 0)) .cse22 .cse23 .cse7 .cse24) (and .cse0 .cse16 (<= .cse18 (* 4294967296 .cse25)) .cse12 .cse22 .cse23 .cse7 .cse24)))) (<= |~#s_can_fail_allocator_static~0.offset| 0) (= (select .cse6 .cse21) (select .cse5 .cse20)) (<= .cse19 .cse18)))) [2021-07-05 17:00:15,481 INFO L758 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (let ((.cse3 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4)) (.cse1 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse16 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse17 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse8 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse22 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse7 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse6 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse5 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (= (select .cse0 .cse1) (select .cse2 .cse3)) .cse4 (<= .cse5 .cse6) (= (select .cse7 .cse3) (select .cse8 .cse1)) (let ((.cse20 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse11 (select .cse20 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse19 (select .cse20 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (let ((.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse10 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse13 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse14 (<= .cse19 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse19) 4294967296))))) (.cse15 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse12 (div .cse11 4294967296)) (.cse18 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (or (and .cse9 .cse10 .cse4 (<= .cse11 (* 4294967296 .cse12)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse9 .cse10 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse4 .cse13 .cse14 .cse15 .cse16 .cse17 (<= .cse11 (+ (* 4294967296 (div (+ (* .cse12 4294967296) (* .cse19 (- 1)) 4294967295) 4294967296)) .cse19)) .cse18))))) (= (select .cse2 .cse21) (select .cse0 .cse22)) .cse16 .cse17 (= (select .cse8 .cse22) (select .cse7 .cse21)) (<= .cse6 .cse5))) [2021-07-05 17:00:15,482 INFO L758 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (let ((.cse11 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse3 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4)) (.cse1 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse10 (select .cse11 12)) (.cse7 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse9 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse6 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse8 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse5 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse4 (select .cse11 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (= (select .cse0 .cse1) (select .cse2 .cse3)) (<= .cse4 .cse5) (= (select .cse6 .cse3) (select .cse7 .cse1)) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= (select .cse0 4) 0)) (= (select .cse2 .cse8) (select .cse0 .cse9)) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (<= .cse4 (+ (* 4294967296 (div (+ (* (div .cse4 4294967296) 4294967296) 4294967295 (* .cse10 (- 1))) 4294967296)) .cse10)) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (<= .cse10 (+ (* 4294967296 (div (+ (- 1) .cse10) 4294967296)) 4294967295)) (= (select .cse7 .cse9) (select .cse6 .cse8)) (<= .cse5 .cse4)))) [2021-07-05 17:00:15,482 INFO L758 garLoopResultBuilder]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: (let ((.cse31 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse7 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse6 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4)) (.cse2 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse8 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse13 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse25 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse17 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse20 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse22 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse23 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse30 (select .cse31 12)) (.cse24 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse12 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse29 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse11 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse3 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse10 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse9 (select .cse31 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse0 .cse1 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize) (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse2) (or (not (= .cse3 ULTIMATE.start_aws_mem_realloc_~ptr.offset)) (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= (select .cse4 .cse2) (select .cse5 .cse6)) (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4) (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse7)) .cse8 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse7) |~#s_can_fail_allocator_static~0.base|) (<= .cse9 .cse10) (= (select .cse11 .cse6) (select .cse12 .cse2)) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse13 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) (let ((.cse28 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse18 (select .cse28 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse14 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse15 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse16 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse21 (let ((.cse27 (select .cse28 12))) (<= .cse27 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse27) 4294967296)))))) (.cse19 (div .cse18 4294967296))) (or (and .cse14 .cse0 .cse1 .cse15 .cse8 .cse13 .cse16 .cse17 (<= .cse18 (* 4294967296 .cse19)) .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse14 .cse0 .cse1 .cse15 .cse8 .cse13 .cse16 .cse25 .cse17 .cse20 .cse21 .cse22 .cse23 (<= .cse18 (let ((.cse26 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse26 (- 1)) (* .cse19 4294967296) 4294967295) 4294967296)) .cse26))) .cse24))))) (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity) (not (= (select .cse4 4) 0)) .cse25 (= (select .cse5 .cse3) (select .cse4 .cse29)) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse29)) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0)) .cse17 .cse20 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse22 (<= .cse9 (+ (* 4294967296 (div (+ (* (div .cse9 4294967296) 4294967296) 4294967295 (* .cse30 (- 1))) 4294967296)) .cse30)) .cse23 (<= .cse30 (+ (* 4294967296 (div (+ (- 1) .cse30) 4294967296)) 4294967295)) (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse24 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity) (= (select .cse12 .cse29) (select .cse11 .cse3)) (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0) (<= .cse10 .cse9)))) [2021-07-05 17:00:15,482 INFO L762 garLoopResultBuilder]: For program point L8176-1(line 8176) no Hoare annotation was computed. [2021-07-05 17:00:15,483 INFO L758 garLoopResultBuilder]: At program point L8176-4(line 8176) the Hoare annotation is: (let ((.cse55 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse52 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse23 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse50 (select .cse52 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse53 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse45 (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse54 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 16)) (.cse44 (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse55))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse39 (= .cse44 0)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse40 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse55) 0)) (.cse41 (= (select .cse45 .cse54) 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse10 (not (= (select .cse53 4) 0))) (.cse11 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse15 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse29 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse16 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse17 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse19 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse43 (= (select .cse53 .cse54) 0)) (.cse35 (+ |#StackHeapBarrier| 1)) (.cse31 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse51 (div .cse50 4294967296)) (.cse49 (select .cse52 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse13 (select .cse23 12))) (let ((.cse22 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse13) 4294967296)))) (.cse27 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4)) (.cse25 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse26 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse24 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse18 (<= .cse50 (+ (* 4294967296 (div (+ (* .cse51 4294967296) (* .cse49 (- 1)) 4294967295) 4294967296)) .cse49))) (.cse20 (<= .cse50 (* 4294967296 .cse51))) (.cse12 (<= .cse49 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse49) 4294967296))))) (.cse7 (<= .cse31 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse31) 4294967296))))) (.cse1 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse3 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse30 (<= .cse35 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse28 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse46 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse36 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse48 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse21 (and .cse0 .cse39 .cse2 .cse40 .cse41 .cse4 .cse6 .cse10 .cse11 .cse15 .cse29 .cse16 .cse17 .cse19 .cse43)) (.cse34 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse38 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse33 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse37 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse32 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (and .cse0 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (let ((.cse5 (select .cse23 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse8 (<= .cse13 .cse22)) (.cse14 (div .cse5 4294967296))) (or (and .cse1 .cse0 .cse2 .cse3 .cse4 (<= .cse5 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse5) 4294967296)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse5 (+ .cse13 (* 4294967296 (div (+ (* .cse14 4294967296) 4294967295 (* .cse13 (- 1))) 4294967296)))) .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse20 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 (<= .cse5 (* 4294967296 .cse14)) .cse16 .cse17 .cse19) .cse21))) (= (select .cse24 .cse25) (select .cse26 .cse27)) .cse4 (or .cse21 (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse6 .cse28 .cse11 (<= (select .cse23 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 12)) .cse22) .cse15 .cse29 .cse16 .cse17 .cse19)) .cse30 (<= .cse31 .cse32) (= (select .cse33 .cse27) (select .cse34 .cse25)) (<= .cse35 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse6 .cse36 .cse28 .cse9 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) (= (select .cse26 .cse37) (select .cse24 .cse38)) .cse29 (let ((.cse42 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse39 .cse2 .cse40 .cse41 .cse4 .cse6 .cse10 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |~#s_can_fail_allocator_static~0.offset| 1)) .cse11 .cse15 .cse29 .cse16 .cse17 .cse42 .cse19 .cse43) (and .cse0 .cse2 .cse4 .cse30 (= .cse44 |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse6 .cse36 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse11 .cse15 .cse29 (= (select .cse45 16) |~#s_can_fail_allocator_static~0.offset|) .cse17 .cse42 .cse19))) (let ((.cse47 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse1 .cse0 .cse2 .cse3 .cse46 .cse4 .cse30 .cse47 .cse36 .cse11 .cse12 .cse15 .cse29 .cse48 .cse17 .cse18 .cse19) (and .cse1 .cse0 .cse39 .cse2 .cse3 .cse40 .cse41 .cse4 .cse47 .cse6 .cse10 .cse11 .cse12 .cse15 .cse29 .cse16 .cse17 .cse18 .cse19 .cse43) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse30 .cse20 .cse47 .cse36 .cse11 .cse12 .cse15 .cse29 .cse48 .cse17 .cse19))) .cse17 (or (and .cse0 .cse2 .cse4 .cse30 .cse6 .cse28 .cse7 .cse10 .cse11 .cse15 .cse29 .cse16 .cse17 .cse19) (and .cse0 .cse39 .cse2 .cse40 .cse41 .cse4 .cse30 .cse6 .cse10 .cse11 .cse15 .cse29 .cse16 .cse17 .cse19 .cse43) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse30 .cse6 .cse28 .cse10 .cse11 .cse15 .cse29 .cse16 .cse17 .cse19)) .cse19 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) (or (and .cse0 .cse2 .cse46 .cse4 .cse36 .cse11 .cse15 .cse29 .cse48 .cse17 .cse19) .cse21) (= (select .cse34 .cse38) (select .cse33 .cse37)) (<= .cse32 .cse31)))))) [2021-07-05 17:00:15,483 INFO L762 garLoopResultBuilder]: For program point L8176-3(line 8176) no Hoare annotation was computed. [2021-07-05 17:00:15,483 INFO L762 garLoopResultBuilder]: For program point L8177-3(lines 8175 8193) no Hoare annotation was computed. [2021-07-05 17:00:15,483 INFO L762 garLoopResultBuilder]: For program point L8177-2(line 8177) no Hoare annotation was computed. [2021-07-05 17:00:15,483 INFO L762 garLoopResultBuilder]: For program point L8177(line 8177) no Hoare annotation was computed. [2021-07-05 17:00:15,483 INFO L762 garLoopResultBuilder]: For program point L8177-4(line 8177) no Hoare annotation was computed. [2021-07-05 17:00:15,483 INFO L762 garLoopResultBuilder]: For program point L6658(lines 6658 6663) no Hoare annotation was computed. [2021-07-05 17:00:15,483 INFO L762 garLoopResultBuilder]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 17:00:15,483 INFO L762 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 17:00:15,483 INFO L762 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 17:00:15,483 INFO L762 garLoopResultBuilder]: For program point L7154(lines 7154 7156) no Hoare annotation was computed. [2021-07-05 17:00:15,483 INFO L762 garLoopResultBuilder]: For program point L6659(lines 6659 6661) no Hoare annotation was computed. [2021-07-05 17:00:15,483 INFO L762 garLoopResultBuilder]: For program point L6659-2(lines 6659 6661) no Hoare annotation was computed. [2021-07-05 17:00:15,483 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 17:00:15,483 INFO L762 garLoopResultBuilder]: For program point L7122(lines 7122 7135) no Hoare annotation was computed. [2021-07-05 17:00:15,483 INFO L762 garLoopResultBuilder]: For program point L8179(lines 8179 8182) no Hoare annotation was computed. [2021-07-05 17:00:15,484 INFO L762 garLoopResultBuilder]: For program point L9137(lines 9137 9156) no Hoare annotation was computed. [2021-07-05 17:00:15,484 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,484 INFO L758 garLoopResultBuilder]: At program point L7158(lines 7137 7159) the Hoare annotation is: (let ((.cse17 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse23 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse24 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse55 (= |ULTIMATE.start_aws_mem_realloc_#res| 0)) (.cse44 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse89 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse54 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse43 (+ |#StackHeapBarrier| 1)) (.cse70 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse81 (= |ULTIMATE.start_can_fail_realloc_#res.base| 0)) (.cse34 (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0)) (.cse82 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse36 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse10 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse11 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse19 (not (= (select .cse82 4) 0))) (.cse20 (not .cse34)) (.cse22 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse25 (not .cse81)) (.cse26 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse30 (not (= (select .cse70 4) 0))) (.cse50 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse32 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse65 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse2 (<= .cse43 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse57 (<= .cse43 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse62 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse52 (select .cse54 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse51 (select .cse89 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse45 (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse29 (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0)) (.cse5 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0)) (.cse46 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse15 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse18 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse6 (<= (+ |ULTIMATE.start_aws_mem_realloc_#res| 1) 0)) (.cse28 (<= (+ (* 4294967296 .cse44) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse71 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse68 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse58 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4)) (.cse67 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse8 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse37 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse14 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse39 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse31 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse21 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse49 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse33 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse77 (and .cse17 .cse23 .cse24 .cse55))) (and (let ((.cse35 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse1 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse35))) (.cse3 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse35) |~#s_can_fail_allocator_static~0.base|))) (let ((.cse0 (let ((.cse12 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse13 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|)) (.cse16 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|)) (.cse27 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse29 .cse7 .cse8 .cse9 .cse11 .cse1 .cse3 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse30 .cse31 (not (= (select .cse32 ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0)) .cse21 .cse23 .cse24 .cse26 .cse27 .cse33 .cse28 .cse34))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6))))) .cse7 .cse8 .cse36 .cse37 (let ((.cse41 (select .cse45 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse38 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse40 (<= (* 4294967296 (div (+ .cse41 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse44 4294967296)) 4294967296)) .cse41)) (.cse42 (<= .cse43 ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and .cse5 .cse9 .cse17 .cse18 .cse6 .cse23 .cse24 .cse28) (and .cse38 .cse7 .cse8 .cse9 .cse37 .cse14 .cse39 .cse15 .cse17 .cse18 .cse40 (<= .cse41 (* 4294967296 (div .cse41 4294967296))) .cse21 .cse22 .cse23 .cse24 .cse26 .cse42 .cse33) (and .cse38 .cse7 .cse8 .cse9 .cse10 .cse11 .cse37 .cse14 .cse39 .cse15 .cse17 .cse18 .cse19 .cse40 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse42 .cse33)))) .cse46 .cse17 .cse21 (let ((.cse47 (= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse48 (or (let ((.cse53 (select .cse54 12))) (and .cse7 .cse8 .cse17 .cse30 .cse21 .cse23 (<= .cse52 (+ (* 4294967296 (div (+ (* (div .cse52 4294967296) 4294967296) 4294967295 (* .cse53 (- 1))) 4294967296)) .cse53)) .cse24 (<= .cse53 (+ (* 4294967296 (div (+ (- 1) .cse53) 4294967296)) 4294967295)))) (and .cse7 .cse8 .cse17 .cse21 .cse23 .cse24 .cse55)))) (or (and .cse9 .cse10 .cse36 .cse11 .cse37 .cse2 .cse47 .cse46 .cse15 .cse18 .cse19 .cse20 .cse22 .cse48 .cse49 .cse50 .cse25 .cse26 .cse28) (and .cse5 .cse9 .cse18 .cse6 .cse48 .cse28) (and .cse9 .cse10 .cse11 .cse37 .cse2 (<= .cse51 (* 4294967296 (div .cse51 4294967296))) .cse47 .cse15 .cse18 .cse19 .cse4 .cse20 .cse22 .cse48 .cse50 .cse25 .cse26 .cse33 .cse28))) .cse49 .cse50 .cse24 (let ((.cse69 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse61 (select .cse71 .cse69)) (.cse60 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (let ((.cse66 (= .cse61 (select .cse70 .cse60)))) (let ((.cse56 (not (= .cse69 ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse59 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse60))) (.cse63 (or (and .cse66 .cse23 .cse24) (and .cse23 .cse24 .cse55))) (.cse64 (= (select .cse67 .cse60) (select .cse68 .cse69)))) (or (and .cse7 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) .cse56) .cse37 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 12))) .cse2 .cse57 .cse14 .cse15 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset .cse58)) .cse17 .cse4 .cse59 (= (select .cse32 .cse60) .cse61) .cse62 .cse63 .cse64) (and (or .cse56 .cse65) .cse14 .cse15 .cse17 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) .cse66 .cse4 .cse59 .cse63 .cse64)))))) (let ((.cse76 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse72 (<= (select .cse45 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse76)) (.cse73 (<= .cse76 .cse51)) (.cse74 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (.cse75 (or (and (<= .cse52 .cse76) .cse17 .cse23 .cse24 (<= .cse76 .cse52)) .cse77))) (or (and .cse9 .cse14 .cse46 .cse39 .cse15 .cse18 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse72 .cse73 .cse65 .cse74 .cse33 .cse28 .cse75) (and .cse5 .cse9 .cse18 .cse6 .cse28 .cse75) (and .cse7 .cse9 (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) .cse65) .cse37 .cse2 .cse57 .cse14 .cse15 .cse18 .cse72 .cse4 .cse73 .cse62 .cse74 .cse33 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) .cse28 .cse75)))) (let ((.cse78 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4))) (let ((.cse79 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse78)) (.cse80 (or (and .cse17 .cse24 .cse55) (and (= (select .cse70 .cse78) (select .cse71 .cse58)) (= (select .cse68 .cse58) (select .cse67 .cse78)) .cse17 .cse24)))) (or (and (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse78) 0)) .cse79 (= |ULTIMATE.start_nondet_voidp_#res.base| 0) .cse14 .cse46 .cse15 .cse18 .cse80 .cse81 .cse28 .cse34) (and .cse29 (not (= (select .cse82 .cse78) 0)) .cse79 .cse14 .cse46 .cse15 .cse18 (= |ULTIMATE.start_#Ultimate.C_realloc_#res.offset| 0) (= |ULTIMATE.start_can_fail_realloc_#res.offset| 0) .cse80 .cse28) (and .cse5 .cse79 .cse14 .cse46 .cse15 .cse18 .cse6 .cse80 .cse28)))) (let ((.cse91 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse85 (select .cse91 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse83 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse84 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse87 (let ((.cse90 (select .cse91 12))) (<= .cse90 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse90) 4294967296)))))) (.cse86 (div .cse85 4294967296))) (or (and .cse83 .cse7 .cse8 .cse84 .cse37 .cse14 .cse39 .cse21 (<= .cse85 (* 4294967296 .cse86)) .cse49 .cse87 .cse23 .cse24 .cse33) (and .cse83 .cse7 .cse8 .cse84 .cse37 .cse14 .cse39 .cse31 .cse21 .cse49 .cse87 .cse23 .cse24 (<= .cse85 (let ((.cse88 (select .cse89 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse88 (- 1)) (* .cse86 4294967296) 4294967295) 4294967296)) .cse88))) .cse33) .cse77))))))) [2021-07-05 17:00:15,484 INFO L762 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:15,484 INFO L762 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:15,484 INFO L762 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:15,484 INFO L762 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:15,484 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,484 INFO L762 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:15,484 INFO L762 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:15,485 INFO L762 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:15,485 INFO L762 garLoopResultBuilder]: For program point L222-7(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:15,485 INFO L762 garLoopResultBuilder]: For program point L222-8(lines 7162 7172) no Hoare annotation was computed. [2021-07-05 17:00:15,485 INFO L762 garLoopResultBuilder]: For program point L222-9(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:15,485 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 17:00:15,485 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,485 INFO L762 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,485 INFO L762 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,485 INFO L762 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,485 INFO L762 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,485 INFO L762 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,485 INFO L762 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,485 INFO L762 garLoopResultBuilder]: For program point L8184(lines 8184 8187) no Hoare annotation was computed. [2021-07-05 17:00:15,485 INFO L762 garLoopResultBuilder]: For program point L7160(lines 7160 7173) no Hoare annotation was computed. [2021-07-05 17:00:15,485 INFO L762 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,485 INFO L762 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,485 INFO L762 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,485 INFO L762 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,485 INFO L762 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,485 INFO L762 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,486 INFO L762 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,486 INFO L762 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,486 INFO L762 garLoopResultBuilder]: For program point L223-21(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,486 INFO L762 garLoopResultBuilder]: For program point L223-22(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,486 INFO L762 garLoopResultBuilder]: For program point L223-24(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,486 INFO L762 garLoopResultBuilder]: For program point L223-25(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,486 INFO L762 garLoopResultBuilder]: For program point L7491-1(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:15,486 INFO L762 garLoopResultBuilder]: For program point L7491(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,486 INFO L762 garLoopResultBuilder]: For program point L223-27(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,486 INFO L762 garLoopResultBuilder]: For program point L223-28(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,486 INFO L762 garLoopResultBuilder]: For program point L7491-4(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:15,486 INFO L762 garLoopResultBuilder]: For program point L7491-3(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:15,486 INFO L762 garLoopResultBuilder]: For program point L7491-9(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,486 INFO L762 garLoopResultBuilder]: For program point L7491-7(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,486 INFO L762 garLoopResultBuilder]: For program point L7491-6(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:15,486 INFO L762 garLoopResultBuilder]: For program point L7491-13(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,486 INFO L758 garLoopResultBuilder]: At program point L7491-12(lines 7489 7495) the Hoare annotation is: (let ((.cse29 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse28 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse13 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse29)) (.cse15 (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse29))) (let ((.cse3 (= .cse15 0)) (.cse4 (= .cse13 0)) (.cse16 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse7 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse18 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0)) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse12 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse26 (select .cse28 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (let ((.cse17 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse14 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse23 (let ((.cse27 (select .cse28 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= .cse27 (+ (* 4294967296 (div (+ (* (div .cse27 4294967296) 4294967296) (* .cse26 (- 1)) 4294967295) 4294967296)) .cse26)))) (.cse2 (and .cse16 .cse0 .cse1 .cse5 .cse7 .cse18 .cse8 .cse9 .cse10 .cse12)) (.cse19 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse20 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse22 (<= .cse26 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse26) 4294967296))))) (.cse25 (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12))) (and .cse0 .cse1 (let ((.cse6 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse11 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or .cse2 (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| .cse13) .cse5 .cse14 (= .cse15 |~#s_can_fail_allocator_static~0.base|) .cse6 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) .cse5 .cse14 (let ((.cse21 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse16 .cse0 .cse1 .cse17 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse7 .cse18 .cse8 .cse10 .cse12) (and .cse19 .cse0 .cse3 .cse1 .cse20 .cse4 .cse5 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse23 .cse12) (and .cse19 .cse0 .cse1 .cse20 .cse5 .cse14 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse23 .cse12))) .cse17 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse7 .cse8 .cse9 .cse10 (or (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse14 .cse7 .cse8 .cse9 .cse10 .cse12) .cse2 (and .cse0 .cse1 .cse5 .cse14 (let ((.cse24 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (<= .cse24 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse24) 4294967296))))) .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse19 .cse0 .cse1 .cse20 .cse5 .cse14 .cse7 .cse8 .cse9 .cse10 .cse12)) (or .cse2 (and .cse19 .cse0 .cse1 .cse20 .cse5 .cse7 .cse22 .cse8 .cse9 .cse10 .cse23 .cse12) .cse25) (or .cse2 (and .cse19 .cse0 .cse1 .cse20 .cse5 .cse7 .cse22 .cse8 .cse9 .cse10 .cse12) .cse25) .cse12))))) [2021-07-05 17:00:15,487 INFO L762 garLoopResultBuilder]: For program point L7491-11(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,487 INFO L762 garLoopResultBuilder]: For program point L7491-17(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:15,487 INFO L762 garLoopResultBuilder]: For program point L7491-16(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:15,487 INFO L762 garLoopResultBuilder]: For program point L7491-14(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:15,487 INFO L762 garLoopResultBuilder]: For program point L7491-20(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,487 INFO L762 garLoopResultBuilder]: For program point L7491-19(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:15,487 INFO L758 garLoopResultBuilder]: At program point L7491-25(lines 7489 7495) the Hoare annotation is: (let ((.cse48 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse28 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse34 (select .cse48 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse50 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse51 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse26 (select .cse51 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse17 (select .cse51 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse36 (select .cse50 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse49 (select .cse50 12)) (.cse44 (div .cse34 4294967296)) (.cse0 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse3 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse5 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0))) (.cse6 (not (= (select .cse28 4) 0))) (.cse7 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse8 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0)) (.cse9 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse10 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse12 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse14 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse40 (+ |#StackHeapBarrier| 1))) (let ((.cse31 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4)) (.cse29 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4)) (.cse27 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse23 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse15 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse22 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse16 (<= .cse40 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse20 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse30 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse21 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse32 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse33 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse24 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14)) (.cse35 (* .cse44 4294967296)) (.cse11 (<= .cse36 (+ (* 4294967296 (div (+ (* (div .cse36 4294967296) 4294967296) 4294967295 (* .cse49 (- 1))) 4294967296)) .cse49))) (.cse13 (<= .cse49 (+ (* 4294967296 (div (+ (- 1) .cse49) 4294967296)) 4294967295))) (.cse18 (div .cse17 4294967296)) (.cse25 (* .cse26 (- 1))) (.cse39 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse42 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse38 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse41 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse37 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (and (let ((.cse19 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse16 (<= .cse17 (* 4294967296 .cse18)) .cse19 .cse20 .cse6 .cse7 .cse9 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse23 .cse15 .cse16 .cse19 .cse20 .cse6 .cse7 .cse9 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14))) (or .cse24 (and .cse1 (<= (* 4294967296 (div (+ (* (div (+ .cse25 4294967295 .cse17) 4294967296) 4294967296) .cse26) 4294967296)) .cse17) .cse2 .cse15 .cse16 .cse3 .cse27 .cse4 .cse6 .cse9 .cse10 .cse12 .cse14)) .cse1 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (= (select .cse28 .cse29) (select .cse30 .cse31)) (or (and .cse32 .cse1 .cse2 .cse33 .cse15 .cse3 .cse27 .cse4 .cse6 .cse9 .cse10 .cse12 .cse13 (<= .cse34 (+ (* 4294967296 (div (+ .cse25 .cse35 4294967295) 4294967296)) .cse26)) .cse14) .cse24) .cse15 .cse16 (<= .cse36 .cse37) (= (select .cse38 .cse31) (select .cse39 .cse29)) (<= .cse40 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse3 .cse20 .cse27 (or (and .cse1 .cse2 .cse23 .cse15 .cse20 .cse7 .cse9 .cse21 .cse22 .cse12 .cse14) .cse24) .cse4 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) (or (and .cse1 .cse2 .cse16 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse3 .cse20 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse4 .cse6 .cse7 .cse9 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 16) |~#s_can_fail_allocator_static~0.offset|) .cse12 (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse14) .cse24) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) (= (select .cse30 .cse41) (select .cse28 .cse42)) .cse21 .cse12 .cse14 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) (let ((.cse43 (let ((.cse47 (select .cse48 12))) (let ((.cse45 (<= .cse47 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse47) 4294967296))))) (.cse46 (<= .cse26 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse26) 4294967296)))))) (or (and .cse1 .cse2 (<= (* 4294967296 (div (+ .cse36 4294967295) 4294967296)) .cse36) (<= (* 4294967296 (div (+ 4294967295 .cse17) 4294967296)) .cse17) (<= (* 4294967296 (div (+ .cse34 4294967295) 4294967296)) .cse34) .cse3 .cse45 .cse4 .cse5 .cse6 .cse7 .cse46 .cse9 .cse10 .cse12 .cse13 .cse14) (and (<= .cse17 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse17) 4294967296)))) .cse1 .cse2 (<= .cse34 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse34) 4294967296)))) .cse3 (<= .cse36 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse36) 4294967296)))) .cse45 .cse4 .cse5 .cse6 .cse7 .cse46 (<= .cse34 (+ .cse47 (* 4294967296 (div (+ .cse35 4294967295 (* .cse47 (- 1))) 4294967296)))) .cse9 .cse10 .cse11 .cse12 .cse13 (<= .cse17 (+ (* 4294967296 (div (+ (* .cse18 4294967296) .cse25 4294967295) 4294967296)) .cse26)) .cse14)))))) (or (and .cse43 (<= .cse34 (* 4294967296 .cse44))) (and .cse32 .cse33 .cse43) .cse24)) (= (select .cse39 .cse42) (select .cse38 .cse41)) (<= .cse37 .cse36)))))) [2021-07-05 17:00:15,487 INFO L762 garLoopResultBuilder]: For program point L7491-24(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,487 INFO L762 garLoopResultBuilder]: For program point L7491-22(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,487 INFO L762 garLoopResultBuilder]: For program point L7491-29(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:15,487 INFO L762 garLoopResultBuilder]: For program point L7491-27(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:15,487 INFO L762 garLoopResultBuilder]: For program point L7491-26(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,487 INFO L762 garLoopResultBuilder]: For program point L7491-33(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,487 INFO L762 garLoopResultBuilder]: For program point L7491-32(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:15,488 INFO L762 garLoopResultBuilder]: For program point L7491-30(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:15,488 INFO L762 garLoopResultBuilder]: For program point L7491-37(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,488 INFO L762 garLoopResultBuilder]: For program point L7491-35(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,488 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,488 INFO L762 garLoopResultBuilder]: For program point L7491-40(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:15,488 INFO L762 garLoopResultBuilder]: For program point L7491-39(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,488 INFO L758 garLoopResultBuilder]: At program point L7491-38(lines 7489 7495) the Hoare annotation is: (let ((.cse11 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse9 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse16 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0))) (.cse17 (not (= (select .cse11 4) 0))) (.cse4 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse5 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse18 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (let ((.cse10 (and (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 .cse2 .cse3 .cse16 .cse17 .cse4 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse5 .cse18 .cse6 .cse7)) (.cse14 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4)) (.cse12 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4)) (.cse13 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse25 (select .cse9 12)) (.cse22 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse24 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse21 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse23 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse20 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse19 (select .cse9 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 (or (and .cse0 .cse1 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse8 (select .cse9 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse8 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse8 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) 4294967296)) 4294967295)))) .cse10) .cse1 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= (select .cse11 .cse12) (select .cse13 .cse14)) (or .cse10 (let ((.cse15 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse15)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse15) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse2 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse3 .cse16 .cse17 .cse4 .cse5 .cse18 .cse6 (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse7))) (<= .cse19 .cse20) (= (select .cse21 .cse14) (select .cse22 .cse12)) .cse3 .cse17 (= (select .cse13 .cse23) (select .cse11 .cse24)) .cse5 .cse18 (<= .cse19 (+ (* 4294967296 (div (+ (* (div .cse19 4294967296) 4294967296) 4294967295 (* .cse25 (- 1))) 4294967296)) .cse25)) .cse6 (<= .cse25 (+ (* 4294967296 (div (+ (- 1) .cse25) 4294967296)) 4294967295)) (= (select .cse22 .cse24) (select .cse21 .cse23)) (<= .cse20 .cse19))))) [2021-07-05 17:00:15,488 INFO L762 garLoopResultBuilder]: For program point L7491-45(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:15,488 INFO L762 garLoopResultBuilder]: For program point L7491-43(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:15,488 INFO L762 garLoopResultBuilder]: For program point L7491-42(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:15,488 INFO L762 garLoopResultBuilder]: For program point L7491-48(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,488 INFO L762 garLoopResultBuilder]: For program point L7491-46(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,488 INFO L762 garLoopResultBuilder]: For program point L7491-53(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:15,488 INFO L762 garLoopResultBuilder]: For program point L7491-52(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,489 INFO L758 garLoopResultBuilder]: At program point L7491-51(lines 7489 7495) the Hoare annotation is: (let ((.cse19 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse3 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4)) (.cse1 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse7 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse10 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse6 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse9 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse5 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse4 (select .cse19 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= (select .cse0 .cse1) (select .cse2 .cse3)) (<= .cse4 .cse5) (= (select .cse6 .cse3) (select .cse7 .cse1)) .cse8 (= (select .cse2 .cse9) (select .cse0 .cse10)) (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) .cse11 (let ((.cse17 (div .cse4 4294967296)) (.cse18 (select .cse19 12))) (let ((.cse12 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse13 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse14 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse15 (<= .cse4 (+ (* 4294967296 (div (+ (* .cse17 4294967296) 4294967295 (* .cse18 (- 1))) 4294967296)) .cse18))) (.cse16 (<= .cse18 (+ (* 4294967296 (div (+ (- 1) .cse18) 4294967296)) 4294967295)))) (or (and .cse12 .cse13 .cse8 (not (= (select .cse0 4) 0)) .cse14 .cse15 .cse11 .cse16) (and .cse12 .cse13 (<= .cse4 (* 4294967296 .cse17)) .cse8 .cse14 .cse15 .cse11 .cse16)))) (= (select .cse7 .cse10) (select .cse6 .cse9)) (<= .cse5 .cse4)))) [2021-07-05 17:00:15,489 INFO L762 garLoopResultBuilder]: For program point L7491-50(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,489 INFO L762 garLoopResultBuilder]: For program point L7491-56(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:15,489 INFO L762 garLoopResultBuilder]: For program point L7491-55(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:15,489 INFO L762 garLoopResultBuilder]: For program point L7491-61(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,489 INFO L762 garLoopResultBuilder]: For program point L7491-59(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,489 INFO L762 garLoopResultBuilder]: For program point L7491-58(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:15,489 INFO L762 garLoopResultBuilder]: For program point L7491-65(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,489 INFO L758 garLoopResultBuilder]: At program point L7491-64(lines 7489 7495) the Hoare annotation is: (let ((.cse33 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse35 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0)) (.cse15 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse19 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse20 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse39 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse62 (+ |#StackHeapBarrier| 1))) (let ((.cse25 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse26 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse16 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse22 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse4 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse42 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse34 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse36 (= |ULTIMATE.start_can_fail_realloc_#res.base| 0)) (.cse37 (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse52 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse6 (<= .cse62 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse46 (<= .cse62 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse28 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse11 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse50 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse23 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse24 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse7 (select .cse39 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse44 (and .cse33 .cse0 .cse1 .cse10 .cse35 .cse15 .cse19 .cse20)) (.cse27 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse29 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse58 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse17 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse30 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) (.cse32 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (and (let ((.cse18 (let ((.cse38 (select .cse39 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (<= (+ (* 4294967296 (div .cse38 4294967296)) 1) .cse38))) (.cse3 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse8 (= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse12 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse14 (not .cse37)) (.cse21 (not .cse36))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= .cse7 (* 4294967296 (div .cse7 4294967296))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (let ((.cse31 (select .cse32 12))) (and .cse25 .cse0 .cse1 .cse2 .cse26 .cse3 .cse27 .cse4 .cse5 .cse6 .cse8 .cse28 .cse29 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= (* 4294967296 (div (+ 4294967295 .cse30 .cse7 (* .cse31 (- 1))) 4294967296)) .cse7) (<= .cse31 ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) .cse24)) (and .cse33 .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse28 .cse9 .cse10 .cse11 (not (= (select .cse34 4) 0)) .cse12 .cse35 .cse14 .cse15 .cse16 .cse19 .cse20 .cse21 .cse22 .cse24))) .cse25 .cse26 (or (let ((.cse43 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and (let ((.cse40 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse41 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse40 .cse10 .cse11 .cse15 .cse16 .cse19 .cse20 .cse22 .cse41 .cse24) (and .cse0 .cse1 .cse2 .cse40 .cse10 .cse11 (not (= (select .cse42 4) 0)) .cse15 .cse19 .cse20 .cse22 .cse41 .cse24))) .cse4 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse43)) .cse6 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse43) |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse28 .cse9 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse13)) .cse44) .cse10 (let ((.cse48 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse53 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse45 (not (= .cse53 ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse49 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse53)) (.cse47 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse48))) (.cse51 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse48) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse53)))) (or (and .cse0 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) .cse45) .cse5 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 12))) .cse6 .cse46 .cse28 .cse9 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4))) .cse10 .cse13 .cse47 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) .cse48) .cse49) .cse50 .cse20 .cse51) (and (or .cse45 .cse52) .cse28 .cse9 .cse10 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) (= .cse49 (select .cse42 .cse48)) .cse13 .cse47 .cse20 .cse51)))) (let ((.cse54 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4))) (let ((.cse55 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse54))) (or (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) (not (= (select .cse34 .cse54) 0)) .cse55 .cse28 .cse29 .cse9 .cse10 .cse11 (= |ULTIMATE.start_#Ultimate.C_realloc_#res.offset| 0) (= |ULTIMATE.start_can_fail_realloc_#res.offset| 0) .cse20 .cse24) (and (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse54) 0)) .cse55 (= |ULTIMATE.start_nondet_voidp_#res.base| 0) .cse28 .cse29 .cse9 .cse10 .cse11 .cse20 .cse36 .cse24 .cse37)))) .cse19 .cse20 (let ((.cse60 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse56 (<= (select (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse60)) (.cse57 (<= .cse60 .cse7)) (.cse59 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)))) (or (and .cse2 .cse28 .cse29 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse9 .cse11 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse56 .cse57 .cse58 .cse19 .cse52 .cse20 .cse59 .cse23 .cse24) (and .cse0 .cse2 (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) .cse52) .cse5 .cse6 .cse46 .cse28 .cse9 .cse11 .cse56 .cse13 .cse57 .cse58 .cse19 .cse50 .cse20 .cse59 .cse23 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) .cse24)))) (or .cse44 (and .cse0 .cse1 .cse27 .cse5 .cse29 .cse10 .cse15 .cse58 .cse17 .cse19 .cse20 (let ((.cse61 (select .cse32 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse61 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse61 .cse30) 4294967296)) 4294967295)))))))) [2021-07-05 17:00:15,489 INFO L762 garLoopResultBuilder]: For program point L7491-63(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,489 INFO L762 garLoopResultBuilder]: For program point L7491-69(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:15,490 INFO L762 garLoopResultBuilder]: For program point L7491-68(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:15,490 INFO L762 garLoopResultBuilder]: For program point L7491-66(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:15,490 INFO L762 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2021-07-05 17:00:15,490 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 17:00:15,490 INFO L762 garLoopResultBuilder]: For program point L7491-72(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,490 INFO L762 garLoopResultBuilder]: For program point L7491-71(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:15,490 INFO L758 garLoopResultBuilder]: At program point L7491-77(lines 7489 7495) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse5 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse18 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse17 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse16 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse15 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4))) (let ((.cse7 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse1)) (.cse8 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse10 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse12 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse13 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse14 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity))) (or (let ((.cse3 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4))) (and (= (select .cse0 .cse1) (select .cse2 .cse3)) (= (select .cse4 .cse3) (select .cse5 .cse1)) .cse6)) (and (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse1) 0)) .cse7 (= |ULTIMATE.start_nondet_voidp_#res.base| 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse6 (= |ULTIMATE.start_can_fail_realloc_#res.base| 0) .cse14 (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0)) (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse1) 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_#Ultimate.C_realloc_#res.offset| 0) (= |ULTIMATE.start_can_fail_realloc_#res.offset| 0) .cse13 .cse6 .cse14)))) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (<= .cse15 .cse16) (= (select .cse2 .cse17) (select .cse0 .cse18)) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) .cse6 (= (select .cse5 .cse18) (select .cse4 .cse17)) (<= .cse16 .cse15))) [2021-07-05 17:00:15,490 INFO L762 garLoopResultBuilder]: For program point L7491-76(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,490 INFO L762 garLoopResultBuilder]: For program point L7491-74(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,490 INFO L762 garLoopResultBuilder]: For program point L9145(lines 9145 9148) no Hoare annotation was computed. [2021-07-05 17:00:15,490 INFO L762 garLoopResultBuilder]: For program point L9145-2(lines 9145 9148) no Hoare annotation was computed. [2021-07-05 17:00:15,490 INFO L762 garLoopResultBuilder]: For program point L7494(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,490 INFO L762 garLoopResultBuilder]: For program point L7494-4(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,490 INFO L762 garLoopResultBuilder]: For program point L7494-3(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,490 INFO L762 garLoopResultBuilder]: For program point L7494-2(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,490 INFO L762 garLoopResultBuilder]: For program point L7494-8(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,490 INFO L762 garLoopResultBuilder]: For program point L7494-6(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,490 INFO L762 garLoopResultBuilder]: For program point L7494-12(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,491 INFO L762 garLoopResultBuilder]: For program point L7494-11(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,491 INFO L762 garLoopResultBuilder]: For program point L7494-9(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,491 INFO L762 garLoopResultBuilder]: For program point L6966(lines 6966 6972) no Hoare annotation was computed. [2021-07-05 17:00:15,491 INFO L762 garLoopResultBuilder]: For program point L7494-15(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,491 INFO L762 garLoopResultBuilder]: For program point L7494-13(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,491 INFO L762 garLoopResultBuilder]: For program point L7494-20(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,491 INFO L762 garLoopResultBuilder]: For program point L7494-18(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,491 INFO L762 garLoopResultBuilder]: For program point L7494-17(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,491 INFO L762 garLoopResultBuilder]: For program point L7494-24(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,491 INFO L762 garLoopResultBuilder]: For program point L7494-22(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,491 INFO L762 garLoopResultBuilder]: For program point L7494-21(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,491 INFO L762 garLoopResultBuilder]: For program point L7494-27(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,491 INFO L762 garLoopResultBuilder]: For program point L7494-26(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,491 INFO L762 garLoopResultBuilder]: For program point L7494-31(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,491 INFO L762 garLoopResultBuilder]: For program point L7494-30(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,491 INFO L762 garLoopResultBuilder]: For program point L7494-29(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,491 INFO L758 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2021-07-05 17:00:15,491 INFO L762 garLoopResultBuilder]: For program point L7494-36(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,491 INFO L758 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: false [2021-07-05 17:00:15,492 INFO L762 garLoopResultBuilder]: For program point L7494-35(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,492 INFO L758 garLoopResultBuilder]: At program point L261-2(line 261) the Hoare annotation is: (let ((.cse57 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse42 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse55 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse44 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse53 (select .cse57 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse7 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse16 (+ |#StackHeapBarrier| 1))) (let ((.cse11 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse9 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4)) (.cse3 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4)) (.cse8 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse27 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse13 (<= .cse16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse18 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse33 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse5 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse10 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse17 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse20 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse29 (select .cse57 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse12 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse19 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse21 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse22 (not (= (select .cse7 4) 0))) (.cse23 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse28 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0))) (.cse31 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse32 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse35 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse37 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse24 (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse52 (* .cse53 (- 1))) (.cse54 (select .cse44 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse38 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse39 (<= (+ (* 4294967296 .cse55) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse15 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse26 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse14 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse4 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse25 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse41 (select .cse42 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 .cse2 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse3) (or (not (= .cse4 ULTIMATE.start_aws_mem_realloc_~ptr.offset)) .cse5) .cse6 (= (select .cse7 .cse3) (select .cse8 .cse9)) .cse10 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse11)) .cse12 .cse13 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse11) |~#s_can_fail_allocator_static~0.base|) (= (select .cse14 .cse9) (select .cse15 .cse3)) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (<= .cse16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse17 .cse18 .cse19 .cse20 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) .cse21 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse22 .cse23 (<= (select .cse24 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse25) (= (select .cse8 .cse4) (select .cse7 .cse26)) .cse27 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse26)) .cse28 (let ((.cse40 (select .cse42 12))) (let ((.cse30 (= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse34 (<= .cse41 (+ (* 4294967296 (div (+ (* (div .cse41 4294967296) 4294967296) 4294967295 (* .cse40 (- 1))) 4294967296)) .cse40))) (.cse36 (<= .cse40 (+ (* 4294967296 (div (+ (- 1) .cse40) 4294967296)) 4294967295)))) (or (and .cse0 .cse1 .cse2 .cse10 .cse12 .cse13 (<= .cse29 (* 4294967296 (div .cse29 4294967296))) .cse30 .cse20 .cse21 .cse27 .cse28 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) (and .cse0 .cse1 .cse2 .cse6 .cse10 .cse12 .cse13 .cse30 .cse18 .cse20 .cse21 .cse28 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39)))) .cse31 .cse32 .cse33 (let ((.cse43 (select .cse44 12))) (<= .cse43 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse43) 4294967296))))) .cse5 .cse35 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) .cse37 (let ((.cse46 (select .cse24 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse45 (let ((.cse56 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse47 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse48 (not (= (select .cse56 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 4)) 0))) (.cse49 (not (= (select .cse56 4) 0))) (.cse50 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse51 (<= .cse16 ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and .cse47 .cse0 .cse1 .cse2 (<= (* 4294967296 (div (+ .cse41 4294967295) 4294967296)) .cse41) .cse12 .cse19 .cse48 .cse21 .cse49 .cse22 .cse23 .cse28 .cse31 (<= (* 4294967296 (div (+ 4294967295 .cse46) 4294967296)) .cse46) .cse32 .cse50 .cse35 .cse37 .cse51 .cse38 .cse39) (and .cse47 .cse0 (<= (* 4294967296 (div (+ (* (div (+ .cse52 4294967295 .cse29) 4294967296) 4294967296) .cse53) 4294967296)) .cse29) .cse1 .cse2 .cse12 (<= .cse54 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse54) 4294967296)))) .cse19 (<= .cse41 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse41) 4294967296)))) .cse48 .cse21 .cse49 (<= (* 4294967296 (div (+ .cse46 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse55 4294967296)) 4294967296)) .cse46) .cse22 .cse23 .cse28 .cse31 .cse32 .cse50 .cse35 .cse37 .cse51 .cse38 .cse39)))))) (or (and .cse10 .cse45 .cse17 .cse20) (and .cse45 .cse17 .cse20 (<= .cse46 (* 4294967296 (div .cse46 4294967296))))))) (<= .cse54 (+ (* 4294967296 (div (+ .cse52 (* (div .cse54 4294967296) 4294967296) 4294967295) 4294967296)) .cse53)) (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse38 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) .cse39 (= (select .cse15 .cse26) (select .cse14 .cse4)) (<= .cse25 .cse41))))) [2021-07-05 17:00:15,492 INFO L762 garLoopResultBuilder]: For program point L7494-33(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,492 INFO L762 garLoopResultBuilder]: For program point L7494-40(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,492 INFO L762 garLoopResultBuilder]: For program point L7494-39(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,492 INFO L762 garLoopResultBuilder]: For program point L7494-38(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,492 INFO L762 garLoopResultBuilder]: For program point L7494-44(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,492 INFO L762 garLoopResultBuilder]: For program point L7494-42(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,492 INFO L762 garLoopResultBuilder]: For program point L7494-48(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,492 INFO L762 garLoopResultBuilder]: For program point L7494-47(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,492 INFO L762 garLoopResultBuilder]: For program point L7494-45(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,492 INFO L762 garLoopResultBuilder]: For program point L7494-51(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,492 INFO L762 garLoopResultBuilder]: For program point L7494-49(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,492 INFO L762 garLoopResultBuilder]: For program point L7494-53(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:15,493 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 17:00:15,493 INFO L762 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2021-07-05 17:00:15,493 INFO L758 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: (let ((.cse51 (+ |#StackHeapBarrier| 1)) (.cse36 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse34 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296))) (let ((.cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse29 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse24 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse16 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse23 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse25 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse19 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse22 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse12 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse26 (<= (+ (* 4294967296 .cse34) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse27 (select .cse36 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse37 (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse17 (<= .cse51 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse39 (<= .cse51 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse42 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse38 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse3 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse20 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse21 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse28 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4)) .cse3 .cse4 (let ((.cse10 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)))) (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse14 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse5 .cse6 .cse7 .cse8 (let ((.cse13 (select .cse14 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (<= .cse13 (* 4294967296 (div .cse13 4294967296)))) .cse9 (let ((.cse15 (select .cse14 12))) (<= .cse15 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse15) 4294967296))))) .cse10 .cse11 .cse12)))) (let ((.cse18 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse8 .cse23 .cse9 .cse24 .cse11 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse17 (<= .cse27 (* 4294967296 (div .cse27 4294967296))) .cse18 .cse20 .cse22 .cse28 .cse8 .cse23 .cse9 .cse24 .cse11 .cse25 .cse12 .cse26))) .cse16 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse29)) .cse5 .cse17 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse29) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse6 .cse19 .cse20 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse21 .cse22 (= |ULTIMATE.start_#Ultimate.C_realloc_#res.offset| 0) .cse28 .cse8 .cse23 .cse9 .cse24 .cse11 .cse25 (<= |~#s_can_fail_allocator_static~0.offset| 0) (let ((.cse33 (select .cse37 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse30 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse31 (<= (* 4294967296 (div (let ((.cse35 (select .cse36 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* (div (+ (* .cse35 (- 1)) 4294967295 .cse27) 4294967296) 4294967296) .cse35)) 4294967296)) .cse27)) (.cse32 (<= (* 4294967296 (div (+ .cse33 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse34 4294967296)) 4294967296)) .cse33))) (or (and .cse30 .cse0 .cse31 .cse1 .cse2 .cse3 .cse16 .cse5 .cse17 .cse6 .cse7 .cse20 .cse21 .cse22 .cse32 .cse8 .cse23 .cse11 .cse25 .cse12) (and .cse30 .cse0 .cse31 .cse1 .cse2 .cse5 .cse17 .cse6 .cse7 .cse20 .cse21 .cse22 .cse32 (<= .cse33 (* 4294967296 (div .cse33 4294967296))) .cse8 .cse23 .cse11 .cse25 .cse12)))) .cse26 (let ((.cse44 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse40 (<= (select .cse37 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse44)) (.cse41 (<= .cse44 .cse27)) (.cse43 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)))) (or (and .cse0 .cse2 .cse3 (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) .cse38) .cse5 .cse17 .cse39 .cse6 .cse20 .cse22 .cse40 .cse28 .cse41 .cse9 .cse42 .cse11 .cse43 .cse12 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) .cse26) (and .cse2 .cse3 .cse6 .cse19 .cse7 .cse20 .cse22 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse40 .cse41 .cse9 .cse38 .cse11 .cse43 .cse12 .cse26)))) (let ((.cse47 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse50 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse45 (not (= .cse50 ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse48 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse50)) (.cse46 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse47))) (.cse49 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse47) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse50)))) (or (and .cse0 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) .cse45) .cse3 .cse5 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 12))) .cse17 .cse39 .cse6 .cse20 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4))) .cse21 .cse28 .cse46 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) .cse47) .cse48) .cse42 .cse11 .cse49) (and (or .cse45 .cse38) .cse3 .cse6 .cse20 .cse21 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) (= .cse48 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse47)) .cse28 .cse46 .cse11 .cse49))))))) [2021-07-05 17:00:15,493 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:15,493 INFO L758 garLoopResultBuilder]: At program point L8192(lines 8175 8193) the Hoare annotation is: (let ((.cse20 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (let ((.cse10 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse15 (and (<= (+ |ULTIMATE.start_aws_byte_buf_reserve_#res| 1) 0) .cse6)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse16 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse17 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse18 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse5 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse24 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse23 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse22 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse21 (select .cse20 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4))) (let ((.cse7 (= |ULTIMATE.start_aws_byte_buf_reserve_#res| 0)) (.cse8 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse1)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse11 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse13 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse14 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity))) (or (let ((.cse3 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4))) (and (= (select .cse0 .cse1) (select .cse2 .cse3)) (= (select .cse4 .cse3) (select .cse5 .cse1)) .cse6)) (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse1) 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_#Ultimate.C_realloc_#res.offset| 0) (= |ULTIMATE.start_can_fail_realloc_#res.offset| 0) .cse6 .cse14) (and (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse1) 0)) .cse7 .cse8 (= |ULTIMATE.start_nondet_voidp_#res.base| 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse6 (= |ULTIMATE.start_can_fail_realloc_#res.base| 0) .cse14 (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0))))) (or .cse15 (and .cse16 .cse17 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse10 .cse12 .cse18 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse6 (let ((.cse19 (select .cse20 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse19 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse19 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) 4294967296)) 4294967295))))) (<= .cse21 .cse22) (= (select .cse2 .cse23) (select .cse0 .cse24)) (or (let ((.cse25 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and .cse16 .cse17 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse25)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse25) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse12 .cse18 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) .cse6 (<= |~#s_can_fail_allocator_static~0.offset| 0))) .cse15) .cse6 (let ((.cse28 (div .cse21 4294967296)) (.cse29 (select .cse20 12))) (let ((.cse26 (<= .cse21 (+ (* 4294967296 (div (+ (* .cse28 4294967296) 4294967295 (* .cse29 (- 1))) 4294967296)) .cse29))) (.cse27 (<= .cse29 (+ (* 4294967296 (div (+ (- 1) .cse29) 4294967296)) 4294967295)))) (or (and .cse16 .cse17 .cse12 (not (= (select .cse0 4) 0)) .cse18 .cse26 .cse6 .cse27) (and .cse16 .cse17 (<= .cse21 (* 4294967296 .cse28)) .cse12 .cse18 .cse26 .cse6 .cse27)))) (= (select .cse5 .cse24) (select .cse4 .cse23)) (<= .cse22 .cse21)))) [2021-07-05 17:00:15,493 INFO L765 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: true [2021-07-05 17:00:15,493 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable386 [2021-07-05 17:00:15,493 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 17:00:15,494 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION was SAFE (9/10) [2021-07-05 17:00:15,494 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 17:00:15,495 INFO L329 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 17:00:15,495 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 17:00:15,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 200 states have internal predecessors, (281), 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-07-05 17:00:15,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-07-05 17:00:15,497 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:00:15,497 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:00:15,497 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:00:15,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:00:15,498 INFO L82 PathProgramCache]: Analyzing trace with hash 799405987, now seen corresponding path program 1 times [2021-07-05 17:00:15,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:00:15,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144657125] [2021-07-05 17:00:15,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:00:15,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:00:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:00:15,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:15,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:15,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:15,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:00:15,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:00:15,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144657125] [2021-07-05 17:00:15,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144657125] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:00:15,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:00:15,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 17:00:15,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611243676] [2021-07-05 17:00:15,584 INFO L425 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-05 17:00:15,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:00:15,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-05 17:00:15,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-05 17:00:15,584 INFO L87 Difference]: Start difference. First operand has 201 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 200 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:00:15,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:00:15,585 INFO L93 Difference]: Finished difference Result 395 states and 553 transitions. [2021-07-05 17:00:15,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-05 17:00:15,585 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-07-05 17:00:15,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:00:15,586 INFO L225 Difference]: With dead ends: 395 [2021-07-05 17:00:15,586 INFO L226 Difference]: Without dead ends: 176 [2021-07-05 17:00:15,586 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-05 17:00:15,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-07-05 17:00:15,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2021-07-05 17:00:15,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.32) internal successors, (231), 175 states have internal predecessors, (231), 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-07-05 17:00:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 231 transitions. [2021-07-05 17:00:15,588 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 231 transitions. Word has length 38 [2021-07-05 17:00:15,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:00:15,588 INFO L442 AbstractCegarLoop]: Abstraction has 176 states and 231 transitions. [2021-07-05 17:00:15,588 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:00:15,588 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 231 transitions. [2021-07-05 17:00:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-07-05 17:00:15,588 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:00:15,588 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:00:15,588 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable411 [2021-07-05 17:00:15,588 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:00:15,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:00:15,589 INFO L82 PathProgramCache]: Analyzing trace with hash 727079011, now seen corresponding path program 1 times [2021-07-05 17:00:15,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:00:15,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430473162] [2021-07-05 17:00:15,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:00:15,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:00:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:00:15,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:15,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:15,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:15,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 17:00:15,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:15,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-07-05 17:00:15,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:15,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:15,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:00:15,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:00:15,702 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430473162] [2021-07-05 17:00:15,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430473162] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:00:15,702 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:00:15,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 17:00:15,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457357503] [2021-07-05 17:00:15,702 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:00:15,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:00:15,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:00:15,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:00:15,703 INFO L87 Difference]: Start difference. First operand 176 states and 231 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:00:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:00:15,780 INFO L93 Difference]: Finished difference Result 329 states and 431 transitions. [2021-07-05 17:00:15,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 17:00:15,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-07-05 17:00:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:00:15,781 INFO L225 Difference]: With dead ends: 329 [2021-07-05 17:00:15,781 INFO L226 Difference]: Without dead ends: 176 [2021-07-05 17:00:15,781 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:00:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-07-05 17:00:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2021-07-05 17:00:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.3085714285714285) internal successors, (229), 175 states have internal predecessors, (229), 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-07-05 17:00:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 229 transitions. [2021-07-05 17:00:15,783 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 229 transitions. Word has length 38 [2021-07-05 17:00:15,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:00:15,783 INFO L442 AbstractCegarLoop]: Abstraction has 176 states and 229 transitions. [2021-07-05 17:00:15,783 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 17:00:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 229 transitions. [2021-07-05 17:00:15,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-07-05 17:00:15,783 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:00:15,783 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:00:15,784 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable412 [2021-07-05 17:00:15,784 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:00:15,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:00:15,784 INFO L82 PathProgramCache]: Analyzing trace with hash 697845963, now seen corresponding path program 1 times [2021-07-05 17:00:15,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:00:15,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737386452] [2021-07-05 17:00:15,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:00:15,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:00:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:00:15,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:15,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:15,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:15,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 17:00:15,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:15,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 17:00:15,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:15,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:00:15,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:00:15,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737386452] [2021-07-05 17:00:15,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737386452] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:00:15,884 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:00:15,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 17:00:15,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844151276] [2021-07-05 17:00:15,884 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:00:15,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:00:15,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:00:15,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:00:15,885 INFO L87 Difference]: Start difference. First operand 176 states and 229 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-07-05 17:00:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:00:16,030 INFO L93 Difference]: Finished difference Result 470 states and 627 transitions. [2021-07-05 17:00:16,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 17:00:16,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-07-05 17:00:16,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:00:16,031 INFO L225 Difference]: With dead ends: 470 [2021-07-05 17:00:16,031 INFO L226 Difference]: Without dead ends: 308 [2021-07-05 17:00:16,032 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:00:16,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-07-05 17:00:16,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 188. [2021-07-05 17:00:16,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.2887700534759359) internal successors, (241), 187 states have internal predecessors, (241), 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-07-05 17:00:16,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 241 transitions. [2021-07-05 17:00:16,034 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 241 transitions. Word has length 50 [2021-07-05 17:00:16,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:00:16,034 INFO L442 AbstractCegarLoop]: Abstraction has 188 states and 241 transitions. [2021-07-05 17:00:16,034 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-07-05 17:00:16,034 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 241 transitions. [2021-07-05 17:00:16,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-07-05 17:00:16,034 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:00:16,034 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:00:16,034 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable413 [2021-07-05 17:00:16,034 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:00:16,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:00:16,035 INFO L82 PathProgramCache]: Analyzing trace with hash -331513335, now seen corresponding path program 1 times [2021-07-05 17:00:16,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:00:16,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959820790] [2021-07-05 17:00:16,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:00:16,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:00:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:00:16,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:16,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:16,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:16,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 17:00:16,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:16,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 2 [2021-07-05 17:00:16,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:16,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:00:16,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:00:16,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959820790] [2021-07-05 17:00:16,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959820790] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:00:16,135 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:00:16,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 17:00:16,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610549783] [2021-07-05 17:00:16,136 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:00:16,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:00:16,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:00:16,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:00:16,136 INFO L87 Difference]: Start difference. First operand 188 states and 241 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-07-05 17:00:16,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:00:16,295 INFO L93 Difference]: Finished difference Result 412 states and 535 transitions. [2021-07-05 17:00:16,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 17:00:16,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-07-05 17:00:16,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:00:16,295 INFO L225 Difference]: With dead ends: 412 [2021-07-05 17:00:16,296 INFO L226 Difference]: Without dead ends: 248 [2021-07-05 17:00:16,296 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 17:00:16,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-07-05 17:00:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 200. [2021-07-05 17:00:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.271356783919598) internal successors, (253), 199 states have internal predecessors, (253), 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-07-05 17:00:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 253 transitions. [2021-07-05 17:00:16,298 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 253 transitions. Word has length 50 [2021-07-05 17:00:16,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:00:16,298 INFO L442 AbstractCegarLoop]: Abstraction has 200 states and 253 transitions. [2021-07-05 17:00:16,298 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-07-05 17:00:16,298 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 253 transitions. [2021-07-05 17:00:16,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-07-05 17:00:16,298 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 17:00:16,298 INFO L525 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 17:00:16,298 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable414 [2021-07-05 17:00:16,298 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 17:00:16,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 17:00:16,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2069653261, now seen corresponding path program 1 times [2021-07-05 17:00:16,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 17:00:16,299 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499939859] [2021-07-05 17:00:16,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 17:00:16,299 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 17:00:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 17:00:16,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:16,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:16,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:16,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-05 17:00:16,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:16,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 17:00:16,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 17:00:16,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 17:00:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 17:00:16,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 17:00:16,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499939859] [2021-07-05 17:00:16,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499939859] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 17:00:16,437 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 17:00:16,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 17:00:16,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979259982] [2021-07-05 17:00:16,437 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 17:00:16,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 17:00:16,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 17:00:16,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:00:16,438 INFO L87 Difference]: Start difference. First operand 200 states and 253 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-07-05 17:00:18,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 17:00:18,683 INFO L93 Difference]: Finished difference Result 200 states and 253 transitions. [2021-07-05 17:00:18,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 17:00:18,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-07-05 17:00:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 17:00:18,684 INFO L225 Difference]: With dead ends: 200 [2021-07-05 17:00:18,684 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 17:00:18,685 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 17:00:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 17:00:18,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 17:00:18,685 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-07-05 17:00:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 17:00:18,685 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2021-07-05 17:00:18,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 17:00:18,685 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 17:00:18,685 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-07-05 17:00:18,686 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 17:00:18,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 17:00:18,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 17:00:18,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,694 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,694 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 17:00:18,778 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,778 INFO L762 garLoopResultBuilder]: For program point L9153(lines 9153 9155) no Hoare annotation was computed. [2021-07-05 17:00:18,778 INFO L762 garLoopResultBuilder]: For program point L9153-2(lines 9153 9155) no Hoare annotation was computed. [2021-07-05 17:00:18,778 INFO L762 garLoopResultBuilder]: For program point L6973(lines 6973 6978) no Hoare annotation was computed. [2021-07-05 17:00:18,778 INFO L758 garLoopResultBuilder]: At program point L268(line 268) the Hoare annotation is: false [2021-07-05 17:00:18,778 INFO L762 garLoopResultBuilder]: For program point L6974(lines 6974 6976) no Hoare annotation was computed. [2021-07-05 17:00:18,778 INFO L762 garLoopResultBuilder]: For program point L6974-2(lines 6974 6976) no Hoare annotation was computed. [2021-07-05 17:00:18,778 INFO L762 garLoopResultBuilder]: For program point L7141-2(line 7141) no Hoare annotation was computed. [2021-07-05 17:00:18,778 INFO L762 garLoopResultBuilder]: For program point L7141(line 7141) no Hoare annotation was computed. [2021-07-05 17:00:18,778 INFO L765 garLoopResultBuilder]: At program point L9157(line 9157) the Hoare annotation is: true [2021-07-05 17:00:18,778 INFO L762 garLoopResultBuilder]: For program point L6979(lines 6979 6981) no Hoare annotation was computed. [2021-07-05 17:00:18,779 INFO L758 garLoopResultBuilder]: At program point L6979-3(lines 6965 6982) the Hoare annotation is: (let ((.cse82 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse31 (select .cse82 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse25 (= |ULTIMATE.start_can_fail_realloc_#res.base| 0)) (.cse27 (+ |#StackHeapBarrier| 1)) (.cse28 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse42 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse51 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse33 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse49 (select .cse51 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse35 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse30 (select .cse82 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse32 (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse13 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse20 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse9 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse48 (not (= (select .cse42 4) 0))) (.cse23 (= |ULTIMATE.start_can_fail_realloc_#res.offset| 0)) (.cse16 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse26 (<= (+ (* 4294967296 .cse28) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse47 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse45 (<= .cse27 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse54 (<= .cse27 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse39 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4)) (.cse67 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse57 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse53 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse8 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse22 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse52 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse40 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse38 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse43 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse19 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse21 (not .cse25)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse3 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse66 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse12 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse14 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse24 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse29 (* .cse31 (- 1))) (.cse18 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse15 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and .cse0 (let ((.cse11 (select .cse32 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse1 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse2 (<= (* 4294967296 (div (+ (* (div (+ .cse29 4294967295 .cse30) 4294967296) 4294967296) .cse31) 4294967296)) .cse30)) (.cse10 (<= (* 4294967296 (div (+ .cse11 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse28 4294967296)) 4294967296)) .cse11)) (.cse17 (<= .cse27 ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse11 (* 4294967296 (div .cse11 4294967296))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse19 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18) (and .cse4 .cse22 .cse9 .cse23 .cse24 .cse15 .cse25 .cse26)))) .cse3 .cse33 .cse5 (let ((.cse41 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4))) (let ((.cse34 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse41)) (.cse36 (= (select .cse42 .cse41) (select .cse43 .cse39))) (.cse37 (= (select .cse38 .cse39) (select .cse40 .cse41)))) (or (and .cse34 .cse19 .cse6 .cse35 .cse8 .cse22 .cse9 (= |ULTIMATE.start_#Ultimate.C_realloc_#res.offset| 0) .cse23 .cse15 .cse21 .cse26) (and .cse34 (= |ULTIMATE.start_nondet_voidp_#res.base| 0) .cse36 .cse37 .cse6 .cse35 .cse8 .cse22 .cse9 .cse15 .cse25 .cse26) (and .cse34 .cse36 .cse37 .cse6 .cse35 .cse8 .cse22 .cse9 .cse23 .cse15 .cse25 .cse26)))) .cse35 .cse22 (let ((.cse44 (< (* 4294967296 (div ULTIMATE.start_can_fail_realloc_~newsize 4294967296)) ULTIMATE.start_can_fail_realloc_~newsize)) (.cse46 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse3 .cse4 .cse19 .cse33 .cse44 .cse20 .cse5 .cse45 .cse46 .cse35 .cse8 .cse22 .cse9 .cse12 .cse13 .cse14 .cse47 .cse15 .cse21 .cse16) (let ((.cse50 (select .cse51 12))) (and .cse0 .cse3 .cse4 .cse22 .cse9 .cse48 .cse23 .cse12 .cse24 (<= .cse49 (+ (* 4294967296 (div (+ (* (div .cse49 4294967296) 4294967296) 4294967295 (* .cse50 (- 1))) 4294967296)) .cse50)) .cse15 .cse25 (<= .cse50 (+ (* 4294967296 (div (+ (- 1) .cse50) 4294967296)) 4294967295)) .cse26)) (and .cse0 .cse3 .cse4 .cse19 .cse44 .cse20 .cse5 .cse45 (<= .cse30 (* 4294967296 (div .cse30 4294967296))) .cse46 .cse8 .cse9 .cse52 .cse12 .cse13 .cse14 .cse47 .cse15 .cse21 .cse16 .cse18))) (let ((.cse59 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse55 (<= (select .cse32 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse59)) (.cse56 (<= .cse59 .cse30)) (.cse58 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)))) (or (and .cse0 .cse4 .cse19 (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) .cse53) .cse5 .cse45 .cse54 .cse6 .cse8 .cse9 .cse55 .cse52 .cse56 .cse14 .cse57 .cse15 .cse21 .cse58 .cse18 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) .cse26) (and .cse4 (<= .cse49 .cse59) .cse22 .cse9 .cse23 .cse24 .cse15 .cse25 .cse26 (<= .cse59 .cse49)) (and .cse4 .cse19 .cse6 .cse35 .cse7 .cse8 .cse9 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse55 .cse56 .cse14 .cse53 .cse15 .cse21 .cse58 .cse18 .cse26)))) (let ((.cse68 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse60 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse68))) (.cse61 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse68) |~#s_can_fail_allocator_static~0.base|)) (.cse62 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse63 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|)) (.cse64 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|)) (.cse65 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse3 .cse4 .cse19 .cse20 .cse60 .cse45 .cse61 .cse62 .cse63 .cse6 .cse8 .cse64 .cse22 .cse9 .cse52 .cse12 .cse13 .cse15 .cse21 .cse16 .cse65 .cse26) (and .cse0 .cse3 .cse4 .cse20 .cse60 .cse61 .cse62 .cse63 .cse6 .cse8 .cse64 .cse22 .cse9 .cse48 .cse66 (not (= (select .cse67 ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0)) .cse23 .cse12 .cse24 .cse15 .cse25 .cse16 .cse65 .cse18 .cse26)))) .cse12 .cse14 .cse47 (let ((.cse71 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse74 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse69 (not (= .cse74 ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse72 (select .cse43 .cse74)) (.cse70 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse71))) (.cse73 (= (select .cse40 .cse71) (select .cse38 .cse74)))) (or (and .cse0 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) .cse69) .cse19 .cse5 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 12))) .cse45 .cse54 .cse6 .cse8 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset .cse39)) .cse22 .cse52 .cse70 (= (select .cse67 .cse71) .cse72) .cse57 .cse15 .cse21 .cse73) (and (or .cse69 .cse53) .cse6 .cse8 .cse22 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) (= .cse72 (select .cse42 .cse71)) .cse52 .cse70 .cse15 .cse73)))) (let ((.cse81 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse77 (select .cse81 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse75 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse76 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse79 (let ((.cse80 (select .cse81 12))) (<= .cse80 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse80) 4294967296)))))) (.cse78 (div .cse77 4294967296))) (or (and .cse0 .cse3 .cse19 .cse5 .cse6 .cse7 .cse12 .cse14 .cse24 .cse15 .cse21 .cse18) (and .cse75 .cse0 .cse3 .cse76 .cse5 .cse6 .cse7 .cse12 (<= .cse77 (* 4294967296 .cse78)) .cse14 .cse79 .cse24 .cse15 .cse18) (and .cse75 .cse0 .cse3 .cse76 .cse5 .cse6 .cse7 .cse66 .cse12 .cse14 .cse79 .cse24 .cse15 (<= .cse77 (+ (* 4294967296 (div (+ .cse29 (* .cse78 4294967296) 4294967295) 4294967296)) .cse31)) .cse18))))) .cse15)))) [2021-07-05 17:00:18,779 INFO L762 garLoopResultBuilder]: For program point L6979-2(lines 6979 6981) no Hoare annotation was computed. [2021-07-05 17:00:18,779 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,779 INFO L762 garLoopResultBuilder]: For program point L7145(lines 7145 7151) no Hoare annotation was computed. [2021-07-05 17:00:18,779 INFO L758 garLoopResultBuilder]: At program point L6947(lines 6943 6948) the Hoare annotation is: (let ((.cse13 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse10 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse13)) (.cse11 (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse13))) (let ((.cse2 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse3 (= .cse11 0)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse4 (= .cse10 0)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse7 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse8 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and .cse0 .cse1 .cse2 (let ((.cse5 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse9 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| .cse10) .cse2 (= .cse11 |~#s_can_fail_allocator_static~0.base|) .cse5 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse6 .cse7 .cse8 .cse9))) .cse6 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse7 .cse8 (let ((.cse12 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse12 .cse6 .cse7 .cse8) (and .cse0 .cse3 .cse1 .cse4 .cse12 .cse6 .cse7 .cse8))))))) [2021-07-05 17:00:18,779 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,779 INFO L762 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:18,780 INFO L762 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:18,780 INFO L762 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:18,780 INFO L762 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:18,780 INFO L762 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:18,780 INFO L762 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:18,780 INFO L762 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:18,780 INFO L762 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-07-05 17:00:18,780 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,780 INFO L762 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-07-05 17:00:18,780 INFO L762 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-07-05 17:00:18,780 INFO L762 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-07-05 17:00:18,780 INFO L762 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-07-05 17:00:18,780 INFO L762 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-07-05 17:00:18,780 INFO L762 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-07-05 17:00:18,780 INFO L762 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-07-05 17:00:18,780 INFO L762 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-07-05 17:00:18,781 INFO L758 garLoopResultBuilder]: At program point L6951-1(lines 6950 6952) the Hoare annotation is: (let ((.cse27 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse17 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse14 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse16 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse22 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse7 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse6 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse5 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse20 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse19 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse18 (select .cse27 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and .cse0 (let ((.cse2 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4))) (let ((.cse8 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse2)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse10 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse11 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse13 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse15 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity))) (or (let ((.cse4 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4))) (and (= (select .cse1 .cse2) (select .cse3 .cse4)) (= (select .cse5 .cse4) (select .cse6 .cse2)) .cse7)) (and (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse2) 0)) .cse8 (= |ULTIMATE.start_nondet_voidp_#res.base| 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse7 (= |ULTIMATE.start_can_fail_realloc_#res.base| 0) .cse15 (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0)) (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse2) 0)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_#Ultimate.C_realloc_#res.offset| 0) (= |ULTIMATE.start_can_fail_realloc_#res.offset| 0) .cse14 .cse7 .cse15)))) .cse16 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse17)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse17) |~#s_can_fail_allocator_static~0.base|) (<= .cse18 .cse19) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |ULTIMATE.start_aws_byte_buf_has_allocator_#t~mem500.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse12 (= (select .cse3 .cse20) (select .cse1 .cse21)) .cse22 .cse14 .cse7 (let ((.cse25 (div .cse18 4294967296)) (.cse26 (select .cse27 12))) (let ((.cse23 (<= .cse18 (+ (* 4294967296 (div (+ (* .cse25 4294967296) 4294967295 (* .cse26 (- 1))) 4294967296)) .cse26))) (.cse24 (<= .cse26 (+ (* 4294967296 (div (+ (- 1) .cse26) 4294967296)) 4294967295)))) (or (and .cse0 .cse16 .cse12 (not (= (select .cse1 4) 0)) .cse22 .cse23 .cse7 .cse24) (and .cse0 .cse16 (<= .cse18 (* 4294967296 .cse25)) .cse12 .cse22 .cse23 .cse7 .cse24)))) (= |ULTIMATE.start_can_fail_allocator_#res.base| |ULTIMATE.start_aws_byte_buf_has_allocator_#t~mem500.base|) (<= |~#s_can_fail_allocator_static~0.offset| 0) (= (select .cse6 .cse21) (select .cse5 .cse20)) (<= .cse19 .cse18)))) [2021-07-05 17:00:18,781 INFO L758 garLoopResultBuilder]: At program point L6951(lines 6950 6952) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2021-07-05 17:00:18,781 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,781 INFO L758 garLoopResultBuilder]: At program point L6655(lines 6653 6656) the Hoare annotation is: (let ((.cse27 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse17 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse3 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse14 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse16 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse22 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse7 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse6 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse5 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse20 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse19 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse18 (select .cse27 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and .cse0 (let ((.cse2 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4))) (let ((.cse8 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse2)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse10 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse11 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse13 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse15 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity))) (or (let ((.cse4 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4))) (and (= (select .cse1 .cse2) (select .cse3 .cse4)) (= (select .cse5 .cse4) (select .cse6 .cse2)) .cse7)) (and (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse2) 0)) .cse8 (= |ULTIMATE.start_nondet_voidp_#res.base| 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse7 (= |ULTIMATE.start_can_fail_realloc_#res.base| 0) .cse15 (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0)) (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse2) 0)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_#Ultimate.C_realloc_#res.offset| 0) (= |ULTIMATE.start_can_fail_realloc_#res.offset| 0) .cse14 .cse7 .cse15)))) (<= 1 |ULTIMATE.start_aws_byte_buf_has_allocator_#res|) .cse16 (<= |ULTIMATE.start_aws_byte_buf_has_allocator_#res| 1) (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse17)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse17) |~#s_can_fail_allocator_static~0.base|) (<= .cse18 .cse19) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse12 (= (select .cse3 .cse20) (select .cse1 .cse21)) .cse22 .cse14 .cse7 (let ((.cse25 (div .cse18 4294967296)) (.cse26 (select .cse27 12))) (let ((.cse23 (<= .cse18 (+ (* 4294967296 (div (+ (* .cse25 4294967296) 4294967295 (* .cse26 (- 1))) 4294967296)) .cse26))) (.cse24 (<= .cse26 (+ (* 4294967296 (div (+ (- 1) .cse26) 4294967296)) 4294967295)))) (or (and .cse0 .cse16 .cse12 (not (= (select .cse1 4) 0)) .cse22 .cse23 .cse7 .cse24) (and .cse0 .cse16 (<= .cse18 (* 4294967296 .cse25)) .cse12 .cse22 .cse23 .cse7 .cse24)))) (<= |~#s_can_fail_allocator_static~0.offset| 0) (= (select .cse6 .cse21) (select .cse5 .cse20)) (<= .cse19 .cse18)))) [2021-07-05 17:00:18,781 INFO L758 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (let ((.cse3 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4)) (.cse1 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse16 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse17 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse8 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse22 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse7 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse21 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse6 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse5 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (= (select .cse0 .cse1) (select .cse2 .cse3)) .cse4 (<= .cse5 .cse6) (= (select .cse7 .cse3) (select .cse8 .cse1)) (let ((.cse20 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse11 (select .cse20 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse19 (select .cse20 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (let ((.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse10 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse13 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse14 (<= .cse19 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse19) 4294967296))))) (.cse15 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse12 (div .cse11 4294967296)) (.cse18 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (or (and .cse9 .cse10 .cse4 (<= .cse11 (* 4294967296 .cse12)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse9 .cse10 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse4 .cse13 .cse14 .cse15 .cse16 .cse17 (<= .cse11 (+ (* 4294967296 (div (+ (* .cse12 4294967296) (* .cse19 (- 1)) 4294967295) 4294967296)) .cse19)) .cse18))))) (= (select .cse2 .cse21) (select .cse0 .cse22)) .cse16 .cse17 (= (select .cse8 .cse22) (select .cse7 .cse21)) (<= .cse6 .cse5))) [2021-07-05 17:00:18,781 INFO L758 garLoopResultBuilder]: At program point L1998-1(lines 1988 1999) the Hoare annotation is: (let ((.cse11 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse3 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4)) (.cse1 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse10 (select .cse11 12)) (.cse7 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse9 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse6 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse8 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse5 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse4 (select .cse11 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (= (select .cse0 .cse1) (select .cse2 .cse3)) (<= .cse4 .cse5) (= (select .cse6 .cse3) (select .cse7 .cse1)) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (not (= (select .cse0 4) 0)) (= (select .cse2 .cse8) (select .cse0 .cse9)) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (<= .cse4 (+ (* 4294967296 (div (+ (* (div .cse4 4294967296) 4294967296) 4294967295 (* .cse10 (- 1))) 4294967296)) .cse10)) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (<= .cse10 (+ (* 4294967296 (div (+ (- 1) .cse10) 4294967296)) 4294967295)) (= (select .cse7 .cse9) (select .cse6 .cse8)) (<= .cse5 .cse4)))) [2021-07-05 17:00:18,782 INFO L758 garLoopResultBuilder]: At program point L1998-2(lines 1988 1999) the Hoare annotation is: (let ((.cse31 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse7 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse6 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4)) (.cse2 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse8 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse13 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse25 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse4 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse17 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse20 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse22 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse23 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse30 (select .cse31 12)) (.cse24 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse12 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse29 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse11 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse3 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse10 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse9 (select .cse31 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0) .cse0 .cse1 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize) (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse2) (or (not (= .cse3 ULTIMATE.start_aws_mem_realloc_~ptr.offset)) (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= (select .cse4 .cse2) (select .cse5 .cse6)) (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4) (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse7)) .cse8 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse7) |~#s_can_fail_allocator_static~0.base|) (<= .cse9 .cse10) (= (select .cse11 .cse6) (select .cse12 .cse2)) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse13 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) (let ((.cse28 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse18 (select .cse28 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse14 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse15 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse16 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse21 (let ((.cse27 (select .cse28 12))) (<= .cse27 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse27) 4294967296)))))) (.cse19 (div .cse18 4294967296))) (or (and .cse14 .cse0 .cse1 .cse15 .cse8 .cse13 .cse16 .cse17 (<= .cse18 (* 4294967296 .cse19)) .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse14 .cse0 .cse1 .cse15 .cse8 .cse13 .cse16 .cse25 .cse17 .cse20 .cse21 .cse22 .cse23 (<= .cse18 (let ((.cse26 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse26 (- 1)) (* .cse19 4294967296) 4294967295) 4294967296)) .cse26))) .cse24))))) (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity) (not (= (select .cse4 4) 0)) .cse25 (= (select .cse5 .cse3) (select .cse4 .cse29)) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse29)) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0)) .cse17 .cse20 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse22 (<= .cse9 (+ (* 4294967296 (div (+ (* (div .cse9 4294967296) 4294967296) 4294967295 (* .cse30 (- 1))) 4294967296)) .cse30)) .cse23 (<= .cse30 (+ (* 4294967296 (div (+ (- 1) .cse30) 4294967296)) 4294967295)) (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse24 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity) (= (select .cse12 .cse29) (select .cse11 .cse3)) (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0) (<= .cse10 .cse9)))) [2021-07-05 17:00:18,782 INFO L762 garLoopResultBuilder]: For program point L8176-1(line 8176) no Hoare annotation was computed. [2021-07-05 17:00:18,782 INFO L758 garLoopResultBuilder]: At program point L8176-4(line 8176) the Hoare annotation is: (let ((.cse55 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse52 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse23 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse50 (select .cse52 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse53 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse45 (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse54 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 16)) (.cse44 (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse55))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse39 (= .cse44 0)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse40 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse55) 0)) (.cse41 (= (select .cse45 .cse54) 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse10 (not (= (select .cse53 4) 0))) (.cse11 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse15 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse29 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse16 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse17 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse19 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse43 (= (select .cse53 .cse54) 0)) (.cse35 (+ |#StackHeapBarrier| 1)) (.cse31 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse51 (div .cse50 4294967296)) (.cse49 (select .cse52 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse13 (select .cse23 12))) (let ((.cse22 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse13) 4294967296)))) (.cse27 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4)) (.cse25 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse26 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse24 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse18 (<= .cse50 (+ (* 4294967296 (div (+ (* .cse51 4294967296) (* .cse49 (- 1)) 4294967295) 4294967296)) .cse49))) (.cse20 (<= .cse50 (* 4294967296 .cse51))) (.cse12 (<= .cse49 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse49) 4294967296))))) (.cse7 (<= .cse31 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse31) 4294967296))))) (.cse1 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse3 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse30 (<= .cse35 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse28 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse46 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse36 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse48 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse21 (and .cse0 .cse39 .cse2 .cse40 .cse41 .cse4 .cse6 .cse10 .cse11 .cse15 .cse29 .cse16 .cse17 .cse19 .cse43)) (.cse34 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse38 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse33 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse37 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse32 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (and .cse0 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (let ((.cse5 (select .cse23 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse8 (<= .cse13 .cse22)) (.cse14 (div .cse5 4294967296))) (or (and .cse1 .cse0 .cse2 .cse3 .cse4 (<= .cse5 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse5) 4294967296)))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse5 (+ .cse13 (* 4294967296 (div (+ (* .cse14 4294967296) 4294967295 (* .cse13 (- 1))) 4294967296)))) .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse20 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 (<= .cse5 (* 4294967296 .cse14)) .cse16 .cse17 .cse19) .cse21))) (= (select .cse24 .cse25) (select .cse26 .cse27)) .cse4 (or .cse21 (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse6 .cse28 .cse11 (<= (select .cse23 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 12)) .cse22) .cse15 .cse29 .cse16 .cse17 .cse19)) .cse30 (<= .cse31 .cse32) (= (select .cse33 .cse27) (select .cse34 .cse25)) (<= .cse35 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse6 .cse36 .cse28 .cse9 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) (= (select .cse26 .cse37) (select .cse24 .cse38)) .cse29 (let ((.cse42 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse39 .cse2 .cse40 .cse41 .cse4 .cse6 .cse10 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |~#s_can_fail_allocator_static~0.offset| 1)) .cse11 .cse15 .cse29 .cse16 .cse17 .cse42 .cse19 .cse43) (and .cse0 .cse2 .cse4 .cse30 (= .cse44 |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse6 .cse36 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse11 .cse15 .cse29 (= (select .cse45 16) |~#s_can_fail_allocator_static~0.offset|) .cse17 .cse42 .cse19))) (let ((.cse47 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse1 .cse0 .cse2 .cse3 .cse46 .cse4 .cse30 .cse47 .cse36 .cse11 .cse12 .cse15 .cse29 .cse48 .cse17 .cse18 .cse19) (and .cse1 .cse0 .cse39 .cse2 .cse3 .cse40 .cse41 .cse4 .cse47 .cse6 .cse10 .cse11 .cse12 .cse15 .cse29 .cse16 .cse17 .cse18 .cse19 .cse43) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse30 .cse20 .cse47 .cse36 .cse11 .cse12 .cse15 .cse29 .cse48 .cse17 .cse19))) .cse17 (or (and .cse0 .cse2 .cse4 .cse30 .cse6 .cse28 .cse7 .cse10 .cse11 .cse15 .cse29 .cse16 .cse17 .cse19) (and .cse0 .cse39 .cse2 .cse40 .cse41 .cse4 .cse30 .cse6 .cse10 .cse11 .cse15 .cse29 .cse16 .cse17 .cse19 .cse43) (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse30 .cse6 .cse28 .cse10 .cse11 .cse15 .cse29 .cse16 .cse17 .cse19)) .cse19 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) (or (and .cse0 .cse2 .cse46 .cse4 .cse36 .cse11 .cse15 .cse29 .cse48 .cse17 .cse19) .cse21) (= (select .cse34 .cse38) (select .cse33 .cse37)) (<= .cse32 .cse31)))))) [2021-07-05 17:00:18,782 INFO L762 garLoopResultBuilder]: For program point L8176-3(line 8176) no Hoare annotation was computed. [2021-07-05 17:00:18,782 INFO L762 garLoopResultBuilder]: For program point L8177-3(lines 8175 8193) no Hoare annotation was computed. [2021-07-05 17:00:18,782 INFO L762 garLoopResultBuilder]: For program point L8177-2(line 8177) no Hoare annotation was computed. [2021-07-05 17:00:18,782 INFO L762 garLoopResultBuilder]: For program point L8177(line 8177) no Hoare annotation was computed. [2021-07-05 17:00:18,782 INFO L762 garLoopResultBuilder]: For program point L8177-4(line 8177) no Hoare annotation was computed. [2021-07-05 17:00:18,782 INFO L762 garLoopResultBuilder]: For program point L6658(lines 6658 6663) no Hoare annotation was computed. [2021-07-05 17:00:18,782 INFO L762 garLoopResultBuilder]: For program point L7385-2(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 17:00:18,782 INFO L762 garLoopResultBuilder]: For program point L7385-1(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 17:00:18,782 INFO L762 garLoopResultBuilder]: For program point L7385(lines 7385 7387) no Hoare annotation was computed. [2021-07-05 17:00:18,783 INFO L762 garLoopResultBuilder]: For program point L7154(lines 7154 7156) no Hoare annotation was computed. [2021-07-05 17:00:18,783 INFO L762 garLoopResultBuilder]: For program point L6659(lines 6659 6661) no Hoare annotation was computed. [2021-07-05 17:00:18,783 INFO L762 garLoopResultBuilder]: For program point L6659-2(lines 6659 6661) no Hoare annotation was computed. [2021-07-05 17:00:18,783 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 17:00:18,783 INFO L762 garLoopResultBuilder]: For program point L7122(lines 7122 7135) no Hoare annotation was computed. [2021-07-05 17:00:18,783 INFO L762 garLoopResultBuilder]: For program point L8179(lines 8179 8182) no Hoare annotation was computed. [2021-07-05 17:00:18,783 INFO L762 garLoopResultBuilder]: For program point L9137(lines 9137 9156) no Hoare annotation was computed. [2021-07-05 17:00:18,783 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,783 INFO L758 garLoopResultBuilder]: At program point L7158(lines 7137 7159) the Hoare annotation is: (let ((.cse17 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse23 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse24 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse55 (= |ULTIMATE.start_aws_mem_realloc_#res| 0)) (.cse44 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse89 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse54 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse43 (+ |#StackHeapBarrier| 1)) (.cse70 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse81 (= |ULTIMATE.start_can_fail_realloc_#res.base| 0)) (.cse34 (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0)) (.cse82 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse36 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse10 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse11 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse19 (not (= (select .cse82 4) 0))) (.cse20 (not .cse34)) (.cse22 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse25 (not .cse81)) (.cse26 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse30 (not (= (select .cse70 4) 0))) (.cse50 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse32 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse65 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse2 (<= .cse43 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse57 (<= .cse43 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse62 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse52 (select .cse54 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse51 (select .cse89 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse45 (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse29 (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0)) (.cse5 (<= (+ |ULTIMATE.start_aws_raise_error_#res| 1) 0)) (.cse46 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse15 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse18 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse6 (<= (+ |ULTIMATE.start_aws_mem_realloc_#res| 1) 0)) (.cse28 (<= (+ (* 4294967296 .cse44) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse71 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse68 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse58 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4)) (.cse67 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse7 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse8 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse37 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse14 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse39 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse31 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse21 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse49 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse33 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse77 (and .cse17 .cse23 .cse24 .cse55))) (and (let ((.cse35 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse1 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse35))) (.cse3 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse35) |~#s_can_fail_allocator_static~0.base|))) (let ((.cse0 (let ((.cse12 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse13 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|)) (.cse16 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|)) (.cse27 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse29 .cse7 .cse8 .cse9 .cse11 .cse1 .cse3 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse30 .cse31 (not (= (select .cse32 ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0)) .cse21 .cse23 .cse24 .cse26 .cse27 .cse33 .cse28 .cse34))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6))))) .cse7 .cse8 .cse36 .cse37 (let ((.cse41 (select .cse45 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse38 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse40 (<= (* 4294967296 (div (+ .cse41 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse44 4294967296)) 4294967296)) .cse41)) (.cse42 (<= .cse43 ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and .cse5 .cse9 .cse17 .cse18 .cse6 .cse23 .cse24 .cse28) (and .cse38 .cse7 .cse8 .cse9 .cse37 .cse14 .cse39 .cse15 .cse17 .cse18 .cse40 (<= .cse41 (* 4294967296 (div .cse41 4294967296))) .cse21 .cse22 .cse23 .cse24 .cse26 .cse42 .cse33) (and .cse38 .cse7 .cse8 .cse9 .cse10 .cse11 .cse37 .cse14 .cse39 .cse15 .cse17 .cse18 .cse19 .cse40 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse42 .cse33)))) .cse46 .cse17 .cse21 (let ((.cse47 (= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse48 (or (let ((.cse53 (select .cse54 12))) (and .cse7 .cse8 .cse17 .cse30 .cse21 .cse23 (<= .cse52 (+ (* 4294967296 (div (+ (* (div .cse52 4294967296) 4294967296) 4294967295 (* .cse53 (- 1))) 4294967296)) .cse53)) .cse24 (<= .cse53 (+ (* 4294967296 (div (+ (- 1) .cse53) 4294967296)) 4294967295)))) (and .cse7 .cse8 .cse17 .cse21 .cse23 .cse24 .cse55)))) (or (and .cse9 .cse10 .cse36 .cse11 .cse37 .cse2 .cse47 .cse46 .cse15 .cse18 .cse19 .cse20 .cse22 .cse48 .cse49 .cse50 .cse25 .cse26 .cse28) (and .cse5 .cse9 .cse18 .cse6 .cse48 .cse28) (and .cse9 .cse10 .cse11 .cse37 .cse2 (<= .cse51 (* 4294967296 (div .cse51 4294967296))) .cse47 .cse15 .cse18 .cse19 .cse4 .cse20 .cse22 .cse48 .cse50 .cse25 .cse26 .cse33 .cse28))) .cse49 .cse50 .cse24 (let ((.cse69 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse61 (select .cse71 .cse69)) (.cse60 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (let ((.cse66 (= .cse61 (select .cse70 .cse60)))) (let ((.cse56 (not (= .cse69 ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse59 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse60))) (.cse63 (or (and .cse66 .cse23 .cse24) (and .cse23 .cse24 .cse55))) (.cse64 (= (select .cse67 .cse60) (select .cse68 .cse69)))) (or (and .cse7 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) .cse56) .cse37 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 12))) .cse2 .cse57 .cse14 .cse15 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset .cse58)) .cse17 .cse4 .cse59 (= (select .cse32 .cse60) .cse61) .cse62 .cse63 .cse64) (and (or .cse56 .cse65) .cse14 .cse15 .cse17 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) .cse66 .cse4 .cse59 .cse63 .cse64)))))) (let ((.cse76 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse72 (<= (select .cse45 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse76)) (.cse73 (<= .cse76 .cse51)) (.cse74 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (.cse75 (or (and (<= .cse52 .cse76) .cse17 .cse23 .cse24 (<= .cse76 .cse52)) .cse77))) (or (and .cse9 .cse14 .cse46 .cse39 .cse15 .cse18 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse72 .cse73 .cse65 .cse74 .cse33 .cse28 .cse75) (and .cse5 .cse9 .cse18 .cse6 .cse28 .cse75) (and .cse7 .cse9 (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) .cse65) .cse37 .cse2 .cse57 .cse14 .cse15 .cse18 .cse72 .cse4 .cse73 .cse62 .cse74 .cse33 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) .cse28 .cse75)))) (let ((.cse78 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4))) (let ((.cse79 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse78)) (.cse80 (or (and .cse17 .cse24 .cse55) (and (= (select .cse70 .cse78) (select .cse71 .cse58)) (= (select .cse68 .cse58) (select .cse67 .cse78)) .cse17 .cse24)))) (or (and (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse78) 0)) .cse79 (= |ULTIMATE.start_nondet_voidp_#res.base| 0) .cse14 .cse46 .cse15 .cse18 .cse80 .cse81 .cse28 .cse34) (and .cse29 (not (= (select .cse82 .cse78) 0)) .cse79 .cse14 .cse46 .cse15 .cse18 (= |ULTIMATE.start_#Ultimate.C_realloc_#res.offset| 0) (= |ULTIMATE.start_can_fail_realloc_#res.offset| 0) .cse80 .cse28) (and .cse5 .cse79 .cse14 .cse46 .cse15 .cse18 .cse6 .cse80 .cse28)))) (let ((.cse91 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse85 (select .cse91 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse83 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse84 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse87 (let ((.cse90 (select .cse91 12))) (<= .cse90 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse90) 4294967296)))))) (.cse86 (div .cse85 4294967296))) (or (and .cse83 .cse7 .cse8 .cse84 .cse37 .cse14 .cse39 .cse21 (<= .cse85 (* 4294967296 .cse86)) .cse49 .cse87 .cse23 .cse24 .cse33) (and .cse83 .cse7 .cse8 .cse84 .cse37 .cse14 .cse39 .cse31 .cse21 .cse49 .cse87 .cse23 .cse24 (<= .cse85 (let ((.cse88 (select .cse89 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* 4294967296 (div (+ (* .cse88 (- 1)) (* .cse86 4294967296) 4294967295) 4294967296)) .cse88))) .cse33) .cse77))))))) [2021-07-05 17:00:18,785 INFO L762 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:18,785 INFO L762 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:18,785 INFO L762 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:18,785 INFO L762 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:18,786 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,786 INFO L762 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:18,786 INFO L762 garLoopResultBuilder]: For program point L222-5(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:18,786 INFO L762 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:18,786 INFO L762 garLoopResultBuilder]: For program point L222-7(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:18,786 INFO L762 garLoopResultBuilder]: For program point L222-8(lines 7162 7172) no Hoare annotation was computed. [2021-07-05 17:00:18,786 INFO L762 garLoopResultBuilder]: For program point L222-9(lines 222 224) no Hoare annotation was computed. [2021-07-05 17:00:18,786 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 17:00:18,787 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,787 INFO L762 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,787 INFO L762 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,787 INFO L762 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,787 INFO L762 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,787 INFO L762 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,787 INFO L762 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,787 INFO L762 garLoopResultBuilder]: For program point L8184(lines 8184 8187) no Hoare annotation was computed. [2021-07-05 17:00:18,787 INFO L762 garLoopResultBuilder]: For program point L7160(lines 7160 7173) no Hoare annotation was computed. [2021-07-05 17:00:18,788 INFO L762 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,788 INFO L762 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,788 INFO L762 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,788 INFO L762 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,788 INFO L762 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,788 INFO L762 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,788 INFO L762 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,788 INFO L762 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,789 INFO L762 garLoopResultBuilder]: For program point L223-21(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,789 INFO L762 garLoopResultBuilder]: For program point L223-22(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,789 INFO L762 garLoopResultBuilder]: For program point L223-24(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,789 INFO L762 garLoopResultBuilder]: For program point L223-25(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,789 INFO L762 garLoopResultBuilder]: For program point L7491-1(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:18,789 INFO L762 garLoopResultBuilder]: For program point L7491(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,789 INFO L762 garLoopResultBuilder]: For program point L223-27(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,789 INFO L762 garLoopResultBuilder]: For program point L223-28(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,790 INFO L762 garLoopResultBuilder]: For program point L7491-4(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:18,790 INFO L762 garLoopResultBuilder]: For program point L7491-3(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:18,790 INFO L762 garLoopResultBuilder]: For program point L7491-9(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,790 INFO L762 garLoopResultBuilder]: For program point L7491-7(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,790 INFO L762 garLoopResultBuilder]: For program point L7491-6(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:18,790 INFO L762 garLoopResultBuilder]: For program point L7491-13(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,790 INFO L758 garLoopResultBuilder]: At program point L7491-12(lines 7489 7495) the Hoare annotation is: (let ((.cse29 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (let ((.cse28 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse13 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse29)) (.cse15 (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse29))) (let ((.cse3 (= .cse15 0)) (.cse4 (= .cse13 0)) (.cse16 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse7 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse18 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0)) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse10 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse12 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse26 (select .cse28 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (let ((.cse17 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse14 (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse23 (let ((.cse27 (select .cse28 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= .cse27 (+ (* 4294967296 (div (+ (* (div .cse27 4294967296) 4294967296) (* .cse26 (- 1)) 4294967295) 4294967296)) .cse26)))) (.cse2 (and .cse16 .cse0 .cse1 .cse5 .cse7 .cse18 .cse8 .cse9 .cse10 .cse12)) (.cse19 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse20 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse22 (<= .cse26 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse26) 4294967296))))) (.cse25 (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12))) (and .cse0 .cse1 (let ((.cse6 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse11 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or .cse2 (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| .cse13) .cse5 .cse14 (= .cse15 |~#s_can_fail_allocator_static~0.base|) .cse6 (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) .cse5 .cse14 (let ((.cse21 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse16 .cse0 .cse1 .cse17 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 4) 0)) .cse7 .cse18 .cse8 .cse10 .cse12) (and .cse19 .cse0 .cse3 .cse1 .cse20 .cse4 .cse5 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse23 .cse12) (and .cse19 .cse0 .cse1 .cse20 .cse5 .cse14 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse23 .cse12))) .cse17 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse7 .cse8 .cse9 .cse10 (or (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse14 .cse7 .cse8 .cse9 .cse10 .cse12) .cse2 (and .cse0 .cse1 .cse5 .cse14 (let ((.cse24 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (<= .cse24 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse24) 4294967296))))) .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse19 .cse0 .cse1 .cse20 .cse5 .cse14 .cse7 .cse8 .cse9 .cse10 .cse12)) (or .cse2 (and .cse19 .cse0 .cse1 .cse20 .cse5 .cse7 .cse22 .cse8 .cse9 .cse10 .cse23 .cse12) .cse25) (or .cse2 (and .cse19 .cse0 .cse1 .cse20 .cse5 .cse7 .cse22 .cse8 .cse9 .cse10 .cse12) .cse25) .cse12))))) [2021-07-05 17:00:18,791 INFO L762 garLoopResultBuilder]: For program point L7491-11(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,791 INFO L762 garLoopResultBuilder]: For program point L7491-17(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:18,791 INFO L762 garLoopResultBuilder]: For program point L7491-16(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:18,791 INFO L762 garLoopResultBuilder]: For program point L7491-14(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:18,791 INFO L762 garLoopResultBuilder]: For program point L7491-20(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,791 INFO L762 garLoopResultBuilder]: For program point L7491-19(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:18,792 INFO L758 garLoopResultBuilder]: At program point L7491-25(lines 7489 7495) the Hoare annotation is: (let ((.cse48 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse28 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse34 (select .cse48 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse50 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse51 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse26 (select .cse51 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse17 (select .cse51 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse36 (select .cse50 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse49 (select .cse50 12)) (.cse44 (div .cse34 4294967296)) (.cse0 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse1 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse3 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse5 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0))) (.cse6 (not (= (select .cse28 4) 0))) (.cse7 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse8 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0)) (.cse9 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse10 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse12 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse14 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse40 (+ |#StackHeapBarrier| 1))) (let ((.cse31 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4)) (.cse29 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4)) (.cse27 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse23 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse15 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse22 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse16 (<= .cse40 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse20 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse30 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse21 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse32 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse33 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse24 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14)) (.cse35 (* .cse44 4294967296)) (.cse11 (<= .cse36 (+ (* 4294967296 (div (+ (* (div .cse36 4294967296) 4294967296) 4294967295 (* .cse49 (- 1))) 4294967296)) .cse49))) (.cse13 (<= .cse49 (+ (* 4294967296 (div (+ (- 1) .cse49) 4294967296)) 4294967295))) (.cse18 (div .cse17 4294967296)) (.cse25 (* .cse26 (- 1))) (.cse39 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse42 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse38 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse41 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse37 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (and (let ((.cse19 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse16 (<= .cse17 (* 4294967296 .cse18)) .cse19 .cse20 .cse6 .cse7 .cse9 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse23 .cse15 .cse16 .cse19 .cse20 .cse6 .cse7 .cse9 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14))) (or .cse24 (and .cse1 (<= (* 4294967296 (div (+ (* (div (+ .cse25 4294967295 .cse17) 4294967296) 4294967296) .cse26) 4294967296)) .cse17) .cse2 .cse15 .cse16 .cse3 .cse27 .cse4 .cse6 .cse9 .cse10 .cse12 .cse14)) .cse1 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (= (select .cse28 .cse29) (select .cse30 .cse31)) (or (and .cse32 .cse1 .cse2 .cse33 .cse15 .cse3 .cse27 .cse4 .cse6 .cse9 .cse10 .cse12 .cse13 (<= .cse34 (+ (* 4294967296 (div (+ .cse25 .cse35 4294967295) 4294967296)) .cse26)) .cse14) .cse24) .cse15 .cse16 (<= .cse36 .cse37) (= (select .cse38 .cse31) (select .cse39 .cse29)) (<= .cse40 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse3 .cse20 .cse27 (or (and .cse1 .cse2 .cse23 .cse15 .cse20 .cse7 .cse9 .cse21 .cse22 .cse12 .cse14) .cse24) .cse4 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) (or (and .cse1 .cse2 .cse16 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse3 .cse20 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse4 .cse6 .cse7 .cse9 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 16) |~#s_can_fail_allocator_static~0.offset|) .cse12 (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse14) .cse24) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) (= (select .cse30 .cse41) (select .cse28 .cse42)) .cse21 .cse12 .cse14 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) (let ((.cse43 (let ((.cse47 (select .cse48 12))) (let ((.cse45 (<= .cse47 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse47) 4294967296))))) (.cse46 (<= .cse26 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse26) 4294967296)))))) (or (and .cse1 .cse2 (<= (* 4294967296 (div (+ .cse36 4294967295) 4294967296)) .cse36) (<= (* 4294967296 (div (+ 4294967295 .cse17) 4294967296)) .cse17) (<= (* 4294967296 (div (+ .cse34 4294967295) 4294967296)) .cse34) .cse3 .cse45 .cse4 .cse5 .cse6 .cse7 .cse46 .cse9 .cse10 .cse12 .cse13 .cse14) (and (<= .cse17 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse17) 4294967296)))) .cse1 .cse2 (<= .cse34 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse34) 4294967296)))) .cse3 (<= .cse36 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse36) 4294967296)))) .cse45 .cse4 .cse5 .cse6 .cse7 .cse46 (<= .cse34 (+ .cse47 (* 4294967296 (div (+ .cse35 4294967295 (* .cse47 (- 1))) 4294967296)))) .cse9 .cse10 .cse11 .cse12 .cse13 (<= .cse17 (+ (* 4294967296 (div (+ (* .cse18 4294967296) .cse25 4294967295) 4294967296)) .cse26)) .cse14)))))) (or (and .cse43 (<= .cse34 (* 4294967296 .cse44))) (and .cse32 .cse33 .cse43) .cse24)) (= (select .cse39 .cse42) (select .cse38 .cse41)) (<= .cse37 .cse36)))))) [2021-07-05 17:00:18,792 INFO L762 garLoopResultBuilder]: For program point L7491-24(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,792 INFO L762 garLoopResultBuilder]: For program point L7491-22(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,792 INFO L762 garLoopResultBuilder]: For program point L7491-29(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:18,792 INFO L762 garLoopResultBuilder]: For program point L7491-27(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:18,792 INFO L762 garLoopResultBuilder]: For program point L7491-26(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,793 INFO L762 garLoopResultBuilder]: For program point L7491-33(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,793 INFO L762 garLoopResultBuilder]: For program point L7491-32(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:18,793 INFO L762 garLoopResultBuilder]: For program point L7491-30(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:18,793 INFO L762 garLoopResultBuilder]: For program point L7491-37(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,793 INFO L762 garLoopResultBuilder]: For program point L7491-35(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,793 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,793 INFO L762 garLoopResultBuilder]: For program point L7491-40(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:18,793 INFO L762 garLoopResultBuilder]: For program point L7491-39(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,794 INFO L758 garLoopResultBuilder]: At program point L7491-38(lines 7489 7495) the Hoare annotation is: (let ((.cse11 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse9 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse16 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) 4) 0))) (.cse17 (not (= (select .cse11 4) 0))) (.cse4 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse5 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse18 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0))) (let ((.cse10 (and (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 .cse2 .cse3 .cse16 .cse17 .cse4 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse5 .cse18 .cse6 .cse7)) (.cse14 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4)) (.cse12 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4)) (.cse13 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse25 (select .cse9 12)) (.cse22 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse24 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse21 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse23 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse20 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse19 (select .cse9 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 (or (and .cse0 .cse1 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse8 (select .cse9 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse8 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse8 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) 4294967296)) 4294967295)))) .cse10) .cse1 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= (select .cse11 .cse12) (select .cse13 .cse14)) (or .cse10 (let ((.cse15 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and .cse0 .cse1 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse15)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse15) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse2 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse3 .cse16 .cse17 .cse4 .cse5 .cse18 .cse6 (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse7))) (<= .cse19 .cse20) (= (select .cse21 .cse14) (select .cse22 .cse12)) .cse3 .cse17 (= (select .cse13 .cse23) (select .cse11 .cse24)) .cse5 .cse18 (<= .cse19 (+ (* 4294967296 (div (+ (* (div .cse19 4294967296) 4294967296) 4294967295 (* .cse25 (- 1))) 4294967296)) .cse25)) .cse6 (<= .cse25 (+ (* 4294967296 (div (+ (- 1) .cse25) 4294967296)) 4294967295)) (= (select .cse22 .cse24) (select .cse21 .cse23)) (<= .cse20 .cse19))))) [2021-07-05 17:00:18,794 INFO L762 garLoopResultBuilder]: For program point L7491-45(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:18,794 INFO L762 garLoopResultBuilder]: For program point L7491-43(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:18,794 INFO L762 garLoopResultBuilder]: For program point L7491-42(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:18,794 INFO L762 garLoopResultBuilder]: For program point L7491-48(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,794 INFO L762 garLoopResultBuilder]: For program point L7491-46(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,795 INFO L762 garLoopResultBuilder]: For program point L7491-53(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:18,795 INFO L762 garLoopResultBuilder]: For program point L7491-52(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,795 INFO L758 garLoopResultBuilder]: At program point L7491-51(lines 7489 7495) the Hoare annotation is: (let ((.cse19 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (let ((.cse3 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4)) (.cse1 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse7 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse10 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse6 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse9 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse5 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse4 (select .cse19 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= (select .cse0 .cse1) (select .cse2 .cse3)) (<= .cse4 .cse5) (= (select .cse6 .cse3) (select .cse7 .cse1)) .cse8 (= (select .cse2 .cse9) (select .cse0 .cse10)) (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) .cse11 (let ((.cse17 (div .cse4 4294967296)) (.cse18 (select .cse19 12))) (let ((.cse12 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse13 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse14 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse15 (<= .cse4 (+ (* 4294967296 (div (+ (* .cse17 4294967296) 4294967295 (* .cse18 (- 1))) 4294967296)) .cse18))) (.cse16 (<= .cse18 (+ (* 4294967296 (div (+ (- 1) .cse18) 4294967296)) 4294967295)))) (or (and .cse12 .cse13 .cse8 (not (= (select .cse0 4) 0)) .cse14 .cse15 .cse11 .cse16) (and .cse12 .cse13 (<= .cse4 (* 4294967296 .cse17)) .cse8 .cse14 .cse15 .cse11 .cse16)))) (= (select .cse7 .cse10) (select .cse6 .cse9)) (<= .cse5 .cse4)))) [2021-07-05 17:00:18,795 INFO L762 garLoopResultBuilder]: For program point L7491-50(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,795 INFO L762 garLoopResultBuilder]: For program point L7491-56(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:18,795 INFO L762 garLoopResultBuilder]: For program point L7491-55(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:18,795 INFO L762 garLoopResultBuilder]: For program point L7491-61(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,796 INFO L762 garLoopResultBuilder]: For program point L7491-59(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,796 INFO L762 garLoopResultBuilder]: For program point L7491-58(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:18,796 INFO L762 garLoopResultBuilder]: For program point L7491-65(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,796 INFO L758 garLoopResultBuilder]: At program point L7491-64(lines 7489 7495) the Hoare annotation is: (let ((.cse33 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse10 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse35 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0)) (.cse15 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse19 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse20 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse39 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse62 (+ |#StackHeapBarrier| 1))) (let ((.cse25 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse26 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse16 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse22 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse4 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse42 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse34 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse36 (= |ULTIMATE.start_can_fail_realloc_#res.base| 0)) (.cse37 (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse52 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse6 (<= .cse62 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse46 (<= .cse62 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse28 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse11 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse13 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse50 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse23 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse24 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse7 (select .cse39 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse44 (and .cse33 .cse0 .cse1 .cse10 .cse35 .cse15 .cse19 .cse20)) (.cse27 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse29 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse58 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse17 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse30 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) (.cse32 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|))) (and (let ((.cse18 (let ((.cse38 (select .cse39 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (<= (+ (* 4294967296 (div .cse38 4294967296)) 1) .cse38))) (.cse3 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse8 (= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse12 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse14 (not .cse37)) (.cse21 (not .cse36))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= .cse7 (* 4294967296 (div .cse7 4294967296))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (let ((.cse31 (select .cse32 12))) (and .cse25 .cse0 .cse1 .cse2 .cse26 .cse3 .cse27 .cse4 .cse5 .cse6 .cse8 .cse28 .cse29 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= (* 4294967296 (div (+ 4294967295 .cse30 .cse7 (* .cse31 (- 1))) 4294967296)) .cse7) (<= .cse31 ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) .cse24)) (and .cse33 .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse28 .cse9 .cse10 .cse11 (not (= (select .cse34 4) 0)) .cse12 .cse35 .cse14 .cse15 .cse16 .cse19 .cse20 .cse21 .cse22 .cse24))) .cse25 .cse26 (or (let ((.cse43 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and (let ((.cse40 (<= 0 |~#s_can_fail_allocator_static~0.offset|)) (.cse41 (<= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse40 .cse10 .cse11 .cse15 .cse16 .cse19 .cse20 .cse22 .cse41 .cse24) (and .cse0 .cse1 .cse2 .cse40 .cse10 .cse11 (not (= (select .cse42 4) 0)) .cse15 .cse19 .cse20 .cse22 .cse41 .cse24))) .cse4 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse43)) .cse6 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse43) |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse28 .cse9 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse13)) .cse44) .cse10 (let ((.cse48 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse53 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse45 (not (= .cse53 ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse49 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse53)) (.cse47 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse48))) (.cse51 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse48) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse53)))) (or (and .cse0 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) .cse45) .cse5 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 12))) .cse6 .cse46 .cse28 .cse9 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4))) .cse10 .cse13 .cse47 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) .cse48) .cse49) .cse50 .cse20 .cse51) (and (or .cse45 .cse52) .cse28 .cse9 .cse10 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) (= .cse49 (select .cse42 .cse48)) .cse13 .cse47 .cse20 .cse51)))) (let ((.cse54 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4))) (let ((.cse55 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse54))) (or (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) (not (= (select .cse34 .cse54) 0)) .cse55 .cse28 .cse29 .cse9 .cse10 .cse11 (= |ULTIMATE.start_#Ultimate.C_realloc_#res.offset| 0) (= |ULTIMATE.start_can_fail_realloc_#res.offset| 0) .cse20 .cse24) (and (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse54) 0)) .cse55 (= |ULTIMATE.start_nondet_voidp_#res.base| 0) .cse28 .cse29 .cse9 .cse10 .cse11 .cse20 .cse36 .cse24 .cse37)))) .cse19 .cse20 (let ((.cse60 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse56 (<= (select (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse60)) (.cse57 (<= .cse60 .cse7)) (.cse59 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)))) (or (and .cse2 .cse28 .cse29 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse9 .cse11 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse56 .cse57 .cse58 .cse19 .cse52 .cse20 .cse59 .cse23 .cse24) (and .cse0 .cse2 (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) .cse52) .cse5 .cse6 .cse46 .cse28 .cse9 .cse11 .cse56 .cse13 .cse57 .cse58 .cse19 .cse50 .cse20 .cse59 .cse23 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) .cse24)))) (or .cse44 (and .cse0 .cse1 .cse27 .cse5 .cse29 .cse10 .cse15 .cse58 .cse17 .cse19 .cse20 (let ((.cse61 (select .cse32 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse61 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse61 .cse30) 4294967296)) 4294967295)))))))) [2021-07-05 17:00:18,796 INFO L762 garLoopResultBuilder]: For program point L7491-63(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,797 INFO L762 garLoopResultBuilder]: For program point L7491-69(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:18,797 INFO L762 garLoopResultBuilder]: For program point L7491-68(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:18,797 INFO L762 garLoopResultBuilder]: For program point L7491-66(line 7491) no Hoare annotation was computed. [2021-07-05 17:00:18,797 INFO L762 garLoopResultBuilder]: For program point L7130(lines 7130 7134) no Hoare annotation was computed. [2021-07-05 17:00:18,797 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 17:00:18,797 INFO L762 garLoopResultBuilder]: For program point L7491-72(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,797 INFO L762 garLoopResultBuilder]: For program point L7491-71(lines 7491 7492) no Hoare annotation was computed. [2021-07-05 17:00:18,798 INFO L758 garLoopResultBuilder]: At program point L7491-77(lines 7489 7495) the Hoare annotation is: (let ((.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse5 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse18 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse17 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse16 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse15 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4))) (let ((.cse7 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse1)) (.cse8 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse10 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse12 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse13 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse14 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity))) (or (let ((.cse3 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4))) (and (= (select .cse0 .cse1) (select .cse2 .cse3)) (= (select .cse4 .cse3) (select .cse5 .cse1)) .cse6)) (and (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse1) 0)) .cse7 (= |ULTIMATE.start_nondet_voidp_#res.base| 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse6 (= |ULTIMATE.start_can_fail_realloc_#res.base| 0) .cse14 (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0)) (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse1) 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_#Ultimate.C_realloc_#res.offset| 0) (= |ULTIMATE.start_can_fail_realloc_#res.offset| 0) .cse13 .cse6 .cse14)))) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (<= .cse15 .cse16) (= (select .cse2 .cse17) (select .cse0 .cse18)) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) .cse6 (= (select .cse5 .cse18) (select .cse4 .cse17)) (<= .cse16 .cse15))) [2021-07-05 17:00:18,798 INFO L762 garLoopResultBuilder]: For program point L7491-76(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,798 INFO L762 garLoopResultBuilder]: For program point L7491-74(lines 7491 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,798 INFO L762 garLoopResultBuilder]: For program point L9145(lines 9145 9148) no Hoare annotation was computed. [2021-07-05 17:00:18,798 INFO L762 garLoopResultBuilder]: For program point L9145-2(lines 9145 9148) no Hoare annotation was computed. [2021-07-05 17:00:18,798 INFO L762 garLoopResultBuilder]: For program point L7494(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,798 INFO L762 garLoopResultBuilder]: For program point L7494-4(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,798 INFO L762 garLoopResultBuilder]: For program point L7494-3(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,799 INFO L762 garLoopResultBuilder]: For program point L7494-2(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,799 INFO L762 garLoopResultBuilder]: For program point L7494-8(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,799 INFO L762 garLoopResultBuilder]: For program point L7494-6(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,799 INFO L762 garLoopResultBuilder]: For program point L7494-12(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,799 INFO L762 garLoopResultBuilder]: For program point L7494-11(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,799 INFO L762 garLoopResultBuilder]: For program point L7494-9(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,799 INFO L762 garLoopResultBuilder]: For program point L6966(lines 6966 6972) no Hoare annotation was computed. [2021-07-05 17:00:18,799 INFO L762 garLoopResultBuilder]: For program point L7494-15(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,799 INFO L762 garLoopResultBuilder]: For program point L7494-13(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,800 INFO L762 garLoopResultBuilder]: For program point L7494-20(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,800 INFO L762 garLoopResultBuilder]: For program point L7494-18(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,800 INFO L762 garLoopResultBuilder]: For program point L7494-17(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,800 INFO L762 garLoopResultBuilder]: For program point L7494-24(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,800 INFO L762 garLoopResultBuilder]: For program point L7494-22(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,800 INFO L762 garLoopResultBuilder]: For program point L7494-21(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,800 INFO L762 garLoopResultBuilder]: For program point L7494-27(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,800 INFO L762 garLoopResultBuilder]: For program point L7494-26(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,800 INFO L762 garLoopResultBuilder]: For program point L7494-31(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,801 INFO L762 garLoopResultBuilder]: For program point L7494-30(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,801 INFO L762 garLoopResultBuilder]: For program point L7494-29(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,801 INFO L758 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2021-07-05 17:00:18,801 INFO L762 garLoopResultBuilder]: For program point L7494-36(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,801 INFO L758 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: false [2021-07-05 17:00:18,801 INFO L762 garLoopResultBuilder]: For program point L7494-35(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,802 INFO L758 garLoopResultBuilder]: At program point L261-2(line 261) the Hoare annotation is: (let ((.cse57 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse42 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse55 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) (.cse44 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse53 (select .cse57 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse7 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse16 (+ |#StackHeapBarrier| 1))) (let ((.cse11 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse9 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4)) (.cse3 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4)) (.cse8 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse27 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse13 (<= .cse16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse18 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse33 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse5 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse10 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse17 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse20 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse29 (select .cse57 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse12 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse19 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse21 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse22 (not (= (select .cse7 4) 0))) (.cse23 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4)) 0))) (.cse28 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) ULTIMATE.start_aws_mem_realloc_~ptr.offset) 0))) (.cse31 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse32 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse35 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0))) (.cse37 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse24 (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse52 (* .cse53 (- 1))) (.cse54 (select .cse44 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset)) (.cse38 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse39 (<= (+ (* 4294967296 .cse55) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse15 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse26 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse14 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse4 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse25 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse41 (select .cse42 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 .cse2 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse3) (or (not (= .cse4 ULTIMATE.start_aws_mem_realloc_~ptr.offset)) .cse5) .cse6 (= (select .cse7 .cse3) (select .cse8 .cse9)) .cse10 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse11)) .cse12 .cse13 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse11) |~#s_can_fail_allocator_static~0.base|) (= (select .cse14 .cse9) (select .cse15 .cse3)) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (<= .cse16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse17 .cse18 .cse19 .cse20 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0) (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) .cse21 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse22 .cse23 (<= (select .cse24 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse25) (= (select .cse8 .cse4) (select .cse7 .cse26)) .cse27 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse26)) .cse28 (let ((.cse40 (select .cse42 12))) (let ((.cse30 (= |~#s_can_fail_allocator_static~0.offset| 0)) (.cse34 (<= .cse41 (+ (* 4294967296 (div (+ (* (div .cse41 4294967296) 4294967296) 4294967295 (* .cse40 (- 1))) 4294967296)) .cse40))) (.cse36 (<= .cse40 (+ (* 4294967296 (div (+ (- 1) .cse40) 4294967296)) 4294967295)))) (or (and .cse0 .cse1 .cse2 .cse10 .cse12 .cse13 (<= .cse29 (* 4294967296 (div .cse29 4294967296))) .cse30 .cse20 .cse21 .cse27 .cse28 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) (and .cse0 .cse1 .cse2 .cse6 .cse10 .cse12 .cse13 .cse30 .cse18 .cse20 .cse21 .cse28 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39)))) .cse31 .cse32 .cse33 (let ((.cse43 (select .cse44 12))) (<= .cse43 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse43) 4294967296))))) .cse5 .cse35 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) .cse37 (let ((.cse46 (select .cse24 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse45 (let ((.cse56 (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (let ((.cse47 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse48 (not (= (select .cse56 (+ ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 4)) 0))) (.cse49 (not (= (select .cse56 4) 0))) (.cse50 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0))) (.cse51 (<= .cse16 ULTIMATE.start_aws_mem_realloc_~ptr.base))) (or (and .cse47 .cse0 .cse1 .cse2 (<= (* 4294967296 (div (+ .cse41 4294967295) 4294967296)) .cse41) .cse12 .cse19 .cse48 .cse21 .cse49 .cse22 .cse23 .cse28 .cse31 (<= (* 4294967296 (div (+ 4294967295 .cse46) 4294967296)) .cse46) .cse32 .cse50 .cse35 .cse37 .cse51 .cse38 .cse39) (and .cse47 .cse0 (<= (* 4294967296 (div (+ (* (div (+ .cse52 4294967295 .cse29) 4294967296) 4294967296) .cse53) 4294967296)) .cse29) .cse1 .cse2 .cse12 (<= .cse54 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse54) 4294967296)))) .cse19 (<= .cse41 (+ 4294967295 (* 4294967296 (div (+ (- 1) .cse41) 4294967296)))) .cse48 .cse21 .cse49 (<= (* 4294967296 (div (+ .cse46 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse55 4294967296)) 4294967296)) .cse46) .cse22 .cse23 .cse28 .cse31 .cse32 .cse50 .cse35 .cse37 .cse51 .cse38 .cse39)))))) (or (and .cse10 .cse45 .cse17 .cse20) (and .cse45 .cse17 .cse20 (<= .cse46 (* 4294967296 (div .cse46 4294967296))))))) (<= .cse54 (+ (* 4294967296 (div (+ .cse52 (* (div .cse54 4294967296) 4294967296) 4294967295) 4294967296)) .cse53)) (<= |~#s_can_fail_allocator_static~0.offset| 0) .cse38 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) .cse39 (= (select .cse15 .cse26) (select .cse14 .cse4)) (<= .cse25 .cse41))))) [2021-07-05 17:00:18,802 INFO L762 garLoopResultBuilder]: For program point L7494-33(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,802 INFO L762 garLoopResultBuilder]: For program point L7494-40(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,802 INFO L762 garLoopResultBuilder]: For program point L7494-39(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,802 INFO L762 garLoopResultBuilder]: For program point L7494-38(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,803 INFO L762 garLoopResultBuilder]: For program point L7494-44(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,803 INFO L762 garLoopResultBuilder]: For program point L7494-42(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,803 INFO L762 garLoopResultBuilder]: For program point L7494-48(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,803 INFO L762 garLoopResultBuilder]: For program point L7494-47(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,803 INFO L762 garLoopResultBuilder]: For program point L7494-45(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,803 INFO L762 garLoopResultBuilder]: For program point L7494-51(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,803 INFO L762 garLoopResultBuilder]: For program point L7494-49(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,803 INFO L762 garLoopResultBuilder]: For program point L7494-53(line 7494) no Hoare annotation was computed. [2021-07-05 17:00:18,803 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 17:00:18,804 INFO L762 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2021-07-05 17:00:18,804 INFO L758 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: (let ((.cse51 (+ |#StackHeapBarrier| 1)) (.cse36 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse34 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296))) (let ((.cse4 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1)) (.cse29 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset)) (.cse24 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse16 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset 4)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse23 (not (= |ULTIMATE.start_#Ultimate.C_realloc_ptr.base| 0))) (.cse25 (not (= ULTIMATE.start_can_fail_realloc_~ptr.base 0))) (.cse2 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_can_fail_realloc_~newsize)) (.cse19 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse7 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_byte_buf_reserve_~buffer.base)) (.cse22 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse9 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse12 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse26 (<= (+ (* 4294967296 .cse34) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse27 (select .cse36 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse37 (select |#memory_int| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse0 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse5 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse17 (<= .cse51 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse39 (<= .cse51 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse42 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse38 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|))) (.cse3 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| 0))) (.cse6 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse20 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse21 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse28 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse11 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4)) .cse3 .cse4 (let ((.cse10 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)))) (or (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse14 (select |#memory_int| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base))) (and (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse0 .cse1 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) .cse5 .cse6 .cse7 .cse8 (let ((.cse13 (select .cse14 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (<= .cse13 (* 4294967296 (div .cse13 4294967296)))) .cse9 (let ((.cse15 (select .cse14 12))) (<= .cse15 (+ 4294967294 (* 4294967296 (div (+ (- 1) .cse15) 4294967296))))) .cse10 .cse11 .cse12)))) (let ((.cse18 (= |~#s_can_fail_allocator_static~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse8 .cse23 .cse9 .cse24 .cse11 .cse25 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse17 (<= .cse27 (* 4294967296 (div .cse27 4294967296))) .cse18 .cse20 .cse22 .cse28 .cse8 .cse23 .cse9 .cse24 .cse11 .cse25 .cse12 .cse26))) .cse16 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse29)) .cse5 .cse17 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse29) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) .cse6 .cse19 .cse20 (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse21 .cse22 (= |ULTIMATE.start_#Ultimate.C_realloc_#res.offset| 0) .cse28 .cse8 .cse23 .cse9 .cse24 .cse11 .cse25 (<= |~#s_can_fail_allocator_static~0.offset| 0) (let ((.cse33 (select .cse37 ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset))) (let ((.cse30 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse31 (<= (* 4294967296 (div (let ((.cse35 (select .cse36 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (+ (* (div (+ (* .cse35 (- 1)) 4294967295 .cse27) 4294967296) 4294967296) .cse35)) 4294967296)) .cse27)) (.cse32 (<= (* 4294967296 (div (+ .cse33 (* ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity (- 1)) 4294967296 (* .cse34 4294967296)) 4294967296)) .cse33))) (or (and .cse30 .cse0 .cse31 .cse1 .cse2 .cse3 .cse16 .cse5 .cse17 .cse6 .cse7 .cse20 .cse21 .cse22 .cse32 .cse8 .cse23 .cse11 .cse25 .cse12) (and .cse30 .cse0 .cse31 .cse1 .cse2 .cse5 .cse17 .cse6 .cse7 .cse20 .cse21 .cse22 .cse32 (<= .cse33 (* 4294967296 (div .cse33 4294967296))) .cse8 .cse23 .cse11 .cse25 .cse12)))) .cse26 (let ((.cse44 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse40 (<= (select .cse37 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse44)) (.cse41 (<= .cse44 .cse27)) (.cse43 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)))) (or (and .cse0 .cse2 .cse3 (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) .cse38) .cse5 .cse17 .cse39 .cse6 .cse20 .cse22 .cse40 .cse28 .cse41 .cse9 .cse42 .cse11 .cse43 .cse12 (<= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 0) .cse26) (and .cse2 .cse3 .cse6 .cse19 .cse7 .cse20 .cse22 (= (select |#valid| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) 1) .cse40 .cse41 .cse9 .cse38 .cse11 .cse43 .cse12 .cse26)))) (let ((.cse47 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse50 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|))) (let ((.cse45 (not (= .cse50 ULTIMATE.start_aws_mem_realloc_~ptr.offset))) (.cse48 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse50)) (.cse46 (not (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse47))) (.cse49 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse47) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) .cse50)))) (or (and .cse0 (not (= |ULTIMATE.start_#Ultimate.C_realloc_#res.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (or (not (= ULTIMATE.start_aws_mem_realloc_~ptr.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) .cse45) .cse3 .cse5 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 12))) .cse17 .cse39 .cse6 .cse20 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4))) .cse21 .cse28 .cse46 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_mem_realloc_~ptr.base) .cse47) .cse48) .cse42 .cse11 .cse49) (and (or .cse45 .cse38) .cse3 .cse6 .cse20 .cse21 (< ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 1)) (= .cse48 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse47)) .cse28 .cse46 .cse11 .cse49))))))) [2021-07-05 17:00:18,804 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-07-05 17:00:18,805 INFO L758 garLoopResultBuilder]: At program point L8192(lines 8175 8193) the Hoare annotation is: (let ((.cse20 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| 0)))) (let ((.cse10 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse15 (and (<= (+ |ULTIMATE.start_aws_byte_buf_reserve_#res| 1) 0) .cse6)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse16 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse17 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse12 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 0)) (.cse18 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse5 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|)) (.cse24 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|)) (.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|)) (.cse23 (+ 16 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse22 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.base|) |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset|)) (.cse21 (select .cse20 |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|))) (and (let ((.cse1 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 4))) (let ((.cse7 (= |ULTIMATE.start_aws_byte_buf_reserve_#res| 0)) (.cse8 (= ULTIMATE.start_aws_mem_realloc_~ptr.offset .cse1)) (.cse9 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset 0)) (.cse11 (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base ULTIMATE.start_aws_mem_realloc_~ptr.base)) (.cse13 (= ULTIMATE.start_aws_mem_realloc_~newsize ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity)) (.cse14 (<= (+ (* 4294967296 (div ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity 4294967296)) 1) ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity))) (or (let ((.cse3 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#old~0.offset| 4))) (and (= (select .cse0 .cse1) (select .cse2 .cse3)) (= (select .cse4 .cse3) (select .cse5 .cse1)) .cse6)) (and (= ULTIMATE.start_aws_mem_realloc_~newptr~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse1) 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_#Ultimate.C_realloc_#res.offset| 0) (= |ULTIMATE.start_can_fail_realloc_#res.offset| 0) .cse6 .cse14) (and (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_reserve_~buffer.base) .cse1) 0)) .cse7 .cse8 (= |ULTIMATE.start_nondet_voidp_#res.base| 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse6 (= |ULTIMATE.start_can_fail_realloc_#res.base| 0) .cse14 (= ULTIMATE.start_aws_mem_realloc_~newptr~0.base 0))))) (or .cse15 (and .cse16 .cse17 (= ULTIMATE.start_aws_byte_buf_reserve_~requested_capacity ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.base|) .cse10 .cse12 .cse18 (= |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.offset |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset|) .cse6 (let ((.cse19 (select .cse20 (+ |ULTIMATE.start_aws_byte_buf_reserve_harness_~#buf~3.offset| 12)))) (<= .cse19 (+ (* 4294967296 (div (+ (* ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 (- 1)) .cse19 (* (div ULTIMATE.start_aws_byte_buf_reserve_harness_~requested_capacity~1 4294967296) 4294967296)) 4294967296)) 4294967295))))) (<= .cse21 .cse22) (= (select .cse2 .cse23) (select .cse0 .cse24)) (or (let ((.cse25 (+ 16 ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset))) (and .cse16 .cse17 (= |~#s_can_fail_allocator_static~0.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse25)) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base) .cse25) |~#s_can_fail_allocator_static~0.base|) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_allocator_#res.base| |~#s_can_fail_allocator_static~0.base|) (= |ULTIMATE.start_can_fail_allocator_#res.offset| |~#s_can_fail_allocator_static~0.offset|) .cse12 .cse18 (not (= ULTIMATE.start_aws_byte_buf_reserve_~buffer.base 0)) .cse6 (<= |~#s_can_fail_allocator_static~0.offset| 0))) .cse15) .cse6 (let ((.cse28 (div .cse21 4294967296)) (.cse29 (select .cse20 12))) (let ((.cse26 (<= .cse21 (+ (* 4294967296 (div (+ (* .cse28 4294967296) 4294967295 (* .cse29 (- 1))) 4294967296)) .cse29))) (.cse27 (<= .cse29 (+ (* 4294967296 (div (+ (- 1) .cse29) 4294967296)) 4294967295)))) (or (and .cse16 .cse17 .cse12 (not (= (select .cse0 4) 0)) .cse18 .cse26 .cse6 .cse27) (and .cse16 .cse17 (<= .cse21 (* 4294967296 .cse28)) .cse12 .cse18 .cse26 .cse6 .cse27)))) (= (select .cse5 .cse24) (select .cse4 .cse23)) (<= .cse22 .cse21)))) [2021-07-05 17:00:18,805 INFO L758 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: false [2021-07-05 17:00:18,805 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable415 [2021-07-05 17:00:18,805 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 17:00:18,805 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION was SAFE (10/10) [2021-07-05 17:00:18,819 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,820 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,820 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,821 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,821 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,821 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,840 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,840 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,840 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,841 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,874 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,874 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,874 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,875 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,875 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,877 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,878 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,878 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,878 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,879 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,885 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,891 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,891 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,891 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,892 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,893 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,893 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:18,893 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,893 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,894 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,894 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,896 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,900 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,900 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,900 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,901 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,901 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,901 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:18,901 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,902 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,902 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,902 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,906 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:18,928 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,929 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:18,929 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,930 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,930 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,930 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,930 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,931 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,931 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,931 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:18,932 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,932 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:18,932 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,932 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,933 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,933 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,933 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,934 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:18,934 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:18,934 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,939 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:18,939 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:18,939 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,939 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:18,940 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,940 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,940 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:18,941 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,941 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:18,941 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,941 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:18,942 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,942 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,942 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:18,942 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,943 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,943 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,943 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,952 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,956 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,956 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,956 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,957 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,957 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,957 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:18,958 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,958 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,958 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,958 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,960 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,960 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,960 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:18,960 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,961 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,961 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,961 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,961 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,961 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,962 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,962 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,962 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,986 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:18,987 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,987 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:18,987 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,987 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,988 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,988 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,989 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,989 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,989 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,989 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:18,990 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,990 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:18,990 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:18,990 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,991 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,991 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,992 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,992 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:18,992 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:18,993 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,993 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:18,994 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:18,994 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,994 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:18,994 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,997 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,998 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:18,998 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,998 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:18,998 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,999 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:18,999 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,999 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:18,999 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,000 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,000 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,000 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,000 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,001 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,001 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,001 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,001 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,001 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,001 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,002 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,002 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,002 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,003 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,003 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,003 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,003 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,003 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,016 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,017 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,017 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,018 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,018 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,018 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,018 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,019 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,019 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,031 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,031 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,032 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,032 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,032 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,033 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,033 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,033 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,033 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,034 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,034 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,034 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,035 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,035 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,035 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,040 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,040 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,041 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,041 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,041 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,041 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,042 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,042 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,042 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,042 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,042 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,043 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,043 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,043 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,043 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,044 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,044 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,044 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,044 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,045 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,048 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,049 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,049 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,049 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,050 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,050 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,050 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,050 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,051 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,051 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,051 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,051 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,051 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,052 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,052 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,052 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,052 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,052 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,057 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,059 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,059 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,059 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,060 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,060 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,064 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,069 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,069 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,070 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,070 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,070 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,084 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,085 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,085 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,085 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,086 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,086 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,086 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,086 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,087 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,087 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,087 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,087 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,088 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,088 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,088 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,088 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,089 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,089 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,089 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,089 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,089 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,090 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,090 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,090 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,090 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,091 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,091 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,092 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,092 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,092 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,093 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,094 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,094 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,095 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,095 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,096 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,096 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,096 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,096 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,096 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,098 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,098 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,098 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,098 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,098 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,099 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,099 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,099 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,114 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,115 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,115 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,115 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,116 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,116 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,116 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,117 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,117 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,117 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,117 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,121 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,121 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,121 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,136 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,138 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,138 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,138 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,138 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,138 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,139 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,139 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,139 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,139 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,140 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,140 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,140 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,140 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,141 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,141 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,141 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,141 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,141 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,142 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,142 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,142 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,142 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,142 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,149 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,149 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,149 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,149 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,150 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,150 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,150 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,151 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,151 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,151 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,151 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,152 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,153 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,153 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,154 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,154 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,154 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,154 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,160 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,161 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,161 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,161 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,162 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,162 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,162 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,162 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,162 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,164 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,164 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,164 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,164 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,165 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,165 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,165 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,165 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,166 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,166 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,166 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,166 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,167 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,167 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,167 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,167 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,184 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,184 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,184 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,184 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,184 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,185 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,185 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,185 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,185 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,185 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,185 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,185 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,185 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,186 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,186 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,186 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,186 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,186 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,186 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,186 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,187 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,187 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,187 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,187 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,187 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,187 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,187 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,188 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,188 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,188 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,188 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,188 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,188 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,188 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,189 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,189 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,189 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,189 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,189 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,189 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,189 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,190 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,190 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,194 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,194 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,194 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,195 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,195 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,195 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,195 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,196 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,196 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,196 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,196 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,196 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,197 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,197 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,197 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,197 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,198 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,198 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,198 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,198 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,199 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,199 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,199 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,199 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,200 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,200 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,200 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,200 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,200 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,201 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,201 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,201 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,201 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,202 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,202 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,202 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,202 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,202 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,202 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,203 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,203 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,203 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,203 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,214 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,215 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,215 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,215 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,216 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,216 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,216 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,216 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,217 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,217 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,217 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,217 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,217 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,218 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,219 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,219 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,219 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,219 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,220 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,220 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,220 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,220 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,221 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,221 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,221 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,221 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,221 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,221 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,223 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,223 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,223 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,223 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,224 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,224 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,224 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,224 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,225 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,225 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,225 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,225 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,225 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,225 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,227 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,227 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,227 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,227 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,227 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,228 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,228 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,228 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,228 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,228 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,229 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,229 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,229 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,229 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,232 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,232 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,232 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,232 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,233 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,233 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,233 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,233 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,233 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,233 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,234 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,234 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,234 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,235 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,235 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,235 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,236 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,236 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,236 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,236 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,237 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,237 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,237 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,237 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,238 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,238 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,238 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,238 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,238 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,239 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,239 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,239 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,239 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,239 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,240 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,240 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,240 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,240 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,240 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,240 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,241 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,243 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,243 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,244 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,244 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,244 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,245 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,245 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,245 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,245 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,245 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,246 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,246 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,246 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,246 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,247 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,247 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,247 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,247 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,247 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,248 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,248 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,248 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,248 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,248 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,248 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,248 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,249 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,249 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,251 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,252 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,252 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,252 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,253 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,253 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,253 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,253 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,254 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,254 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,254 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,254 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,255 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,255 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,255 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,255 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,255 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,256 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,256 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,256 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,256 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,256 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,256 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,257 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,257 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,257 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,257 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,258 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,260 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,261 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,261 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,261 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,261 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,262 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,262 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,262 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,262 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,263 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,263 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:19,263 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,263 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,264 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,264 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,264 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,264 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,264 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,266 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,266 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,266 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,266 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,271 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,271 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,271 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,271 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,272 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,272 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,272 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,273 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,273 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,273 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,273 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,273 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,274 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,274 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,275 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,275 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,275 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,275 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,276 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,276 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,276 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,276 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,277 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,277 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,277 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,277 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,278 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,279 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,279 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,279 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,279 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,280 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,280 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,280 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,280 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,280 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,281 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,281 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,281 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,281 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,282 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,284 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,284 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,284 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,284 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,284 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,285 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,285 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,285 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,285 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,286 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,286 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,286 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,286 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,286 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,287 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,287 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,287 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,287 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,287 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,288 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,288 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,288 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,288 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,288 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,288 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,290 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,291 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,291 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,291 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,291 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,292 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,292 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,292 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,292 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,292 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,293 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,293 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,293 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,293 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,294 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,294 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,294 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,294 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,294 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,295 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,295 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,295 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,295 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,295 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,295 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,296 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,296 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,296 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,296 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,296 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,299 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,299 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,299 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,299 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,300 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,300 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,300 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,300 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,301 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,301 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,301 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,301 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,301 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,301 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,303 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,303 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,303 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,304 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,304 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,304 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,304 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:19,305 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,305 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,305 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,305 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,305 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,306 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,306 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,307 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,307 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,308 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,308 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,308 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,308 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,308 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,308 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,309 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,309 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,310 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,310 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,310 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,310 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,310 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,310 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,311 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,311 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,312 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,312 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,313 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,313 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,313 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,313 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,314 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,314 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,314 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,314 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,315 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,315 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,315 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,315 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,316 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,316 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,316 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,316 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,317 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,317 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,317 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,317 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,318 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,318 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,318 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,318 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,318 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,319 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,319 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,319 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,319 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,320 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,320 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,320 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,320 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,323 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,323 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,323 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,323 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,324 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,324 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,324 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,324 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,325 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,325 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,325 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,325 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,326 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,326 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,326 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,326 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,327 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,327 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,327 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,327 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,328 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,328 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,328 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,328 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,328 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,329 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,329 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,329 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,329 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,330 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,330 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,330 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,330 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,330 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,331 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,333 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,334 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,334 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,334 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,334 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,334 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,335 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,335 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,335 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,335 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,335 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,336 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,336 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,336 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,336 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,336 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,337 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,337 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,337 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,337 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,337 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,338 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,338 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,339 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,339 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,339 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,339 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,340 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,340 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,340 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,340 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,340 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,341 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,341 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,341 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,341 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,341 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,342 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,342 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,342 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:19,342 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,342 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:19,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.07 05:00:19 BoogieIcfgContainer [2021-07-05 17:00:19,344 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-05 17:00:19,344 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-05 17:00:19,344 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-05 17:00:19,345 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-05 17:00:19,345 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.07 04:48:21" (3/4) ... [2021-07-05 17:00:19,353 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-07-05 17:00:19,384 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 125 nodes and edges [2021-07-05 17:00:19,385 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2021-07-05 17:00:19,386 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2021-07-05 17:00:19,387 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-07-05 17:00:19,388 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-07-05 17:00:19,389 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-07-05 17:00:19,390 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-07-05 17:00:19,391 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-07-05 17:00:19,426 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((buf == buf && buf == 0) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && 0 <= s_can_fail_allocator_static) && s_can_fail_allocator_static == 0) && \result == s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buf == 0) && \valid[buf] == 1) && !(buf == 0)) && s_can_fail_allocator_static <= 0 [2021-07-05 17:00:19,427 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((buf == buf && buf == 0) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && (((((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && 0 <= s_can_fail_allocator_static) && buf == 0) && !(\result == 0)) && !(buf == 0)) && s_can_fail_allocator_static <= 0) || (((((((((((buf == buf && buf == 0) && s_can_fail_allocator_static == #memory_$Pointer$[buf][16 + buf]) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buf == 0) && !(\result == 0)) && !(buf == 0)) && s_can_fail_allocator_static <= 0))) && buf == 0) && \valid[buf] == 1) && !(\result == 0)) && !(buf == 0)) && (((((((buf == buf && buf == 0) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && s_can_fail_allocator_static == 0) && buf == 0) && !(\result == 0)) && !(buf == 0)) || (((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && s_can_fail_allocator_static == 0) && buf == 0) && !(\result == 0)) && !(buf == 0))) [2021-07-05 17:00:19,427 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((buf == buf && buf == 0) && (((((((((((0 <= \result && buf == buf) && buf == 0) && buf == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result <= 0) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0) || (((((((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && buf == buf) && 0 <= s_can_fail_allocator_static) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && buf == 0)) || ((((((((((((((buf == buf && buf == 0) && s_can_fail_allocator_static == #memory_$Pointer$[buf][16 + buf]) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && buf == 0))) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && (((((((((((0 <= \result && buf == buf) && buf == 0) && buf == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result <= 0) && !(\result == 0)) && !(buf == 0)) && buf == 0) || ((((((((((((((1 <= \result && buf == buf) && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && \result <= 1) && #memory_$Pointer$[buf][16 + buf] == 0) && buf == buf) && s_can_fail_allocator_static == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0)) || (((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && s_can_fail_allocator_static == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0))) && buf == 0) && \valid[buf] == 1) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && (((((((((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0) || (((((((((0 <= \result && buf == buf) && buf == 0) && buf == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result <= 0) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0)) || (((((((((buf == buf && buf == 0) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#memory_int-unknown[buf][buf] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf]) / 4294967296)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0)) || ((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0))) && (((((((((((0 <= \result && buf == buf) && buf == 0) && buf == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result <= 0) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0) || (((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0)) || (((((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && buf == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0))) && (((((((((((0 <= \result && buf == buf) && buf == 0) && buf == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result <= 0) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0) || ((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0)) || (((((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && buf == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0))) && buf == 0 [2021-07-05 17:00:19,427 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((buf == buf && !(buf == \old)) && ((((((((((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && unknown-#memory_int-unknown[buffer][buffer] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][buffer]) / 4294967296)) && buffer == 0) && unknown-#memory_int-unknown[buf][buf] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf]) / 4294967296)) && unknown-#memory_int-unknown[buffer][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][12]) / 4294967296)) && buf == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && unknown-#memory_int-unknown[buffer][buffer] <= unknown-#memory_int-unknown[buffer][12] + 4294967296 * ((unknown-#memory_int-unknown[buffer][buffer] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buffer][12] * -1) / 4294967296)) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0) || ((((((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && buffer == 0) && unknown-#memory_int-unknown[buffer][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][12]) / 4294967296)) && buf == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && unknown-#memory_int-unknown[buffer][buffer] <= 4294967296 * (unknown-#memory_int-unknown[buffer][buffer] / 4294967296)) && !(buffer == 0)) && !(buf == 0)) && buf == 0)) || ((((((((((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0) && buf == buf) && buffer == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && buf == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0))) && #memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4]) && buf == buf) && (((((((((((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0) && buf == buf) && buffer == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && buf == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0) || (((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && buffer == 0) && buf == buffer) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buffer][buffer + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][12]) / 4294967296)) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && buf == 0))) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old]) && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && unknown-#StackHeapBarrier-unknown + 1 <= \old) && buffer == 0) && buffer == buf) && buf == buffer) && buf == 0) && buffer < \old + 1) && \valid[buf] == 1) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && buf == buf) && (((((((((((((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0) && buf == buf) && buffer == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && buffer < s_can_fail_allocator_static + 1) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && buf == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0) || ((((((((((((((((buf == buf && buf == 0) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buffer == 0) && buffer == buf) && \result == s_can_fail_allocator_static) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && #memory_$Pointer$[buffer][16] == s_can_fail_allocator_static) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && buf == 0))) && ((((((((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && requested_capacity == requested_capacity) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && s_can_fail_allocator_static == 0) && buffer == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && buf == buf) && buffer == buf) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0) || (((((((((((((((((((1 <= \result && buf == buf) && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && \result <= 1) && #memory_$Pointer$[buf][16 + buf] == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0) && buf == buf) && s_can_fail_allocator_static == 0) && buffer == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0)) || (((((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && s_can_fail_allocator_static == 0) && buffer == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && buf == buf) && buffer == buf) && !(buf == 0)) && buf == 0))) && !(buf == 0)) && (((((((((((((((buf == buf && buf == 0) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && buffer == 0) && buf == buffer) && unknown-#memory_int-unknown[buf][buf] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf]) / 4294967296)) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && buf == 0) || (((((((((((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && buffer == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && buf == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0)) || ((((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && buffer == 0) && buf == buffer) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && buf == 0))) && buf == 0) && \old <= 0) && (((((((((((buf == buf && buf == 0) && requested_capacity == requested_capacity) && buf == buf) && buffer == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && buffer == buf) && !(buf == 0)) && buf == 0) || ((((((((((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0) && buf == buf) && buffer == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && buf == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0))) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf] [2021-07-05 17:00:19,427 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result + 1 <= 0 && #memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4]) && buf == buf) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old]) && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && ((((((((((buf == buf && buf == 0) && buf == buf) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0) || (((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0))) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && buf == buf) && !(buf == 0)) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf] [2021-07-05 17:00:19,427 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((#memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4] && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && !(buf == 0)) || ((((((((((((newptr == 0 && !(#memory_$Pointer$[buffer][buf + 4] == 0)) && \result == 0) && ptr == buf + 4) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && #Ultimate.C_realloc_#res == 0) && \result == 0) && !(buf == 0)) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity)) || ((((((((((((!(#memory_$Pointer$[buffer][buf + 4] == 0) && \result == 0) && ptr == buf + 4) && \result == 0) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && !(buf == 0)) && \result == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) && newptr == 0)) && ((\result + 1 <= 0 && !(buf == 0)) || ((((((((((buf == buf && buf == 0) && requested_capacity == requested_capacity) && buf == buf) && buffer == buf) && buf == 0) && !(\result == 0)) && buf == buf) && buffer == buf) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((requested_capacity * -1 + unknown-#memory_int-unknown[buf][buf + 12] + requested_capacity / 4294967296 * 4294967296) / 4294967296) + 4294967295))) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old]) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && ((((((((((((buf == buf && buf == 0) && s_can_fail_allocator_static == #memory_$Pointer$[buf][16 + buf]) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buf == 0) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && s_can_fail_allocator_static <= 0) || (\result + 1 <= 0 && !(buf == 0)))) && !(buf == 0)) && ((((((((buf == buf && buf == 0) && buf == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) || (((((((buf == buf && buf == 0) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && buf == 0) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295))) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf] [2021-07-05 17:00:19,427 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((buf == buf && ((((#memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4] && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && !(buf == 0)) || ((((((((((((!(#memory_$Pointer$[buffer][buf + 4] == 0) && ptr == buf + 4) && \result == 0) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && !(buffer == 0)) && !(buf == 0)) && \result == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) && newptr == 0)) || ((((((((((((newptr == 0 && !(#memory_$Pointer$[buffer][buf + 4] == 0)) && ptr == buf + 4) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && #Ultimate.C_realloc_#res == 0) && \result == 0) && !(buffer == 0)) && !(buf == 0)) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity))) && buf == 0) && s_can_fail_allocator_static == #memory_$Pointer$[buf][16 + buf]) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old]) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && \result == buf->allocator) && \result == s_can_fail_allocator_static) && buf == 0) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && ((((((((buf == buf && buf == 0) && buf == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) || (((((((buf == buf && buf == 0) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && buf == 0) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295))) && \result == buf->allocator) && s_can_fail_allocator_static <= 0) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf] [2021-07-05 17:00:19,427 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((buf == buf && ((((#memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4] && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && !(buf == 0)) || ((((((((((((!(#memory_$Pointer$[buffer][buf + 4] == 0) && ptr == buf + 4) && \result == 0) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && !(buffer == 0)) && !(buf == 0)) && \result == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) && newptr == 0)) || ((((((((((((newptr == 0 && !(#memory_$Pointer$[buffer][buf + 4] == 0)) && ptr == buf + 4) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && #Ultimate.C_realloc_#res == 0) && \result == 0) && !(buffer == 0)) && !(buf == 0)) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity))) && 1 <= \result) && buf == 0) && \result <= 1) && s_can_fail_allocator_static == #memory_$Pointer$[buf][16 + buf]) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old]) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buf == 0) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && ((((((((buf == buf && buf == 0) && buf == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) || (((((((buf == buf && buf == 0) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && buf == 0) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295))) && s_can_fail_allocator_static <= 0) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf] [2021-07-05 17:00:19,428 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= \result && ((((#memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4] && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && !(buf == 0)) || ((((((((((((!(#memory_$Pointer$[buffer][buf + 4] == 0) && ptr == buf + 4) && \result == 0) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && !(buffer == 0)) && !(buf == 0)) && \result == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) && newptr == 0)) || ((((((((((((newptr == 0 && !(#memory_$Pointer$[buffer][buf + 4] == 0)) && ptr == buf + 4) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && #Ultimate.C_realloc_#res == 0) && \result == 0) && !(buffer == 0)) && !(buf == 0)) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity))) && \result <= 1) && buf == buf) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old]) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && buf == buf) && !(buf == 0)) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf] [2021-07-05 17:00:20,063 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-05 17:00:20,063 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-05 17:00:20,064 INFO L168 Benchmark]: Toolchain (without parser) took 730138.82 ms. Allocated memory was 58.7 MB in the beginning and 1.1 GB in the end (delta: 1.1 GB). Free memory was 28.2 MB in the beginning and 716.1 MB in the end (delta: -687.9 MB). Peak memory consumption was 732.5 MB. Max. memory is 16.1 GB. [2021-07-05 17:00:20,064 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 58.7 MB. Free memory is still 40.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-07-05 17:00:20,064 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2599.86 ms. Allocated memory was 58.7 MB in the beginning and 117.4 MB in the end (delta: 58.7 MB). Free memory was 28.0 MB in the beginning and 52.0 MB in the end (delta: -23.9 MB). Peak memory consumption was 67.8 MB. Max. memory is 16.1 GB. [2021-07-05 17:00:20,064 INFO L168 Benchmark]: Boogie Procedure Inliner took 191.95 ms. Allocated memory is still 117.4 MB. Free memory was 52.0 MB in the beginning and 38.4 MB in the end (delta: 13.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-07-05 17:00:20,064 INFO L168 Benchmark]: Boogie Preprocessor took 89.43 ms. Allocated memory is still 117.4 MB. Free memory was 38.4 MB in the beginning and 28.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-07-05 17:00:20,064 INFO L168 Benchmark]: RCFGBuilder took 8209.21 ms. Allocated memory was 117.4 MB in the beginning and 444.6 MB in the end (delta: 327.2 MB). Free memory was 28.9 MB in the beginning and 263.0 MB in the end (delta: -234.1 MB). Peak memory consumption was 230.9 MB. Max. memory is 16.1 GB. [2021-07-05 17:00:20,064 INFO L168 Benchmark]: TraceAbstraction took 718322.10 ms. Allocated memory was 444.6 MB in the beginning and 1.1 GB in the end (delta: 687.9 MB). Free memory was 262.0 MB in the beginning and 869.5 MB in the end (delta: -607.5 MB). Peak memory consumption was 79.3 MB. Max. memory is 16.1 GB. [2021-07-05 17:00:20,064 INFO L168 Benchmark]: Witness Printer took 718.95 ms. Allocated memory is still 1.1 GB. Free memory was 869.5 MB in the beginning and 716.1 MB in the end (delta: 153.4 MB). Peak memory consumption was 498.4 MB. Max. memory is 16.1 GB. [2021-07-05 17:00:20,065 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.19 ms. Allocated memory is still 58.7 MB. Free memory is still 40.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 2599.86 ms. Allocated memory was 58.7 MB in the beginning and 117.4 MB in the end (delta: 58.7 MB). Free memory was 28.0 MB in the beginning and 52.0 MB in the end (delta: -23.9 MB). Peak memory consumption was 67.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 191.95 ms. Allocated memory is still 117.4 MB. Free memory was 52.0 MB in the beginning and 38.4 MB in the end (delta: 13.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 89.43 ms. Allocated memory is still 117.4 MB. Free memory was 38.4 MB in the beginning and 28.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * RCFGBuilder took 8209.21 ms. Allocated memory was 117.4 MB in the beginning and 444.6 MB in the end (delta: 327.2 MB). Free memory was 28.9 MB in the beginning and 263.0 MB in the end (delta: -234.1 MB). Peak memory consumption was 230.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 718322.10 ms. Allocated memory was 444.6 MB in the beginning and 1.1 GB in the end (delta: 687.9 MB). Free memory was 262.0 MB in the beginning and 869.5 MB in the end (delta: -607.5 MB). Peak memory consumption was 79.3 MB. Max. memory is 16.1 GB. * Witness Printer took 718.95 ms. Allocated memory is still 1.1 GB. Free memory was 869.5 MB in the beginning and 716.1 MB in the end (delta: 153.4 MB). Peak memory consumption was 498.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - 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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 201 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 119590.7ms, OverallIterations: 24, TraceHistogramMax: 1, EmptinessCheckTime: 30.2ms, AutomataDifference: 90348.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 2392.2ms, InitialAbstractionConstructionTime: 11.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1901 SDtfs, 4716 SDslu, 4979 SDs, 0 SdLazy, 3157 SolverSat, 438 SolverUnsat, 40 SolverUnknown, 0 SolverNotchecked, 84510.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 4845.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred in iteration=0, InterpolantAutomatonStates: 223, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 154.2ms AutomataMinimizationTime, 24 MinimizatonAttempts, 800 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 61 NumberOfFragments, 1669 HoareAnnotationTreeSize, 24 FomulaSimplifications, 188090 FormulaSimplificationTreeSizeReduction, 184.4ms HoareSimplificationTime, 24 FomulaSimplificationsInter, 39098 FormulaSimplificationTreeSizeReductionInter, 2198.2ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 339.5ms SsaConstructionTime, 20751.2ms SatisfiabilityAnalysisTime, 5062.5ms InterpolantComputationTime, 1300 NumberOfCodeBlocks, 1300 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1276 ConstructedInterpolants, 0 QuantifiedInterpolants, 9059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 201 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 99087.0ms, OverallIterations: 24, TraceHistogramMax: 1, EmptinessCheckTime: 13.8ms, AutomataDifference: 76393.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 3090.6ms, InitialAbstractionConstructionTime: 1.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2829 SDtfs, 5312 SDslu, 8156 SDs, 0 SdLazy, 2973 SolverSat, 376 SolverUnsat, 34 SolverUnknown, 0 SolverNotchecked, 71605.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 58 SyntacticMatches, 12 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 4060.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred in iteration=0, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 100.2ms AutomataMinimizationTime, 24 MinimizatonAttempts, 626 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 68 NumberOfFragments, 1572 HoareAnnotationTreeSize, 24 FomulaSimplifications, 202193 FormulaSimplificationTreeSizeReduction, 160.5ms HoareSimplificationTime, 24 FomulaSimplificationsInter, 172189 FormulaSimplificationTreeSizeReductionInter, 2924.8ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 302.4ms SsaConstructionTime, 14999.9ms SatisfiabilityAnalysisTime, 3943.4ms InterpolantComputationTime, 1764 NumberOfCodeBlocks, 1764 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1740 ConstructedInterpolants, 0 QuantifiedInterpolants, 10013 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 201 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 129577.3ms, OverallIterations: 29, TraceHistogramMax: 1, EmptinessCheckTime: 14.9ms, AutomataDifference: 97246.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 4465.8ms, InitialAbstractionConstructionTime: 1.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3081 SDtfs, 7054 SDslu, 9437 SDs, 0 SdLazy, 3839 SolverSat, 477 SolverUnsat, 42 SolverUnknown, 0 SolverNotchecked, 88961.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 445 GetRequests, 70 SyntacticMatches, 16 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 8518.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=10, InterpolantAutomatonStates: 284, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 119.2ms AutomataMinimizationTime, 29 MinimizatonAttempts, 1138 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 68 NumberOfFragments, 2228 HoareAnnotationTreeSize, 24 FomulaSimplifications, 426588 FormulaSimplificationTreeSizeReduction, 253.7ms HoareSimplificationTime, 24 FomulaSimplificationsInter, 256611 FormulaSimplificationTreeSizeReductionInter, 4207.6ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 316.0ms SsaConstructionTime, 21487.5ms SatisfiabilityAnalysisTime, 5683.1ms InterpolantComputationTime, 2130 NumberOfCodeBlocks, 2130 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2101 ConstructedInterpolants, 0 QuantifiedInterpolants, 14565 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 201 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 50471.9ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 10.4ms, AutomataDifference: 34730.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 1085.0ms, InitialAbstractionConstructionTime: 1.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2946 SDtfs, 4394 SDslu, 6747 SDs, 0 SdLazy, 2169 SolverSat, 249 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 32281.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1708.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=9, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 46.3ms AutomataMinimizationTime, 17 MinimizatonAttempts, 687 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 61 NumberOfFragments, 912 HoareAnnotationTreeSize, 24 FomulaSimplifications, 28432 FormulaSimplificationTreeSizeReduction, 65.2ms HoareSimplificationTime, 24 FomulaSimplificationsInter, 1022 FormulaSimplificationTreeSizeReductionInter, 1016.1ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 155.6ms SsaConstructionTime, 12784.8ms SatisfiabilityAnalysisTime, 1529.8ms InterpolantComputationTime, 861 NumberOfCodeBlocks, 861 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 844 ConstructedInterpolants, 0 QuantifiedInterpolants, 3488 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 201 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 82334.3ms, OverallIterations: 24, TraceHistogramMax: 1, EmptinessCheckTime: 8.6ms, AutomataDifference: 57889.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 3333.3ms, InitialAbstractionConstructionTime: 1.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3789 SDtfs, 6392 SDslu, 9369 SDs, 0 SdLazy, 2788 SolverSat, 326 SolverUnsat, 25 SolverUnknown, 0 SolverNotchecked, 53355.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 4213.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=9, InterpolantAutomatonStates: 202, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 84.3ms AutomataMinimizationTime, 24 MinimizatonAttempts, 837 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 60 NumberOfFragments, 2129 HoareAnnotationTreeSize, 24 FomulaSimplifications, 523740 FormulaSimplificationTreeSizeReduction, 132.5ms HoareSimplificationTime, 24 FomulaSimplificationsInter, 7332 FormulaSimplificationTreeSizeReductionInter, 3196.0ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 245.1ms SsaConstructionTime, 17216.1ms SatisfiabilityAnalysisTime, 3365.7ms InterpolantComputationTime, 1558 NumberOfCodeBlocks, 1558 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1534 ConstructedInterpolants, 0 QuantifiedInterpolants, 8824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 201 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 159353.4ms, OverallIterations: 37, TraceHistogramMax: 1, EmptinessCheckTime: 12.0ms, AutomataDifference: 111937.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 7827.6ms, InitialAbstractionConstructionTime: 0.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 6447 SDtfs, 12267 SDslu, 18391 SDs, 0 SdLazy, 7209 SolverSat, 946 SolverUnsat, 47 SolverUnknown, 0 SolverNotchecked, 102953.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 522 GetRequests, 92 SyntacticMatches, 13 SemanticMatches, 417 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 8743.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=590occurred in iteration=10, InterpolantAutomatonStates: 353, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 164.9ms AutomataMinimizationTime, 37 MinimizatonAttempts, 2272 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 96 NumberOfFragments, 3814 HoareAnnotationTreeSize, 24 FomulaSimplifications, 20779442 FormulaSimplificationTreeSizeReduction, 421.2ms HoareSimplificationTime, 24 FomulaSimplificationsInter, 297346 FormulaSimplificationTreeSizeReductionInter, 7399.2ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 358.2ms SsaConstructionTime, 32236.6ms SatisfiabilityAnalysisTime, 6563.2ms InterpolantComputationTime, 2824 NumberOfCodeBlocks, 2824 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2787 ConstructedInterpolants, 0 QuantifiedInterpolants, 16880 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 201 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 37924.2ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 4.7ms, AutomataDifference: 27141.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 2406.1ms, InitialAbstractionConstructionTime: 1.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2871 SDtfs, 3541 SDslu, 4682 SDs, 0 SdLazy, 958 SolverSat, 134 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 25325.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 2110.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred in iteration=0, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 26.2ms AutomataMinimizationTime, 15 MinimizatonAttempts, 429 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 61 NumberOfFragments, 1522 HoareAnnotationTreeSize, 24 FomulaSimplifications, 4626 FormulaSimplificationTreeSizeReduction, 56.8ms HoareSimplificationTime, 24 FomulaSimplificationsInter, 1678 FormulaSimplificationTreeSizeReductionInter, 2344.4ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 139.0ms SsaConstructionTime, 5846.6ms SatisfiabilityAnalysisTime, 2248.2ms InterpolantComputationTime, 1027 NumberOfCodeBlocks, 1027 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1012 ConstructedInterpolants, 0 QuantifiedInterpolants, 7181 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 201 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 21146.9ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 3.0ms, AutomataDifference: 16311.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 1650.2ms, InitialAbstractionConstructionTime: 1.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2297 SDtfs, 2761 SDslu, 3292 SDs, 0 SdLazy, 720 SolverSat, 101 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 15113.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2060.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred in iteration=0, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 17.2ms AutomataMinimizationTime, 11 MinimizatonAttempts, 321 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 59 NumberOfFragments, 1533 HoareAnnotationTreeSize, 24 FomulaSimplifications, 1742 FormulaSimplificationTreeSizeReduction, 27.8ms HoareSimplificationTime, 24 FomulaSimplificationsInter, 560 FormulaSimplificationTreeSizeReductionInter, 1617.5ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 100.0ms SsaConstructionTime, 643.5ms SatisfiabilityAnalysisTime, 2323.2ms InterpolantComputationTime, 692 NumberOfCodeBlocks, 692 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 681 ConstructedInterpolants, 0 QuantifiedInterpolants, 8144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 201 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 14930.7ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 4.9ms, AutomataDifference: 8012.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 1952.4ms, InitialAbstractionConstructionTime: 1.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2888 SDtfs, 3437 SDslu, 5220 SDs, 0 SdLazy, 771 SolverSat, 88 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 7172.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1260.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred in iteration=0, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 28.2ms AutomataMinimizationTime, 14 MinimizatonAttempts, 580 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 58 NumberOfFragments, 1747 HoareAnnotationTreeSize, 24 FomulaSimplifications, 8286 FormulaSimplificationTreeSizeReduction, 43.1ms HoareSimplificationTime, 24 FomulaSimplificationsInter, 3038 FormulaSimplificationTreeSizeReductionInter, 1904.8ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 169.4ms SsaConstructionTime, 2717.8ms SatisfiabilityAnalysisTime, 1930.4ms InterpolantComputationTime, 1007 NumberOfCodeBlocks, 1007 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 993 ConstructedInterpolants, 0 QuantifiedInterpolants, 3941 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 201 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 3310.9ms, OverallIterations: 5, TraceHistogramMax: 1, EmptinessCheckTime: 1.8ms, AutomataDifference: 2636.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 91.8ms, InitialAbstractionConstructionTime: 1.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1275 SDtfs, 668 SDslu, 1275 SDs, 0 SdLazy, 280 SolverSat, 48 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2428.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 65.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 6.8ms AutomataMinimizationTime, 5 MinimizatonAttempts, 168 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 45 NumberOfFragments, 90 HoareAnnotationTreeSize, 24 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 9.3ms HoareSimplificationTime, 24 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 79.3ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 47.0ms SsaConstructionTime, 179.1ms SatisfiabilityAnalysisTime, 288.6ms InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 281 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 1988]: Loop Invariant [2021-07-05 17:00:20,091 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,092 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,092 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,092 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,092 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,092 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,092 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,092 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,093 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,093 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,093 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,093 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,093 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,094 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,094 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,094 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,094 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,094 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,094 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,094 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((\result + 1 <= 0 && #memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4]) && buf == buf) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old]) && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && ((((((((((buf == buf && buf == 0) && buf == buf) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0) || (((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0))) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && buf == buf) && !(buf == 0)) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf] - InvariantResult [Line: 7489]: Loop Invariant [2021-07-05 17:00:20,095 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,095 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,095 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,095 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,095 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,095 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,095 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,095 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,096 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,096 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,096 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,096 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,096 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,096 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,096 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,096 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,097 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((1 <= \result && ((((#memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4] && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && !(buf == 0)) || ((((((((((((!(#memory_$Pointer$[buffer][buf + 4] == 0) && ptr == buf + 4) && \result == 0) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && !(buffer == 0)) && !(buf == 0)) && \result == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) && newptr == 0)) || ((((((((((((newptr == 0 && !(#memory_$Pointer$[buffer][buf + 4] == 0)) && ptr == buf + 4) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && #Ultimate.C_realloc_#res == 0) && \result == 0) && !(buffer == 0)) && !(buf == 0)) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity))) && \result <= 1) && buf == buf) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old]) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && buf == buf) && !(buf == 0)) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf] - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((((((buf == buf && buf == 0) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && 0 <= s_can_fail_allocator_static) && s_can_fail_allocator_static == 0) && buf == 0) && \valid[buf] == 1) && !(buf == 0)) && s_can_fail_allocator_static <= 0 - InvariantResult [Line: 7137]: Loop Invariant [2021-07-05 17:00:20,098 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,098 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,098 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,101 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,101 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,101 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,101 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,101 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,101 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,101 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,102 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,102 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,102 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,102 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,102 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,103 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,103 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,103 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,103 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,103 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,103 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,103 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,104 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,104 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,104 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,104 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,104 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,104 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,104 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,105 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,105 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,105 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,105 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,105 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,105 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,105 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,105 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,105 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,105 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,105 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,106 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,106 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,107 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,107 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,107 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,107 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,107 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,107 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,107 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,110 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,111 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,111 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,111 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,111 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,111 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,112 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,112 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,112 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,112 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,112 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,114 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,114 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,114 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,114 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,114 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,115 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,115 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,115 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,115 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,116 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,116 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,116 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,116 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,117 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,117 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,117 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,117 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,117 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,118 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,118 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,119 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,120 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,121 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,121 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,121 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,121 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,121 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,122 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((buf == buf && buf == 0) && requested_capacity == newsize) && !(#Ultimate.C_realloc_#res == 0)) && ptr == 4) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buffer == 0) && buffer == ptr) && \result == s_can_fail_allocator_static) && buf == 0) && newsize == requested_capacity) && !(#memory_$Pointer$[buffer][4] == 0)) && !(newptr == 0)) && !(\result == 0)) && !(#Ultimate.C_realloc_ptr == 0)) && !(buffer == 0)) && !(buf == 0)) && !(\result == 0)) && !(ptr == 0)) && s_can_fail_allocator_static <= 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) || ((((((((((((((((((((((((newptr == 0 && buf == buf) && buf == 0) && requested_capacity == newsize) && ptr == 4) && s_can_fail_allocator_static == #memory_$Pointer$[buf][16 + buf]) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buffer == 0) && buffer == ptr) && \result == s_can_fail_allocator_static) && buf == 0) && newsize == requested_capacity) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(#memory_$Pointer$[ptr][ptr] == 0)) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && !(ptr == 0)) && s_can_fail_allocator_static <= 0) && buf == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) && newptr == 0)) && s_can_fail_allocator_static == #memory_$Pointer$[buf][16 + buf]) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && buf == ptr) || ((\result + 1 <= 0 && ((((((((((((((((((((((buf == buf && buf == 0) && requested_capacity == newsize) && !(#Ultimate.C_realloc_#res == 0)) && ptr == 4) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buffer == 0) && buffer == ptr) && \result == s_can_fail_allocator_static) && buf == 0) && newsize == requested_capacity) && !(#memory_$Pointer$[buffer][4] == 0)) && !(newptr == 0)) && !(\result == 0)) && !(#Ultimate.C_realloc_ptr == 0)) && !(buffer == 0)) && !(buf == 0)) && !(\result == 0)) && !(ptr == 0)) && s_can_fail_allocator_static <= 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) || ((((((((((((((((((((((((newptr == 0 && buf == buf) && buf == 0) && requested_capacity == newsize) && ptr == 4) && s_can_fail_allocator_static == #memory_$Pointer$[buf][16 + buf]) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buffer == 0) && buffer == ptr) && \result == s_can_fail_allocator_static) && buf == 0) && newsize == requested_capacity) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(#memory_$Pointer$[ptr][ptr] == 0)) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && !(ptr == 0)) && s_can_fail_allocator_static <= 0) && buf == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) && newptr == 0))) && \result + 1 <= 0)) && buf == buf) && buf == 0) && requested_capacity == requested_capacity) && buf == buf) && (((((((((\result + 1 <= 0 && requested_capacity == newsize) && buf == 0) && newsize == requested_capacity) && \result + 1 <= 0) && !(buffer == 0)) && !(buf == 0)) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) || ((((((((((((((((((!(buffer == ptr) && buf == buf) && buf == 0) && requested_capacity == newsize) && buf == buf) && buffer == 0) && buf == buffer) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && 4294967296 * ((unknown-#memory_int-unknown[ptr][buffer] + requested_capacity * -1 + 4294967296 + requested_capacity / 4294967296 * 4294967296) / 4294967296) <= unknown-#memory_int-unknown[ptr][buffer]) && unknown-#memory_int-unknown[ptr][buffer] <= 4294967296 * (unknown-#memory_int-unknown[ptr][buffer] / 4294967296)) && !(\result == 0)) && !(#Ultimate.C_realloc_ptr == 0)) && !(buffer == 0)) && !(buf == 0)) && !(ptr == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= ptr) && buf == 0)) || ((((((((((((((((((((((!(buffer == ptr) && buf == buf) && buf == 0) && requested_capacity == newsize) && !(#Ultimate.C_realloc_#res == 0)) && ptr == 4) && buf == buf) && buffer == 0) && buf == buffer) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && !(#memory_$Pointer$[buffer][4] == 0)) && 4294967296 * ((unknown-#memory_int-unknown[ptr][buffer] + requested_capacity * -1 + 4294967296 + requested_capacity / 4294967296 * 4294967296) / 4294967296) <= unknown-#memory_int-unknown[ptr][buffer]) && !(newptr == 0)) && !(\result == 0)) && !(#Ultimate.C_realloc_ptr == 0)) && !(buffer == 0)) && !(buf == 0)) && !(\result == 0)) && !(ptr == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= ptr) && buf == 0))) && buffer == buf) && buf == 0) && !(\result == 0)) && ((((((((((((((((((((requested_capacity == newsize && !(#Ultimate.C_realloc_#res == 0)) && requested_capacity == requested_capacity) && ptr == 4) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && s_can_fail_allocator_static == 0) && buffer == buf) && buffer == ptr) && newsize == requested_capacity) && !(#memory_$Pointer$[buffer][4] == 0)) && !(newptr == 0)) && !(#Ultimate.C_realloc_ptr == 0)) && (((((((((buf == buf && buf == 0) && buf == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(\result == 0)) && !(buffer == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) || ((((((buf == buf && buf == 0) && buf == 0) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && \result == 0))) && buf == buf) && buffer == buf) && !(\result == 0)) && !(ptr == 0)) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) || (((((\result + 1 <= 0 && requested_capacity == newsize) && newsize == requested_capacity) && \result + 1 <= 0) && (((((((((buf == buf && buf == 0) && buf == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(\result == 0)) && !(buffer == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) || ((((((buf == buf && buf == 0) && buf == 0) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && \result == 0))) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity)) || ((((((((((((((((((requested_capacity == newsize && !(#Ultimate.C_realloc_#res == 0)) && ptr == 4) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && s_can_fail_allocator_static == 0) && buffer == ptr) && newsize == requested_capacity) && !(#memory_$Pointer$[buffer][4] == 0)) && buf == ptr) && !(newptr == 0)) && !(#Ultimate.C_realloc_ptr == 0)) && (((((((((buf == buf && buf == 0) && buf == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(\result == 0)) && !(buffer == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) || ((((((buf == buf && buf == 0) && buf == 0) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && \result == 0))) && buffer == buf) && !(\result == 0)) && !(ptr == 0)) && buf == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity))) && buf == buf) && buffer == buf) && !(buf == 0)) && (((((((((((((((((buf == buf && !(#Ultimate.C_realloc_#res == buf)) && (!(ptr == \old) || !(16 + \old == ptr))) && buf == buf) && !(buffer == \old + 12)) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#StackHeapBarrier-unknown + 1 <= \old) && buffer == 0) && buffer == ptr) && !(buffer == \old + 4)) && buf == 0) && buf == ptr) && !(ptr == 16 + buf)) && #memory_$Pointer$[ptr][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && !(#Ultimate.C_realloc_#res == \old)) && (((#memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf] && !(buffer == 0)) && !(buf == 0)) || ((!(buffer == 0) && !(buf == 0)) && \result == 0))) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) || ((((((((((!(16 + \old == ptr) || !(buffer == \old)) && buffer == 0) && buffer == ptr) && buf == 0) && buffer < \old + 1) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && buf == ptr) && !(ptr == 16 + buf)) && (((#memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf] && !(buffer == 0)) && !(buf == 0)) || ((!(buffer == 0) && !(buf == 0)) && \result == 0))) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]))) && (((((((((((((((requested_capacity == newsize && buffer == 0) && buffer == buf) && buf == buffer) && buffer == ptr) && newsize == requested_capacity) && \valid[buf] == 1) && unknown-#memory_int-unknown[ptr][buf] <= unknown-#memory_int-unknown[\old][\old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf]) && !(buffer == \old)) && !(ptr == buf)) && buf == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) && (((((unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old] && buf == 0) && !(buffer == 0)) && !(buf == 0)) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf]) || (((buf == 0 && !(buffer == 0)) && !(buf == 0)) && \result == 0))) || (((((\result + 1 <= 0 && requested_capacity == newsize) && newsize == requested_capacity) && \result + 1 <= 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) && (((((unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old] && buf == 0) && !(buffer == 0)) && !(buf == 0)) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf]) || (((buf == 0 && !(buffer == 0)) && !(buf == 0)) && \result == 0)))) || (((((((((((((((((buf == buf && requested_capacity == newsize) && (!(ptr == \old) || !(buffer == \old))) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#StackHeapBarrier-unknown + 1 <= \old) && buffer == 0) && buffer == ptr) && newsize == requested_capacity) && unknown-#memory_int-unknown[ptr][buf] <= unknown-#memory_int-unknown[\old][\old]) && buf == ptr) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf]) && !(#Ultimate.C_realloc_#res == \old)) && !(ptr == buf)) && buf == 0) && \old <= 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) && (((((unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old] && buf == 0) && !(buffer == 0)) && !(buf == 0)) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf]) || (((buf == 0 && !(buffer == 0)) && !(buf == 0)) && \result == 0))))) && ((((((((((((!(#memory_$Pointer$[buffer][buf + 4] == 0) && ptr == buf + 4) && \result == 0) && buffer == 0) && buffer == buf) && buffer == ptr) && newsize == requested_capacity) && (((buf == 0 && !(buf == 0)) && \result == 0) || (((#memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4] && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && buf == 0) && !(buf == 0)))) && \result == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) && newptr == 0) || ((((((((((newptr == 0 && !(#memory_$Pointer$[buffer][buf + 4] == 0)) && ptr == buf + 4) && buffer == 0) && buffer == buf) && buffer == ptr) && newsize == requested_capacity) && #Ultimate.C_realloc_#res == 0) && \result == 0) && (((buf == 0 && !(buf == 0)) && \result == 0) || (((#memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4] && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && buf == 0) && !(buf == 0)))) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity)) || ((((((((\result + 1 <= 0 && ptr == buf + 4) && buffer == 0) && buffer == buf) && buffer == ptr) && newsize == requested_capacity) && \result + 1 <= 0) && (((buf == 0 && !(buf == 0)) && \result == 0) || (((#memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4] && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && buf == 0) && !(buf == 0)))) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity))) && (((((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && buffer == 0) && buf == buffer) && !(\result == 0)) && unknown-#memory_int-unknown[buffer][buffer] <= 4294967296 * (unknown-#memory_int-unknown[buffer][buffer] / 4294967296)) && buf == buf) && unknown-#memory_int-unknown[buffer][12] <= 4294967294 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][12]) / 4294967296)) && !(buffer == 0)) && !(buf == 0)) && buf == 0) || ((((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && buffer == 0) && buf == buffer) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && unknown-#memory_int-unknown[buffer][12] <= 4294967294 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][12]) / 4294967296)) && !(buffer == 0)) && !(buf == 0)) && unknown-#memory_int-unknown[buffer][buffer] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] * -1 + unknown-#memory_int-unknown[buffer][buffer] / 4294967296 * 4294967296 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0)) || (((buf == 0 && !(buffer == 0)) && !(buf == 0)) && \result == 0)) - InvariantResult [Line: 8176]: Loop Invariant [2021-07-05 17:00:20,127 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,127 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,127 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,128 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,128 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,128 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,128 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,129 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,129 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,129 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,129 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,130 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,130 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,130 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,130 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,130 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,131 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,131 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,131 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,131 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,131 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,132 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,132 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,132 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,132 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,132 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,133 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,133 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,133 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,133 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,133 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,136 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,136 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,136 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,136 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,136 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,136 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,138 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,138 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,138 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,138 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,138 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,138 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,139 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,141 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,141 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,141 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,142 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,142 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,142 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,143 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,143 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,143 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,143 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,143 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,144 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,144 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,144 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,144 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,145 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,145 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,145 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,145 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,146 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,146 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,146 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,146 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,146 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,147 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,147 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,147 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,147 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,147 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,148 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,152 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,153 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,153 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,153 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,153 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,153 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,153 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,154 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,154 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,154 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,154 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,154 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,154 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,155 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,155 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,155 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,155 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,155 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,155 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,155 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,155 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,156 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,156 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,156 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,156 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,156 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((buf == buf && !(buf == \old)) && ((((((((((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && unknown-#memory_int-unknown[buffer][buffer] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][buffer]) / 4294967296)) && buffer == 0) && unknown-#memory_int-unknown[buf][buf] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf]) / 4294967296)) && unknown-#memory_int-unknown[buffer][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][12]) / 4294967296)) && buf == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && unknown-#memory_int-unknown[buffer][buffer] <= unknown-#memory_int-unknown[buffer][12] + 4294967296 * ((unknown-#memory_int-unknown[buffer][buffer] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buffer][12] * -1) / 4294967296)) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0) || ((((((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && buffer == 0) && unknown-#memory_int-unknown[buffer][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][12]) / 4294967296)) && buf == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && unknown-#memory_int-unknown[buffer][buffer] <= 4294967296 * (unknown-#memory_int-unknown[buffer][buffer] / 4294967296)) && !(buffer == 0)) && !(buf == 0)) && buf == 0)) || ((((((((((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0) && buf == buf) && buffer == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && buf == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0))) && #memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4]) && buf == buf) && (((((((((((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0) && buf == buf) && buffer == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && buf == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0) || (((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && buffer == 0) && buf == buffer) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buffer][buffer + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][12]) / 4294967296)) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && buf == 0))) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old]) && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && unknown-#StackHeapBarrier-unknown + 1 <= \old) && buffer == 0) && buffer == buf) && buf == buffer) && buf == 0) && buffer < \old + 1) && \valid[buf] == 1) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && buf == buf) && (((((((((((((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0) && buf == buf) && buffer == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && buffer < s_can_fail_allocator_static + 1) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && buf == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0) || ((((((((((((((((buf == buf && buf == 0) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buffer == 0) && buffer == buf) && \result == s_can_fail_allocator_static) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && #memory_$Pointer$[buffer][16] == s_can_fail_allocator_static) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && buf == 0))) && ((((((((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && requested_capacity == requested_capacity) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && s_can_fail_allocator_static == 0) && buffer == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && buf == buf) && buffer == buf) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0) || (((((((((((((((((((1 <= \result && buf == buf) && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && \result <= 1) && #memory_$Pointer$[buf][16 + buf] == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0) && buf == buf) && s_can_fail_allocator_static == 0) && buffer == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0)) || (((((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && s_can_fail_allocator_static == 0) && buffer == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && buf == buf) && buffer == buf) && !(buf == 0)) && buf == 0))) && !(buf == 0)) && (((((((((((((((buf == buf && buf == 0) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && buffer == 0) && buf == buffer) && unknown-#memory_int-unknown[buf][buf] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf]) / 4294967296)) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && buf == 0) || (((((((((((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && buffer == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && buf == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0)) || ((((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && buffer == 0) && buf == buffer) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && buf == 0))) && buf == 0) && \old <= 0) && (((((((((((buf == buf && buf == 0) && requested_capacity == requested_capacity) && buf == buf) && buffer == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && buffer == buf) && !(buf == 0)) && buf == 0) || ((((((((((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0) && buf == buf) && buffer == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && buf == 0) && #memory_$Pointer$[buffer][buffer + 16] == 0))) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf] - InvariantResult [Line: 7489]: Loop Invariant [2021-07-05 17:00:20,158 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,158 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,159 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,159 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,159 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,159 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,160 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,160 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,160 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,160 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,160 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,161 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,161 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,161 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,161 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,161 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,162 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,162 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,162 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,162 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,162 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,162 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,163 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,164 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,164 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,164 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,164 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,164 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,164 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,164 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,165 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,165 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,165 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,165 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,165 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,165 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,165 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,166 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,166 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,166 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,166 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,166 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,166 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,169 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,169 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,169 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,170 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,170 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,170 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,170 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,170 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,171 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,171 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,171 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,171 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,171 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,172 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,172 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,172 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,172 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,172 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,173 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,173 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,173 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,173 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,173 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,173 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,173 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,174 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,174 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,174 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,174 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,174 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,174 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,174 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,175 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,175 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,175 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,175 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,175 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,175 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,176 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,176 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,176 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,176 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,176 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,176 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,176 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,177 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,177 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,177 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,177 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((0 <= \result && buf == buf) && buf == 0) && buffer == 0) && buf == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result <= 0) && !(\result == 0)) && !(buffer == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) && buf == 0) || (((((((((((((((buf == buf && buf == 0) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && s_can_fail_allocator_static == 0) && buffer == buf) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && buffer == buf) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) && buf == 0)) || (((((((((((((((buf == buf && buf == 0) && requested_capacity == requested_capacity) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && s_can_fail_allocator_static == 0) && buffer == buf) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && buffer == buf) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) && buf == 0)) && (((((((((((((0 <= \result && buf == buf) && buf == 0) && buffer == 0) && buf == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result <= 0) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && buf == 0) || ((((((((((((buf == buf && 4294967296 * (((unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295 + unknown-#memory_int-unknown[buf][buf]) / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && buf == 0) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && buffer == 0) && buf == buffer) && buf == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && buf == 0))) && buf == buf) && !(buf == \old)) && #memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4]) && (((((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && buffer == 0) && buf == buffer) && buf == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) && unknown-#memory_int-unknown[buffer][buffer] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] * -1 + unknown-#memory_int-unknown[buffer][buffer] / 4294967296 * 4294967296 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0) || ((((((((((((0 <= \result && buf == buf) && buf == 0) && buffer == 0) && buf == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result <= 0) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && buf == 0))) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old]) && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && unknown-#StackHeapBarrier-unknown + 1 <= \old) && buffer == 0) && buffer == buf) && buf == buffer) && (((((((((((buf == buf && buf == 0) && requested_capacity == requested_capacity) && buf == buf) && buffer == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && buffer == buf) && !(buf == 0)) && buf == 0) || ((((((((((((0 <= \result && buf == buf) && buf == 0) && buffer == 0) && buf == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result <= 0) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && buf == 0))) && buf == 0) && buffer < \old + 1) && (((((((((((((((((buf == buf && buf == 0) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buffer == 0) && buffer == buf) && \result == s_can_fail_allocator_static) && buf == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && #memory_$Pointer$[buffer][16] == s_can_fail_allocator_static) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && buf == 0) || ((((((((((((0 <= \result && buf == buf) && buf == 0) && buffer == 0) && buf == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result <= 0) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && buf == 0))) && \valid[buf] == 1) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && buf == buf) && !(buf == 0)) && buf == 0) && \old <= 0) && ((((((((((((((((((((buf == buf && buf == 0) && 4294967296 * ((unknown-#memory_int-unknown[buf][buf] + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && 4294967296 * ((4294967295 + unknown-#memory_int-unknown[buf][buf]) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && 4294967296 * ((unknown-#memory_int-unknown[buffer][buffer] + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[buffer][buffer]) && buffer == 0) && unknown-#memory_int-unknown[buffer][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][12]) / 4294967296)) && buf == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) && buf == 0) || (((((((((((((((((((unknown-#memory_int-unknown[buf][buf] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf]) / 4294967296) && buf == buf) && buf == 0) && unknown-#memory_int-unknown[buffer][buffer] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][buffer]) / 4294967296)) && buffer == 0) && unknown-#memory_int-unknown[buf][buf] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf]) / 4294967296)) && unknown-#memory_int-unknown[buffer][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][12]) / 4294967296)) && buf == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && unknown-#memory_int-unknown[buffer][buffer] <= unknown-#memory_int-unknown[buffer][12] + 4294967296 * ((unknown-#memory_int-unknown[buffer][buffer] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buffer][12] * -1) / 4294967296)) && !(\result == 0)) && !(buffer == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0)) && unknown-#memory_int-unknown[buffer][buffer] <= 4294967296 * (unknown-#memory_int-unknown[buffer][buffer] / 4294967296)) || ((1 <= \result && \result <= 1) && (((((((((((((((((buf == buf && buf == 0) && 4294967296 * ((unknown-#memory_int-unknown[buf][buf] + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && 4294967296 * ((4294967295 + unknown-#memory_int-unknown[buf][buf]) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && 4294967296 * ((unknown-#memory_int-unknown[buffer][buffer] + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[buffer][buffer]) && buffer == 0) && unknown-#memory_int-unknown[buffer][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][12]) / 4294967296)) && buf == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) && buf == 0) || (((((((((((((((((((unknown-#memory_int-unknown[buf][buf] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf]) / 4294967296) && buf == buf) && buf == 0) && unknown-#memory_int-unknown[buffer][buffer] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][buffer]) / 4294967296)) && buffer == 0) && unknown-#memory_int-unknown[buf][buf] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf]) / 4294967296)) && unknown-#memory_int-unknown[buffer][12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][12]) / 4294967296)) && buf == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && unknown-#memory_int-unknown[buffer][buffer] <= unknown-#memory_int-unknown[buffer][12] + 4294967296 * ((unknown-#memory_int-unknown[buffer][buffer] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buffer][12] * -1) / 4294967296)) && !(\result == 0)) && !(buffer == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0)))) || ((((((((((((0 <= \result && buf == buf) && buf == 0) && buffer == 0) && buf == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result <= 0) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && buf == 0))) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf] - InvariantResult [Line: 6965]: Loop Invariant [2021-07-05 17:00:20,180 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,180 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,180 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,180 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,180 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,181 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,181 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,181 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,181 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,181 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,181 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,181 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,182 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,182 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,182 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,182 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,182 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,182 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,183 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,183 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,183 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,183 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,183 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,183 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,184 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,184 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,184 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,184 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,184 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,184 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,184 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,185 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,185 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,185 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,185 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,185 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,185 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,185 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,185 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,186 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,186 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,186 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,186 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,188 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,189 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,189 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,189 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,189 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,189 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,189 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,190 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,190 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,190 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,190 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,190 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,190 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,191 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,191 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,191 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,191 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,191 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,191 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,192 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,192 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,192 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,192 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,192 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,192 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,193 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,193 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,193 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,193 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,193 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,193 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,194 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,194 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,195 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,195 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,195 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((buf == buf && ((((((((((((((((((((!(buffer == ptr) && buf == buf) && 4294967296 * (((unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295 + unknown-#memory_int-unknown[buf][buf]) / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && buf == 0) && requested_capacity == newsize) && buf == buf) && buffer == 0) && buf == buffer) && buffer == ptr) && newsize == requested_capacity) && 4294967296 * ((unknown-#memory_int-unknown[ptr][buffer] + requested_capacity * -1 + 4294967296 + requested_capacity / 4294967296 * 4294967296) / 4294967296) <= unknown-#memory_int-unknown[ptr][buffer]) && unknown-#memory_int-unknown[ptr][buffer] <= 4294967296 * (unknown-#memory_int-unknown[ptr][buffer] / 4294967296)) && !(\result == 0)) && !(#Ultimate.C_realloc_ptr == 0)) && buf == buf) && !(buf == 0)) && !(ptr == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= ptr) && buf == 0) || ((((((((((((((((((((!(buffer == ptr) && buf == buf) && 4294967296 * (((unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295 + unknown-#memory_int-unknown[buf][buf]) / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && buf == 0) && requested_capacity == newsize) && !(#Ultimate.C_realloc_#res == 0)) && ptr == 4) && buf == buf) && buffer == 0) && buf == buffer) && buffer == ptr) && newsize == requested_capacity) && 4294967296 * ((unknown-#memory_int-unknown[ptr][buffer] + requested_capacity * -1 + 4294967296 + requested_capacity / 4294967296 * 4294967296) / 4294967296) <= unknown-#memory_int-unknown[ptr][buffer]) && !(\result == 0)) && !(#Ultimate.C_realloc_ptr == 0)) && buf == buf) && !(buf == 0)) && !(\result == 0)) && !(ptr == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= ptr) && buf == 0)) || (((((((requested_capacity == newsize && buf == 0) && newsize == requested_capacity) && \result == 0) && !(buffer == 0)) && !(buf == 0)) && \result == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity))) && buf == 0) && requested_capacity == requested_capacity) && buf == buf) && (((((((((((((ptr == buf + 4 && !(#Ultimate.C_realloc_#res == 0)) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && #Ultimate.C_realloc_#res == 0) && \result == 0) && !(buf == 0)) && !(\result == 0)) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) || (((((((((((ptr == buf + 4 && \result == 0) && #memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4]) && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && !(buf == 0)) && \result == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity)) || (((((((((((ptr == buf + 4 && #memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4]) && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && \result == 0) && !(buf == 0)) && \result == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity))) && buffer == buf) && buf == 0) && ((((((((((((((((((((((buf == buf && buf == 0) && requested_capacity == newsize) && !(#Ultimate.C_realloc_#res == 0)) && requested_capacity == requested_capacity) && 4294967296 * (newsize / 4294967296) < newsize) && ptr == 4) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && s_can_fail_allocator_static == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && !(\result == 0)) && !(#Ultimate.C_realloc_ptr == 0)) && buf == buf) && buffer == buf) && !(buf == 0)) && !(\result == 0)) && !(ptr == 0)) || (((((((((((((buf == buf && buf == 0) && requested_capacity == newsize) && buf == 0) && newsize == requested_capacity) && !(#memory_$Pointer$[buf][4] == 0)) && \result == 0) && !(\result == 0)) && !(buffer == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && \result == 0) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity)) || ((((((((((((((((((((buf == buf && buf == 0) && requested_capacity == newsize) && !(#Ultimate.C_realloc_#res == 0)) && 4294967296 * (newsize / 4294967296) < newsize) && ptr == 4) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && s_can_fail_allocator_static == 0) && buffer == ptr) && newsize == requested_capacity) && buf == ptr) && !(\result == 0)) && !(#Ultimate.C_realloc_ptr == 0)) && buf == buf) && buffer == buf) && !(buf == 0)) && !(\result == 0)) && !(ptr == 0)) && buf == 0))) && ((((((((((((((((((((((buf == buf && requested_capacity == newsize) && !(#Ultimate.C_realloc_#res == 0)) && (!(ptr == \old) || !(buffer == \old))) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#StackHeapBarrier-unknown + 1 <= \old) && buffer == 0) && buffer == ptr) && newsize == requested_capacity) && unknown-#memory_int-unknown[ptr][buf] <= unknown-#memory_int-unknown[\old][\old]) && buf == ptr) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf]) && buf == buf) && !(#Ultimate.C_realloc_#res == \old)) && !(buf == 0)) && !(\result == 0)) && !(ptr == buf)) && buf == 0) && \old <= 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) || (((((((((requested_capacity == newsize && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old]) && buf == 0) && newsize == requested_capacity) && \result == 0) && !(buffer == 0)) && !(buf == 0)) && \result == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf])) || ((((((((((((((((requested_capacity == newsize && !(#Ultimate.C_realloc_#res == 0)) && buffer == 0) && buffer == buf) && buf == buffer) && buffer == ptr) && newsize == requested_capacity) && \valid[buf] == 1) && unknown-#memory_int-unknown[ptr][buf] <= unknown-#memory_int-unknown[\old][\old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf]) && buf == buf) && !(buffer == \old)) && !(buf == 0)) && !(\result == 0)) && !(ptr == buf)) && buf == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity))) && (((((((((((((((((((((((buf == buf && buf == 0) && requested_capacity == newsize) && !(#Ultimate.C_realloc_#res == 0)) && ptr == 4) && s_can_fail_allocator_static == #memory_$Pointer$[buf][16 + buf]) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buffer == 0) && buffer == ptr) && \result == s_can_fail_allocator_static) && buf == 0) && newsize == requested_capacity) && buf == ptr) && !(\result == 0)) && !(#Ultimate.C_realloc_ptr == 0)) && !(buf == 0)) && !(\result == 0)) && !(ptr == 0)) && s_can_fail_allocator_static <= 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) || ((((((((((((((((((((((((buf == buf && buf == 0) && requested_capacity == newsize) && ptr == 4) && s_can_fail_allocator_static == #memory_$Pointer$[buf][16 + buf]) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buffer == 0) && buffer == ptr) && \result == s_can_fail_allocator_static) && buf == 0) && newsize == requested_capacity) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(#memory_$Pointer$[ptr][ptr] == 0)) && \result == 0) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && \result == 0) && !(ptr == 0)) && s_can_fail_allocator_static <= 0) && buf == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity))) && !(\result == 0)) && buf == buf) && buffer == buf) && (((((((((((((((((((buf == buf && !(#Ultimate.C_realloc_#res == buf)) && (!(ptr == \old) || !(16 + \old == ptr))) && !(#Ultimate.C_realloc_#res == 0)) && buf == buf) && !(buffer == \old + 12)) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#StackHeapBarrier-unknown + 1 <= \old) && buffer == 0) && buffer == ptr) && !(buffer == \old + 4)) && buf == 0) && buf == ptr) && !(ptr == 16 + buf)) && #memory_$Pointer$[ptr][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && !(#Ultimate.C_realloc_#res == \old)) && !(buf == 0)) && !(\result == 0)) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) || ((((((((((!(16 + \old == ptr) || !(buffer == \old)) && buffer == 0) && buffer == ptr) && buf == 0) && buffer < \old + 1) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && buf == ptr) && !(ptr == 16 + buf)) && !(buf == 0)) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]))) && (((((((((((((buf == buf && buf == 0) && !(#Ultimate.C_realloc_#res == 0)) && buf == buf) && buffer == 0) && buf == buffer) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && !(\result == 0)) && buf == 0) || (((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && buffer == 0) && buf == buffer) && !(\result == 0)) && unknown-#memory_int-unknown[buffer][buffer] <= 4294967296 * (unknown-#memory_int-unknown[buffer][buffer] / 4294967296)) && buf == buf) && unknown-#memory_int-unknown[buffer][12] <= 4294967294 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][12]) / 4294967296)) && !(buffer == 0)) && !(buf == 0)) && buf == 0)) || ((((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && buffer == 0) && buf == buffer) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && unknown-#memory_int-unknown[buffer][12] <= 4294967294 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][12]) / 4294967296)) && !(buffer == 0)) && !(buf == 0)) && unknown-#memory_int-unknown[buffer][buffer] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] * -1 + unknown-#memory_int-unknown[buffer][buffer] / 4294967296 * 4294967296 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0))) && !(buf == 0) - InvariantResult [Line: 6653]: Loop Invariant [2021-07-05 17:00:20,197 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,197 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,198 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,198 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,198 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,198 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,198 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,198 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,199 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,199 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,199 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,199 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,199 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,199 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,200 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,200 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,200 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,200 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,200 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,201 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,201 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,201 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,201 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,201 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,201 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,201 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,202 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,202 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((buf == buf && ((((#memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4] && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && !(buf == 0)) || ((((((((((((!(#memory_$Pointer$[buffer][buf + 4] == 0) && ptr == buf + 4) && \result == 0) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && !(buffer == 0)) && !(buf == 0)) && \result == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) && newptr == 0)) || ((((((((((((newptr == 0 && !(#memory_$Pointer$[buffer][buf + 4] == 0)) && ptr == buf + 4) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && #Ultimate.C_realloc_#res == 0) && \result == 0) && !(buffer == 0)) && !(buf == 0)) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity))) && 1 <= \result) && buf == 0) && \result <= 1) && s_can_fail_allocator_static == #memory_$Pointer$[buf][16 + buf]) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old]) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buf == 0) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && ((((((((buf == buf && buf == 0) && buf == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) || (((((((buf == buf && buf == 0) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && buf == 0) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295))) && s_can_fail_allocator_static <= 0) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf] - InvariantResult [Line: 8175]: Loop Invariant [2021-07-05 17:00:20,202 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,202 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,202 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,203 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,203 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,203 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,203 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,203 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,203 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,203 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,203 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,204 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,204 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,204 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,205 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,205 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,205 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,205 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,205 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,205 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,205 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,206 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,206 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,206 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,206 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,206 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,206 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,206 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((#memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4] && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && !(buf == 0)) || ((((((((((((newptr == 0 && !(#memory_$Pointer$[buffer][buf + 4] == 0)) && \result == 0) && ptr == buf + 4) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && #Ultimate.C_realloc_#res == 0) && \result == 0) && !(buf == 0)) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity)) || ((((((((((((!(#memory_$Pointer$[buffer][buf + 4] == 0) && \result == 0) && ptr == buf + 4) && \result == 0) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && !(buf == 0)) && \result == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) && newptr == 0)) && ((\result + 1 <= 0 && !(buf == 0)) || ((((((((((buf == buf && buf == 0) && requested_capacity == requested_capacity) && buf == buf) && buffer == buf) && buf == 0) && !(\result == 0)) && buf == buf) && buffer == buf) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((requested_capacity * -1 + unknown-#memory_int-unknown[buf][buf + 12] + requested_capacity / 4294967296 * 4294967296) / 4294967296) + 4294967295))) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old]) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && ((((((((((((buf == buf && buf == 0) && s_can_fail_allocator_static == #memory_$Pointer$[buf][16 + buf]) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buf == 0) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && s_can_fail_allocator_static <= 0) || (\result + 1 <= 0 && !(buf == 0)))) && !(buf == 0)) && ((((((((buf == buf && buf == 0) && buf == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) || (((((((buf == buf && buf == 0) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && buf == 0) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295))) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf] - InvariantResult [Line: 1988]: Loop Invariant [2021-07-05 17:00:20,207 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,207 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,207 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,207 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,207 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,208 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,208 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,208 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,208 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,208 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,208 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,208 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,209 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,209 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,209 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,209 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,209 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,209 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((\result + 1 <= 0 && buf == buf) && buf == 0) && #memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4]) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old]) && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && buf == 0) && !(#memory_$Pointer$[buf][4] == 0)) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf] - InvariantResult [Line: -1]: Loop Invariant [2021-07-05 17:00:20,209 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,210 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,210 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,210 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,210 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,211 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,211 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,211 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,211 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,211 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,211 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,212 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,212 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,212 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,212 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,212 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,212 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,213 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,213 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,213 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,213 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,213 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,213 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,213 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,213 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,213 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,214 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,214 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,215 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,216 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,216 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,216 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,216 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,217 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,217 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,217 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,217 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,217 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,217 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,217 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,218 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,218 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,218 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,218 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,218 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,218 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,219 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,219 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,219 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,219 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,219 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,219 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,219 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,219 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,219 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,219 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((((((((((buf == buf && buf == 0) && requested_capacity == newsize) && ptr == buf + 4) && !(#Ultimate.C_realloc_#res == 0)) && requested_capacity == requested_capacity) && (((((((((((buf == buf && buf == 0) && !(#Ultimate.C_realloc_#res == 0)) && buf == buf) && buffer == 0) && buf == buffer) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && buf == 0) || (((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && buffer == 0) && buf == buffer) && !(\result == 0)) && unknown-#memory_int-unknown[buffer][buffer] <= 4294967296 * (unknown-#memory_int-unknown[buffer][buffer] / 4294967296)) && buf == buf) && unknown-#memory_int-unknown[buffer][12] <= 4294967294 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][12]) / 4294967296)) && !(buffer == 0)) && !(buf == 0)) && buf == 0))) && ((((((((((((((((((((buf == buf && buf == 0) && requested_capacity == newsize) && !(#Ultimate.C_realloc_#res == 0)) && requested_capacity == requested_capacity) && ptr == 4) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && s_can_fail_allocator_static == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && !(\result == 0)) && !(#Ultimate.C_realloc_ptr == 0)) && buf == buf) && buffer == buf) && !(buf == 0)) && !(ptr == 0)) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) || (((((((((((((((((((buf == buf && buf == 0) && requested_capacity == newsize) && !(#Ultimate.C_realloc_#res == 0)) && ptr == 4) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && s_can_fail_allocator_static == 0) && buffer == ptr) && newsize == requested_capacity) && buf == ptr) && !(\result == 0)) && !(#Ultimate.C_realloc_ptr == 0)) && buf == buf) && buffer == buf) && !(buf == 0)) && !(ptr == 0)) && buf == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity))) && ptr == 4) && s_can_fail_allocator_static == #memory_$Pointer$[buf][16 + buf]) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buffer == 0) && buffer == buf) && buffer == ptr) && \result == s_can_fail_allocator_static) && buf == 0) && newsize == requested_capacity) && #Ultimate.C_realloc_#res == 0) && buf == ptr) && !(\result == 0)) && !(#Ultimate.C_realloc_ptr == 0)) && buf == buf) && buffer == buf) && !(buf == 0)) && !(ptr == 0)) && s_can_fail_allocator_static <= 0) && ((((((((((((((((((((!(buffer == ptr) && buf == buf) && 4294967296 * (((unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295 + unknown-#memory_int-unknown[buf][buf]) / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && buf == 0) && requested_capacity == newsize) && !(#Ultimate.C_realloc_#res == 0)) && ptr == 4) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && buffer == 0) && buf == buffer) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && 4294967296 * ((unknown-#memory_int-unknown[ptr][buffer] + requested_capacity * -1 + 4294967296 + requested_capacity / 4294967296 * 4294967296) / 4294967296) <= unknown-#memory_int-unknown[ptr][buffer]) && !(\result == 0)) && !(#Ultimate.C_realloc_ptr == 0)) && !(buf == 0)) && !(ptr == 0)) && buf == 0) || ((((((((((((((((((!(buffer == ptr) && buf == buf) && 4294967296 * (((unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295 + unknown-#memory_int-unknown[buf][buf]) / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && buf == 0) && requested_capacity == newsize) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && buffer == 0) && buf == buffer) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && 4294967296 * ((unknown-#memory_int-unknown[ptr][buffer] + requested_capacity * -1 + 4294967296 + requested_capacity / 4294967296 * 4294967296) / 4294967296) <= unknown-#memory_int-unknown[ptr][buffer]) && unknown-#memory_int-unknown[ptr][buffer] <= 4294967296 * (unknown-#memory_int-unknown[ptr][buffer] / 4294967296)) && !(\result == 0)) && !(#Ultimate.C_realloc_ptr == 0)) && !(buf == 0)) && !(ptr == 0)) && buf == 0))) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) && ((((((((((((((((((((buf == buf && requested_capacity == newsize) && !(#Ultimate.C_realloc_#res == 0)) && (!(ptr == \old) || !(buffer == \old))) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#StackHeapBarrier-unknown + 1 <= \old) && buffer == 0) && buffer == ptr) && newsize == requested_capacity) && unknown-#memory_int-unknown[ptr][buf] <= unknown-#memory_int-unknown[\old][\old]) && buf == ptr) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf]) && buf == buf) && !(#Ultimate.C_realloc_#res == \old)) && !(buf == 0)) && !(ptr == buf)) && buf == 0) && \old <= 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) || (((((((((((((((requested_capacity == newsize && !(#Ultimate.C_realloc_#res == 0)) && buffer == 0) && buffer == buf) && buf == buffer) && buffer == ptr) && newsize == requested_capacity) && \valid[buf] == 1) && unknown-#memory_int-unknown[ptr][buf] <= unknown-#memory_int-unknown[\old][\old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf]) && buf == buf) && !(buffer == \old)) && !(buf == 0)) && !(ptr == buf)) && buf == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity))) && ((((((((((((((((((buf == buf && !(#Ultimate.C_realloc_#res == buf)) && (!(ptr == \old) || !(16 + \old == ptr))) && !(#Ultimate.C_realloc_#res == 0)) && buf == buf) && !(buffer == \old + 12)) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#StackHeapBarrier-unknown + 1 <= \old) && buffer == 0) && buffer == ptr) && !(buffer == \old + 4)) && buf == 0) && buf == ptr) && !(ptr == 16 + buf)) && #memory_$Pointer$[ptr][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && !(#Ultimate.C_realloc_#res == \old)) && !(buf == 0)) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) || (((((((((((!(16 + \old == ptr) || !(buffer == \old)) && !(#Ultimate.C_realloc_#res == 0)) && buffer == 0) && buffer == ptr) && buf == 0) && buffer < \old + 1) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && buf == ptr) && !(ptr == 16 + buf)) && !(buf == 0)) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old])) - InvariantResult [Line: 7489]: Loop Invariant [2021-07-05 17:00:20,221 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,221 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,221 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,222 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,222 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,222 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,222 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,222 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,223 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,223 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,223 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,223 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,223 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,223 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,224 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,224 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,224 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,224 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,224 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,224 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,225 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,225 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,225 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,225 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,225 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,225 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,225 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,226 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,227 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,227 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,228 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,228 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,228 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,228 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,229 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,229 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,229 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,229 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,230 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr : $Pointer$ not handled [2021-07-05 17:00:20,230 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,230 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,230 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,230 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,230 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,231 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,232 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,232 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,232 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled Derived loop invariant: (((((((((((((((((((((((((((((((((((buf == buf && buf == 0) && requested_capacity == newsize) && !(#Ultimate.C_realloc_#res == 0)) && ptr == 4) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && s_can_fail_allocator_static == 0) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && buf == ptr) && !(newptr == 0)) && !(\result == 0)) && !(#Ultimate.C_realloc_ptr == 0)) && buffer == buf) && 4294967296 * (unknown-#memory_int-unknown[buf][buf + 12] / 4294967296) + 1 <= unknown-#memory_int-unknown[buf][buf + 12]) && !(buffer == 0)) && !(buf == 0)) && !(\result == 0)) && !(ptr == 0)) && buf == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) || ((((((((((((((((((((((((((((1 <= \result && buf == buf) && buf == 0) && requested_capacity == newsize) && \result <= 1) && !(#Ultimate.C_realloc_#res == 0)) && requested_capacity == requested_capacity) && ptr == 4) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && s_can_fail_allocator_static == 0) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(newptr == 0)) && !(\result == 0)) && !(#Ultimate.C_realloc_ptr == 0)) && 4294967296 * (unknown-#memory_int-unknown[buf][buf + 12] / 4294967296) + 1 <= unknown-#memory_int-unknown[buf][buf + 12]) && !(buffer == 0)) && !(buf == 0)) && !(\result == 0)) && !(ptr == 0)) && buf == 0) && 4294967296 * ((4294967295 + requested_capacity / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf] + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && unknown-#memory_int-unknown[buf][12] <= requested_capacity) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity)) || (((((((((((((((((((((0 <= \result && buf == buf) && buf == 0) && requested_capacity == newsize) && !(#Ultimate.C_realloc_#res == 0)) && ptr == 4) && s_can_fail_allocator_static == 0) && buffer == 0) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result <= 0) && !(newptr == 0)) && !(\result == 0)) && !(#Ultimate.C_realloc_ptr == 0)) && !(buffer == 0)) && !(buf == 0)) && !(\result == 0)) && !(ptr == 0)) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity)) && 1 <= \result) && \result <= 1) && (((((((((((((((((((((((buf == buf && buf == 0) && requested_capacity == newsize) && 0 <= s_can_fail_allocator_static) && buf == 0) && newsize == requested_capacity) && !(\result == 0)) && !(#Ultimate.C_realloc_ptr == 0)) && !(buffer == 0)) && !(buf == 0)) && !(ptr == 0)) && s_can_fail_allocator_static <= 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) || ((((((((((((buf == buf && buf == 0) && requested_capacity == newsize) && 0 <= s_can_fail_allocator_static) && buf == 0) && newsize == requested_capacity) && !(#memory_$Pointer$[buf][4] == 0)) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && !(ptr == 0)) && s_can_fail_allocator_static <= 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity)) && ptr == 4) && s_can_fail_allocator_static == #memory_$Pointer$[buf][16 + buf]) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buffer == 0) && buffer == ptr) && \result == s_can_fail_allocator_static) && buf == ptr) || (((((((0 <= \result && buf == buf) && buf == 0) && buf == 0) && \result <= 0) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)))) && buf == 0) && (((((((((((((((((buf == buf && !(#Ultimate.C_realloc_#res == buf)) && (!(ptr == \old) || !(16 + \old == ptr))) && buf == buf) && !(buffer == \old + 12)) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#StackHeapBarrier-unknown + 1 <= \old) && buffer == 0) && buffer == ptr) && !(buffer == \old + 4)) && buf == 0) && buf == ptr) && !(ptr == 16 + buf)) && #memory_$Pointer$[ptr][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && !(#Ultimate.C_realloc_#res == \old)) && !(buf == 0)) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) || ((((((((((!(16 + \old == ptr) || !(buffer == \old)) && buffer == 0) && buffer == ptr) && buf == 0) && buffer < \old + 1) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && buf == ptr) && !(ptr == 16 + buf)) && !(buf == 0)) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]))) && ((((((((((((newptr == 0 && !(#memory_$Pointer$[buffer][buf + 4] == 0)) && ptr == buf + 4) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && #Ultimate.C_realloc_#res == 0) && \result == 0) && !(buf == 0)) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) || (((((((((((!(#memory_$Pointer$[buffer][buf + 4] == 0) && ptr == buf + 4) && \result == 0) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && !(buf == 0)) && \result == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) && newptr == 0))) && !(buffer == 0)) && !(buf == 0)) && ((((((((((((((((requested_capacity == newsize && buffer == 0) && buffer == buf) && buf == buffer) && buffer == ptr) && newsize == requested_capacity) && \valid[buf] == 1) && unknown-#memory_int-unknown[ptr][buf] <= unknown-#memory_int-unknown[\old][\old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf]) && buf == buf) && !(buffer == 0)) && !(buffer == \old)) && !(buf == 0)) && !(ptr == buf)) && buf == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) || (((((((((((((((((((buf == buf && requested_capacity == newsize) && (!(ptr == \old) || !(buffer == \old))) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#StackHeapBarrier-unknown + 1 <= \old) && buffer == 0) && buffer == ptr) && newsize == requested_capacity) && unknown-#memory_int-unknown[ptr][buf] <= unknown-#memory_int-unknown[\old][\old]) && buf == ptr) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf]) && buf == buf) && !(buffer == 0)) && !(#Ultimate.C_realloc_#res == \old)) && !(buf == 0)) && !(ptr == buf)) && buf == 0) && \old <= 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity))) && ((((((((0 <= \result && buf == buf) && buf == 0) && buf == 0) && \result <= 0) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) || (((((((((((buf == buf && buf == 0) && requested_capacity == requested_capacity) && buf == buf) && buffer == buf) && buf == 0) && !(\result == 0)) && buf == buf) && buffer == buf) && !(buffer == 0)) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((requested_capacity * -1 + unknown-#memory_int-unknown[buf][buf + 12] + requested_capacity / 4294967296 * 4294967296) / 4294967296) + 4294967295)) - InvariantResult [Line: 6943]: Loop Invariant [2021-07-05 17:00:20,234 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,234 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,234 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,234 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,234 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,234 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,235 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,235 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,235 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,235 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,235 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,235 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((buf == buf && buf == 0) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && (((((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && 0 <= s_can_fail_allocator_static) && buf == 0) && !(\result == 0)) && !(buf == 0)) && s_can_fail_allocator_static <= 0) || (((((((((((buf == buf && buf == 0) && s_can_fail_allocator_static == #memory_$Pointer$[buf][16 + buf]) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buf == 0) && !(\result == 0)) && !(buf == 0)) && s_can_fail_allocator_static <= 0))) && buf == 0) && \valid[buf] == 1) && !(\result == 0)) && !(buf == 0)) && (((((((buf == buf && buf == 0) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && s_can_fail_allocator_static == 0) && buf == 0) && !(\result == 0)) && !(buf == 0)) || (((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && s_can_fail_allocator_static == 0) && buf == 0) && !(\result == 0)) && !(buf == 0))) - InvariantResult [Line: 1988]: Loop Invariant [2021-07-05 17:00:20,236 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,236 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,236 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,236 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,236 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,237 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,237 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,237 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,237 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,237 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,238 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,238 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,238 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,238 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,239 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,239 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,239 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,239 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,240 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,240 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,240 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,240 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,240 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,240 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,241 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,241 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,241 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,241 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((newptr == 0 && \result + 1 <= 0) && buf == buf) && buf == 0) && requested_capacity == newsize) && ptr == buf + 4) && (!(16 + \old == ptr) || !(buffer == \old))) && requested_capacity == requested_capacity) && #memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4]) && ptr == 4) && s_can_fail_allocator_static == #memory_$Pointer$[buf][16 + buf]) && buf == buf) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old]) && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buffer == 0) && buffer == buf) && buffer == ptr) && \result == s_can_fail_allocator_static) && buf == 0) && buffer < \old + 1) && ((((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && buffer == 0) && buf == buffer) && !(\result == 0)) && unknown-#memory_int-unknown[buffer][buffer] <= 4294967296 * (unknown-#memory_int-unknown[buffer][buffer] / 4294967296)) && buf == buf) && unknown-#memory_int-unknown[buffer][12] <= 4294967294 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][12]) / 4294967296)) && !(buffer == 0)) && !(buf == 0)) && buf == 0) || ((((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && buffer == 0) && buf == buffer) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && unknown-#memory_int-unknown[buffer][12] <= 4294967294 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][12]) / 4294967296)) && !(buffer == 0)) && !(buf == 0)) && unknown-#memory_int-unknown[buffer][buffer] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] * -1 + unknown-#memory_int-unknown[buffer][buffer] / 4294967296 * 4294967296 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0))) && newsize == requested_capacity) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && buf == ptr) && !(ptr == 16 + buf)) && !(#memory_$Pointer$[ptr][ptr] == 0)) && !(\result == 0)) && buf == buf) && buffer == buf) && !(buffer == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) && !(ptr == 0)) && s_can_fail_allocator_static <= 0) && buf == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && newptr == 0) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf] - InvariantResult [Line: 7489]: Loop Invariant [2021-07-05 17:00:20,242 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,242 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,242 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,242 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,242 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,243 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,243 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,243 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,243 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,243 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,243 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,243 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,244 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,244 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,244 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,244 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,244 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,244 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,245 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,245 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,245 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,245 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,245 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,245 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,245 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,245 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,245 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,246 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,246 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,246 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,247 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,247 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,248 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,248 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,248 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,248 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,248 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,248 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,249 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,249 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,249 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,249 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,249 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,249 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,249 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,250 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,250 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,250 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,250 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,250 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,250 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,250 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,251 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,251 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,251 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,251 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,251 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,251 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,251 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,251 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((buf == buf && buf == 0) && (((((((((((0 <= \result && buf == buf) && buf == 0) && buf == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result <= 0) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0) || (((((((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && buf == buf) && 0 <= s_can_fail_allocator_static) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && buf == 0)) || ((((((((((((((buf == buf && buf == 0) && s_can_fail_allocator_static == #memory_$Pointer$[buf][16 + buf]) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && buf == 0))) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && (((((((((((0 <= \result && buf == buf) && buf == 0) && buf == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result <= 0) && !(\result == 0)) && !(buf == 0)) && buf == 0) || ((((((((((((((1 <= \result && buf == buf) && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && \result <= 1) && #memory_$Pointer$[buf][16 + buf] == 0) && buf == buf) && s_can_fail_allocator_static == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0)) || (((((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && s_can_fail_allocator_static == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0))) && buf == 0) && \valid[buf] == 1) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && (((((((((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0) || (((((((((0 <= \result && buf == buf) && buf == 0) && buf == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result <= 0) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0)) || (((((((((buf == buf && buf == 0) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#memory_int-unknown[buf][buf] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf]) / 4294967296)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0)) || ((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0))) && (((((((((((0 <= \result && buf == buf) && buf == 0) && buf == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result <= 0) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0) || (((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && buf == 0)) || (((((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && buf == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0))) && (((((((((((0 <= \result && buf == buf) && buf == 0) && buf == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result <= 0) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0) || ((((((((((1 <= \result && buf == buf) && buf == 0) && \result <= 1) && buf == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0)) || (((((((((buf == buf && #memory_$Pointer$[buf][16 + buf] == 0) && buf == 0) && #memory_$Pointer$[buf][16 + buf] == 0) && buf == buf) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && buf == buf) && !(buf == 0)) && buf == 0))) && buf == 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9157]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6950]: Loop Invariant [2021-07-05 17:00:20,253 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,253 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,253 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,253 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,253 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,254 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,254 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,254 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,254 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,254 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,254 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,254 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,255 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,255 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,255 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,256 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,256 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,256 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,256 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,256 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,256 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res : $Pointer$ not handled [2021-07-05 17:00:20,257 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,257 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,257 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,257 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,257 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,257 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,257 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((buf == buf && ((((#memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4] && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && !(buf == 0)) || ((((((((((((!(#memory_$Pointer$[buffer][buf + 4] == 0) && ptr == buf + 4) && \result == 0) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && !(buffer == 0)) && !(buf == 0)) && \result == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) && newptr == 0)) || ((((((((((((newptr == 0 && !(#memory_$Pointer$[buffer][buf + 4] == 0)) && ptr == buf + 4) && buffer == 0) && buffer == buf) && buffer == ptr) && buf == 0) && newsize == requested_capacity) && #Ultimate.C_realloc_#res == 0) && \result == 0) && !(buffer == 0)) && !(buf == 0)) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity))) && buf == 0) && s_can_fail_allocator_static == #memory_$Pointer$[buf][16 + buf]) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old]) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && \result == buf->allocator) && \result == s_can_fail_allocator_static) && buf == 0) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && ((((((((buf == buf && buf == 0) && buf == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) || (((((((buf == buf && buf == 0) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && buf == 0) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295))) && \result == buf->allocator) && s_can_fail_allocator_static <= 0) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf] - InvariantResult [Line: 7489]: Loop Invariant [2021-07-05 17:00:20,258 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,258 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,258 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,259 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,259 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,259 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,259 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,259 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,259 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,260 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,260 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,260 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,260 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,260 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,260 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,260 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,260 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,261 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((1 <= \result && \result <= 1) && #memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4]) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old]) && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && buf == 0) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && !(buffer == 0)) && !(buf == 0)) && ((((((((buf == buf && buf == 0) && buf == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) || (((((((buf == buf && buf == 0) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && buf == 0) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295))) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf] - InvariantResult [Line: 268]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 261]: Loop Invariant [2021-07-05 17:00:20,261 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,261 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,261 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,262 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,262 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,262 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,262 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,262 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,263 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,263 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,263 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,263 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,263 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,263 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,264 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,264 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,264 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,264 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,264 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,264 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,266 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,266 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,266 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,266 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,266 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,266 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,267 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,267 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,267 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,269 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,269 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,269 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,269 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,270 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,270 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,270 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,270 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,270 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,270 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,270 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,271 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,271 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,271 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,271 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,271 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,272 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,272 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,272 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,272 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,272 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,272 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,273 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,273 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,273 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,273 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,273 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,273 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,274 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,274 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,274 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,274 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,274 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,274 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,275 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((1 <= \result && buf == buf) && buf == 0) && requested_capacity == newsize) && \result <= 1) && ptr == buf + 4) && (!(16 + \old == ptr) || !(buffer == \old))) && requested_capacity == requested_capacity) && #memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4]) && ptr == 4) && s_can_fail_allocator_static == #memory_$Pointer$[buf][16 + buf]) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && 0 <= s_can_fail_allocator_static) && unknown-#StackHeapBarrier-unknown + 1 <= \old) && \result == s_can_fail_allocator_static) && buffer == 0) && buffer == buf) && buf == buffer) && buffer == ptr) && \result == s_can_fail_allocator_static) && buf == 0) && buffer < \old + 1) && newsize == requested_capacity) && \valid[buf] == 1) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && unknown-#memory_int-unknown[ptr][buf] <= unknown-#memory_int-unknown[\old][\old]) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && buf == ptr) && !(ptr == 16 + buf)) && !(#memory_$Pointer$[ptr][ptr] == 0)) && (((((((((((((((((((((buf == buf && buf == 0) && requested_capacity == newsize) && ptr == 4) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf] / 4294967296)) && s_can_fail_allocator_static == 0) && buffer == ptr) && newsize == requested_capacity) && buf == ptr) && !(#memory_$Pointer$[ptr][ptr] == 0)) && !(\result == 0)) && buf == buf) && buffer == buf) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) && !(ptr == 0)) && buf == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) || ((((((((((((((((((((buf == buf && buf == 0) && requested_capacity == newsize) && requested_capacity == requested_capacity) && ptr == 4) && buf == buf) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && s_can_fail_allocator_static == 0) && buffer == buf) && buffer == ptr) && newsize == requested_capacity) && !(#memory_$Pointer$[ptr][ptr] == 0)) && !(\result == 0)) && buf == buf) && buffer == buf) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) && !(ptr == 0)) && buf == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity))) && !(\result == 0)) && buf == buf) && buffer == buf) && unknown-#memory_int-unknown[buffer][12] <= 4294967294 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][12]) / 4294967296)) && !(buffer == \old)) && !(buf == 0)) && !(ptr == buf)) && !(ptr == 0)) && ((((ptr == 4 && ((((((((((((((((((((((!(buffer == ptr) && buf == buf) && buf == 0) && requested_capacity == newsize) && 4294967296 * ((unknown-#memory_int-unknown[buf][buf] + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && buf == buf) && buf == buffer) && !(#memory_$Pointer$[buffer][buffer + 4] == 0)) && newsize == requested_capacity) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(#memory_$Pointer$[ptr][ptr] == 0)) && !(\result == 0)) && 4294967296 * ((4294967295 + unknown-#memory_int-unknown[ptr][buffer]) / 4294967296) <= unknown-#memory_int-unknown[ptr][buffer]) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && !(ptr == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= ptr) && buf == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) || (((((((((((((((((((((((!(buffer == ptr) && buf == buf) && 4294967296 * (((unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295 + unknown-#memory_int-unknown[buf][buf]) / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && buf == 0) && requested_capacity == newsize) && buf == buf) && unknown-#memory_int-unknown[buffer][buffer] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][buffer]) / 4294967296)) && buf == buffer) && unknown-#memory_int-unknown[buf][buf] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf]) / 4294967296)) && !(#memory_$Pointer$[buffer][buffer + 4] == 0)) && newsize == requested_capacity) && !(#memory_$Pointer$[buffer][4] == 0)) && 4294967296 * ((unknown-#memory_int-unknown[ptr][buffer] + requested_capacity * -1 + 4294967296 + requested_capacity / 4294967296 * 4294967296) / 4294967296) <= unknown-#memory_int-unknown[ptr][buffer]) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(#memory_$Pointer$[ptr][ptr] == 0)) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && !(ptr == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= ptr) && buf == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity))) && buffer == 0) && buffer == ptr) || (((((((((((((((((((((((((!(buffer == ptr) && buf == buf) && buf == 0) && requested_capacity == newsize) && 4294967296 * ((unknown-#memory_int-unknown[buf][buf] + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && buf == buf) && buf == buffer) && !(#memory_$Pointer$[buffer][buffer + 4] == 0)) && newsize == requested_capacity) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(#memory_$Pointer$[ptr][ptr] == 0)) && !(\result == 0)) && 4294967296 * ((4294967295 + unknown-#memory_int-unknown[ptr][buffer]) / 4294967296) <= unknown-#memory_int-unknown[ptr][buffer]) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && !(ptr == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= ptr) && buf == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) || (((((((((((((((((((((((!(buffer == ptr) && buf == buf) && 4294967296 * (((unknown-#memory_int-unknown[buf][buf + 12] * -1 + 4294967295 + unknown-#memory_int-unknown[buf][buf]) / 4294967296 * 4294967296 + unknown-#memory_int-unknown[buf][buf + 12]) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && buf == 0) && requested_capacity == newsize) && buf == buf) && unknown-#memory_int-unknown[buffer][buffer] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buffer][buffer]) / 4294967296)) && buf == buffer) && unknown-#memory_int-unknown[buf][buf] <= 4294967295 + 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][buf]) / 4294967296)) && !(#memory_$Pointer$[buffer][buffer + 4] == 0)) && newsize == requested_capacity) && !(#memory_$Pointer$[buffer][4] == 0)) && 4294967296 * ((unknown-#memory_int-unknown[ptr][buffer] + requested_capacity * -1 + 4294967296 + requested_capacity / 4294967296 * 4294967296) / 4294967296) <= unknown-#memory_int-unknown[ptr][buffer]) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(#memory_$Pointer$[ptr][ptr] == 0)) && !(\result == 0)) && buf == buf) && !(buffer == 0)) && !(buf == 0)) && !(ptr == 0)) && unknown-#StackHeapBarrier-unknown + 1 <= ptr) && buf == 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity)) && buffer == 0) && buffer == ptr) && unknown-#memory_int-unknown[ptr][buffer] <= 4294967296 * (unknown-#memory_int-unknown[ptr][buffer] / 4294967296)))) && unknown-#memory_int-unknown[buffer][buffer] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] * -1 + unknown-#memory_int-unknown[buffer][buffer] / 4294967296 * 4294967296 + 4294967295) / 4294967296) + unknown-#memory_int-unknown[buf][buf + 12]) && s_can_fail_allocator_static <= 0) && buf == 0) && \old <= 0) && 4294967296 * (requested_capacity / 4294967296) + 1 <= requested_capacity) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf] - InvariantResult [Line: 6950]: Loop Invariant Derived loop invariant: (((((((((buf == buf && buf == 0) && unknown-#StackHeapBarrier-unknown + 1 <= buf) && 0 <= s_can_fail_allocator_static) && s_can_fail_allocator_static == 0) && \result == s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buf == 0) && \valid[buf] == 1) && !(buf == 0)) && s_can_fail_allocator_static <= 0 - InvariantResult [Line: 7489]: Loop Invariant [2021-07-05 17:00:20,277 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,277 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,277 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,277 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,277 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,278 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,278 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,278 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,278 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,278 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,278 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,278 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,279 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,279 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,279 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,279 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,279 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,279 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,279 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,279 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,280 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,280 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,280 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,281 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,281 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,281 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,281 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,281 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,281 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,281 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,282 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,282 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,282 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,282 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,282 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,282 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-07-05 17:00:20,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-07-05 17:00:20,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((1 <= \result && buf == buf) && ((((((((((((buf == buf && buf == 0) && requested_capacity == requested_capacity) && buf == buf) && buffer == 0) && buffer == buf) && buf == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && !(buf == 0)) && buf == 0) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((requested_capacity * -1 + unknown-#memory_int-unknown[buf][buf + 12] + requested_capacity / 4294967296 * 4294967296) / 4294967296) + 4294967295) || ((((((((((((0 <= \result && buf == buf) && buf == 0) && buffer == 0) && buf == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result <= 0) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && buf == 0))) && buf == 0) && \result <= 1) && #memory_$Pointer$[buf][buf + 4] == #memory_$Pointer$[\old][\old + 4]) && (((((((((((((0 <= \result && buf == buf) && buf == 0) && buffer == 0) && buf == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result <= 0) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && buf == 0) || ((((((((((((((((buf == buf && buf == 0) && s_can_fail_allocator_static == #memory_$Pointer$[buf][16 + buf]) && #memory_$Pointer$[buf][16 + buf] == s_can_fail_allocator_static) && 0 <= s_can_fail_allocator_static) && \result == s_can_fail_allocator_static) && buffer == 0) && \result == s_can_fail_allocator_static) && buf == 0) && !(#memory_$Pointer$[buffer][4] == 0)) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(\result == 0)) && !(buffer == 0)) && !(buf == 0)) && s_can_fail_allocator_static <= 0) && buf == 0))) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[\old][\old]) && #memory_$Pointer$[\old][\old + 4] == #memory_$Pointer$[buf][buf + 4]) && buf == 0) && !(#memory_$Pointer$[buf][4] == 0)) && #memory_$Pointer$[\old][16 + \old] == #memory_$Pointer$[buf][16 + buf]) && !(\result == 0)) && !(buffer == 0)) && unknown-#memory_int-unknown[buf][buf] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295 + unknown-#memory_int-unknown[buf][12] * -1) / 4294967296) + unknown-#memory_int-unknown[buf][12]) && !(buf == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((-1 + unknown-#memory_int-unknown[buf][12]) / 4294967296) + 4294967295) && #memory_$Pointer$[buf][16 + buf] == #memory_$Pointer$[\old][16 + \old]) && unknown-#memory_int-unknown[\old][\old] <= unknown-#memory_int-unknown[buf][buf] - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2021-07-05 17:00:20,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...