./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/unreach-call.prp --file /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_eq_byte_buf_ignore_case_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 87fd6ee1 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 /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_eq_byte_buf_ignore_case_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 26345e67fe6012e34d49d02da53ff5ee2c1af552 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-87fd6ee [2020-12-04 19:22:39,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-04 19:22:39,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-04 19:22:39,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-04 19:22:39,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-04 19:22:39,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-04 19:22:39,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-04 19:22:39,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-04 19:22:39,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-04 19:22:39,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-04 19:22:39,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-04 19:22:39,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-04 19:22:39,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-04 19:22:39,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-04 19:22:39,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-04 19:22:39,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-04 19:22:39,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-04 19:22:39,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-04 19:22:39,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-04 19:22:39,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-04 19:22:39,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-04 19:22:39,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-04 19:22:39,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-04 19:22:39,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-04 19:22:39,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-04 19:22:39,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-04 19:22:39,489 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-04 19:22:39,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-04 19:22:39,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-04 19:22:39,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-04 19:22:39,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-04 19:22:39,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-04 19:22:39,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-04 19:22:39,496 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-04 19:22:39,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-04 19:22:39,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-04 19:22:39,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-04 19:22:39,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-04 19:22:39,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-04 19:22:39,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-04 19:22:39,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-04 19:22:39,503 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-04 19:22:39,545 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-04 19:22:39,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-04 19:22:39,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-04 19:22:39,548 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-04 19:22:39,548 INFO L138 SettingsManager]: * Use SBE=true [2020-12-04 19:22:39,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-04 19:22:39,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-04 19:22:39,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-04 19:22:39,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-04 19:22:39,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-04 19:22:39,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-04 19:22:39,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-04 19:22:39,551 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-04 19:22:39,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-04 19:22:39,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-04 19:22:39,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-04 19:22:39,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-04 19:22:39,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-04 19:22:39,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-04 19:22:39,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-04 19:22:39,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-04 19:22:39,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-04 19:22:39,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-04 19:22:39,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-04 19:22:39,555 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-04 19:22:39,555 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 -> 26345e67fe6012e34d49d02da53ff5ee2c1af552 [2020-12-04 19:22:39,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-04 19:22:40,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-04 19:22:40,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-04 19:22:40,017 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-04 19:22:40,018 INFO L275 PluginConnector]: CDTParser initialized [2020-12-04 19:22:40,019 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_eq_byte_buf_ignore_case_harness.i [2020-12-04 19:22:40,104 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99ede06af/cff3669c7f3849b898be242c6871af31/FLAG53bb4a0bb [2020-12-04 19:22:41,210 INFO L306 CDTParser]: Found 1 translation units. [2020-12-04 19:22:41,213 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_eq_byte_buf_ignore_case_harness.i [2020-12-04 19:22:41,271 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99ede06af/cff3669c7f3849b898be242c6871af31/FLAG53bb4a0bb [2020-12-04 19:22:41,585 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99ede06af/cff3669c7f3849b898be242c6871af31 [2020-12-04 19:22:41,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-04 19:22:41,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-04 19:22:41,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-04 19:22:41,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-04 19:22:41,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-04 19:22:41,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.12 07:22:41" (1/1) ... [2020-12-04 19:22:41,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed36ee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 07:22:41, skipping insertion in model container [2020-12-04 19:22:41,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.12 07:22:41" (1/1) ... [2020-12-04 19:22:41,614 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-04 19:22:41,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-04 19:22:42,080 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_eq_byte_buf_ignore_case_harness.i[4508,4521] [2020-12-04 19:22:42,090 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_eq_byte_buf_ignore_case_harness.i[4568,4581] [2020-12-04 19:22:42,117 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-04 19:22:42,125 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2020-12-04 19:22:43,018 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:43,020 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:43,020 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:43,021 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:43,023 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:43,040 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:43,041 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:43,043 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:43,044 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:43,489 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-04 19:22:43,491 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-04 19:22:43,492 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-04 19:22:43,494 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-04 19:22:43,495 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-04 19:22:43,496 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-04 19:22:43,497 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-04 19:22:43,498 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-04 19:22:43,499 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-04 19:22:43,500 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2020-12-04 19:22:43,795 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2020-12-04 19:22:43,976 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:43,977 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:44,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-04 19:22:44,253 INFO L203 MainTranslator]: Completed pre-run [2020-12-04 19:22:44,279 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_eq_byte_buf_ignore_case_harness.i[4508,4521] [2020-12-04 19:22:44,283 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_eq_byte_buf_ignore_case_harness.i[4568,4581] [2020-12-04 19:22:44,290 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-04 19:22:44,291 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2020-12-04 19:22:44,325 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:44,326 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:44,326 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:44,326 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:44,327 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:44,333 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:44,333 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:44,334 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:44,335 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:44,408 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-04 19:22:44,409 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-04 19:22:44,410 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-04 19:22:44,411 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-04 19:22:44,411 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-04 19:22:44,412 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-04 19:22:44,413 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-04 19:22:44,413 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-04 19:22:44,414 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-04 19:22:44,414 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2020-12-04 19:22:44,435 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2020-12-04 19:22:44,487 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:44,487 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 19:22:44,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-04 19:22:45,397 INFO L208 MainTranslator]: Completed translation [2020-12-04 19:22:45,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 07:22:45 WrapperNode [2020-12-04 19:22:45,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-04 19:22:45,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-04 19:22:45,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-04 19:22:45,400 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-04 19:22:45,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 07:22:45" (1/1) ... [2020-12-04 19:22:45,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 07:22:45" (1/1) ... [2020-12-04 19:22:45,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-04 19:22:45,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-04 19:22:45,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-04 19:22:45,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-04 19:22:45,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 07:22:45" (1/1) ... [2020-12-04 19:22:45,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 07:22:45" (1/1) ... [2020-12-04 19:22:45,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 07:22:45" (1/1) ... [2020-12-04 19:22:45,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 07:22:45" (1/1) ... [2020-12-04 19:22:45,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 07:22:45" (1/1) ... [2020-12-04 19:22:45,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 07:22:45" (1/1) ... [2020-12-04 19:22:45,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 07:22:45" (1/1) ... [2020-12-04 19:22:45,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-04 19:22:45,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-04 19:22:45,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-04 19:22:45,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-04 19:22:45,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 07:22:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-04 19:22:45,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-04 19:22:45,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-04 19:22:45,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-04 19:22:45,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-04 19:22:45,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-04 19:22:46,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-04 19:22:46,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2020-12-04 19:22:46,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-04 19:22:46,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-04 19:22:46,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-04 19:22:46,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-04 19:22:46,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-04 19:22:55,808 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-04 19:22:55,809 INFO L299 CfgBuilder]: Removed 69 assume(true) statements. [2020-12-04 19:22:55,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 07:22:55 BoogieIcfgContainer [2020-12-04 19:22:55,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-04 19:22:55,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-04 19:22:55,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-04 19:22:55,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-04 19:22:55,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.12 07:22:41" (1/3) ... [2020-12-04 19:22:55,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4335b60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 07:22:55, skipping insertion in model container [2020-12-04 19:22:55,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 07:22:45" (2/3) ... [2020-12-04 19:22:55,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4335b60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 07:22:55, skipping insertion in model container [2020-12-04 19:22:55,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 07:22:55" (3/3) ... [2020-12-04 19:22:55,821 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_buf_ignore_case_harness.i [2020-12-04 19:22:55,838 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-04 19:22:55,844 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-12-04 19:22:55,858 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-12-04 19:22:55,889 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-04 19:22:55,889 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-04 19:22:55,889 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-04 19:22:55,889 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-04 19:22:55,890 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-04 19:22:55,890 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-04 19:22:55,890 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-04 19:22:55,890 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-04 19:22:55,909 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2020-12-04 19:22:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-04 19:22:55,919 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:22:55,920 INFO L422 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] [2020-12-04 19:22:55,921 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:22:55,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:22:55,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1863044394, now seen corresponding path program 1 times [2020-12-04 19:22:55,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:22:55,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848014047] [2020-12-04 19:22:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:22:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:22:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:22:56,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848014047] [2020-12-04 19:22:56,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:22:56,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-04 19:22:56,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889928572] [2020-12-04 19:22:56,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-04 19:22:56,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:22:56,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-04 19:22:56,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-04 19:22:56,814 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 2 states. [2020-12-04 19:22:56,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:22:56,848 INFO L93 Difference]: Finished difference Result 246 states and 344 transitions. [2020-12-04 19:22:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-04 19:22:56,850 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 39 [2020-12-04 19:22:56,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:22:56,862 INFO L225 Difference]: With dead ends: 246 [2020-12-04 19:22:56,862 INFO L226 Difference]: Without dead ends: 121 [2020-12-04 19:22:56,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-04 19:22:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-12-04 19:22:56,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-12-04 19:22:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-12-04 19:22:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 158 transitions. [2020-12-04 19:22:56,919 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 158 transitions. Word has length 39 [2020-12-04 19:22:56,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:22:56,919 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 158 transitions. [2020-12-04 19:22:56,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-04 19:22:56,920 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 158 transitions. [2020-12-04 19:22:56,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-04 19:22:56,922 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:22:56,922 INFO L422 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] [2020-12-04 19:22:56,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-04 19:22:56,923 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:22:56,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:22:56,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1125087472, now seen corresponding path program 1 times [2020-12-04 19:22:56,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:22:56,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644244379] [2020-12-04 19:22:56,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:22:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:22:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:22:57,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644244379] [2020-12-04 19:22:57,401 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:22:57,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-04 19:22:57,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714736017] [2020-12-04 19:22:57,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-04 19:22:57,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:22:57,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-04 19:22:57,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-04 19:22:57,411 INFO L87 Difference]: Start difference. First operand 121 states and 158 transitions. Second operand 4 states. [2020-12-04 19:22:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:22:57,577 INFO L93 Difference]: Finished difference Result 201 states and 265 transitions. [2020-12-04 19:22:57,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-04 19:22:57,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-12-04 19:22:57,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:22:57,585 INFO L225 Difference]: With dead ends: 201 [2020-12-04 19:22:57,585 INFO L226 Difference]: Without dead ends: 121 [2020-12-04 19:22:57,587 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-04 19:22:57,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-12-04 19:22:57,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-12-04 19:22:57,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-12-04 19:22:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 156 transitions. [2020-12-04 19:22:57,600 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 156 transitions. Word has length 39 [2020-12-04 19:22:57,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:22:57,600 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 156 transitions. [2020-12-04 19:22:57,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-04 19:22:57,601 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 156 transitions. [2020-12-04 19:22:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-04 19:22:57,603 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:22:57,603 INFO L422 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] [2020-12-04 19:22:57,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-04 19:22:57,604 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:22:57,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:22:57,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1954908885, now seen corresponding path program 1 times [2020-12-04 19:22:57,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:22:57,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026662081] [2020-12-04 19:22:57,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:22:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:22:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:22:58,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026662081] [2020-12-04 19:22:58,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:22:58,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-04 19:22:58,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031028845] [2020-12-04 19:22:58,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-04 19:22:58,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:22:58,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-04 19:22:58,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-04 19:22:58,065 INFO L87 Difference]: Start difference. First operand 121 states and 156 transitions. Second operand 5 states. [2020-12-04 19:22:58,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:22:58,211 INFO L93 Difference]: Finished difference Result 231 states and 300 transitions. [2020-12-04 19:22:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-04 19:22:58,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2020-12-04 19:22:58,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:22:58,215 INFO L225 Difference]: With dead ends: 231 [2020-12-04 19:22:58,215 INFO L226 Difference]: Without dead ends: 196 [2020-12-04 19:22:58,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-04 19:22:58,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-12-04 19:22:58,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 151. [2020-12-04 19:22:58,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-12-04 19:22:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 197 transitions. [2020-12-04 19:22:58,230 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 197 transitions. Word has length 46 [2020-12-04 19:22:58,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:22:58,231 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 197 transitions. [2020-12-04 19:22:58,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-04 19:22:58,231 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 197 transitions. [2020-12-04 19:22:58,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-04 19:22:58,233 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:22:58,233 INFO L422 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] [2020-12-04 19:22:58,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-04 19:22:58,234 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:22:58,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:22:58,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1522409961, now seen corresponding path program 1 times [2020-12-04 19:22:58,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:22:58,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963692934] [2020-12-04 19:22:58,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:22:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:22:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:22:58,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963692934] [2020-12-04 19:22:58,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:22:58,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-04 19:22:58,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427264862] [2020-12-04 19:22:58,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-04 19:22:58,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:22:58,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-04 19:22:58,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-04 19:22:58,678 INFO L87 Difference]: Start difference. First operand 151 states and 197 transitions. Second operand 4 states. [2020-12-04 19:22:58,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:22:58,728 INFO L93 Difference]: Finished difference Result 305 states and 400 transitions. [2020-12-04 19:22:58,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-04 19:22:58,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2020-12-04 19:22:58,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:22:58,733 INFO L225 Difference]: With dead ends: 305 [2020-12-04 19:22:58,733 INFO L226 Difference]: Without dead ends: 272 [2020-12-04 19:22:58,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-04 19:22:58,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-12-04 19:22:58,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 253. [2020-12-04 19:22:58,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-12-04 19:22:58,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 334 transitions. [2020-12-04 19:22:58,755 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 334 transitions. Word has length 46 [2020-12-04 19:22:58,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:22:58,756 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 334 transitions. [2020-12-04 19:22:58,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-04 19:22:58,756 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 334 transitions. [2020-12-04 19:22:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-04 19:22:58,759 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:22:58,760 INFO L422 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] [2020-12-04 19:22:58,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-04 19:22:58,760 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:22:58,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:22:58,761 INFO L82 PathProgramCache]: Analyzing trace with hash 835614738, now seen corresponding path program 1 times [2020-12-04 19:22:58,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:22:58,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635913301] [2020-12-04 19:22:58,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:22:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:22:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:22:59,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635913301] [2020-12-04 19:22:59,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:22:59,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-04 19:22:59,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084088536] [2020-12-04 19:22:59,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-04 19:22:59,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:22:59,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-04 19:22:59,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-04 19:22:59,532 INFO L87 Difference]: Start difference. First operand 253 states and 334 transitions. Second operand 6 states. [2020-12-04 19:22:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:22:59,768 INFO L93 Difference]: Finished difference Result 382 states and 494 transitions. [2020-12-04 19:22:59,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-04 19:22:59,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2020-12-04 19:22:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:22:59,773 INFO L225 Difference]: With dead ends: 382 [2020-12-04 19:22:59,773 INFO L226 Difference]: Without dead ends: 376 [2020-12-04 19:22:59,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-04 19:22:59,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2020-12-04 19:22:59,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 253. [2020-12-04 19:22:59,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2020-12-04 19:22:59,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 333 transitions. [2020-12-04 19:22:59,788 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 333 transitions. Word has length 51 [2020-12-04 19:22:59,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:22:59,789 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 333 transitions. [2020-12-04 19:22:59,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-04 19:22:59,789 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 333 transitions. [2020-12-04 19:22:59,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-04 19:22:59,791 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:22:59,791 INFO L422 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] [2020-12-04 19:22:59,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-04 19:22:59,792 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:22:59,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:22:59,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1221968138, now seen corresponding path program 1 times [2020-12-04 19:22:59,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:22:59,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217506333] [2020-12-04 19:22:59,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:23:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:23:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:23:00,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217506333] [2020-12-04 19:23:00,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:23:00,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-04 19:23:00,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180892880] [2020-12-04 19:23:00,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-04 19:23:00,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:23:00,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-04 19:23:00,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-04 19:23:00,415 INFO L87 Difference]: Start difference. First operand 253 states and 333 transitions. Second operand 5 states. [2020-12-04 19:23:05,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:23:05,066 INFO L93 Difference]: Finished difference Result 716 states and 943 transitions. [2020-12-04 19:23:05,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-04 19:23:05,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2020-12-04 19:23:05,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:23:05,070 INFO L225 Difference]: With dead ends: 716 [2020-12-04 19:23:05,070 INFO L226 Difference]: Without dead ends: 517 [2020-12-04 19:23:05,071 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-04 19:23:05,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-12-04 19:23:05,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 288. [2020-12-04 19:23:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2020-12-04 19:23:05,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 381 transitions. [2020-12-04 19:23:05,086 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 381 transitions. Word has length 55 [2020-12-04 19:23:05,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:23:05,086 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 381 transitions. [2020-12-04 19:23:05,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-04 19:23:05,087 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 381 transitions. [2020-12-04 19:23:05,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-12-04 19:23:05,088 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:23:05,088 INFO L422 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] [2020-12-04 19:23:05,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-04 19:23:05,089 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:23:05,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:23:05,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1902026508, now seen corresponding path program 1 times [2020-12-04 19:23:05,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:23:05,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745744612] [2020-12-04 19:23:05,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:23:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:23:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:23:09,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745744612] [2020-12-04 19:23:09,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:23:09,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 19:23:09,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571036665] [2020-12-04 19:23:09,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 19:23:09,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:23:09,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 19:23:09,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-04 19:23:09,998 INFO L87 Difference]: Start difference. First operand 288 states and 381 transitions. Second operand 9 states. [2020-12-04 19:23:12,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:23:12,726 INFO L93 Difference]: Finished difference Result 609 states and 809 transitions. [2020-12-04 19:23:12,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-04 19:23:12,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2020-12-04 19:23:12,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:23:12,730 INFO L225 Difference]: With dead ends: 609 [2020-12-04 19:23:12,730 INFO L226 Difference]: Without dead ends: 395 [2020-12-04 19:23:12,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-12-04 19:23:12,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2020-12-04 19:23:12,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 304. [2020-12-04 19:23:12,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-12-04 19:23:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 393 transitions. [2020-12-04 19:23:12,746 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 393 transitions. Word has length 55 [2020-12-04 19:23:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:23:12,746 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 393 transitions. [2020-12-04 19:23:12,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 19:23:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 393 transitions. [2020-12-04 19:23:12,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-04 19:23:12,748 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:23:12,748 INFO L422 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] [2020-12-04 19:23:12,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-04 19:23:12,749 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:23:12,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:23:12,749 INFO L82 PathProgramCache]: Analyzing trace with hash -159373102, now seen corresponding path program 1 times [2020-12-04 19:23:12,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:23:12,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597862363] [2020-12-04 19:23:12,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:23:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:23:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:23:13,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597862363] [2020-12-04 19:23:13,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:23:13,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-04 19:23:13,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266175856] [2020-12-04 19:23:13,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-04 19:23:13,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:23:13,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-04 19:23:13,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-04 19:23:13,365 INFO L87 Difference]: Start difference. First operand 304 states and 393 transitions. Second operand 7 states. [2020-12-04 19:23:13,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:23:13,747 INFO L93 Difference]: Finished difference Result 618 states and 793 transitions. [2020-12-04 19:23:13,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-04 19:23:13,748 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-12-04 19:23:13,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:23:13,751 INFO L225 Difference]: With dead ends: 618 [2020-12-04 19:23:13,751 INFO L226 Difference]: Without dead ends: 386 [2020-12-04 19:23:13,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-04 19:23:13,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2020-12-04 19:23:13,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 304. [2020-12-04 19:23:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-12-04 19:23:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 391 transitions. [2020-12-04 19:23:13,773 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 391 transitions. Word has length 59 [2020-12-04 19:23:13,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:23:13,773 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 391 transitions. [2020-12-04 19:23:13,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-04 19:23:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 391 transitions. [2020-12-04 19:23:13,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-04 19:23:13,775 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:23:13,776 INFO L422 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] [2020-12-04 19:23:13,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-04 19:23:13,777 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:23:13,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:23:13,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1440113991, now seen corresponding path program 1 times [2020-12-04 19:23:13,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:23:13,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697637306] [2020-12-04 19:23:13,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:23:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:23:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:23:14,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697637306] [2020-12-04 19:23:14,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:23:14,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-04 19:23:14,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107571529] [2020-12-04 19:23:14,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-04 19:23:14,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:23:14,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-04 19:23:14,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-04 19:23:14,048 INFO L87 Difference]: Start difference. First operand 304 states and 391 transitions. Second operand 4 states. [2020-12-04 19:23:14,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:23:14,184 INFO L93 Difference]: Finished difference Result 584 states and 751 transitions. [2020-12-04 19:23:14,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-04 19:23:14,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-04 19:23:14,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:23:14,188 INFO L225 Difference]: With dead ends: 584 [2020-12-04 19:23:14,189 INFO L226 Difference]: Without dead ends: 334 [2020-12-04 19:23:14,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-04 19:23:14,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2020-12-04 19:23:14,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 304. [2020-12-04 19:23:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-12-04 19:23:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 385 transitions. [2020-12-04 19:23:14,206 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 385 transitions. Word has length 61 [2020-12-04 19:23:14,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:23:14,206 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 385 transitions. [2020-12-04 19:23:14,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-04 19:23:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 385 transitions. [2020-12-04 19:23:14,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-04 19:23:14,208 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:23:14,208 INFO L422 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] [2020-12-04 19:23:14,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-04 19:23:14,208 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:23:14,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:23:14,209 INFO L82 PathProgramCache]: Analyzing trace with hash 825179645, now seen corresponding path program 1 times [2020-12-04 19:23:14,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:23:14,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959240843] [2020-12-04 19:23:14,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:23:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:23:14,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:23:14,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959240843] [2020-12-04 19:23:14,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:23:14,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-04 19:23:14,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501148812] [2020-12-04 19:23:14,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-04 19:23:14,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:23:14,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-04 19:23:14,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-04 19:23:14,481 INFO L87 Difference]: Start difference. First operand 304 states and 385 transitions. Second operand 4 states. [2020-12-04 19:23:14,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:23:14,620 INFO L93 Difference]: Finished difference Result 609 states and 761 transitions. [2020-12-04 19:23:14,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-04 19:23:14,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-04 19:23:14,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:23:14,623 INFO L225 Difference]: With dead ends: 609 [2020-12-04 19:23:14,623 INFO L226 Difference]: Without dead ends: 353 [2020-12-04 19:23:14,625 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-04 19:23:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2020-12-04 19:23:14,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 296. [2020-12-04 19:23:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-12-04 19:23:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 366 transitions. [2020-12-04 19:23:14,638 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 366 transitions. Word has length 61 [2020-12-04 19:23:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:23:14,640 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 366 transitions. [2020-12-04 19:23:14,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-04 19:23:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 366 transitions. [2020-12-04 19:23:14,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-04 19:23:14,641 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:23:14,641 INFO L422 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] [2020-12-04 19:23:14,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-04 19:23:14,642 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:23:14,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:23:14,643 INFO L82 PathProgramCache]: Analyzing trace with hash -72213633, now seen corresponding path program 1 times [2020-12-04 19:23:14,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:23:14,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012063926] [2020-12-04 19:23:14,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:23:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:23:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:23:15,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012063926] [2020-12-04 19:23:15,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:23:15,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-04 19:23:15,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579063193] [2020-12-04 19:23:15,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-04 19:23:15,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:23:15,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-04 19:23:15,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-12-04 19:23:15,532 INFO L87 Difference]: Start difference. First operand 296 states and 366 transitions. Second operand 10 states. [2020-12-04 19:23:21,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:23:21,509 INFO L93 Difference]: Finished difference Result 822 states and 983 transitions. [2020-12-04 19:23:21,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-12-04 19:23:21,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2020-12-04 19:23:21,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:23:21,514 INFO L225 Difference]: With dead ends: 822 [2020-12-04 19:23:21,514 INFO L226 Difference]: Without dead ends: 810 [2020-12-04 19:23:21,516 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=273, Invalid=849, Unknown=0, NotChecked=0, Total=1122 [2020-12-04 19:23:21,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2020-12-04 19:23:21,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 507. [2020-12-04 19:23:21,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2020-12-04 19:23:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 640 transitions. [2020-12-04 19:23:21,541 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 640 transitions. Word has length 61 [2020-12-04 19:23:21,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:23:21,542 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 640 transitions. [2020-12-04 19:23:21,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-04 19:23:21,542 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 640 transitions. [2020-12-04 19:23:21,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-04 19:23:21,549 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:23:21,550 INFO L422 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] [2020-12-04 19:23:21,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-04 19:23:21,550 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:23:21,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:23:21,551 INFO L82 PathProgramCache]: Analyzing trace with hash 185951805, now seen corresponding path program 1 times [2020-12-04 19:23:21,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:23:21,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856935352] [2020-12-04 19:23:21,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:23:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:23:27,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:23:27,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856935352] [2020-12-04 19:23:27,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:23:27,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 19:23:27,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045661083] [2020-12-04 19:23:27,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 19:23:27,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:23:27,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 19:23:27,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-12-04 19:23:27,524 INFO L87 Difference]: Start difference. First operand 507 states and 640 transitions. Second operand 9 states. [2020-12-04 19:23:30,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:23:30,070 INFO L93 Difference]: Finished difference Result 622 states and 784 transitions. [2020-12-04 19:23:30,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-04 19:23:30,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-12-04 19:23:30,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:23:30,076 INFO L225 Difference]: With dead ends: 622 [2020-12-04 19:23:30,076 INFO L226 Difference]: Without dead ends: 606 [2020-12-04 19:23:30,077 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-04 19:23:30,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-12-04 19:23:30,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 291. [2020-12-04 19:23:30,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-12-04 19:23:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 359 transitions. [2020-12-04 19:23:30,094 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 359 transitions. Word has length 61 [2020-12-04 19:23:30,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:23:30,094 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 359 transitions. [2020-12-04 19:23:30,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 19:23:30,095 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 359 transitions. [2020-12-04 19:23:30,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-04 19:23:30,096 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:23:30,096 INFO L422 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] [2020-12-04 19:23:30,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-04 19:23:30,097 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:23:30,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:23:30,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1505223815, now seen corresponding path program 1 times [2020-12-04 19:23:30,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:23:30,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694313305] [2020-12-04 19:23:30,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:23:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:23:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:23:37,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694313305] [2020-12-04 19:23:37,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:23:37,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-04 19:23:37,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392138941] [2020-12-04 19:23:37,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-04 19:23:37,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:23:37,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-04 19:23:37,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-12-04 19:23:37,210 INFO L87 Difference]: Start difference. First operand 291 states and 359 transitions. Second operand 11 states. [2020-12-04 19:23:40,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:23:40,227 INFO L93 Difference]: Finished difference Result 356 states and 437 transitions. [2020-12-04 19:23:40,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-04 19:23:40,228 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2020-12-04 19:23:40,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:23:40,231 INFO L225 Difference]: With dead ends: 356 [2020-12-04 19:23:40,231 INFO L226 Difference]: Without dead ends: 349 [2020-12-04 19:23:40,232 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2020-12-04 19:23:40,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2020-12-04 19:23:40,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 291. [2020-12-04 19:23:40,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-12-04 19:23:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 358 transitions. [2020-12-04 19:23:40,248 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 358 transitions. Word has length 61 [2020-12-04 19:23:40,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:23:40,249 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 358 transitions. [2020-12-04 19:23:40,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-04 19:23:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 358 transitions. [2020-12-04 19:23:40,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-04 19:23:40,250 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:23:40,250 INFO L422 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] [2020-12-04 19:23:40,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-04 19:23:40,251 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:23:40,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:23:40,252 INFO L82 PathProgramCache]: Analyzing trace with hash -825165445, now seen corresponding path program 1 times [2020-12-04 19:23:40,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:23:40,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710858805] [2020-12-04 19:23:40,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:23:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:23:40,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:23:40,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710858805] [2020-12-04 19:23:40,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:23:40,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-04 19:23:40,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416538733] [2020-12-04 19:23:40,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-04 19:23:40,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:23:40,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-04 19:23:40,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-04 19:23:40,789 INFO L87 Difference]: Start difference. First operand 291 states and 358 transitions. Second operand 5 states. [2020-12-04 19:23:43,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:23:43,253 INFO L93 Difference]: Finished difference Result 459 states and 555 transitions. [2020-12-04 19:23:43,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-04 19:23:43,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-12-04 19:23:43,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:23:43,256 INFO L225 Difference]: With dead ends: 459 [2020-12-04 19:23:43,257 INFO L226 Difference]: Without dead ends: 360 [2020-12-04 19:23:43,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-04 19:23:43,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2020-12-04 19:23:43,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 289. [2020-12-04 19:23:43,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2020-12-04 19:23:43,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 351 transitions. [2020-12-04 19:23:43,276 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 351 transitions. Word has length 61 [2020-12-04 19:23:43,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:23:43,277 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 351 transitions. [2020-12-04 19:23:43,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-04 19:23:43,277 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 351 transitions. [2020-12-04 19:23:43,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-04 19:23:43,278 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:23:43,279 INFO L422 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] [2020-12-04 19:23:43,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-04 19:23:43,279 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:23:43,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:23:43,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1894411642, now seen corresponding path program 1 times [2020-12-04 19:23:43,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:23:43,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719734257] [2020-12-04 19:23:43,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:23:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:23:43,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:23:43,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719734257] [2020-12-04 19:23:43,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:23:43,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 19:23:43,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851189267] [2020-12-04 19:23:43,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 19:23:43,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:23:43,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 19:23:43,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-04 19:23:43,701 INFO L87 Difference]: Start difference. First operand 289 states and 351 transitions. Second operand 9 states. [2020-12-04 19:23:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:23:44,114 INFO L93 Difference]: Finished difference Result 343 states and 409 transitions. [2020-12-04 19:23:44,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-04 19:23:44,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2020-12-04 19:23:44,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:23:44,117 INFO L225 Difference]: With dead ends: 343 [2020-12-04 19:23:44,117 INFO L226 Difference]: Without dead ends: 308 [2020-12-04 19:23:44,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2020-12-04 19:23:44,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2020-12-04 19:23:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 250. [2020-12-04 19:23:44,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-04 19:23:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 301 transitions. [2020-12-04 19:23:44,136 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 301 transitions. Word has length 63 [2020-12-04 19:23:44,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:23:44,136 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 301 transitions. [2020-12-04 19:23:44,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 19:23:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 301 transitions. [2020-12-04 19:23:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-04 19:23:44,138 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:23:44,138 INFO L422 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] [2020-12-04 19:23:44,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-04 19:23:44,139 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:23:44,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:23:44,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2000988788, now seen corresponding path program 1 times [2020-12-04 19:23:44,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:23:44,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956547582] [2020-12-04 19:23:44,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:23:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:23:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:23:44,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956547582] [2020-12-04 19:23:44,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:23:44,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-04 19:23:44,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417830156] [2020-12-04 19:23:44,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-04 19:23:44,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:23:44,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-04 19:23:44,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-04 19:23:44,669 INFO L87 Difference]: Start difference. First operand 250 states and 301 transitions. Second operand 8 states. [2020-12-04 19:23:45,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:23:45,201 INFO L93 Difference]: Finished difference Result 379 states and 456 transitions. [2020-12-04 19:23:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-04 19:23:45,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2020-12-04 19:23:45,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:23:45,205 INFO L225 Difference]: With dead ends: 379 [2020-12-04 19:23:45,205 INFO L226 Difference]: Without dead ends: 371 [2020-12-04 19:23:45,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-12-04 19:23:45,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2020-12-04 19:23:45,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 250. [2020-12-04 19:23:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-04 19:23:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 300 transitions. [2020-12-04 19:23:45,223 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 300 transitions. Word has length 63 [2020-12-04 19:23:45,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:23:45,224 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 300 transitions. [2020-12-04 19:23:45,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-04 19:23:45,224 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 300 transitions. [2020-12-04 19:23:45,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-04 19:23:45,225 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:23:45,225 INFO L422 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] [2020-12-04 19:23:45,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-04 19:23:45,226 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:23:45,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:23:45,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1191642162, now seen corresponding path program 1 times [2020-12-04 19:23:45,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:23:45,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666504073] [2020-12-04 19:23:45,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:23:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:23:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:23:48,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666504073] [2020-12-04 19:23:48,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:23:48,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-04 19:23:48,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884630682] [2020-12-04 19:23:48,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-04 19:23:48,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:23:48,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-04 19:23:48,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-12-04 19:23:48,234 INFO L87 Difference]: Start difference. First operand 250 states and 300 transitions. Second operand 13 states. [2020-12-04 19:23:53,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:23:53,908 INFO L93 Difference]: Finished difference Result 373 states and 449 transitions. [2020-12-04 19:23:53,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-04 19:23:53,910 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2020-12-04 19:23:53,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:23:53,911 INFO L225 Difference]: With dead ends: 373 [2020-12-04 19:23:53,911 INFO L226 Difference]: Without dead ends: 175 [2020-12-04 19:23:53,912 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2020-12-04 19:23:53,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-12-04 19:23:53,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 110. [2020-12-04 19:23:53,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-04 19:23:53,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2020-12-04 19:23:53,920 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 63 [2020-12-04 19:23:53,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:23:53,921 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2020-12-04 19:23:53,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-04 19:23:53,921 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2020-12-04 19:23:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-04 19:23:53,922 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:23:53,922 INFO L422 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] [2020-12-04 19:23:53,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-04 19:23:53,923 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:23:53,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:23:53,923 INFO L82 PathProgramCache]: Analyzing trace with hash -415031135, now seen corresponding path program 1 times [2020-12-04 19:23:53,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:23:53,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981283288] [2020-12-04 19:23:53,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:23:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:23:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:23:54,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981283288] [2020-12-04 19:23:54,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:23:54,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-04 19:23:54,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111079833] [2020-12-04 19:23:54,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-04 19:23:54,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:23:54,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-04 19:23:54,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-12-04 19:23:54,358 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand 10 states. [2020-12-04 19:23:54,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:23:54,949 INFO L93 Difference]: Finished difference Result 189 states and 224 transitions. [2020-12-04 19:23:54,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-04 19:23:54,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2020-12-04 19:23:54,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:23:54,954 INFO L225 Difference]: With dead ends: 189 [2020-12-04 19:23:54,955 INFO L226 Difference]: Without dead ends: 174 [2020-12-04 19:23:54,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2020-12-04 19:23:54,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-12-04 19:23:54,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 150. [2020-12-04 19:23:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-12-04 19:23:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 179 transitions. [2020-12-04 19:23:54,965 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 179 transitions. Word has length 64 [2020-12-04 19:23:54,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:23:54,966 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 179 transitions. [2020-12-04 19:23:54,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-04 19:23:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 179 transitions. [2020-12-04 19:23:54,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-04 19:23:54,967 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:23:54,967 INFO L422 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] [2020-12-04 19:23:54,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-04 19:23:54,968 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:23:54,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:23:54,968 INFO L82 PathProgramCache]: Analyzing trace with hash 7670691, now seen corresponding path program 1 times [2020-12-04 19:23:54,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:23:54,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19383948] [2020-12-04 19:23:54,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:23:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:23:55,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:23:55,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19383948] [2020-12-04 19:23:55,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:23:55,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 19:23:55,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716761616] [2020-12-04 19:23:55,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 19:23:55,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:23:55,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 19:23:55,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-04 19:23:55,341 INFO L87 Difference]: Start difference. First operand 150 states and 179 transitions. Second operand 9 states. [2020-12-04 19:23:55,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:23:55,689 INFO L93 Difference]: Finished difference Result 240 states and 288 transitions. [2020-12-04 19:23:55,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-04 19:23:55,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2020-12-04 19:23:55,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:23:55,693 INFO L225 Difference]: With dead ends: 240 [2020-12-04 19:23:55,693 INFO L226 Difference]: Without dead ends: 150 [2020-12-04 19:23:55,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2020-12-04 19:23:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-12-04 19:23:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2020-12-04 19:23:55,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-12-04 19:23:55,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 177 transitions. [2020-12-04 19:23:55,705 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 177 transitions. Word has length 64 [2020-12-04 19:23:55,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:23:55,705 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 177 transitions. [2020-12-04 19:23:55,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 19:23:55,706 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 177 transitions. [2020-12-04 19:23:55,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-04 19:23:55,706 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:23:55,707 INFO L422 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] [2020-12-04 19:23:55,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-04 19:23:55,707 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:23:55,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:23:55,708 INFO L82 PathProgramCache]: Analyzing trace with hash -8320128, now seen corresponding path program 1 times [2020-12-04 19:23:55,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:23:55,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670868647] [2020-12-04 19:23:55,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:23:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:23:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:23:56,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670868647] [2020-12-04 19:23:56,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:23:56,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-04 19:23:56,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377607134] [2020-12-04 19:23:56,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-04 19:23:56,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:23:56,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-04 19:23:56,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-04 19:23:56,026 INFO L87 Difference]: Start difference. First operand 150 states and 177 transitions. Second operand 4 states. [2020-12-04 19:23:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:23:56,074 INFO L93 Difference]: Finished difference Result 165 states and 193 transitions. [2020-12-04 19:23:56,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-04 19:23:56,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2020-12-04 19:23:56,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:23:56,077 INFO L225 Difference]: With dead ends: 165 [2020-12-04 19:23:56,077 INFO L226 Difference]: Without dead ends: 150 [2020-12-04 19:23:56,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-04 19:23:56,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-12-04 19:23:56,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 110. [2020-12-04 19:23:56,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-04 19:23:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 127 transitions. [2020-12-04 19:23:56,086 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 127 transitions. Word has length 69 [2020-12-04 19:23:56,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:23:56,087 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 127 transitions. [2020-12-04 19:23:56,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-04 19:23:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 127 transitions. [2020-12-04 19:23:56,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-04 19:23:56,088 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:23:56,088 INFO L422 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] [2020-12-04 19:23:56,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-04 19:23:56,089 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:23:56,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:23:56,089 INFO L82 PathProgramCache]: Analyzing trace with hash 328621752, now seen corresponding path program 1 times [2020-12-04 19:23:56,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:23:56,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334530574] [2020-12-04 19:23:56,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:23:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:23:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:23:56,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334530574] [2020-12-04 19:23:56,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:23:56,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-04 19:23:56,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372935663] [2020-12-04 19:23:56,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-04 19:23:56,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:23:56,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-04 19:23:56,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-04 19:23:56,447 INFO L87 Difference]: Start difference. First operand 110 states and 127 transitions. Second operand 6 states. [2020-12-04 19:23:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:23:56,685 INFO L93 Difference]: Finished difference Result 203 states and 237 transitions. [2020-12-04 19:23:56,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-04 19:23:56,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2020-12-04 19:23:56,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:23:56,689 INFO L225 Difference]: With dead ends: 203 [2020-12-04 19:23:56,689 INFO L226 Difference]: Without dead ends: 174 [2020-12-04 19:23:56,689 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-12-04 19:23:56,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-12-04 19:23:56,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 121. [2020-12-04 19:23:56,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-12-04 19:23:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2020-12-04 19:23:56,700 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 74 [2020-12-04 19:23:56,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:23:56,700 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2020-12-04 19:23:56,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-04 19:23:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2020-12-04 19:23:56,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-04 19:23:56,702 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:23:56,702 INFO L422 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] [2020-12-04 19:23:56,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-04 19:23:56,703 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:23:56,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:23:56,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1030221626, now seen corresponding path program 1 times [2020-12-04 19:23:56,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:23:56,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45873192] [2020-12-04 19:23:56,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:23:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:23:57,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:23:57,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45873192] [2020-12-04 19:23:57,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:23:57,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-04 19:23:57,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035503879] [2020-12-04 19:23:57,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-04 19:23:57,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:23:57,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-04 19:23:57,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-04 19:23:57,035 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand 4 states. [2020-12-04 19:23:57,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:23:57,113 INFO L93 Difference]: Finished difference Result 174 states and 203 transitions. [2020-12-04 19:23:57,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-04 19:23:57,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-12-04 19:23:57,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:23:57,116 INFO L225 Difference]: With dead ends: 174 [2020-12-04 19:23:57,117 INFO L226 Difference]: Without dead ends: 110 [2020-12-04 19:23:57,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-04 19:23:57,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-12-04 19:23:57,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-12-04 19:23:57,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-04 19:23:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2020-12-04 19:23:57,129 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 74 [2020-12-04 19:23:57,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:23:57,129 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2020-12-04 19:23:57,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-04 19:23:57,130 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2020-12-04 19:23:57,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-04 19:23:57,131 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:23:57,131 INFO L422 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] [2020-12-04 19:23:57,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-04 19:23:57,132 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:23:57,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:23:57,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1651843554, now seen corresponding path program 1 times [2020-12-04 19:23:57,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:23:57,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424202699] [2020-12-04 19:23:57,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:23:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:23:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:23:57,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424202699] [2020-12-04 19:23:57,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:23:57,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-04 19:23:57,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530086774] [2020-12-04 19:23:57,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-04 19:23:57,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:23:57,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-04 19:23:57,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-04 19:23:57,460 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand 6 states. [2020-12-04 19:23:57,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:23:57,656 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2020-12-04 19:23:57,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-04 19:23:57,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2020-12-04 19:23:57,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:23:57,659 INFO L225 Difference]: With dead ends: 141 [2020-12-04 19:23:57,659 INFO L226 Difference]: Without dead ends: 110 [2020-12-04 19:23:57,659 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-12-04 19:23:57,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-12-04 19:23:57,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-12-04 19:23:57,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-04 19:23:57,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2020-12-04 19:23:57,667 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 77 [2020-12-04 19:23:57,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:23:57,667 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2020-12-04 19:23:57,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-04 19:23:57,667 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2020-12-04 19:23:57,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-04 19:23:57,668 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:23:57,669 INFO L422 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] [2020-12-04 19:23:57,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-04 19:23:57,669 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:23:57,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:23:57,670 INFO L82 PathProgramCache]: Analyzing trace with hash -725845363, now seen corresponding path program 1 times [2020-12-04 19:23:57,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:23:57,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054378038] [2020-12-04 19:23:57,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:23:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:23:58,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:23:58,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054378038] [2020-12-04 19:23:58,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:23:58,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-04 19:23:58,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734625980] [2020-12-04 19:23:58,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-04 19:23:58,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:23:58,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-04 19:23:58,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-04 19:23:58,028 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 5 states. [2020-12-04 19:23:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:23:58,105 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2020-12-04 19:23:58,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-04 19:23:58,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2020-12-04 19:23:58,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:23:58,107 INFO L225 Difference]: With dead ends: 126 [2020-12-04 19:23:58,108 INFO L226 Difference]: Without dead ends: 110 [2020-12-04 19:23:58,108 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-04 19:23:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-12-04 19:23:58,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-12-04 19:23:58,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-04 19:23:58,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2020-12-04 19:23:58,116 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 83 [2020-12-04 19:23:58,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:23:58,116 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2020-12-04 19:23:58,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-04 19:23:58,116 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2020-12-04 19:23:58,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-04 19:23:58,117 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:23:58,118 INFO L422 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] [2020-12-04 19:23:58,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-04 19:23:58,118 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:23:58,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:23:58,119 INFO L82 PathProgramCache]: Analyzing trace with hash 416042108, now seen corresponding path program 1 times [2020-12-04 19:23:58,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:23:58,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382789324] [2020-12-04 19:23:58,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:23:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:23:59,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:23:59,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382789324] [2020-12-04 19:23:59,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:23:59,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-04 19:23:59,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014007791] [2020-12-04 19:23:59,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-04 19:23:59,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:23:59,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-04 19:23:59,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-12-04 19:23:59,291 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand 10 states. [2020-12-04 19:24:09,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:24:09,018 INFO L93 Difference]: Finished difference Result 227 states and 250 transitions. [2020-12-04 19:24:09,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-04 19:24:09,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2020-12-04 19:24:09,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:24:09,020 INFO L225 Difference]: With dead ends: 227 [2020-12-04 19:24:09,021 INFO L226 Difference]: Without dead ends: 189 [2020-12-04 19:24:09,021 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2020-12-04 19:24:09,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-12-04 19:24:09,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 133. [2020-12-04 19:24:09,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-12-04 19:24:09,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 148 transitions. [2020-12-04 19:24:09,033 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 148 transitions. Word has length 85 [2020-12-04 19:24:09,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:24:09,033 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 148 transitions. [2020-12-04 19:24:09,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-04 19:24:09,033 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 148 transitions. [2020-12-04 19:24:09,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-12-04 19:24:09,034 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:24:09,035 INFO L422 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] [2020-12-04 19:24:09,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-04 19:24:09,035 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:24:09,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:24:09,036 INFO L82 PathProgramCache]: Analyzing trace with hash 897122366, now seen corresponding path program 1 times [2020-12-04 19:24:09,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:24:09,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080448211] [2020-12-04 19:24:09,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:24:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:24:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:24:12,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080448211] [2020-12-04 19:24:12,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:24:12,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-04 19:24:12,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061408710] [2020-12-04 19:24:12,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-04 19:24:12,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:24:12,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-04 19:24:12,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-12-04 19:24:12,823 INFO L87 Difference]: Start difference. First operand 133 states and 148 transitions. Second operand 11 states. [2020-12-04 19:24:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:24:19,874 INFO L93 Difference]: Finished difference Result 165 states and 182 transitions. [2020-12-04 19:24:19,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-04 19:24:19,877 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2020-12-04 19:24:19,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:24:19,878 INFO L225 Difference]: With dead ends: 165 [2020-12-04 19:24:19,878 INFO L226 Difference]: Without dead ends: 133 [2020-12-04 19:24:19,879 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2020-12-04 19:24:19,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-12-04 19:24:19,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2020-12-04 19:24:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-12-04 19:24:19,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2020-12-04 19:24:19,889 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 85 [2020-12-04 19:24:19,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:24:19,889 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2020-12-04 19:24:19,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-04 19:24:19,890 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2020-12-04 19:24:19,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-04 19:24:19,890 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:24:19,891 INFO L422 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] [2020-12-04 19:24:19,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-04 19:24:19,891 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:24:19,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:24:19,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1873119676, now seen corresponding path program 1 times [2020-12-04 19:24:19,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:24:19,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143973978] [2020-12-04 19:24:19,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:24:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:24:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:24:20,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143973978] [2020-12-04 19:24:20,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:24:20,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-04 19:24:20,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160355129] [2020-12-04 19:24:20,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-04 19:24:20,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:24:20,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-04 19:24:20,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-04 19:24:20,718 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand 8 states. [2020-12-04 19:24:21,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:24:21,131 INFO L93 Difference]: Finished difference Result 164 states and 180 transitions. [2020-12-04 19:24:21,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-04 19:24:21,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2020-12-04 19:24:21,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:24:21,134 INFO L225 Difference]: With dead ends: 164 [2020-12-04 19:24:21,134 INFO L226 Difference]: Without dead ends: 122 [2020-12-04 19:24:21,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-12-04 19:24:21,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-12-04 19:24:21,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2020-12-04 19:24:21,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-12-04 19:24:21,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2020-12-04 19:24:21,145 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 89 [2020-12-04 19:24:21,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:24:21,146 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2020-12-04 19:24:21,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-04 19:24:21,146 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2020-12-04 19:24:21,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-04 19:24:21,147 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:24:21,147 INFO L422 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] [2020-12-04 19:24:21,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-04 19:24:21,148 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:24:21,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:24:21,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1165234989, now seen corresponding path program 1 times [2020-12-04 19:24:21,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:24:21,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138584385] [2020-12-04 19:24:21,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:24:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:24:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:24:22,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138584385] [2020-12-04 19:24:22,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:24:22,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-04 19:24:22,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737462279] [2020-12-04 19:24:22,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-04 19:24:22,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:24:22,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-04 19:24:22,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-12-04 19:24:22,358 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 11 states. [2020-12-04 19:24:31,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:24:31,674 INFO L93 Difference]: Finished difference Result 198 states and 213 transitions. [2020-12-04 19:24:31,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-04 19:24:31,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2020-12-04 19:24:31,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:24:31,676 INFO L225 Difference]: With dead ends: 198 [2020-12-04 19:24:31,677 INFO L226 Difference]: Without dead ends: 164 [2020-12-04 19:24:31,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2020-12-04 19:24:31,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-12-04 19:24:31,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 130. [2020-12-04 19:24:31,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-12-04 19:24:31,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2020-12-04 19:24:31,689 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 91 [2020-12-04 19:24:31,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:24:31,689 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2020-12-04 19:24:31,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-04 19:24:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2020-12-04 19:24:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-04 19:24:31,690 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:24:31,690 INFO L422 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] [2020-12-04 19:24:31,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-04 19:24:31,691 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:24:31,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:24:31,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1206504273, now seen corresponding path program 1 times [2020-12-04 19:24:31,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:24:31,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364804366] [2020-12-04 19:24:31,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:24:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:24:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:24:33,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364804366] [2020-12-04 19:24:33,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:24:33,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-04 19:24:33,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972297820] [2020-12-04 19:24:33,447 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-04 19:24:33,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:24:33,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-04 19:24:33,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-04 19:24:33,448 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 11 states. [2020-12-04 19:24:41,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:24:41,089 INFO L93 Difference]: Finished difference Result 202 states and 218 transitions. [2020-12-04 19:24:41,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-04 19:24:41,091 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2020-12-04 19:24:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:24:41,092 INFO L225 Difference]: With dead ends: 202 [2020-12-04 19:24:41,092 INFO L226 Difference]: Without dead ends: 185 [2020-12-04 19:24:41,093 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2020-12-04 19:24:41,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-12-04 19:24:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 145. [2020-12-04 19:24:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-12-04 19:24:41,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2020-12-04 19:24:41,108 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 91 [2020-12-04 19:24:41,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:24:41,108 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2020-12-04 19:24:41,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-04 19:24:41,109 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2020-12-04 19:24:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-04 19:24:41,109 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:24:41,110 INFO L422 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] [2020-12-04 19:24:41,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-04 19:24:41,110 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:24:41,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:24:41,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1124560239, now seen corresponding path program 1 times [2020-12-04 19:24:41,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:24:41,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590279562] [2020-12-04 19:24:41,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:24:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:24:50,211 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2020-12-04 19:24:50,414 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-12-04 19:24:50,610 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2020-12-04 19:24:50,841 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2020-12-04 19:24:51,210 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2020-12-04 19:24:51,430 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2020-12-04 19:24:52,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:24:52,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590279562] [2020-12-04 19:24:52,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:24:52,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-12-04 19:24:52,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96214252] [2020-12-04 19:24:52,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-04 19:24:52,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:24:52,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-04 19:24:52,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2020-12-04 19:24:52,190 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand 22 states. [2020-12-04 19:24:57,514 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-12-04 19:24:57,784 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-12-04 19:24:58,104 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-12-04 19:24:58,291 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-12-04 19:24:58,825 WARN L197 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2020-12-04 19:24:59,284 WARN L197 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2020-12-04 19:24:59,678 WARN L197 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2020-12-04 19:25:00,325 WARN L197 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2020-12-04 19:25:00,743 WARN L197 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2020-12-04 19:25:01,153 WARN L197 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2020-12-04 19:25:01,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:25:01,296 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2020-12-04 19:25:01,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-04 19:25:01,299 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 91 [2020-12-04 19:25:01,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:25:01,301 INFO L225 Difference]: With dead ends: 175 [2020-12-04 19:25:01,301 INFO L226 Difference]: Without dead ends: 173 [2020-12-04 19:25:01,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=400, Invalid=1160, Unknown=0, NotChecked=0, Total=1560 [2020-12-04 19:25:01,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-12-04 19:25:01,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 156. [2020-12-04 19:25:01,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-12-04 19:25:01,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 169 transitions. [2020-12-04 19:25:01,318 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 169 transitions. Word has length 91 [2020-12-04 19:25:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:25:01,319 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 169 transitions. [2020-12-04 19:25:01,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-04 19:25:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 169 transitions. [2020-12-04 19:25:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-12-04 19:25:01,320 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:25:01,320 INFO L422 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] [2020-12-04 19:25:01,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-04 19:25:01,321 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:25:01,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:25:01,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1126407281, now seen corresponding path program 1 times [2020-12-04 19:25:01,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:25:01,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510435537] [2020-12-04 19:25:01,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:25:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:25:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:25:01,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510435537] [2020-12-04 19:25:01,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:25:01,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-04 19:25:01,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744275835] [2020-12-04 19:25:01,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-04 19:25:01,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:25:01,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-04 19:25:01,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-12-04 19:25:01,889 INFO L87 Difference]: Start difference. First operand 156 states and 169 transitions. Second operand 11 states. [2020-12-04 19:25:02,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:25:02,614 INFO L93 Difference]: Finished difference Result 173 states and 187 transitions. [2020-12-04 19:25:02,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-04 19:25:02,616 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2020-12-04 19:25:02,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:25:02,617 INFO L225 Difference]: With dead ends: 173 [2020-12-04 19:25:02,617 INFO L226 Difference]: Without dead ends: 156 [2020-12-04 19:25:02,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2020-12-04 19:25:02,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-12-04 19:25:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2020-12-04 19:25:02,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2020-12-04 19:25:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2020-12-04 19:25:02,638 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 91 [2020-12-04 19:25:02,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:25:02,639 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2020-12-04 19:25:02,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-04 19:25:02,639 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2020-12-04 19:25:02,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-04 19:25:02,640 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:25:02,640 INFO L422 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] [2020-12-04 19:25:02,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-04 19:25:02,641 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:25:02,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:25:02,641 INFO L82 PathProgramCache]: Analyzing trace with hash -889112910, now seen corresponding path program 1 times [2020-12-04 19:25:02,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:25:02,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301280248] [2020-12-04 19:25:02,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:25:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:25:23,098 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 18 [2020-12-04 19:25:23,509 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 16 [2020-12-04 19:25:23,772 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2020-12-04 19:25:24,030 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2020-12-04 19:25:24,278 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2020-12-04 19:25:24,556 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2020-12-04 19:25:24,835 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2020-12-04 19:25:25,135 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2020-12-04 19:25:25,470 WARN L197 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2020-12-04 19:25:25,847 WARN L197 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2020-12-04 19:25:26,239 WARN L197 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2020-12-04 19:25:26,518 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2020-12-04 19:25:26,855 WARN L197 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2020-12-04 19:25:27,355 WARN L197 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2020-12-04 19:25:27,621 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2020-12-04 19:25:27,914 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2020-12-04 19:25:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:25:28,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301280248] [2020-12-04 19:25:28,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258597846] [2020-12-04 19:25:28,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-04 19:25:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:25:30,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 3092 conjuncts, 111 conjunts are in the unsatisfiable core [2020-12-04 19:25:30,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-04 19:25:31,337 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2020-12-04 19:25:31,338 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2020-12-04 19:25:31,341 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-04 19:25:31,375 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-04 19:25:31,378 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-04 19:25:31,378 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2020-12-04 19:25:32,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-04 19:25:32,698 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-04 19:25:32,698 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2020-12-04 19:25:32,705 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-04 19:25:32,733 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-04 19:25:32,735 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-04 19:25:32,736 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:24 [2020-12-04 19:25:32,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-04 19:25:32,808 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-04 19:25:32,809 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2020-12-04 19:25:32,813 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-04 19:25:32,841 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-04 19:25:32,846 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-04 19:25:32,846 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:19 [2020-12-04 19:25:34,136 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2020-12-04 19:25:36,044 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-04 19:25:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-04 19:25:36,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-04 19:25:36,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [24] total 43 [2020-12-04 19:25:36,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922246308] [2020-12-04 19:25:36,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-04 19:25:36,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:25:36,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-04 19:25:36,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1688, Unknown=0, NotChecked=0, Total=1806 [2020-12-04 19:25:36,453 INFO L87 Difference]: Start difference. First operand 156 states and 165 transitions. Second operand 23 states. [2020-12-04 19:25:55,983 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-12-04 19:25:56,297 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-12-04 19:25:56,615 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-12-04 19:25:58,044 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-12-04 19:25:58,402 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-12-04 19:25:58,706 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-12-04 19:25:59,009 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-12-04 19:25:59,321 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-12-04 19:25:59,628 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-04 19:26:00,213 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-12-04 19:26:00,585 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-04 19:26:00,839 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-12-04 19:26:01,236 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-12-04 19:26:01,546 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-12-04 19:26:01,885 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2020-12-04 19:26:02,158 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-12-04 19:26:02,593 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-12-04 19:26:02,964 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-12-04 19:26:03,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:26:03,057 INFO L93 Difference]: Finished difference Result 229 states and 241 transitions. [2020-12-04 19:26:03,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-04 19:26:03,061 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 94 [2020-12-04 19:26:03,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:26:03,063 INFO L225 Difference]: With dead ends: 229 [2020-12-04 19:26:03,064 INFO L226 Difference]: Without dead ends: 227 [2020-12-04 19:26:03,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=495, Invalid=3927, Unknown=0, NotChecked=0, Total=4422 [2020-12-04 19:26:03,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2020-12-04 19:26:03,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2020-12-04 19:26:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-12-04 19:26:03,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2020-12-04 19:26:03,083 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 94 [2020-12-04 19:26:03,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:26:03,084 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2020-12-04 19:26:03,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-04 19:26:03,084 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2020-12-04 19:26:03,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-04 19:26:03,088 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:26:03,088 INFO L422 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] [2020-12-04 19:26:03,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2020-12-04 19:26:03,290 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:26:03,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:26:03,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1033329166, now seen corresponding path program 1 times [2020-12-04 19:26:03,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:26:03,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488952674] [2020-12-04 19:26:03,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:26:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:26:09,737 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 14 [2020-12-04 19:26:09,931 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 14 [2020-12-04 19:26:10,504 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2020-12-04 19:26:10,873 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2020-12-04 19:26:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:26:11,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488952674] [2020-12-04 19:26:11,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 19:26:11,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-12-04 19:26:11,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332025182] [2020-12-04 19:26:11,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-04 19:26:11,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:26:11,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-04 19:26:11,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2020-12-04 19:26:11,187 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 18 states. [2020-12-04 19:26:20,016 WARN L197 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2020-12-04 19:26:20,418 WARN L197 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2020-12-04 19:26:20,635 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-12-04 19:26:21,103 WARN L197 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2020-12-04 19:26:21,996 WARN L197 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2020-12-04 19:26:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:26:22,064 INFO L93 Difference]: Finished difference Result 179 states and 187 transitions. [2020-12-04 19:26:22,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-04 19:26:22,068 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94 [2020-12-04 19:26:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:26:22,069 INFO L225 Difference]: With dead ends: 179 [2020-12-04 19:26:22,069 INFO L226 Difference]: Without dead ends: 164 [2020-12-04 19:26:22,070 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2020-12-04 19:26:22,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-12-04 19:26:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 129. [2020-12-04 19:26:22,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-12-04 19:26:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2020-12-04 19:26:22,089 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 94 [2020-12-04 19:26:22,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:26:22,089 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2020-12-04 19:26:22,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-04 19:26:22,090 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2020-12-04 19:26:22,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-04 19:26:22,091 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 19:26:22,091 INFO L422 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] [2020-12-04 19:26:22,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-04 19:26:22,091 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 19:26:22,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 19:26:22,092 INFO L82 PathProgramCache]: Analyzing trace with hash -495229461, now seen corresponding path program 1 times [2020-12-04 19:26:22,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 19:26:22,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622008227] [2020-12-04 19:26:22,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 19:26:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:26:38,516 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2020-12-04 19:26:38,962 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2020-12-04 19:26:39,162 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2020-12-04 19:26:39,368 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2020-12-04 19:26:40,936 WARN L197 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 38 [2020-12-04 19:26:41,849 WARN L197 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 38 [2020-12-04 19:26:42,282 WARN L197 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2020-12-04 19:26:42,626 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 28 [2020-12-04 19:26:43,180 WARN L197 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2020-12-04 19:26:43,904 WARN L197 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2020-12-04 19:26:45,078 WARN L197 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2020-12-04 19:26:46,321 WARN L197 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2020-12-04 19:26:47,406 WARN L197 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2020-12-04 19:26:47,809 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2020-12-04 19:26:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 19:26:48,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622008227] [2020-12-04 19:26:48,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864054780] [2020-12-04 19:26:48,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-04 19:31:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 19:31:06,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 3103 conjuncts, 120 conjunts are in the unsatisfiable core [2020-12-04 19:31:06,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-04 19:31:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-04 19:31:10,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-04 19:31:10,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [25] total 41 [2020-12-04 19:31:10,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666591190] [2020-12-04 19:31:10,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-04 19:31:10,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 19:31:10,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-04 19:31:10,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1522, Unknown=0, NotChecked=0, Total=1640 [2020-12-04 19:31:10,267 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 18 states. [2020-12-04 19:31:14,321 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-12-04 19:31:14,754 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-12-04 19:31:15,098 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-12-04 19:31:15,464 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-12-04 19:31:15,825 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-12-04 19:31:16,158 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-12-04 19:31:16,497 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-12-04 19:31:16,874 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-12-04 19:31:16,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 19:31:16,876 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2020-12-04 19:31:16,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-04 19:31:16,876 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 97 [2020-12-04 19:31:16,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 19:31:16,877 INFO L225 Difference]: With dead ends: 129 [2020-12-04 19:31:16,877 INFO L226 Difference]: Without dead ends: 0 [2020-12-04 19:31:16,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 83 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=364, Invalid=2828, Unknown=0, NotChecked=0, Total=3192 [2020-12-04 19:31:16,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-04 19:31:16,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-04 19:31:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-04 19:31:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-04 19:31:16,879 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2020-12-04 19:31:16,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 19:31:16,879 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-04 19:31:16,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-04 19:31:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-04 19:31:16,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-04 19:31:17,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2020-12-04 19:31:17,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-04 19:31:17,230 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 204 [2020-12-04 19:31:17,469 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 286 DAG size of output: 258 [2020-12-04 19:31:17,861 WARN L197 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 305 [2020-12-04 19:31:18,128 WARN L197 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 322 DAG size of output: 285 [2020-12-04 19:31:18,304 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 286 DAG size of output: 228 [2020-12-04 19:31:18,522 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 309 [2020-12-04 19:31:18,633 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-12-04 19:31:22,306 WARN L197 SmtUtils]: Spent 3.67 s on a formula simplification. DAG size of input: 198 DAG size of output: 115 [2020-12-04 19:31:24,121 WARN L197 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2020-12-04 19:31:27,420 WARN L197 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 256 DAG size of output: 146 [2020-12-04 19:31:28,047 WARN L197 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2020-12-04 19:31:28,721 WARN L197 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2020-12-04 19:31:34,838 WARN L197 SmtUtils]: Spent 6.11 s on a formula simplification. DAG size of input: 304 DAG size of output: 161 [2020-12-04 19:31:40,492 WARN L197 SmtUtils]: Spent 5.65 s on a formula simplification. DAG size of input: 283 DAG size of output: 121 [2020-12-04 19:31:40,662 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-12-04 19:31:41,437 WARN L197 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2020-12-04 19:31:41,761 WARN L197 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-12-04 19:31:46,590 WARN L197 SmtUtils]: Spent 4.83 s on a formula simplification. DAG size of input: 226 DAG size of output: 137 [2020-12-04 19:31:54,449 WARN L197 SmtUtils]: Spent 7.85 s on a formula simplification. DAG size of input: 308 DAG size of output: 163 [2020-12-04 19:31:54,527 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 19:31:54,527 INFO L262 CegarLoopResult]: For program point L6609(lines 6609 6614) no Hoare annotation was computed. [2020-12-04 19:31:54,528 INFO L258 CegarLoopResult]: At program point L6890(lines 6889 6891) the Hoare annotation is: (and (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (< |ULTIMATE.start_bounded_malloc_#res.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0)) (< ULTIMATE.start_ensure_string_is_allocated_~str~0.base |#StackHeapBarrier|)) [2020-12-04 19:31:54,528 INFO L258 CegarLoopResult]: At program point L6890-1(lines 6889 6891) the Hoare annotation is: (let ((.cse1 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| 0))) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.offset| 0)) (.cse3 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.offset 0)) (.cse4 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base))) (or (and (= (let ((.cse0 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_#res.base|))) (select .cse0 (+ (mod (select .cse0 8) 4294967296) 12))) 0) .cse1 .cse2 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) .cse3 (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0) .cse4 (= 0 (let ((.cse5 (select |#memory_int| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base))) (select .cse5 (+ (mod (select .cse5 8) 4294967296) 12)))) .cse6 (< |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (< ULTIMATE.start_ensure_string_is_allocated_~str~0.base |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0)) (= (let ((.cse7 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base|))) (select .cse7 (+ (mod (select .cse7 8) 4294967296) 12))) 0) (< |ULTIMATE.start_ensure_string_is_allocated_#res.base| |#StackHeapBarrier|) (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (< |ULTIMATE.start_bounded_malloc_#res.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0)) (< (+ ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 1) |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|)) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 0)))) [2020-12-04 19:31:54,528 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-04 19:31:54,528 INFO L262 CegarLoopResult]: For program point L6610(lines 6610 6612) no Hoare annotation was computed. [2020-12-04 19:31:54,528 INFO L262 CegarLoopResult]: For program point L6610-2(lines 6610 6612) no Hoare annotation was computed. [2020-12-04 19:31:54,528 INFO L262 CegarLoopResult]: For program point L9418(line 9418) no Hoare annotation was computed. [2020-12-04 19:31:54,529 INFO L262 CegarLoopResult]: For program point L9418-2(line 9418) no Hoare annotation was computed. [2020-12-04 19:31:54,529 INFO L262 CegarLoopResult]: For program point L9551-2(lines 9551 9552) no Hoare annotation was computed. [2020-12-04 19:31:54,529 INFO L262 CegarLoopResult]: For program point L9551-3(lines 9551 9558) no Hoare annotation was computed. [2020-12-04 19:31:54,529 INFO L262 CegarLoopResult]: For program point L9419(line 9419) no Hoare annotation was computed. [2020-12-04 19:31:54,529 INFO L262 CegarLoopResult]: For program point L9551-4(lines 9551 9558) no Hoare annotation was computed. [2020-12-04 19:31:54,529 INFO L262 CegarLoopResult]: For program point L9551(lines 9551 9552) no Hoare annotation was computed. [2020-12-04 19:31:54,529 INFO L262 CegarLoopResult]: For program point L9419-2(line 9419) no Hoare annotation was computed. [2020-12-04 19:31:54,530 INFO L262 CegarLoopResult]: For program point L6810(lines 6810 6811) no Hoare annotation was computed. [2020-12-04 19:31:54,530 INFO L262 CegarLoopResult]: For program point L6810-2(lines 6810 6811) no Hoare annotation was computed. [2020-12-04 19:31:54,530 INFO L262 CegarLoopResult]: For program point L9420(lines 9420 9428) no Hoare annotation was computed. [2020-12-04 19:31:54,530 INFO L262 CegarLoopResult]: For program point L7670-4(lines 7670 7676) no Hoare annotation was computed. [2020-12-04 19:31:54,531 INFO L258 CegarLoopResult]: At program point L7670-3(lines 7670 7676) the Hoare annotation is: (let ((.cse11 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|))) (let ((.cse8 (select .cse11 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.offset|)) (.cse10 (select .cse11 12))) (let ((.cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.offset| 0)) (.cse3 (<= .cse10 (+ (* 4294967296 (div (+ .cse10 (- 1)) 4294967296)) 4294967295))) (.cse0 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.offset 0)) (.cse1 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse9 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse2 (<= .cse8 (+ .cse10 (* 4294967296 (div (+ (* .cse10 (- 1)) (* (div .cse8 4294967296) 4294967296) 4294967295) 4294967296)))))) (or (let ((.cse6 (select |#memory_int| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base))) (let ((.cse5 (select .cse6 (+ ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.offset 8)))) (and (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) .cse0 (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0) (not (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ite1550.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|) .cse1 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~str.base ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base) (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (< ULTIMATE.start_ensure_string_is_allocated_~str~0.base |#StackHeapBarrier|) .cse2 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0)) .cse3 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~str.offset 0) (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ite1550.base|) 4) 0)) (< |ULTIMATE.start_bounded_malloc_#res.base| |#StackHeapBarrier|) (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.offset 0) (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0)) (= ULTIMATE.start_aws_string_is_valid_~str.offset 0) (= ULTIMATE.start_aws_string_is_valid_~str.base ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base) .cse4 (= ULTIMATE.start_aws_array_eq_ignore_case_~len_a .cse5) (= 0 (select .cse6 (+ (mod (select .cse6 8) 4294967296) 12))) .cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ite1550.offset| 0) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base) (= (mod .cse5 4294967296) (mod .cse8 4294967296)) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0) (= ULTIMATE.start_aws_array_eq_ignore_case_~len_b .cse8) .cse9 (< (+ ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 1) |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|)))) (and (not (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| 0)) .cse4 .cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|) 4) 0)) .cse0 .cse1 .cse7 .cse9 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 0) .cse2))))) [2020-12-04 19:31:54,531 INFO L262 CegarLoopResult]: For program point L7670-2(lines 7670 7676) no Hoare annotation was computed. [2020-12-04 19:31:54,531 INFO L262 CegarLoopResult]: For program point L222(lines 222 224) no Hoare annotation was computed. [2020-12-04 19:31:54,531 INFO L262 CegarLoopResult]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2020-12-04 19:31:54,531 INFO L262 CegarLoopResult]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2020-12-04 19:31:54,532 INFO L258 CegarLoopResult]: At program point L9438(lines 9416 9439) the Hoare annotation is: (let ((.cse40 (select |#memory_int| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base)) (.cse43 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|))) (let ((.cse36 (select .cse43 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.offset|)) (.cse39 (select .cse43 12)) (.cse41 (select .cse40 8))) (let ((.cse13 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ite1550.base| 0))) (.cse14 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse15 (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0)) (.cse16 (not (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base 0))) (.cse17 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~str.base ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base)) (.cse4 (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0))) (.cse18 (< ULTIMATE.start_ensure_string_is_allocated_~str~0.base |#StackHeapBarrier|)) (.cse6 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0))) (.cse19 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~str.offset 0)) (.cse20 (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0)) (.cse21 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ite1550.base|) 4) 0))) (.cse9 (not (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~str.base 0))) (.cse22 (< |ULTIMATE.start_bounded_malloc_#res.base| |#StackHeapBarrier|)) (.cse23 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.offset 0)) (.cse24 (let ((.cse42 (div ULTIMATE.start_aws_array_eq_ignore_case_~len_a 4294967296))) (or (not (= ULTIMATE.start_aws_array_eq_ignore_case_~len_a (* .cse42 4294967296))) (and (<= (* 4294967296 .cse42) .cse41) (<= .cse41 ULTIMATE.start_aws_array_eq_ignore_case_~len_a))))) (.cse11 (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0))) (.cse25 (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0)) (.cse26 (= ULTIMATE.start_aws_string_is_valid_~str.offset 0)) (.cse27 (= ULTIMATE.start_aws_string_is_valid_~str.base ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base)) (.cse28 (= |ULTIMATE.start_aws_array_eq_ignore_case_#res| 1)) (.cse29 (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))) (.cse30 (= 0 (select .cse40 (+ (mod .cse41 4294967296) 12)))) (.cse32 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ite1550.offset| 0)) (.cse33 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base) 4) 0))) (.cse34 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_#res| 1)) (.cse35 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse31 (select .cse40 (+ ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.offset 8))) (.cse37 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.offset ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~str.offset)) (.cse38 (< (+ ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 1) |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|)) (.cse0 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| 0))) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.offset| 0)) (.cse7 (<= .cse39 (+ (* 4294967296 (div (+ .cse39 (- 1)) 4294967296)) 4294967295))) (.cse8 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|) 4) 0))) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse3 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse10 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse12 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 0)) (.cse5 (<= .cse36 (+ .cse39 (* 4294967296 (div (+ (* .cse39 (- 1)) (* (div .cse36 4294967296) 4294967296) 4294967295) 4294967296)))))) (or (and .cse0 .cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_#res| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not .cse12)) (and .cse13 .cse0 .cse14 .cse15 .cse16 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ite1550.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|) .cse2 .cse17 .cse4 .cse18 .cse5 .cse6 .cse7 .cse19 .cse20 .cse8 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base) .cse21 .cse9 .cse22 .cse23 .cse24 .cse11 .cse25 .cse26 .cse27 .cse28 .cse1 .cse29 .cse30 (= ULTIMATE.start_aws_array_eq_ignore_case_~len_a .cse31) .cse3 .cse32 .cse33 .cse34 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base) .cse35 (= (mod .cse31 4294967296) (mod .cse36 4294967296)) (= ULTIMATE.start_aws_array_eq_ignore_case_~len_b .cse36) .cse10 .cse37 .cse38) (and .cse13 .cse0 .cse14 .cse15 .cse16 .cse2 .cse17 .cse4 .cse18 .cse5 .cse6 .cse7 .cse19 .cse20 .cse8 .cse21 .cse9 .cse22 .cse23 .cse24 .cse11 .cse25 .cse26 (= ULTIMATE.start_aws_array_eq_ignore_case_~i~7 0) (<= (* 4294967296 (div (+ .cse36 4294967295) 4294967296)) .cse36) .cse27 .cse28 .cse1 .cse29 .cse30 .cse3 .cse32 .cse33 .cse34 .cse35 (<= .cse31 (* 4294967296 (div .cse31 4294967296))) .cse10 .cse37 .cse38) (and .cse0 .cse1 .cse7 .cse8 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.offset 0) .cse2 .cse3 .cse10 .cse12 .cse5))))) [2020-12-04 19:31:54,532 INFO L262 CegarLoopResult]: For program point L7671(lines 7671 7675) no Hoare annotation was computed. [2020-12-04 19:31:54,532 INFO L262 CegarLoopResult]: For program point L9538(lines 9538 9561) no Hoare annotation was computed. [2020-12-04 19:31:54,533 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-04 19:31:54,533 INFO L262 CegarLoopResult]: For program point L223(line 223) no Hoare annotation was computed. [2020-12-04 19:31:54,533 INFO L262 CegarLoopResult]: For program point L223-1(line 223) no Hoare annotation was computed. [2020-12-04 19:31:54,533 INFO L262 CegarLoopResult]: For program point L223-3(line 223) no Hoare annotation was computed. [2020-12-04 19:31:54,533 INFO L262 CegarLoopResult]: For program point L223-4(line 223) no Hoare annotation was computed. [2020-12-04 19:31:54,533 INFO L262 CegarLoopResult]: For program point L223-6(line 223) no Hoare annotation was computed. [2020-12-04 19:31:54,533 INFO L262 CegarLoopResult]: For program point L223-7(line 223) no Hoare annotation was computed. [2020-12-04 19:31:54,534 INFO L262 CegarLoopResult]: For program point L9555(lines 9555 9557) no Hoare annotation was computed. [2020-12-04 19:31:54,534 INFO L262 CegarLoopResult]: For program point L9539(lines 9539 9540) no Hoare annotation was computed. [2020-12-04 19:31:54,534 INFO L262 CegarLoopResult]: For program point L9539-2(lines 9539 9540) no Hoare annotation was computed. [2020-12-04 19:31:54,534 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 19:31:54,534 INFO L258 CegarLoopResult]: At program point L6600(lines 6598 6601) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| 0))) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.offset| 0)) (.cse2 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.offset 0))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 0)) (and (= (let ((.cse3 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_#res.base|))) (select .cse3 (+ (mod (select .cse3 8) 4294967296) 12))) 0) .cse0 .cse1 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) .cse2 (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0) (= 0 (let ((.cse4 (select |#memory_int| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base))) (select .cse4 (+ (mod (select .cse4 8) 4294967296) 12)))) (< |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (< ULTIMATE.start_ensure_string_is_allocated_~str~0.base |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0)) (= (let ((.cse5 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base|))) (select .cse5 (+ (mod (select .cse5 8) 4294967296) 12))) 0) (< |ULTIMATE.start_ensure_string_is_allocated_#res.base| |#StackHeapBarrier|) (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (< |ULTIMATE.start_bounded_malloc_#res.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0)) (< (+ ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 1) |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|)))) [2020-12-04 19:31:54,535 INFO L258 CegarLoopResult]: At program point L6815(lines 6806 6816) the Hoare annotation is: (and (= (let ((.cse0 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_#res.base|))) (select .cse0 (+ (mod (select .cse0 8) 4294967296) 12))) 0) (< |ULTIMATE.start_ensure_string_is_allocated_#res.base| |#StackHeapBarrier|) (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0) (< |ULTIMATE.start_bounded_malloc_#res.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0)) (< ULTIMATE.start_ensure_string_is_allocated_~str~0.base |#StackHeapBarrier|)) [2020-12-04 19:31:54,535 INFO L262 CegarLoopResult]: For program point L7361-3(line 7361) no Hoare annotation was computed. [2020-12-04 19:31:54,535 INFO L262 CegarLoopResult]: For program point L7361-1(line 7361) no Hoare annotation was computed. [2020-12-04 19:31:54,535 INFO L262 CegarLoopResult]: For program point L7361(lines 7361 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,535 INFO L262 CegarLoopResult]: For program point L7361-7(lines 7361 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,535 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-04 19:31:54,536 INFO L262 CegarLoopResult]: For program point L7361-6(lines 7361 7362) no Hoare annotation was computed. [2020-12-04 19:31:54,536 INFO L262 CegarLoopResult]: For program point L7361-4(lines 7361 7362) no Hoare annotation was computed. [2020-12-04 19:31:54,536 INFO L262 CegarLoopResult]: For program point L7361-11(lines 7361 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,536 INFO L262 CegarLoopResult]: For program point L7361-9(lines 7361 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,536 INFO L262 CegarLoopResult]: For program point L7361-14(line 7361) no Hoare annotation was computed. [2020-12-04 19:31:54,536 INFO L262 CegarLoopResult]: For program point L7361-13(lines 7361 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,536 INFO L262 CegarLoopResult]: For program point L210(lines 210 212) no Hoare annotation was computed. [2020-12-04 19:31:54,537 INFO L258 CegarLoopResult]: At program point L7361-12(lines 7359 7365) the Hoare annotation is: (let ((.cse18 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse16 (select .cse18 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12)))) (let ((.cse2 (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 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse0 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| 0))) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.offset| 0)) (.cse8 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse9 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.offset 0)) (.cse10 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse5 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse12 (let ((.cse17 (select .cse18 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= .cse17 (+ (* 4294967296 (div (+ (* (div .cse17 4294967296) 4294967296) (* .cse16 (- 1)) 4294967295) 4294967296)) .cse16)))) (.cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|) 4) 0))) (.cse13 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse14 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse7 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse15 (<= .cse16 (+ (* 4294967296 (div (+ .cse16 (- 1)) 4294967296)) 4294967295)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse7 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0)) (and .cse0 .cse8 .cse2 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) .cse9 (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0) .cse10 .cse5 (= 0 (let ((.cse11 (select |#memory_int| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base))) (select .cse11 (+ (mod (select .cse11 8) 4294967296) 12)))) .cse6 (< ULTIMATE.start_ensure_string_is_allocated_~str~0.base |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) .cse12 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0)) (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) .cse4 (< |ULTIMATE.start_bounded_malloc_#res.base| |#StackHeapBarrier|) .cse13 .cse14 .cse7 (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0)) (< (+ ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 1) |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|) .cse15) (and .cse0 .cse1 .cse8 .cse9 .cse10 .cse5 .cse6 .cse12 .cse3 .cse13 .cse14 .cse7 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 0) .cse15))))) [2020-12-04 19:31:54,537 INFO L262 CegarLoopResult]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2020-12-04 19:31:54,537 INFO L262 CegarLoopResult]: For program point L7361-19(lines 7361 7362) no Hoare annotation was computed. [2020-12-04 19:31:54,537 INFO L262 CegarLoopResult]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2020-12-04 19:31:54,538 INFO L262 CegarLoopResult]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2020-12-04 19:31:54,538 INFO L262 CegarLoopResult]: For program point L7361-17(lines 7361 7362) no Hoare annotation was computed. [2020-12-04 19:31:54,538 INFO L262 CegarLoopResult]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2020-12-04 19:31:54,538 INFO L262 CegarLoopResult]: For program point L7361-16(line 7361) no Hoare annotation was computed. [2020-12-04 19:31:54,538 INFO L262 CegarLoopResult]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2020-12-04 19:31:54,538 INFO L262 CegarLoopResult]: For program point L7361-22(lines 7361 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,539 INFO L262 CegarLoopResult]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2020-12-04 19:31:54,539 INFO L262 CegarLoopResult]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2020-12-04 19:31:54,539 INFO L262 CegarLoopResult]: For program point L7361-20(lines 7361 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,539 INFO L262 CegarLoopResult]: For program point L210-8(lines 7662 7666) no Hoare annotation was computed. [2020-12-04 19:31:54,539 INFO L262 CegarLoopResult]: For program point L7361-27(line 7361) no Hoare annotation was computed. [2020-12-04 19:31:54,539 INFO L262 CegarLoopResult]: For program point L7361-26(lines 7361 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,540 INFO L258 CegarLoopResult]: At program point L7361-25(lines 7359 7365) the Hoare annotation is: (let ((.cse24 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|))) (let ((.cse23 (select .cse24 12)) (.cse21 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 0)) (.cse20 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base 0)) (.cse19 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ite1550.base| 0))) (let ((.cse0 (not .cse19)) (.cse3 (not .cse20)) (.cse1 (not |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_#t~short1516|)) (.cse5 (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0))) (.cse18 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ite1550.offset| 0)) (.cse7 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0))) (.cse10 (not (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~str.base 0))) (.cse11 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.offset 0)) (.cse12 (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0))) (.cse13 (not .cse21)) (.cse2 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| 0))) (.cse14 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.offset| 0)) (.cse8 (<= .cse23 (+ (* 4294967296 (div (+ .cse23 (- 1)) 4294967296)) 4294967295))) (.cse9 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|) 4) 0))) (.cse4 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse16 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse17 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse6 (let ((.cse22 (select .cse24 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.offset|))) (<= .cse22 (+ .cse23 (* 4294967296 (div (+ (* .cse23 (- 1)) (* (div .cse22 4294967296) 4294967296) 4294967295) 4294967296))))))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0) .cse3 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ite1550.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|) .cse4 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~str.base ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base) .cse5 (< ULTIMATE.start_ensure_string_is_allocated_~str~0.base |#StackHeapBarrier|) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.offset| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ite1550.offset|) .cse6 .cse7 .cse8 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~str.offset 0) (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base) .cse9 .cse10 (< |ULTIMATE.start_bounded_malloc_#res.base| |#StackHeapBarrier|) .cse11 .cse12 .cse13 (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0) (= ULTIMATE.start_aws_string_is_valid_~str.offset 0) (= ULTIMATE.start_aws_string_is_valid_~str.base ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base) .cse14 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.offset ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (= 0 (let ((.cse15 (select |#memory_int| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base))) (select .cse15 (+ (mod (select .cse15 8) 4294967296) 12)))) .cse16 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base) .cse17 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.offset ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~str.offset) (< (+ ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 1) |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|)) (and .cse0 .cse1 .cse2 .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)) .cse3 .cse4 (<= 0 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) .cse16 .cse5 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 0) .cse6 .cse18 .cse7 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base) 4) 0)) .cse8 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0) .cse9 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ite1550.base|) 4) 0)) .cse10 .cse11 .cse17 .cse12 .cse13) (and .cse1 .cse2 .cse14 .cse4 .cse16 .cse5 .cse6 .cse18 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse20) (and .cse2 .cse14 .cse8 .cse9 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.offset 0) .cse4 .cse16 .cse17 .cse21 .cse6))))) [2020-12-04 19:31:54,540 INFO L262 CegarLoopResult]: For program point L7361-24(lines 7361 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,540 INFO L262 CegarLoopResult]: For program point L7361-30(lines 7361 7362) no Hoare annotation was computed. [2020-12-04 19:31:54,540 INFO L262 CegarLoopResult]: For program point L7361-29(line 7361) no Hoare annotation was computed. [2020-12-04 19:31:54,541 INFO L262 CegarLoopResult]: For program point L7361-35(lines 7361 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,541 INFO L262 CegarLoopResult]: For program point L7361-33(lines 7361 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,541 INFO L262 CegarLoopResult]: For program point L7361-32(lines 7361 7362) no Hoare annotation was computed. [2020-12-04 19:31:54,541 INFO L258 CegarLoopResult]: At program point L7361-38(lines 7359 7365) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| 0)) (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) [2020-12-04 19:31:54,541 INFO L262 CegarLoopResult]: For program point L7361-37(lines 7361 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,541 INFO L262 CegarLoopResult]: For program point L211(line 211) no Hoare annotation was computed. [2020-12-04 19:31:54,542 INFO L262 CegarLoopResult]: For program point L211-2(line 211) no Hoare annotation was computed. [2020-12-04 19:31:54,542 INFO L262 CegarLoopResult]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2020-12-04 19:31:54,542 INFO L262 CegarLoopResult]: For program point L211-4(line 211) no Hoare annotation was computed. [2020-12-04 19:31:54,542 INFO L262 CegarLoopResult]: For program point L6256(line 6256) no Hoare annotation was computed. [2020-12-04 19:31:54,542 INFO L262 CegarLoopResult]: For program point L211-6(line 211) no Hoare annotation was computed. [2020-12-04 19:31:54,542 INFO L262 CegarLoopResult]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2020-12-04 19:31:54,543 INFO L258 CegarLoopResult]: At program point L6256-6(lines 6252 6257) the Hoare annotation is: (let ((.cse25 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse23 (select .cse25 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse22 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 0))) (let ((.cse3 (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0))) (.cse15 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ite1550.offset| 0)) (.cse4 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0))) (.cse17 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse6 (not (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~str.base 0))) (.cse19 (not |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_#t~short1514|)) (.cse7 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.offset 0)) (.cse9 (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0))) (.cse10 (not .cse22)) (.cse0 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| 0))) (.cse11 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse1 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.offset 0)) (.cse12 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse2 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse14 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse16 (let ((.cse24 (select .cse25 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= .cse24 (+ (* 4294967296 (div (+ (* (div .cse24 4294967296) 4294967296) (* .cse23 (- 1)) 4294967295) 4294967296)) .cse23)))) (.cse5 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|) 4) 0))) (.cse18 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset)) (.cse8 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse20 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse21 (<= .cse23 (+ (* 4294967296 (div (+ .cse23 (- 1)) 4294967296)) 4294967295)))) (or (and .cse0 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) .cse1 (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ite1550.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|) .cse2 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~str.base ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base) .cse3 (< ULTIMATE.start_ensure_string_is_allocated_~str~0.base |#StackHeapBarrier|) .cse4 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~str.offset 0) (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base) .cse5 .cse6 (< |ULTIMATE.start_bounded_malloc_#res.base| |#StackHeapBarrier|) .cse7 .cse8 (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0) .cse9 .cse10 (= ULTIMATE.start_aws_string_is_valid_~str.offset 0) (= ULTIMATE.start_aws_string_is_valid_~str.base ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base) .cse11 .cse12 (= 0 (let ((.cse13 (select |#memory_int| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base))) (select .cse13 (+ (mod (select .cse13 8) 4294967296) 12)))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (< (+ ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 1) |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|) .cse21) (and .cse0 .cse11 .cse12 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ite1550.base| 0) .cse5 .cse17 .cse6 .cse18 .cse19 .cse7 .cse8 .cse20 .cse9 .cse10 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base 0) .cse21) (and .cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.offset| 0) .cse11 .cse1 .cse12 .cse2 .cse14 .cse16 .cse5 .cse18 .cse8 .cse20 .cse22 .cse21))))) [2020-12-04 19:31:54,543 INFO L262 CegarLoopResult]: For program point L211-8(line 211) no Hoare annotation was computed. [2020-12-04 19:31:54,543 INFO L262 CegarLoopResult]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2020-12-04 19:31:54,543 INFO L262 CegarLoopResult]: For program point L211-10(line 211) no Hoare annotation was computed. [2020-12-04 19:31:54,543 INFO L262 CegarLoopResult]: For program point L6256-9(line 6256) no Hoare annotation was computed. [2020-12-04 19:31:54,544 INFO L262 CegarLoopResult]: For program point L6256-10(line 6256) no Hoare annotation was computed. [2020-12-04 19:31:54,544 INFO L262 CegarLoopResult]: For program point L211-12(line 211) no Hoare annotation was computed. [2020-12-04 19:31:54,544 INFO L262 CegarLoopResult]: For program point L6256-7(line 6256) no Hoare annotation was computed. [2020-12-04 19:31:54,544 INFO L265 CegarLoopResult]: At program point L261(line 261) the Hoare annotation is: true [2020-12-04 19:31:54,544 INFO L262 CegarLoopResult]: For program point L211-14(line 211) no Hoare annotation was computed. [2020-12-04 19:31:54,545 INFO L258 CegarLoopResult]: At program point L6256-13(lines 6252 6257) the Hoare annotation is: (let ((.cse40 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|)) (.cse36 (select |#memory_int| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base))) (let ((.cse37 (select .cse36 8)) (.cse39 (select .cse40 12)) (.cse22 (select .cse40 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| 0))) (.cse1 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse2 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.offset 0)) (.cse3 (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0)) (.cse4 (not (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base 0))) (.cse5 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse6 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~str.base ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base)) (.cse7 (< ULTIMATE.start_ensure_string_is_allocated_~str~0.base |#StackHeapBarrier|)) (.cse8 (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0))) (.cse9 (<= .cse22 (+ .cse39 (* 4294967296 (div (+ (* .cse39 (- 1)) (* (div .cse22 4294967296) 4294967296) 4294967295) 4294967296))))) (.cse10 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0))) (.cse11 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~str.offset 0)) (.cse12 (<= .cse39 (+ (* 4294967296 (div (+ .cse39 (- 1)) 4294967296)) 4294967295))) (.cse13 (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0)) (.cse14 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|) 4) 0))) (.cse15 (not (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~str.base 0))) (.cse16 (< |ULTIMATE.start_bounded_malloc_#res.base| |#StackHeapBarrier|)) (.cse17 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.offset 0)) (.cse18 (let ((.cse38 (div ULTIMATE.start_aws_array_eq_ignore_case_~len_a 4294967296))) (or (not (= ULTIMATE.start_aws_array_eq_ignore_case_~len_a (* .cse38 4294967296))) (and (<= (* 4294967296 .cse38) .cse37) (<= .cse37 ULTIMATE.start_aws_array_eq_ignore_case_~len_a))))) (.cse19 (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0))) (.cse20 (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0)) (.cse21 (= ULTIMATE.start_aws_string_is_valid_~str.offset 0)) (.cse23 (= ULTIMATE.start_aws_string_is_valid_~str.base ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base)) (.cse24 (= |ULTIMATE.start_aws_array_eq_ignore_case_#res| 1)) (.cse25 (= 1 |ULTIMATE.start_aws_string_is_valid_#res|)) (.cse26 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.offset| 0)) (.cse27 (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 (= 0 (select .cse36 (+ (mod .cse37 4294967296) 12)))) (.cse29 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse30 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base) 4) 0))) (.cse31 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_#res| 1)) (.cse33 (select .cse36 (+ ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.offset 8))) (.cse32 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse34 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse35 (< (+ ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 1) |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (= ULTIMATE.start_aws_array_eq_ignore_case_~i~7 0) (<= (* 4294967296 (div (+ .cse22 4294967295) 4294967296)) .cse22) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (<= .cse33 (* 4294967296 (div .cse33 4294967296))) .cse34 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25 .cse26 .cse27 (= ULTIMATE.start_aws_array_eq_ignore_case_~len_a .cse33) .cse28 .cse29 .cse30 .cse31 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base) (= (mod .cse33 4294967296) (mod .cse22 4294967296)) .cse32 (= ULTIMATE.start_aws_array_eq_ignore_case_~len_b .cse22) .cse34 .cse35))))) [2020-12-04 19:31:54,545 INFO L258 CegarLoopResult]: At program point L261-1(line 261) the Hoare annotation is: (and (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (< |ULTIMATE.start_bounded_malloc_#res.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0)) (< ULTIMATE.start_ensure_string_is_allocated_~str~0.base |#StackHeapBarrier|)) [2020-12-04 19:31:54,545 INFO L258 CegarLoopResult]: At program point L261-2(line 261) the Hoare annotation is: (let ((.cse1 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| 0))) (.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.offset| 0)) (.cse3 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.offset 0)) (.cse4 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base))) (or (and (= (let ((.cse0 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_#res.base|))) (select .cse0 (+ (mod (select .cse0 8) 4294967296) 12))) 0) .cse1 .cse2 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) .cse3 (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0) .cse4 (= 0 (let ((.cse5 (select |#memory_int| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base))) (select .cse5 (+ (mod (select .cse5 8) 4294967296) 12)))) .cse6 (< |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (< ULTIMATE.start_ensure_string_is_allocated_~str~0.base |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0)) (= (let ((.cse7 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base|))) (select .cse7 (+ (mod (select .cse7 8) 4294967296) 12))) 0) (< |ULTIMATE.start_ensure_string_is_allocated_#res.base| |#StackHeapBarrier|) (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (< |ULTIMATE.start_bounded_malloc_#res.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0)) (< (+ ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 1) |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|)) (and .cse1 .cse2 .cse3 .cse4 .cse6 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 0)))) [2020-12-04 19:31:54,546 INFO L262 CegarLoopResult]: For program point L211-16(line 211) no Hoare annotation was computed. [2020-12-04 19:31:54,546 INFO L262 CegarLoopResult]: For program point L6256-12(line 6256) no Hoare annotation was computed. [2020-12-04 19:31:54,546 INFO L262 CegarLoopResult]: For program point L7364-2(line 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,546 INFO L262 CegarLoopResult]: For program point L7364(line 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,546 INFO L262 CegarLoopResult]: For program point L7364-6(line 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,547 INFO L258 CegarLoopResult]: At program point L7678(lines 7651 7681) the Hoare annotation is: (let ((.cse40 (select |#memory_int| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base)) (.cse43 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|))) (let ((.cse24 (select .cse43 |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.offset|)) (.cse39 (select .cse43 12)) (.cse38 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 0)) (.cse41 (select .cse40 8))) (let ((.cse0 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ite1550.base| 0))) (.cse2 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse4 (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0)) (.cse5 (not (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base 0))) (.cse7 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~str.base ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base)) (.cse8 (< ULTIMATE.start_ensure_string_is_allocated_~str~0.base |#StackHeapBarrier|)) (.cse9 (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0))) (.cse11 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0))) (.cse13 (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0)) (.cse15 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ite1550.base|) 4) 0))) (.cse16 (not (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~str.base 0))) (.cse17 (< |ULTIMATE.start_bounded_malloc_#res.base| |#StackHeapBarrier|)) (.cse18 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.offset 0)) (.cse19 (let ((.cse42 (div ULTIMATE.start_aws_array_eq_ignore_case_~len_a 4294967296))) (or (not (= ULTIMATE.start_aws_array_eq_ignore_case_~len_a (* .cse42 4294967296))) (and (<= (* 4294967296 .cse42) .cse41) (<= .cse41 ULTIMATE.start_aws_array_eq_ignore_case_~len_a))))) (.cse20 (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0))) (.cse21 (not .cse38)) (.cse22 (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0)) (.cse23 (= ULTIMATE.start_aws_string_is_valid_~str.offset 0)) (.cse25 (= ULTIMATE.start_aws_string_is_valid_~str.base ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base)) (.cse26 (= |ULTIMATE.start_aws_array_eq_ignore_case_#res| 1)) (.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))) (.cse29 (= 0 (select .cse40 (+ (mod .cse41 4294967296) 12)))) (.cse31 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ite1550.offset| 0)) (.cse32 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base) 4) 0))) (.cse34 (select .cse40 (+ ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.offset 8))) (.cse33 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse36 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.offset ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~str.offset)) (.cse37 (< (+ ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 1) |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|)) (.cse1 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| 0))) (.cse27 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.offset| 0)) (.cse12 (<= .cse39 (+ (* 4294967296 (div (+ .cse39 (- 1)) 4294967296)) 4294967295))) (.cse14 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|) 4) 0))) (.cse3 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.offset 0)) (.cse6 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse30 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse35 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse10 (<= .cse24 (+ .cse39 (* 4294967296 (div (+ (* .cse39 (- 1)) (* (div .cse24 4294967296) 4294967296) 4294967295) 4294967296)))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (= ULTIMATE.start_aws_array_eq_ignore_case_~i~7 0) (<= (* 4294967296 (div (+ .cse24 4294967295) 4294967296)) .cse24) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (<= .cse34 (* 4294967296 (div .cse34 4294967296))) .cse35 .cse36 .cse37) (and .cse0 .cse1 (= |ULTIMATE.start_aws_array_eq_ignore_case_#res| 0) .cse27 .cse5 .cse6 .cse30 .cse9 .cse10 .cse11 .cse12 .cse14 .cse16 .cse35 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_#t~ite1550.base| |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 (= ULTIMATE.start_aws_array_eq_ignore_case_~len_a .cse34) .cse29 .cse30 .cse31 .cse32 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_~buf.base) (= (mod .cse34 4294967296) (mod .cse24 4294967296)) .cse33 (= ULTIMATE.start_aws_array_eq_ignore_case_~len_b .cse24) .cse35 .cse36 .cse37) (and .cse1 .cse27 .cse12 .cse14 .cse3 .cse6 .cse30 .cse35 .cse38 .cse10))))) [2020-12-04 19:31:54,547 INFO L262 CegarLoopResult]: For program point L7364-4(line 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,547 INFO L262 CegarLoopResult]: For program point L7364-3(line 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,547 INFO L262 CegarLoopResult]: For program point L7364-9(line 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,547 INFO L262 CegarLoopResult]: For program point L7364-8(line 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,548 INFO L262 CegarLoopResult]: For program point L9429(lines 9429 9437) no Hoare annotation was computed. [2020-12-04 19:31:54,548 INFO L262 CegarLoopResult]: For program point L7364-13(line 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,548 INFO L262 CegarLoopResult]: For program point L7364-12(line 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,548 INFO L262 CegarLoopResult]: For program point L7364-11(line 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,548 INFO L262 CegarLoopResult]: For program point L7364-18(line 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,548 INFO L258 CegarLoopResult]: At program point L6803(lines 6800 6804) the Hoare annotation is: (and (= (let ((.cse0 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_#res.base|))) (select .cse0 (+ (mod (select .cse0 8) 4294967296) 12))) 0) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0) (< |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (< ULTIMATE.start_ensure_string_is_allocated_~str~0.base |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0)) (= (let ((.cse1 (select |#memory_int| |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base|))) (select .cse1 (+ (mod (select .cse1 8) 4294967296) 12))) 0) (< |ULTIMATE.start_ensure_string_is_allocated_#res.base| |#StackHeapBarrier|) (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (< |ULTIMATE.start_bounded_malloc_#res.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0))) [2020-12-04 19:31:54,549 INFO L262 CegarLoopResult]: For program point L7364-17(line 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,549 INFO L262 CegarLoopResult]: For program point L7364-15(line 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,549 INFO L262 CegarLoopResult]: For program point L7364-22(line 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,549 INFO L262 CegarLoopResult]: For program point L7364-21(line 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,549 INFO L262 CegarLoopResult]: For program point L7364-20(line 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,549 INFO L262 CegarLoopResult]: For program point L7364-26(line 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,550 INFO L262 CegarLoopResult]: For program point L7364-24(line 7364) no Hoare annotation was computed. [2020-12-04 19:31:54,550 INFO L258 CegarLoopResult]: At program point L6886(lines 6882 6887) the Hoare annotation is: (and (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (< |ULTIMATE.start_bounded_malloc_#res.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) [2020-12-04 19:31:54,550 INFO L258 CegarLoopResult]: At program point L6886-1(lines 6882 6887) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| 0))) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.offset| 0)) (.cse2 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.offset 0)) (.cse3 (= ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.offset 0)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base| ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf.base)) (.cse6 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) .cse2 (= |ULTIMATE.start_ensure_string_is_allocated_#res.offset| 0) .cse3 (= 0 (let ((.cse4 (select |#memory_int| ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base))) (select .cse4 (+ (mod (select .cse4 8) 4294967296) 12)))) .cse5 (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (< ULTIMATE.start_ensure_string_is_allocated_~str~0.base |#StackHeapBarrier|) (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0)) (= ULTIMATE.start_ensure_string_is_allocated_~str~0.offset 0) (< |ULTIMATE.start_bounded_malloc_#res.base| |#StackHeapBarrier|) .cse6 (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.offset| 0) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0)) (< (+ ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 1) |ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~#buf~3.base|)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (= ULTIMATE.start_aws_string_eq_byte_buf_ignore_case_harness_~str~3.base 0)))) [2020-12-04 19:31:54,550 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-04 19:31:54,550 INFO L265 CegarLoopResult]: At program point L9562(line 9562) the Hoare annotation is: true [2020-12-04 19:31:54,551 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 19:31:54,551 INFO L265 CegarLoopResult]: At program point L266(line 266) the Hoare annotation is: true [2020-12-04 19:31:54,586 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,593 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,594 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,606 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,610 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,611 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,620 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,622 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,622 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,624 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,630 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,630 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,631 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,631 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,640 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,641 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,641 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,642 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,642 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,643 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,649 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,653 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,653 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,654 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,654 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,655 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,668 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,671 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,671 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,672 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,672 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,673 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,676 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,676 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,677 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,677 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,680 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,684 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,684 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,685 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,685 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,685 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,686 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,687 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,687 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,687 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,690 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,691 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,694 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,694 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,707 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,707 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,708 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,708 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,708 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,709 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,709 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,713 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,714 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,714 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,715 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,715 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,715 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,716 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,719 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,719 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,719 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,720 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,720 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,721 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,722 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,722 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,722 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,723 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,725 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,726 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,726 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,727 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,727 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,727 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,728 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,728 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,728 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,729 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:54,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.12 07:31:54 BoogieIcfgContainer [2020-12-04 19:31:54,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-04 19:31:54,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-04 19:31:54,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-04 19:31:54,736 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-04 19:31:54,737 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 07:22:55" (3/4) ... [2020-12-04 19:31:54,741 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-04 19:31:54,782 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 134 nodes and edges [2020-12-04 19:31:54,784 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2020-12-04 19:31:54,787 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2020-12-04 19:31:54,789 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2020-12-04 19:31:54,791 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-12-04 19:31:54,793 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-12-04 19:31:54,795 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-04 19:31:54,798 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-04 19:31:54,859 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(buf == 0) && buf == 0) && str == 0) && str == 0) || ((((((((((((((((((unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0 && !(buf == 0)) && buf == 0) && \result == 0) && str == 0) && \result == 0) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && \result < unknown-#StackHeapBarrier-unknown) && str == 0) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result == 0) && !(str == 0)) && str + 1 < buf) [2020-12-04 19:31:54,859 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0 && !(buf == 0)) && buf == 0) && \result == 0) && str == 0) && \result == 0) && buf == 0) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && \result < unknown-#StackHeapBarrier-unknown) && str == 0) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result == 0) && !(str == 0)) && str + 1 < buf) || (((((!(buf == 0) && buf == 0) && str == 0) && buf == 0) && buf == buf) && str == 0) [2020-12-04 19:31:54,860 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0) [2020-12-04 19:31:54,860 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0 && !(buf == 0)) && buf == 0) && \result == 0) && str == 0) && \result == 0) && buf == 0) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && \result < unknown-#StackHeapBarrier-unknown) && str == 0) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result == 0) && !(str == 0)) && str + 1 < buf) || (((((!(buf == 0) && buf == 0) && str == 0) && buf == 0) && buf == buf) && str == 0) [2020-12-04 19:31:54,860 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((str == 0 && \result == 0) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && !(str == 0)) && str < unknown-#StackHeapBarrier-unknown [2020-12-04 19:31:54,860 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((str == 0 && \result == 0) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && !(str == 0)) && str < unknown-#StackHeapBarrier-unknown [2020-12-04 19:31:54,861 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(buf == 0) && buf == 0) && \result == 0) && str == 0) && \result == 0) && buf == 0) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && !(\result == 0)) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result == 0) && !(str == 0)) && str + 1 < buf) || ((((((!(buf == 0) && buf == 0) && str == 0) && buf == 0) && buf == buf) && !(\result == 0)) && str == 0) [2020-12-04 19:31:54,861 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0 && \result < unknown-#StackHeapBarrier-unknown) && str == 0) && \result == 0) && \result == 0) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && !(\result == 0)) && !(str == 0)) && str < unknown-#StackHeapBarrier-unknown [2020-12-04 19:31:54,861 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0 && \result == 0) && \result == 0) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && \result < unknown-#StackHeapBarrier-unknown) && str == 0) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result == 0) && !(str == 0) [2020-12-04 19:31:54,862 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(buf == 0) && buf == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(#memory_$Pointer$[buf][4] == 0)) && buf == 0) && buf == 0) && buf == buf) && 0 <= \result) && !(\result == 0)) && \result <= 0) || (((((((((((((((((((((((!(buf == 0) && 1 <= \result) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result == 0) && str == 0) && \result == 0) && \result <= 1) && buf == 0) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 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]) && !(\result == 0)) && str == 0) && buf == 0) && \result < unknown-#StackHeapBarrier-unknown) && buf == buf) && buf == buf) && !(\result == 0)) && \result == 0) && !(str == 0)) && str + 1 < buf) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296) + 4294967295)) || (((((((((((((!(buf == 0) && buf == 0) && 1 <= \result) && str == 0) && \result <= 1) && buf == 0) && buf == buf) && 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]) && !(#memory_$Pointer$[buf][4] == 0)) && buf == buf) && buf == buf) && !(\result == 0)) && str == 0) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296) + 4294967295) [2020-12-04 19:31:54,862 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((!(buf == 0) && \result == 0) && str == 0) && \result == 0) && nondet_parameter ? &buf : ((void *)0) == buf) && buf == 0) && str == str) && !(\result == 0)) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && str == 0) && buf == buf) && !(#memory_$Pointer$[buf][4] == 0)) && !(str == 0)) && \result < unknown-#StackHeapBarrier-unknown) && buf == 0) && buf == buf) && \result == 0) && !(str == 0)) && !(str == 0)) && str == 0) && str == str) && 1 <= \result) && \result <= 1) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && nondet_parameter ? &buf : ((void *)0) == 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) && !aux-!str || aws_string_is_valid(str)-aux) && !(\result == 0)) && str + 1 < buf) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296) + 4294967295) || (((((((((((((((((((((!(buf == 0) && 1 <= \result) && \result <= 1) && buf == 0) && buf == buf) && !(\result == 0)) && nondet_parameter ? &buf : ((void *)0) == 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]) && !(\result == 0)) && nondet_parameter ? &buf : ((void *)0) == 0) && !(#memory_$Pointer$[buf][4] == 0)) && buf == 0) && !(str == 0)) && buf == buf) && !aux-!str || aws_string_is_valid(str)-aux) && buf == 0) && buf == buf) && !(\result == 0)) && !(str == 0)) && !(str == 0)) && buf == 0) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296) + 4294967295)) || (((((((((((((!(buf == 0) && buf == 0) && 1 <= \result) && str == 0) && \result <= 1) && buf == 0) && buf == buf) && 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]) && !(#memory_$Pointer$[buf][4] == 0)) && buf == buf) && buf == buf) && !(\result == 0)) && str == 0) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296) + 4294967295) [2020-12-04 19:31:54,863 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(buf == 0) && buf == 0) && \result == 0) && buf == 0) && buf == buf) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && !(#memory_$Pointer$[buf][4] == 0)) && !(str == 0)) && !(\result == 0)) && !(str == 0)) && !(str == 0)) || (((((((((((((((((((((((((((((((((((((((((!(nondet_parameter ? &buf : ((void *)0) == 0) && !(buf == 0)) && \result == 0) && \result == 0) && !(buf == 0)) && nondet_parameter ? &buf : ((void *)0) == buf) && buf == 0) && str == str) && !(\result == 0)) && str < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && str == 0) && str == 0) && !(#memory_$Pointer$[buf][4] == 0)) && buf == buf) && !(#memory_$Pointer$[nondet_parameter ? &buf : ((void *)0)][4] == 0)) && !(str == 0)) && \result < unknown-#StackHeapBarrier-unknown) && buf == 0) && (!(len_a == len_a / 4294967296 * 4294967296) || (4294967296 * (len_a / 4294967296) <= unknown-#memory_int-unknown[str][8] && unknown-#memory_int-unknown[str][8] <= len_a))) && !(str == 0)) && \result == 0) && str == 0) && str == str) && \result == 1) && buf == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && len_a == unknown-#memory_int-unknown[str][str + 8]) && buf == buf) && nondet_parameter ? &buf : ((void *)0) == 0) && !(#memory_$Pointer$[buf][4] == 0)) && \result == 1) && buf == buf) && buf == 0) && unknown-#memory_int-unknown[str][str + 8] % 4294967296 == unknown-#memory_int-unknown[buf][buf] % 4294967296) && len_b == unknown-#memory_int-unknown[buf][buf]) && !(\result == 0)) && str == str) && str + 1 < buf)) || ((((((((((((((((((((((((((((((((((((((!(nondet_parameter ? &buf : ((void *)0) == 0) && !(buf == 0)) && \result == 0) && \result == 0) && !(buf == 0)) && buf == 0) && str == str) && !(\result == 0)) && str < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && str == 0) && str == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[nondet_parameter ? &buf : ((void *)0)][4] == 0)) && !(str == 0)) && \result < unknown-#StackHeapBarrier-unknown) && buf == 0) && (!(len_a == len_a / 4294967296 * 4294967296) || (4294967296 * (len_a / 4294967296) <= unknown-#memory_int-unknown[str][8] && unknown-#memory_int-unknown[str][8] <= len_a))) && !(str == 0)) && \result == 0) && str == 0) && i == 0) && 4294967296 * ((unknown-#memory_int-unknown[buf][buf] + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && str == str) && \result == 1) && buf == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && nondet_parameter ? &buf : ((void *)0) == 0) && !(#memory_$Pointer$[buf][4] == 0)) && \result == 1) && buf == 0) && unknown-#memory_int-unknown[str][str + 8] <= 4294967296 * (unknown-#memory_int-unknown[str][str + 8] / 4294967296)) && !(\result == 0)) && str == str) && str + 1 < buf)) || (((((((((!(buf == 0) && buf == 0) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && !(#memory_$Pointer$[buf][4] == 0)) && str == 0) && buf == 0) && buf == buf) && !(\result == 0)) && str == 0) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) [2020-12-04 19:31:54,864 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((!(nondet_parameter ? &buf : ((void *)0) == 0) && !(buf == 0)) && \result == 0) && str == 0) && \result == 0) && !(buf == 0)) && buf == 0) && str == str) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && str == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[nondet_parameter ? &buf : ((void *)0)][4] == 0)) && !(str == 0)) && \result < unknown-#StackHeapBarrier-unknown) && buf == 0) && (!(len_a == len_a / 4294967296 * 4294967296) || (4294967296 * (len_a / 4294967296) <= unknown-#memory_int-unknown[str][8] && unknown-#memory_int-unknown[str][8] <= len_a))) && !(str == 0)) && !(str == 0)) && \result == 0) && str == 0) && i == 0) && 4294967296 * ((unknown-#memory_int-unknown[buf][buf] + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && str == str) && \result == 1) && buf == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && nondet_parameter ? &buf : ((void *)0) == 0) && !(#memory_$Pointer$[buf][4] == 0)) && buf == 0) && unknown-#memory_int-unknown[str][str + 8] <= 4294967296 * (unknown-#memory_int-unknown[str][str + 8] / 4294967296)) && !(\result == 0)) && str == str) && str + 1 < buf) || (((((((((((((((!(nondet_parameter ? &buf : ((void *)0) == 0) && !(buf == 0)) && \result == 0) && buf == 0) && !(buf == 0)) && buf == 0) && buf == buf) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && !(#memory_$Pointer$[buf][4] == 0)) && !(str == 0)) && !(\result == 0)) && !(str == 0)) && !(str == 0))) || (((((((((((((((((((((((((((((((((((((((((!(nondet_parameter ? &buf : ((void *)0) == 0) && !(buf == 0)) && \result == 0) && str == 0) && \result == 0) && !(buf == 0)) && nondet_parameter ? &buf : ((void *)0) == buf) && buf == 0) && str == str) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && str == 0) && buf == buf) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[nondet_parameter ? &buf : ((void *)0)][4] == 0)) && !(str == 0)) && \result < unknown-#StackHeapBarrier-unknown) && buf == 0) && (!(len_a == len_a / 4294967296 * 4294967296) || (4294967296 * (len_a / 4294967296) <= unknown-#memory_int-unknown[str][8] && unknown-#memory_int-unknown[str][8] <= len_a))) && !(str == 0)) && !(str == 0)) && \result == 0) && str == 0) && str == str) && \result == 1) && buf == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && len_a == unknown-#memory_int-unknown[str][str + 8]) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && nondet_parameter ? &buf : ((void *)0) == 0) && !(#memory_$Pointer$[buf][4] == 0)) && buf == buf) && unknown-#memory_int-unknown[str][str + 8] % 4294967296 == unknown-#memory_int-unknown[buf][buf] % 4294967296) && buf == 0) && len_b == unknown-#memory_int-unknown[buf][buf]) && !(\result == 0)) && str == str) && str + 1 < buf)) || (((((((((!(buf == 0) && buf == 0) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && !(#memory_$Pointer$[buf][4] == 0)) && str == 0) && buf == 0) && buf == buf) && !(\result == 0)) && str == 0) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) [2020-12-04 19:31:54,865 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((!(nondet_parameter ? &buf : ((void *)0) == 0) && !aux-!buf || aws_byte_buf_is_valid(buf)-aux) && !(buf == 0)) && \result == 0) && \result == 0) && !(buf == 0)) && nondet_parameter ? &buf : ((void *)0) == buf) && buf == 0) && str == str) && !(\result == 0)) && str < unknown-#StackHeapBarrier-unknown) && buf == nondet_parameter ? &buf : ((void *)0)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && str == 0) && str == 0) && buf == buf) && !(#memory_$Pointer$[buf][4] == 0)) && !(str == 0)) && \result < unknown-#StackHeapBarrier-unknown) && buf == 0) && !(str == 0)) && !(str == 0)) && \result == 0) && str == 0) && str == str) && buf == 0) && buf == buf) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && buf == buf) && !(\result == 0)) && str == str) && str + 1 < buf) || (((((((((((((((((((((((!(nondet_parameter ? &buf : ((void *)0) == 0) && !aux-!buf || aws_byte_buf_is_valid(buf)-aux) && !(buf == 0)) && buf == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(buf == 0)) && buf == 0) && 0 <= \result) && buf == buf) && !(\result == 0)) && \result <= 0) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && nondet_parameter ? &buf : ((void *)0) == 0) && !(\result == 0)) && !(#memory_$Pointer$[buf][4] == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && buf == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[nondet_parameter ? &buf : ((void *)0)][4] == 0)) && !(str == 0)) && buf == 0) && !(\result == 0)) && !(str == 0)) && !(str == 0))) || (((((((((((((((((!aux-!buf || aws_byte_buf_is_valid(buf)-aux && !(buf == 0)) && buf == 0) && buf == 0) && buf == buf) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && nondet_parameter ? &buf : ((void *)0) == 0) && !(\result == 0)) && nondet_parameter ? &buf : ((void *)0) == 0) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && !(#memory_$Pointer$[buf][4] == 0)) && !(str == 0)) && buf == 0) && !(\result == 0)) && !(str == 0)) && !(str == 0)) && buf == 0)) || (((((((((!(buf == 0) && buf == 0) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && !(#memory_$Pointer$[buf][4] == 0)) && str == 0) && buf == 0) && buf == buf) && !(\result == 0)) && str == 0) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) [2020-12-04 19:31:54,865 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((\result == 0 && str == 0) && \result == 0) && !(buf == 0)) && nondet_parameter ? &buf : ((void *)0) == buf) && buf == 0) && str == str) && !(\result == 0)) && str < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && str == 0) && str == 0) && buf == buf) && !(#memory_$Pointer$[nondet_parameter ? &buf : ((void *)0)][4] == 0)) && \result < unknown-#StackHeapBarrier-unknown) && buf == 0) && \result == 0) && !(str == 0)) && str == 0) && str == str) && buf == 0) && len_a == unknown-#memory_int-unknown[str][str + 8]) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && nondet_parameter ? &buf : ((void *)0) == 0) && buf == buf) && unknown-#memory_int-unknown[str][str + 8] % 4294967296 == unknown-#memory_int-unknown[buf][buf] % 4294967296) && buf == 0) && len_b == unknown-#memory_int-unknown[buf][buf]) && !(\result == 0)) && str + 1 < buf) || (((((((((!(buf == 0) && buf == 0) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && !(#memory_$Pointer$[buf][4] == 0)) && str == 0) && buf == 0) && buf == buf) && !(\result == 0)) && str == 0) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) [2020-12-04 19:31:54,865 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((!(buf == 0) && \result == 0) && str == 0) && \result == 0) && !(buf == 0)) && buf == 0) && str == str) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && !(\result == 0)) && str == 0) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && str == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(str == 0)) && \result < unknown-#StackHeapBarrier-unknown) && buf == 0) && (!(len_a == len_a / 4294967296 * 4294967296) || (4294967296 * (len_a / 4294967296) <= unknown-#memory_int-unknown[str][8] && unknown-#memory_int-unknown[str][8] <= len_a))) && !(str == 0)) && \result == 0) && str == 0) && i == 0) && 4294967296 * ((unknown-#memory_int-unknown[buf][buf] + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && str == str) && \result == 1) && 1 == \result) && buf == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && !(#memory_$Pointer$[buf][4] == 0)) && \result == 1) && buf == 0) && unknown-#memory_int-unknown[str][str + 8] <= 4294967296 * (unknown-#memory_int-unknown[str][str + 8] / 4294967296)) && !(\result == 0)) && str + 1 < buf) || ((((((((((((((((((((((((((((((((((((((!(buf == 0) && \result == 0) && str == 0) && \result == 0) && !(buf == 0)) && buf == 0) && str == str) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && !(\result == 0)) && str == 0) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && str == 0) && buf == buf) && !(#memory_$Pointer$[buf][4] == 0)) && !(str == 0)) && \result < unknown-#StackHeapBarrier-unknown) && buf == 0) && (!(len_a == len_a / 4294967296 * 4294967296) || (4294967296 * (len_a / 4294967296) <= unknown-#memory_int-unknown[str][8] && unknown-#memory_int-unknown[str][8] <= len_a))) && !(str == 0)) && \result == 0) && str == 0) && str == str) && \result == 1) && 1 == \result) && buf == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && len_a == unknown-#memory_int-unknown[str][str + 8]) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && !(#memory_$Pointer$[buf][4] == 0)) && \result == 1) && buf == buf) && unknown-#memory_int-unknown[str][str + 8] % 4294967296 == unknown-#memory_int-unknown[buf][buf] % 4294967296) && buf == 0) && len_b == unknown-#memory_int-unknown[buf][buf]) && !(\result == 0)) && str + 1 < buf) [2020-12-04 19:31:54,866 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(buf == 0) && 1 <= \result) && \result <= 1 [2020-12-04 19:31:56,070 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-04 19:31:56,071 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-04 19:31:56,072 INFO L168 Benchmark]: Toolchain (without parser) took 554481.60 ms. Allocated memory was 52.4 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 32.5 MB in the beginning and 1.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 16.1 GB. [2020-12-04 19:31:56,072 INFO L168 Benchmark]: CDTParser took 0.67 ms. Allocated memory is still 52.4 MB. Free memory is still 35.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-04 19:31:56,073 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3806.59 ms. Allocated memory was 52.4 MB in the beginning and 169.9 MB in the end (delta: 117.4 MB). Free memory was 32.2 MB in the beginning and 72.8 MB in the end (delta: -40.6 MB). Peak memory consumption was 79.9 MB. Max. memory is 16.1 GB. [2020-12-04 19:31:56,073 INFO L168 Benchmark]: Boogie Procedure Inliner took 319.78 ms. Allocated memory is still 169.9 MB. Free memory was 72.8 MB in the beginning and 60.2 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-04 19:31:56,074 INFO L168 Benchmark]: Boogie Preprocessor took 137.69 ms. Allocated memory is still 169.9 MB. Free memory was 60.2 MB in the beginning and 50.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-04 19:31:56,074 INFO L168 Benchmark]: RCFGBuilder took 9952.56 ms. Allocated memory was 169.9 MB in the beginning and 522.2 MB in the end (delta: 352.3 MB). Free memory was 50.7 MB in the beginning and 295.8 MB in the end (delta: -245.1 MB). Peak memory consumption was 197.3 MB. Max. memory is 16.1 GB. [2020-12-04 19:31:56,075 INFO L168 Benchmark]: TraceAbstraction took 538922.22 ms. Allocated memory was 522.2 MB in the beginning and 1.9 GB in the end (delta: 1.4 GB). Free memory was 294.8 MB in the beginning and 809.9 MB in the end (delta: -515.1 MB). Peak memory consumption was 981.3 MB. Max. memory is 16.1 GB. [2020-12-04 19:31:56,075 INFO L168 Benchmark]: Witness Printer took 1334.66 ms. Allocated memory is still 1.9 GB. Free memory was 809.9 MB in the beginning and 1.1 GB in the end (delta: -274.0 MB). Peak memory consumption was 165.3 MB. Max. memory is 16.1 GB. [2020-12-04 19:31:56,077 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.67 ms. Allocated memory is still 52.4 MB. Free memory is still 35.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 3806.59 ms. Allocated memory was 52.4 MB in the beginning and 169.9 MB in the end (delta: 117.4 MB). Free memory was 32.2 MB in the beginning and 72.8 MB in the end (delta: -40.6 MB). Peak memory consumption was 79.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 319.78 ms. Allocated memory is still 169.9 MB. Free memory was 72.8 MB in the beginning and 60.2 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 137.69 ms. Allocated memory is still 169.9 MB. Free memory was 60.2 MB in the beginning and 50.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * RCFGBuilder took 9952.56 ms. Allocated memory was 169.9 MB in the beginning and 522.2 MB in the end (delta: 352.3 MB). Free memory was 50.7 MB in the beginning and 295.8 MB in the end (delta: -245.1 MB). Peak memory consumption was 197.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 538922.22 ms. Allocated memory was 522.2 MB in the beginning and 1.9 GB in the end (delta: 1.4 GB). Free memory was 294.8 MB in the beginning and 809.9 MB in the end (delta: -515.1 MB). Peak memory consumption was 981.3 MB. Max. memory is 16.1 GB. * Witness Printer took 1334.66 ms. Allocated memory is still 1.9 GB. Free memory was 809.9 MB in the beginning and 1.1 GB in the end (delta: -274.0 MB). Peak memory consumption was 165.3 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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: ((((((((unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0 && \result < unknown-#StackHeapBarrier-unknown) && str == 0) && \result == 0) && \result == 0) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && !(\result == 0)) && !(str == 0)) && str < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 6252]: Loop Invariant [2020-12-04 19:31:56,096 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,099 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,099 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((((((((((!(buf == 0) && \result == 0) && str == 0) && \result == 0) && nondet_parameter ? &buf : ((void *)0) == buf) && buf == 0) && str == str) && !(\result == 0)) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && str == 0) && buf == buf) && !(#memory_$Pointer$[buf][4] == 0)) && !(str == 0)) && \result < unknown-#StackHeapBarrier-unknown) && buf == 0) && buf == buf) && \result == 0) && !(str == 0)) && !(str == 0)) && str == 0) && str == str) && 1 <= \result) && \result <= 1) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && nondet_parameter ? &buf : ((void *)0) == 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) && !aux-!str || aws_string_is_valid(str)-aux) && !(\result == 0)) && str + 1 < buf) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296) + 4294967295) || (((((((((((((((((((((!(buf == 0) && 1 <= \result) && \result <= 1) && buf == 0) && buf == buf) && !(\result == 0)) && nondet_parameter ? &buf : ((void *)0) == 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]) && !(\result == 0)) && nondet_parameter ? &buf : ((void *)0) == 0) && !(#memory_$Pointer$[buf][4] == 0)) && buf == 0) && !(str == 0)) && buf == buf) && !aux-!str || aws_string_is_valid(str)-aux) && buf == 0) && buf == buf) && !(\result == 0)) && !(str == 0)) && !(str == 0)) && buf == 0) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296) + 4294967295)) || (((((((((((((!(buf == 0) && buf == 0) && 1 <= \result) && str == 0) && \result <= 1) && buf == 0) && buf == buf) && 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]) && !(#memory_$Pointer$[buf][4] == 0)) && buf == buf) && buf == buf) && !(\result == 0)) && str == 0) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296) + 4294967295) - InvariantResult [Line: 6889]: Loop Invariant Derived loop invariant: ((((str == 0 && \result == 0) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && !(str == 0)) && str < unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 7359]: Loop Invariant [2020-12-04 19:31:56,102 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,102 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,102 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,103 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,104 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,104 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,104 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,105 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((!(buf == 0) && buf == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(#memory_$Pointer$[buf][4] == 0)) && buf == 0) && buf == 0) && buf == buf) && 0 <= \result) && !(\result == 0)) && \result <= 0) || (((((((((((((((((((((((!(buf == 0) && 1 <= \result) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && \result == 0) && str == 0) && \result == 0) && \result <= 1) && buf == 0) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 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]) && !(\result == 0)) && str == 0) && buf == 0) && \result < unknown-#StackHeapBarrier-unknown) && buf == buf) && buf == buf) && !(\result == 0)) && \result == 0) && !(str == 0)) && str + 1 < buf) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296) + 4294967295)) || (((((((((((((!(buf == 0) && buf == 0) && 1 <= \result) && str == 0) && \result <= 1) && buf == 0) && buf == buf) && 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]) && !(#memory_$Pointer$[buf][4] == 0)) && buf == buf) && buf == buf) && !(\result == 0)) && str == 0) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296) + 4294967295) - InvariantResult [Line: 6252]: Loop Invariant [2020-12-04 19:31:56,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,106 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,107 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,107 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,107 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,108 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,109 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,110 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,110 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,110 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,110 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,111 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((((((((!(buf == 0) && \result == 0) && str == 0) && \result == 0) && !(buf == 0)) && buf == 0) && str == str) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && !(\result == 0)) && str == 0) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && str == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(str == 0)) && \result < unknown-#StackHeapBarrier-unknown) && buf == 0) && (!(len_a == len_a / 4294967296 * 4294967296) || (4294967296 * (len_a / 4294967296) <= unknown-#memory_int-unknown[str][8] && unknown-#memory_int-unknown[str][8] <= len_a))) && !(str == 0)) && \result == 0) && str == 0) && i == 0) && 4294967296 * ((unknown-#memory_int-unknown[buf][buf] + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && str == str) && \result == 1) && 1 == \result) && buf == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && !(#memory_$Pointer$[buf][4] == 0)) && \result == 1) && buf == 0) && unknown-#memory_int-unknown[str][str + 8] <= 4294967296 * (unknown-#memory_int-unknown[str][str + 8] / 4294967296)) && !(\result == 0)) && str + 1 < buf) || ((((((((((((((((((((((((((((((((((((((!(buf == 0) && \result == 0) && str == 0) && \result == 0) && !(buf == 0)) && buf == 0) && str == str) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && !(\result == 0)) && str == 0) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && str == 0) && buf == buf) && !(#memory_$Pointer$[buf][4] == 0)) && !(str == 0)) && \result < unknown-#StackHeapBarrier-unknown) && buf == 0) && (!(len_a == len_a / 4294967296 * 4294967296) || (4294967296 * (len_a / 4294967296) <= unknown-#memory_int-unknown[str][8] && unknown-#memory_int-unknown[str][8] <= len_a))) && !(str == 0)) && \result == 0) && str == 0) && str == str) && \result == 1) && 1 == \result) && buf == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && len_a == unknown-#memory_int-unknown[str][str + 8]) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && !(#memory_$Pointer$[buf][4] == 0)) && \result == 1) && buf == buf) && unknown-#memory_int-unknown[str][str + 8] % 4294967296 == unknown-#memory_int-unknown[buf][buf] % 4294967296) && buf == 0) && len_b == unknown-#memory_int-unknown[buf][buf]) && !(\result == 0)) && str + 1 < buf) - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7359]: Loop Invariant Derived loop invariant: (!(buf == 0) && 1 <= \result) && \result <= 1 - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: (\result == 0 && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0) - InvariantResult [Line: 9562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: ((((((((((((((((!(buf == 0) && buf == 0) && \result == 0) && str == 0) && \result == 0) && buf == 0) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && !(\result == 0)) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str == 0) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result == 0) && !(str == 0)) && str + 1 < buf) || ((((((!(buf == 0) && buf == 0) && str == 0) && buf == 0) && buf == buf) && !(\result == 0)) && str == 0) - InvariantResult [Line: 6889]: Loop Invariant Derived loop invariant: ((((((((((((((((((((unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0 && !(buf == 0)) && buf == 0) && \result == 0) && str == 0) && \result == 0) && buf == 0) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && \result < unknown-#StackHeapBarrier-unknown) && str == 0) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result == 0) && !(str == 0)) && str + 1 < buf) || (((((!(buf == 0) && buf == 0) && str == 0) && buf == 0) && buf == buf) && str == 0) - InvariantResult [Line: 7651]: Loop Invariant [2020-12-04 19:31:56,116 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,117 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,117 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,117 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,119 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,121 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,122 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,123 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,124 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,124 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,124 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((!(nondet_parameter ? &buf : ((void *)0) == 0) && !(buf == 0)) && \result == 0) && str == 0) && \result == 0) && !(buf == 0)) && buf == 0) && str == str) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && str == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[nondet_parameter ? &buf : ((void *)0)][4] == 0)) && !(str == 0)) && \result < unknown-#StackHeapBarrier-unknown) && buf == 0) && (!(len_a == len_a / 4294967296 * 4294967296) || (4294967296 * (len_a / 4294967296) <= unknown-#memory_int-unknown[str][8] && unknown-#memory_int-unknown[str][8] <= len_a))) && !(str == 0)) && !(str == 0)) && \result == 0) && str == 0) && i == 0) && 4294967296 * ((unknown-#memory_int-unknown[buf][buf] + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && str == str) && \result == 1) && buf == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && nondet_parameter ? &buf : ((void *)0) == 0) && !(#memory_$Pointer$[buf][4] == 0)) && buf == 0) && unknown-#memory_int-unknown[str][str + 8] <= 4294967296 * (unknown-#memory_int-unknown[str][str + 8] / 4294967296)) && !(\result == 0)) && str == str) && str + 1 < buf) || (((((((((((((((!(nondet_parameter ? &buf : ((void *)0) == 0) && !(buf == 0)) && \result == 0) && buf == 0) && !(buf == 0)) && buf == 0) && buf == buf) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && !(#memory_$Pointer$[buf][4] == 0)) && !(str == 0)) && !(\result == 0)) && !(str == 0)) && !(str == 0))) || (((((((((((((((((((((((((((((((((((((((((!(nondet_parameter ? &buf : ((void *)0) == 0) && !(buf == 0)) && \result == 0) && str == 0) && \result == 0) && !(buf == 0)) && nondet_parameter ? &buf : ((void *)0) == buf) && buf == 0) && str == str) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && str == 0) && buf == buf) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[nondet_parameter ? &buf : ((void *)0)][4] == 0)) && !(str == 0)) && \result < unknown-#StackHeapBarrier-unknown) && buf == 0) && (!(len_a == len_a / 4294967296 * 4294967296) || (4294967296 * (len_a / 4294967296) <= unknown-#memory_int-unknown[str][8] && unknown-#memory_int-unknown[str][8] <= len_a))) && !(str == 0)) && !(str == 0)) && \result == 0) && str == 0) && str == str) && \result == 1) && buf == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && len_a == unknown-#memory_int-unknown[str][str + 8]) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && nondet_parameter ? &buf : ((void *)0) == 0) && !(#memory_$Pointer$[buf][4] == 0)) && buf == buf) && unknown-#memory_int-unknown[str][str + 8] % 4294967296 == unknown-#memory_int-unknown[buf][buf] % 4294967296) && buf == 0) && len_b == unknown-#memory_int-unknown[buf][buf]) && !(\result == 0)) && str == str) && str + 1 < buf)) || (((((((((!(buf == 0) && buf == 0) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && !(#memory_$Pointer$[buf][4] == 0)) && str == 0) && buf == 0) && buf == buf) && !(\result == 0)) && str == 0) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) - InvariantResult [Line: 7670]: Loop Invariant [2020-12-04 19:31:56,127 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,127 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,128 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,128 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((((\result == 0 && str == 0) && \result == 0) && !(buf == 0)) && nondet_parameter ? &buf : ((void *)0) == buf) && buf == 0) && str == str) && !(\result == 0)) && str < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && str == 0) && str == 0) && buf == buf) && !(#memory_$Pointer$[nondet_parameter ? &buf : ((void *)0)][4] == 0)) && \result < unknown-#StackHeapBarrier-unknown) && buf == 0) && \result == 0) && !(str == 0)) && str == 0) && str == str) && buf == 0) && len_a == unknown-#memory_int-unknown[str][str + 8]) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && nondet_parameter ? &buf : ((void *)0) == 0) && buf == buf) && unknown-#memory_int-unknown[str][str + 8] % 4294967296 == unknown-#memory_int-unknown[buf][buf] % 4294967296) && buf == 0) && len_b == unknown-#memory_int-unknown[buf][buf]) && !(\result == 0)) && str + 1 < buf) || (((((((((!(buf == 0) && buf == 0) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && !(#memory_$Pointer$[buf][4] == 0)) && str == 0) && buf == 0) && buf == buf) && !(\result == 0)) && str == 0) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) - InvariantResult [Line: 6800]: Loop Invariant Derived loop invariant: ((((((((((((unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0 && \result == 0) && \result == 0) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && \result < unknown-#StackHeapBarrier-unknown) && str == 0) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result == 0) && !(str == 0) - InvariantResult [Line: 6598]: Loop Invariant Derived loop invariant: (((!(buf == 0) && buf == 0) && str == 0) && str == 0) || ((((((((((((((((((unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0 && !(buf == 0)) && buf == 0) && \result == 0) && str == 0) && \result == 0) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && \result < unknown-#StackHeapBarrier-unknown) && str == 0) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result == 0) && !(str == 0)) && str + 1 < buf) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((((((((((((((((((unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0 && !(buf == 0)) && buf == 0) && \result == 0) && str == 0) && \result == 0) && buf == 0) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && str < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && unknown-#memory_int-unknown[\result][unknown-#memory_int-unknown[\result][8] % 4294967296 + 12] == 0) && \result < unknown-#StackHeapBarrier-unknown) && str == 0) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result == 0) && !(str == 0)) && str + 1 < buf) || (((((!(buf == 0) && buf == 0) && str == 0) && buf == 0) && buf == buf) && str == 0) - InvariantResult [Line: 7359]: Loop Invariant [2020-12-04 19:31:56,132 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,133 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,133 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,133 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,134 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,136 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,136 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,137 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,138 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((((((((!(nondet_parameter ? &buf : ((void *)0) == 0) && !aux-!buf || aws_byte_buf_is_valid(buf)-aux) && !(buf == 0)) && \result == 0) && \result == 0) && !(buf == 0)) && nondet_parameter ? &buf : ((void *)0) == buf) && buf == 0) && str == str) && !(\result == 0)) && str < unknown-#StackHeapBarrier-unknown) && buf == nondet_parameter ? &buf : ((void *)0)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && str == 0) && str == 0) && buf == buf) && !(#memory_$Pointer$[buf][4] == 0)) && !(str == 0)) && \result < unknown-#StackHeapBarrier-unknown) && buf == 0) && !(str == 0)) && !(str == 0)) && \result == 0) && str == 0) && str == str) && buf == 0) && buf == buf) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && buf == buf) && !(\result == 0)) && str == str) && str + 1 < buf) || (((((((((((((((((((((((!(nondet_parameter ? &buf : ((void *)0) == 0) && !aux-!buf || aws_byte_buf_is_valid(buf)-aux) && !(buf == 0)) && buf == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && !(buf == 0)) && buf == 0) && 0 <= \result) && buf == buf) && !(\result == 0)) && \result <= 0) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && nondet_parameter ? &buf : ((void *)0) == 0) && !(\result == 0)) && !(#memory_$Pointer$[buf][4] == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && buf == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[nondet_parameter ? &buf : ((void *)0)][4] == 0)) && !(str == 0)) && buf == 0) && !(\result == 0)) && !(str == 0)) && !(str == 0))) || (((((((((((((((((!aux-!buf || aws_byte_buf_is_valid(buf)-aux && !(buf == 0)) && buf == 0) && buf == 0) && buf == buf) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && nondet_parameter ? &buf : ((void *)0) == 0) && !(\result == 0)) && nondet_parameter ? &buf : ((void *)0) == 0) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && !(#memory_$Pointer$[buf][4] == 0)) && !(str == 0)) && buf == 0) && !(\result == 0)) && !(str == 0)) && !(str == 0)) && buf == 0)) || (((((((((!(buf == 0) && buf == 0) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && !(#memory_$Pointer$[buf][4] == 0)) && str == 0) && buf == 0) && buf == buf) && !(\result == 0)) && str == 0) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) - InvariantResult [Line: 9416]: Loop Invariant [2020-12-04 19:31:56,140 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,140 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,140 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,141 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,141 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,141 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,141 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,142 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,142 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,142 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,144 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,145 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,145 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,145 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,146 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,146 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,146 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,147 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,147 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 19:31:56,147 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((!(buf == 0) && buf == 0) && \result == 0) && buf == 0) && buf == buf) && !(\result == 0)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && !(#memory_$Pointer$[buf][4] == 0)) && !(str == 0)) && !(\result == 0)) && !(str == 0)) && !(str == 0)) || (((((((((((((((((((((((((((((((((((((((((!(nondet_parameter ? &buf : ((void *)0) == 0) && !(buf == 0)) && \result == 0) && \result == 0) && !(buf == 0)) && nondet_parameter ? &buf : ((void *)0) == buf) && buf == 0) && str == str) && !(\result == 0)) && str < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && str == 0) && str == 0) && !(#memory_$Pointer$[buf][4] == 0)) && buf == buf) && !(#memory_$Pointer$[nondet_parameter ? &buf : ((void *)0)][4] == 0)) && !(str == 0)) && \result < unknown-#StackHeapBarrier-unknown) && buf == 0) && (!(len_a == len_a / 4294967296 * 4294967296) || (4294967296 * (len_a / 4294967296) <= unknown-#memory_int-unknown[str][8] && unknown-#memory_int-unknown[str][8] <= len_a))) && !(str == 0)) && \result == 0) && str == 0) && str == str) && \result == 1) && buf == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && len_a == unknown-#memory_int-unknown[str][str + 8]) && buf == buf) && nondet_parameter ? &buf : ((void *)0) == 0) && !(#memory_$Pointer$[buf][4] == 0)) && \result == 1) && buf == buf) && buf == 0) && unknown-#memory_int-unknown[str][str + 8] % 4294967296 == unknown-#memory_int-unknown[buf][buf] % 4294967296) && len_b == unknown-#memory_int-unknown[buf][buf]) && !(\result == 0)) && str == str) && str + 1 < buf)) || ((((((((((((((((((((((((((((((((((((((!(nondet_parameter ? &buf : ((void *)0) == 0) && !(buf == 0)) && \result == 0) && \result == 0) && !(buf == 0)) && buf == 0) && str == str) && !(\result == 0)) && str < unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) && !(\result == 0)) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && str == 0) && str == 0) && !(#memory_$Pointer$[buf][4] == 0)) && !(#memory_$Pointer$[nondet_parameter ? &buf : ((void *)0)][4] == 0)) && !(str == 0)) && \result < unknown-#StackHeapBarrier-unknown) && buf == 0) && (!(len_a == len_a / 4294967296 * 4294967296) || (4294967296 * (len_a / 4294967296) <= unknown-#memory_int-unknown[str][8] && unknown-#memory_int-unknown[str][8] <= len_a))) && !(str == 0)) && \result == 0) && str == 0) && i == 0) && 4294967296 * ((unknown-#memory_int-unknown[buf][buf] + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[buf][buf]) && str == str) && \result == 1) && buf == 0) && !(#memory_$Pointer$[buf][buf + 4] == 0)) && 0 == unknown-#memory_int-unknown[str][unknown-#memory_int-unknown[str][8] % 4294967296 + 12]) && buf == buf) && nondet_parameter ? &buf : ((void *)0) == 0) && !(#memory_$Pointer$[buf][4] == 0)) && \result == 1) && buf == 0) && unknown-#memory_int-unknown[str][str + 8] <= 4294967296 * (unknown-#memory_int-unknown[str][str + 8] / 4294967296)) && !(\result == 0)) && str == str) && str + 1 < buf)) || (((((((((!(buf == 0) && buf == 0) && unknown-#memory_int-unknown[buf][12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][12] + -1) / 4294967296) + 4294967295) && !(#memory_$Pointer$[buf][4] == 0)) && str == 0) && buf == 0) && buf == buf) && !(\result == 0)) && str == 0) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][12] + 4294967296 * ((unknown-#memory_int-unknown[buf][12] * -1 + unknown-#memory_int-unknown[buf][buf] / 4294967296 * 4294967296 + 4294967295) / 4294967296)) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((str == 0 && \result == 0) && \result < unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && !(str == 0)) && str < unknown-#StackHeapBarrier-unknown - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 501.1s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 119.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 37.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4414 SDtfs, 12413 SDslu, 15292 SDs, 0 SdLazy, 4354 SolverSat, 532 SolverUnsat, 39 SolverUnknown, 0 SolverNotchecked, 89.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 756 GetRequests, 230 SyntacticMatches, 20 SemanticMatches, 506 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2502 ImplicationChecksByTransitivity, 54.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=507occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 34 MinimizatonAttempts, 2073 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 74 NumberOfFragments, 4145 HoareAnnotationTreeSize, 20 FomulaSimplifications, 232996833 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 20 FomulaSimplificationsInter, 9069507 FormulaSimplificationTreeSizeReductionInter, 35.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 337.0s SatisfiabilityAnalysisTime, 41.3s InterpolantComputationTime, 2549 NumberOfCodeBlocks, 2549 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2513 ConstructedInterpolants, 0 QuantifiedInterpolants, 2839891 SizeOfPredicates, 113 NumberOfNonLiveVariables, 6195 ConjunctsInSsa, 231 ConjunctsInUnsatCore, 36 InterpolantComputations, 34 PerfectInterpolantSequences, 2/4 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...