./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_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 bd5e922bebe187c1230ec455171e0dbeb52eef7c95cec8ebc1ad02d91040db3c --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 10:15:32,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 10:15:32,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 10:15:32,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 10:15:32,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 10:15:32,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 10:15:32,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 10:15:32,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 10:15:32,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 10:15:32,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 10:15:32,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 10:15:32,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 10:15:32,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 10:15:32,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 10:15:32,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 10:15:32,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 10:15:32,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 10:15:32,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 10:15:32,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 10:15:32,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 10:15:32,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 10:15:32,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 10:15:32,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 10:15:32,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 10:15:32,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 10:15:32,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 10:15:32,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 10:15:32,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 10:15:32,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 10:15:32,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 10:15:32,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 10:15:32,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 10:15:32,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 10:15:32,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 10:15:32,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 10:15:32,428 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 10:15:32,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 10:15:32,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 10:15:32,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 10:15:32,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 10:15:32,430 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 10:15:32,431 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 10:15:32,460 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 10:15:32,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 10:15:32,461 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 10:15:32,461 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 10:15:32,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 10:15:32,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 10:15:32,463 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 10:15:32,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 10:15:32,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 10:15:32,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 10:15:32,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 10:15:32,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 10:15:32,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 10:15:32,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 10:15:32,465 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 10:15:32,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 10:15:32,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 10:15:32,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 10:15:32,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 10:15:32,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 10:15:32,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 10:15:32,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 10:15:32,466 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 10:15:32,467 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 10:15:32,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 10:15:32,467 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 10:15:32,467 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 10:15:32,467 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 10:15:32,468 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 10:15:32,468 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 -> bd5e922bebe187c1230ec455171e0dbeb52eef7c95cec8ebc1ad02d91040db3c [2021-11-06 10:15:32,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 10:15:32,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 10:15:32,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 10:15:32,718 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 10:15:32,719 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 10:15:32,720 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i [2021-11-06 10:15:32,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f9476f44/06e62316f40e4f02813338e0f4b47f12/FLAG5e60c55b0 [2021-11-06 10:15:33,368 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 10:15:33,371 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i [2021-11-06 10:15:33,421 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f9476f44/06e62316f40e4f02813338e0f4b47f12/FLAG5e60c55b0 [2021-11-06 10:15:33,543 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f9476f44/06e62316f40e4f02813338e0f4b47f12 [2021-11-06 10:15:33,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 10:15:33,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 10:15:33,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 10:15:33,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 10:15:33,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 10:15:33,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:33" (1/1) ... [2021-11-06 10:15:33,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e20b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:33, skipping insertion in model container [2021-11-06 10:15:33,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:15:33" (1/1) ... [2021-11-06 10:15:33,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 10:15:33,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 10:15:33,852 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4497,4510] [2021-11-06 10:15:33,857 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4557,4570] [2021-11-06 10:15:33,870 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 10:15:33,874 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 10:15:34,492 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:34,501 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:34,503 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:34,503 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:34,504 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:34,516 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:34,522 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:34,524 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:34,524 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:34,775 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 10:15:34,776 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 10:15:34,777 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 10:15:34,778 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 10:15:34,779 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 10:15:34,780 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 10:15:34,780 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 10:15:34,781 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 10:15:34,781 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 10:15:34,782 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 10:15:34,876 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 10:15:34,938 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:34,947 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:35,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 10:15:35,055 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 10:15:35,068 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4497,4510] [2021-11-06 10:15:35,069 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_from_array_harness.i[4557,4570] [2021-11-06 10:15:35,070 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-06 10:15:35,070 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-06 10:15:35,153 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:35,171 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:35,171 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:35,172 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:35,174 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:35,181 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:35,182 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:35,183 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:35,184 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:35,218 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-06 10:15:35,219 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-06 10:15:35,219 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-06 10:15:35,220 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-06 10:15:35,220 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-06 10:15:35,221 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-06 10:15:35,221 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-06 10:15:35,221 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-06 10:15:35,222 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-06 10:15:35,222 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-06 10:15:35,245 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-06 10:15:35,300 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:35,301 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-06 10:15:35,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 10:15:35,518 INFO L208 MainTranslator]: Completed translation [2021-11-06 10:15:35,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:35 WrapperNode [2021-11-06 10:15:35,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 10:15:35,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 10:15:35,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 10:15:35,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 10:15:35,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:35" (1/1) ... [2021-11-06 10:15:35,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:35" (1/1) ... [2021-11-06 10:15:35,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 10:15:35,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 10:15:35,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 10:15:35,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 10:15:35,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:35" (1/1) ... [2021-11-06 10:15:35,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:35" (1/1) ... [2021-11-06 10:15:35,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:35" (1/1) ... [2021-11-06 10:15:35,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:35" (1/1) ... [2021-11-06 10:15:35,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:35" (1/1) ... [2021-11-06 10:15:35,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:35" (1/1) ... [2021-11-06 10:15:35,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:35" (1/1) ... [2021-11-06 10:15:35,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 10:15:35,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 10:15:35,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 10:15:35,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 10:15:35,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:35" (1/1) ... [2021-11-06 10:15:35,784 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 10:15:35,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 10:15:35,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 10:15:35,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 10:15:35,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 10:15:35,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 10:15:35,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 10:15:35,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 10:15:35,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 10:15:35,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 10:15:35,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 10:15:35,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 10:15:35,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 10:15:35,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 10:15:35,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 10:15:43,590 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 10:15:43,590 INFO L299 CfgBuilder]: Removed 38 assume(true) statements. [2021-11-06 10:15:43,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:43 BoogieIcfgContainer [2021-11-06 10:15:43,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 10:15:43,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 10:15:43,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 10:15:43,596 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 10:15:43,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:15:33" (1/3) ... [2021-11-06 10:15:43,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed743ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:43, skipping insertion in model container [2021-11-06 10:15:43,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:15:35" (2/3) ... [2021-11-06 10:15:43,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed743ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:15:43, skipping insertion in model container [2021-11-06 10:15:43,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:43" (3/3) ... [2021-11-06 10:15:43,599 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_from_array_harness.i [2021-11-06 10:15:43,603 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 10:15:43,603 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2021-11-06 10:15:43,639 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 10:15:43,644 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 10:15:43,645 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-11-06 10:15:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 77 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:43,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-06 10:15:43,660 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:43,661 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:15:43,661 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:15:43,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:43,665 INFO L85 PathProgramCache]: Analyzing trace with hash 810375617, now seen corresponding path program 1 times [2021-11-06 10:15:43,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:43,673 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957759476] [2021-11-06 10:15:43,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:43,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:15:44,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:44,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957759476] [2021-11-06 10:15:44,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957759476] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:44,229 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:44,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 10:15:44,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189288530] [2021-11-06 10:15:44,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 10:15:44,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:44,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 10:15:44,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 10:15:44,246 INFO L87 Difference]: Start difference. First operand has 78 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 77 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:44,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:44,270 INFO L93 Difference]: Finished difference Result 153 states and 204 transitions. [2021-11-06 10:15:44,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 10:15:44,271 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-06 10:15:44,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:44,279 INFO L225 Difference]: With dead ends: 153 [2021-11-06 10:15:44,279 INFO L226 Difference]: Without dead ends: 71 [2021-11-06 10:15:44,282 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 10:15:44,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-06 10:15:44,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-11-06 10:15:44,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.328125) internal successors, (85), 70 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:44,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2021-11-06 10:15:44,315 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 14 [2021-11-06 10:15:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:44,316 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2021-11-06 10:15:44,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:44,317 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2021-11-06 10:15:44,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-06 10:15:44,318 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:44,320 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:15:44,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 10:15:44,321 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:15:44,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:44,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1068541055, now seen corresponding path program 1 times [2021-11-06 10:15:44,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:44,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427511631] [2021-11-06 10:15:44,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:44,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:15:44,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:44,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427511631] [2021-11-06 10:15:44,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427511631] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:44,604 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:44,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:15:44,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982620107] [2021-11-06 10:15:44,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:15:44,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:44,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:15:44,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:15:44,606 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:44,710 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2021-11-06 10:15:44,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:15:44,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-06 10:15:44,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:44,711 INFO L225 Difference]: With dead ends: 120 [2021-11-06 10:15:44,711 INFO L226 Difference]: Without dead ends: 71 [2021-11-06 10:15:44,712 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:15:44,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-06 10:15:44,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-11-06 10:15:44,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.3125) internal successors, (84), 70 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:44,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2021-11-06 10:15:44,717 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 14 [2021-11-06 10:15:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:44,717 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2021-11-06 10:15:44,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:44,717 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2021-11-06 10:15:44,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-06 10:15:44,718 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:44,718 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:15:44,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 10:15:44,718 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:15:44,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:44,719 INFO L85 PathProgramCache]: Analyzing trace with hash -715146382, now seen corresponding path program 1 times [2021-11-06 10:15:44,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:44,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730601513] [2021-11-06 10:15:44,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:44,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:15:44,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:44,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730601513] [2021-11-06 10:15:44,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730601513] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:44,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:44,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:15:44,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209624937] [2021-11-06 10:15:44,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:15:44,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:44,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:15:44,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:15:44,990 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:45,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:45,179 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2021-11-06 10:15:45,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:15:45,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-06 10:15:45,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:45,183 INFO L225 Difference]: With dead ends: 173 [2021-11-06 10:15:45,183 INFO L226 Difference]: Without dead ends: 115 [2021-11-06 10:15:45,183 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:15:45,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-06 10:15:45,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 75. [2021-11-06 10:15:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 74 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2021-11-06 10:15:45,193 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 20 [2021-11-06 10:15:45,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:45,194 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2021-11-06 10:15:45,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2021-11-06 10:15:45,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-06 10:15:45,195 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:45,195 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:15:45,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 10:15:45,195 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:15:45,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:45,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1524493008, now seen corresponding path program 1 times [2021-11-06 10:15:45,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:45,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746754959] [2021-11-06 10:15:45,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:45,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:15:45,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:45,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746754959] [2021-11-06 10:15:45,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746754959] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:45,437 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:45,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:15:45,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730633229] [2021-11-06 10:15:45,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:15:45,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:45,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:15:45,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:15:45,438 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:45,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:45,616 INFO L93 Difference]: Finished difference Result 147 states and 174 transitions. [2021-11-06 10:15:45,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:15:45,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-06 10:15:45,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:45,617 INFO L225 Difference]: With dead ends: 147 [2021-11-06 10:15:45,617 INFO L226 Difference]: Without dead ends: 95 [2021-11-06 10:15:45,618 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:15:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-06 10:15:45,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 79. [2021-11-06 10:15:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 78 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2021-11-06 10:15:45,622 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 20 [2021-11-06 10:15:45,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:45,622 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2021-11-06 10:15:45,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:45,622 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2021-11-06 10:15:45,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-06 10:15:45,623 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:45,623 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:15:45,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 10:15:45,623 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:15:45,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:45,624 INFO L85 PathProgramCache]: Analyzing trace with hash -322119372, now seen corresponding path program 1 times [2021-11-06 10:15:45,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:45,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737241795] [2021-11-06 10:15:45,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:45,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:15:46,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:46,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737241795] [2021-11-06 10:15:46,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737241795] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:46,179 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:46,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:15:46,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225958899] [2021-11-06 10:15:46,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:15:46,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:46,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:15:46,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:15:46,181 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:46,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:46,667 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2021-11-06 10:15:46,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:15:46,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-06 10:15:46,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:46,669 INFO L225 Difference]: With dead ends: 139 [2021-11-06 10:15:46,669 INFO L226 Difference]: Without dead ends: 135 [2021-11-06 10:15:46,670 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:15:46,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-11-06 10:15:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 87. [2021-11-06 10:15:46,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 80 states have (on average 1.25) internal successors, (100), 86 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:46,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2021-11-06 10:15:46,676 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 20 [2021-11-06 10:15:46,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:46,676 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2021-11-06 10:15:46,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2021-11-06 10:15:46,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-06 10:15:46,677 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:46,677 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:15:46,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 10:15:46,678 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:15:46,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:46,679 INFO L85 PathProgramCache]: Analyzing trace with hash -2144800216, now seen corresponding path program 1 times [2021-11-06 10:15:46,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:46,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911804889] [2021-11-06 10:15:46,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:46,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:49,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:15:49,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:49,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911804889] [2021-11-06 10:15:49,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911804889] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:49,784 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:49,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:15:49,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075225820] [2021-11-06 10:15:49,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:15:49,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:49,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:15:49,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:15:49,785 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:52,631 INFO L93 Difference]: Finished difference Result 153 states and 174 transitions. [2021-11-06 10:15:52,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 10:15:52,632 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-06 10:15:52,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:52,633 INFO L225 Difference]: With dead ends: 153 [2021-11-06 10:15:52,633 INFO L226 Difference]: Without dead ends: 94 [2021-11-06 10:15:52,634 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:15:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-11-06 10:15:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2021-11-06 10:15:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 88 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:52,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2021-11-06 10:15:52,638 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 24 [2021-11-06 10:15:52,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:52,639 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2021-11-06 10:15:52,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2021-11-06 10:15:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-06 10:15:52,640 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:52,640 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:15:52,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 10:15:52,641 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:15:52,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:52,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1464741846, now seen corresponding path program 1 times [2021-11-06 10:15:52,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:52,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189952839] [2021-11-06 10:15:52,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:52,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:53,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:15:53,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:53,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189952839] [2021-11-06 10:15:53,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189952839] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:53,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:53,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:15:53,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607583377] [2021-11-06 10:15:53,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:15:53,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:53,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:15:53,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:15:53,028 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:55,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:55,535 INFO L93 Difference]: Finished difference Result 206 states and 231 transitions. [2021-11-06 10:15:55,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:15:55,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-06 10:15:55,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:55,537 INFO L225 Difference]: With dead ends: 206 [2021-11-06 10:15:55,537 INFO L226 Difference]: Without dead ends: 143 [2021-11-06 10:15:55,538 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:15:55,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-11-06 10:15:55,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 95. [2021-11-06 10:15:55,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.2272727272727273) internal successors, (108), 94 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2021-11-06 10:15:55,543 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 24 [2021-11-06 10:15:55,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:55,544 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2021-11-06 10:15:55,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:55,544 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2021-11-06 10:15:55,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-06 10:15:55,545 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:55,545 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:15:55,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 10:15:55,545 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:15:55,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:55,546 INFO L85 PathProgramCache]: Analyzing trace with hash -711790034, now seen corresponding path program 1 times [2021-11-06 10:15:55,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:55,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546847196] [2021-11-06 10:15:55,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:55,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:15:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:15:56,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:15:56,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:15:56,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546847196] [2021-11-06 10:15:56,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546847196] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:15:56,002 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:15:56,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:15:56,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323152944] [2021-11-06 10:15:56,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:15:56,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:15:56,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:15:56,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:15:56,003 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:59,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:15:59,186 INFO L93 Difference]: Finished difference Result 298 states and 346 transitions. [2021-11-06 10:15:59,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:15:59,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-06 10:15:59,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:15:59,187 INFO L225 Difference]: With dead ends: 298 [2021-11-06 10:15:59,188 INFO L226 Difference]: Without dead ends: 223 [2021-11-06 10:15:59,188 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:15:59,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-11-06 10:15:59,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 100. [2021-11-06 10:15:59,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 99 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2021-11-06 10:15:59,195 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 24 [2021-11-06 10:15:59,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:15:59,195 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2021-11-06 10:15:59,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:15:59,195 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2021-11-06 10:15:59,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-06 10:15:59,196 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:15:59,196 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:15:59,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 10:15:59,197 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:15:59,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:15:59,197 INFO L85 PathProgramCache]: Analyzing trace with hash -453624596, now seen corresponding path program 1 times [2021-11-06 10:15:59,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:15:59,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169700433] [2021-11-06 10:15:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:15:59,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:01,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:01,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:01,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169700433] [2021-11-06 10:16:01,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169700433] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:01,893 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:01,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 10:16:01,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126149750] [2021-11-06 10:16:01,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 10:16:01,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:01,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 10:16:01,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:16:01,894 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:04,828 INFO L93 Difference]: Finished difference Result 189 states and 213 transitions. [2021-11-06 10:16:04,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 10:16:04,829 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-06 10:16:04,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:04,830 INFO L225 Difference]: With dead ends: 189 [2021-11-06 10:16:04,830 INFO L226 Difference]: Without dead ends: 116 [2021-11-06 10:16:04,831 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:16:04,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-06 10:16:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2021-11-06 10:16:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 97 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2021-11-06 10:16:04,844 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 24 [2021-11-06 10:16:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:04,844 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2021-11-06 10:16:04,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2021-11-06 10:16:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-06 10:16:04,845 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:04,846 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:04,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 10:16:04,846 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:04,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:04,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1994829360, now seen corresponding path program 1 times [2021-11-06 10:16:04,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:04,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130384513] [2021-11-06 10:16:04,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:04,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:07,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:07,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130384513] [2021-11-06 10:16:07,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130384513] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:07,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:07,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:16:07,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116203150] [2021-11-06 10:16:07,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:16:07,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:07,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:16:07,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:16:07,062 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:09,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:09,742 INFO L93 Difference]: Finished difference Result 185 states and 208 transitions. [2021-11-06 10:16:09,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:16:09,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-06 10:16:09,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:09,744 INFO L225 Difference]: With dead ends: 185 [2021-11-06 10:16:09,744 INFO L226 Difference]: Without dead ends: 116 [2021-11-06 10:16:09,744 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:16:09,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-06 10:16:09,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2021-11-06 10:16:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 91 states have (on average 1.2087912087912087) internal successors, (110), 97 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:09,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2021-11-06 10:16:09,752 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 24 [2021-11-06 10:16:09,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:09,752 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2021-11-06 10:16:09,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:09,752 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2021-11-06 10:16:09,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-06 10:16:09,753 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:09,753 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:09,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 10:16:09,754 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:09,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:09,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2041972498, now seen corresponding path program 1 times [2021-11-06 10:16:09,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:09,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677097100] [2021-11-06 10:16:09,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:09,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:10,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:10,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:10,173 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677097100] [2021-11-06 10:16:10,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677097100] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:10,173 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:10,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:16:10,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737745667] [2021-11-06 10:16:10,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:16:10,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:10,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:16:10,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:16:10,174 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:12,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:12,768 INFO L93 Difference]: Finished difference Result 235 states and 261 transitions. [2021-11-06 10:16:12,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 10:16:12,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-06 10:16:12,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:12,769 INFO L225 Difference]: With dead ends: 235 [2021-11-06 10:16:12,769 INFO L226 Difference]: Without dead ends: 164 [2021-11-06 10:16:12,770 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:16:12,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-11-06 10:16:12,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 93. [2021-11-06 10:16:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 86 states have (on average 1.186046511627907) internal successors, (102), 92 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2021-11-06 10:16:12,774 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 24 [2021-11-06 10:16:12,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:12,774 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2021-11-06 10:16:12,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:12,774 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2021-11-06 10:16:12,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-06 10:16:12,775 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:12,775 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:12,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 10:16:12,776 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:12,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:12,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1548380899, now seen corresponding path program 1 times [2021-11-06 10:16:12,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:12,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426497834] [2021-11-06 10:16:12,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:12,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:13,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:13,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:13,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426497834] [2021-11-06 10:16:13,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426497834] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:13,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:13,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:16:13,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137977378] [2021-11-06 10:16:13,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:16:13,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:13,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:16:13,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:16:13,163 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:13,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:14,003 INFO L93 Difference]: Finished difference Result 165 states and 180 transitions. [2021-11-06 10:16:14,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-06 10:16:14,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-06 10:16:14,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:14,005 INFO L225 Difference]: With dead ends: 165 [2021-11-06 10:16:14,005 INFO L226 Difference]: Without dead ends: 161 [2021-11-06 10:16:14,005 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:16:14,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-06 10:16:14,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 97. [2021-11-06 10:16:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 90 states have (on average 1.1777777777777778) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:14,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2021-11-06 10:16:14,010 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 26 [2021-11-06 10:16:14,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:14,010 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2021-11-06 10:16:14,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2021-11-06 10:16:14,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-06 10:16:14,011 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:14,011 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:14,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 10:16:14,012 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:14,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:14,012 INFO L85 PathProgramCache]: Analyzing trace with hash 739034273, now seen corresponding path program 1 times [2021-11-06 10:16:14,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:14,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11809230] [2021-11-06 10:16:14,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:14,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:16,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:16,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11809230] [2021-11-06 10:16:16,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11809230] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:16,342 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:16,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-06 10:16:16,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283237738] [2021-11-06 10:16:16,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-06 10:16:16,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:16,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-06 10:16:16,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2021-11-06 10:16:16,344 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:21,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:21,048 INFO L93 Difference]: Finished difference Result 180 states and 196 transitions. [2021-11-06 10:16:21,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-06 10:16:21,048 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-06 10:16:21,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:21,049 INFO L225 Difference]: With dead ends: 180 [2021-11-06 10:16:21,049 INFO L226 Difference]: Without dead ends: 178 [2021-11-06 10:16:21,050 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=389, Invalid=1503, Unknown=0, NotChecked=0, Total=1892 [2021-11-06 10:16:21,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-11-06 10:16:21,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 105. [2021-11-06 10:16:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 98 states have (on average 1.1734693877551021) internal successors, (115), 104 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2021-11-06 10:16:21,055 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 26 [2021-11-06 10:16:21,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:21,055 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2021-11-06 10:16:21,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:21,056 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2021-11-06 10:16:21,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-06 10:16:21,056 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:21,057 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:21,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 10:16:21,057 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:21,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:21,057 INFO L85 PathProgramCache]: Analyzing trace with hash -949909469, now seen corresponding path program 1 times [2021-11-06 10:16:21,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:21,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345207339] [2021-11-06 10:16:21,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:21,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:21,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:21,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:21,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345207339] [2021-11-06 10:16:21,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345207339] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:21,410 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:21,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:16:21,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072937061] [2021-11-06 10:16:21,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:16:21,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:21,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:16:21,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:16:21,411 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:23,967 INFO L93 Difference]: Finished difference Result 235 states and 257 transitions. [2021-11-06 10:16:23,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 10:16:23,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-06 10:16:23,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:23,968 INFO L225 Difference]: With dead ends: 235 [2021-11-06 10:16:23,968 INFO L226 Difference]: Without dead ends: 170 [2021-11-06 10:16:23,969 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:16:23,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-11-06 10:16:23,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 97. [2021-11-06 10:16:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 91 states have (on average 1.164835164835165) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:23,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2021-11-06 10:16:23,972 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 26 [2021-11-06 10:16:23,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:23,973 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2021-11-06 10:16:23,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2021-11-06 10:16:23,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-06 10:16:23,973 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:23,973 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:23,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 10:16:23,974 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:23,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:23,974 INFO L85 PathProgramCache]: Analyzing trace with hash -365390039, now seen corresponding path program 1 times [2021-11-06 10:16:23,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:23,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919466274] [2021-11-06 10:16:23,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:23,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:24,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:24,160 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919466274] [2021-11-06 10:16:24,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919466274] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:24,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:24,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 10:16:24,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513907846] [2021-11-06 10:16:24,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 10:16:24,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:24,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 10:16:24,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 10:16:24,161 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:24,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:24,258 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2021-11-06 10:16:24,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 10:16:24,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-06 10:16:24,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:24,260 INFO L225 Difference]: With dead ends: 126 [2021-11-06 10:16:24,260 INFO L226 Difference]: Without dead ends: 97 [2021-11-06 10:16:24,260 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:16:24,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-11-06 10:16:24,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-11-06 10:16:24,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 91 states have (on average 1.1538461538461537) internal successors, (105), 96 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2021-11-06 10:16:24,264 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 26 [2021-11-06 10:16:24,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:24,264 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2021-11-06 10:16:24,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:24,264 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2021-11-06 10:16:24,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-06 10:16:24,264 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:24,265 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:24,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 10:16:24,265 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:24,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:24,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1400671456, now seen corresponding path program 1 times [2021-11-06 10:16:24,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:24,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090025358] [2021-11-06 10:16:24,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:24,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:26,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:26,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:26,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090025358] [2021-11-06 10:16:26,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090025358] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:26,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:26,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-06 10:16:26,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019099690] [2021-11-06 10:16:26,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 10:16:26,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:26,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 10:16:26,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:16:26,248 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:31,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:31,062 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2021-11-06 10:16:31,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 10:16:31,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-06 10:16:31,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:31,063 INFO L225 Difference]: With dead ends: 97 [2021-11-06 10:16:31,063 INFO L226 Difference]: Without dead ends: 95 [2021-11-06 10:16:31,063 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:16:31,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-11-06 10:16:31,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-11-06 10:16:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.1444444444444444) internal successors, (103), 94 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2021-11-06 10:16:31,067 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 34 [2021-11-06 10:16:31,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:31,068 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2021-11-06 10:16:31,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:31,068 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2021-11-06 10:16:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 10:16:31,069 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:31,069 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:31,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 10:16:31,069 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:31,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:31,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1720376510, now seen corresponding path program 1 times [2021-11-06 10:16:31,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:31,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565724646] [2021-11-06 10:16:31,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:31,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:33,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:33,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565724646] [2021-11-06 10:16:33,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565724646] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:33,154 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:33,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:16:33,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137150300] [2021-11-06 10:16:33,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:16:33,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:33,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:16:33,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:16:33,155 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:38,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:38,226 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2021-11-06 10:16:38,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:16:38,226 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-06 10:16:38,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:38,227 INFO L225 Difference]: With dead ends: 156 [2021-11-06 10:16:38,227 INFO L226 Difference]: Without dead ends: 154 [2021-11-06 10:16:38,228 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:16:38,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-11-06 10:16:38,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 136. [2021-11-06 10:16:38,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.1526717557251909) internal successors, (151), 135 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 151 transitions. [2021-11-06 10:16:38,234 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 151 transitions. Word has length 36 [2021-11-06 10:16:38,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:38,234 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 151 transitions. [2021-11-06 10:16:38,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 151 transitions. [2021-11-06 10:16:38,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 10:16:38,235 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:38,235 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:38,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 10:16:38,235 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:38,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:38,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1549467370, now seen corresponding path program 1 times [2021-11-06 10:16:38,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:38,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902786933] [2021-11-06 10:16:38,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:38,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:38,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:38,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902786933] [2021-11-06 10:16:38,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902786933] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:38,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:38,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:16:38,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072911657] [2021-11-06 10:16:38,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:16:38,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:38,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:16:38,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:16:38,663 INFO L87 Difference]: Start difference. First operand 136 states and 151 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:43,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:43,474 INFO L93 Difference]: Finished difference Result 262 states and 287 transitions. [2021-11-06 10:16:43,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:16:43,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-06 10:16:43,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:43,475 INFO L225 Difference]: With dead ends: 262 [2021-11-06 10:16:43,476 INFO L226 Difference]: Without dead ends: 224 [2021-11-06 10:16:43,476 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:16:43,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-11-06 10:16:43,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 142. [2021-11-06 10:16:43,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 137 states have (on average 1.1605839416058394) internal successors, (159), 141 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 159 transitions. [2021-11-06 10:16:43,483 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 159 transitions. Word has length 36 [2021-11-06 10:16:43,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:43,483 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 159 transitions. [2021-11-06 10:16:43,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:43,483 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 159 transitions. [2021-11-06 10:16:43,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 10:16:43,483 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:43,484 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:43,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 10:16:43,484 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:43,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:43,484 INFO L85 PathProgramCache]: Analyzing trace with hash -869409000, now seen corresponding path program 1 times [2021-11-06 10:16:43,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:43,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754476992] [2021-11-06 10:16:43,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:43,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:45,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:45,579 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754476992] [2021-11-06 10:16:45,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754476992] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:45,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:45,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:16:45,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618869119] [2021-11-06 10:16:45,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:16:45,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:45,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:16:45,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:16:45,581 INFO L87 Difference]: Start difference. First operand 142 states and 159 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:50,581 INFO L93 Difference]: Finished difference Result 199 states and 215 transitions. [2021-11-06 10:16:50,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:16:50,582 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-06 10:16:50,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:50,584 INFO L225 Difference]: With dead ends: 199 [2021-11-06 10:16:50,584 INFO L226 Difference]: Without dead ends: 159 [2021-11-06 10:16:50,584 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-11-06 10:16:50,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-11-06 10:16:50,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 139. [2021-11-06 10:16:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.1492537313432836) internal successors, (154), 138 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:50,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2021-11-06 10:16:50,591 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 36 [2021-11-06 10:16:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:50,591 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2021-11-06 10:16:50,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2021-11-06 10:16:50,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 10:16:50,592 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:50,592 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:50,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 10:16:50,593 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:50,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:50,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1291301932, now seen corresponding path program 1 times [2021-11-06 10:16:50,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:50,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231466566] [2021-11-06 10:16:50,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:50,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:50,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:50,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:50,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231466566] [2021-11-06 10:16:50,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231466566] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:50,945 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:50,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 10:16:50,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615884784] [2021-11-06 10:16:50,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 10:16:50,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:50,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 10:16:50,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 10:16:50,947 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:53,486 INFO L93 Difference]: Finished difference Result 265 states and 288 transitions. [2021-11-06 10:16:53,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 10:16:53,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-06 10:16:53,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:53,487 INFO L225 Difference]: With dead ends: 265 [2021-11-06 10:16:53,488 INFO L226 Difference]: Without dead ends: 205 [2021-11-06 10:16:53,488 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:16:53,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-11-06 10:16:53,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 136. [2021-11-06 10:16:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.1297709923664123) internal successors, (148), 135 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2021-11-06 10:16:53,494 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 36 [2021-11-06 10:16:53,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:53,494 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2021-11-06 10:16:53,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:53,494 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2021-11-06 10:16:53,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 10:16:53,495 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:53,495 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:53,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 10:16:53,495 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:53,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:53,496 INFO L85 PathProgramCache]: Analyzing trace with hash -611243562, now seen corresponding path program 1 times [2021-11-06 10:16:53,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:53,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465151920] [2021-11-06 10:16:53,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:53,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:54,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:54,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465151920] [2021-11-06 10:16:54,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465151920] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:54,054 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:54,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 10:16:54,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305366447] [2021-11-06 10:16:54,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 10:16:54,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:54,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 10:16:54,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:16:54,055 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:59,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:16:59,298 INFO L93 Difference]: Finished difference Result 195 states and 206 transitions. [2021-11-06 10:16:59,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 10:16:59,298 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-06 10:16:59,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:16:59,299 INFO L225 Difference]: With dead ends: 195 [2021-11-06 10:16:59,299 INFO L226 Difference]: Without dead ends: 155 [2021-11-06 10:16:59,299 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-11-06 10:16:59,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-11-06 10:16:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 133. [2021-11-06 10:16:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.125) internal successors, (144), 132 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:59,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2021-11-06 10:16:59,305 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 36 [2021-11-06 10:16:59,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:16:59,306 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2021-11-06 10:16:59,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:16:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2021-11-06 10:16:59,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-06 10:16:59,306 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:16:59,307 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:16:59,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 10:16:59,307 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:16:59,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:16:59,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1992548114, now seen corresponding path program 1 times [2021-11-06 10:16:59,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:16:59,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134127140] [2021-11-06 10:16:59,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:16:59,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:16:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:16:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:16:59,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:16:59,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134127140] [2021-11-06 10:16:59,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134127140] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:16:59,950 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:16:59,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:16:59,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066841872] [2021-11-06 10:16:59,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:16:59,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:16:59,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:16:59,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:16:59,951 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:09,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:17:09,702 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2021-11-06 10:17:09,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-06 10:17:09,703 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-06 10:17:09,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:17:09,704 INFO L225 Difference]: With dead ends: 182 [2021-11-06 10:17:09,704 INFO L226 Difference]: Without dead ends: 155 [2021-11-06 10:17:09,704 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2021-11-06 10:17:09,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-11-06 10:17:09,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 133. [2021-11-06 10:17:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.1171875) internal successors, (143), 132 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2021-11-06 10:17:09,710 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 36 [2021-11-06 10:17:09,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:17:09,710 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2021-11-06 10:17:09,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:09,711 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2021-11-06 10:17:09,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-06 10:17:09,711 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:17:09,711 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:17:09,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 10:17:09,712 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:17:09,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:17:09,712 INFO L85 PathProgramCache]: Analyzing trace with hash 280712196, now seen corresponding path program 1 times [2021-11-06 10:17:09,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:17:09,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539854357] [2021-11-06 10:17:09,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:17:09,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:17:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:17:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:17:10,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:17:10,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539854357] [2021-11-06 10:17:10,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539854357] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:17:10,098 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:17:10,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:17:10,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918386212] [2021-11-06 10:17:10,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:17:10,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:17:10,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:17:10,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:17:10,099 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:14,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:17:14,646 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2021-11-06 10:17:14,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:17:14,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-06 10:17:14,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:17:14,647 INFO L225 Difference]: With dead ends: 133 [2021-11-06 10:17:14,647 INFO L226 Difference]: Without dead ends: 131 [2021-11-06 10:17:14,647 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-06 10:17:14,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-11-06 10:17:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-11-06 10:17:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 127 states have (on average 1.110236220472441) internal successors, (141), 130 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:14,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2021-11-06 10:17:14,653 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 38 [2021-11-06 10:17:14,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:17:14,653 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2021-11-06 10:17:14,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:14,653 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2021-11-06 10:17:14,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-06 10:17:14,654 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:17:14,654 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:17:14,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 10:17:14,654 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:17:14,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:17:14,655 INFO L85 PathProgramCache]: Analyzing trace with hash -408934709, now seen corresponding path program 1 times [2021-11-06 10:17:14,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:17:14,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838509362] [2021-11-06 10:17:14,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:17:14,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:17:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:17:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:17:15,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:17:15,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838509362] [2021-11-06 10:17:15,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838509362] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:17:15,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:17:15,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:17:15,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122864666] [2021-11-06 10:17:15,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:17:15,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:17:15,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:17:15,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:17:15,221 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:20,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:17:20,233 INFO L93 Difference]: Finished difference Result 175 states and 182 transitions. [2021-11-06 10:17:20,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:17:20,234 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-06 10:17:20,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:17:20,235 INFO L225 Difference]: With dead ends: 175 [2021-11-06 10:17:20,235 INFO L226 Difference]: Without dead ends: 149 [2021-11-06 10:17:20,235 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:17:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-11-06 10:17:20,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 125. [2021-11-06 10:17:20,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 121 states have (on average 1.0991735537190082) internal successors, (133), 124 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:20,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2021-11-06 10:17:20,240 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 38 [2021-11-06 10:17:20,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:17:20,240 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2021-11-06 10:17:20,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:20,241 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2021-11-06 10:17:20,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 10:17:20,241 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:17:20,241 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:17:20,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 10:17:20,242 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:17:20,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:17:20,243 INFO L85 PathProgramCache]: Analyzing trace with hash 399724621, now seen corresponding path program 1 times [2021-11-06 10:17:20,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:17:20,243 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456179001] [2021-11-06 10:17:20,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:17:20,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:17:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:17:20,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:17:20,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:17:20,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456179001] [2021-11-06 10:17:20,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456179001] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:17:20,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:17:20,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-06 10:17:20,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182419437] [2021-11-06 10:17:20,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 10:17:20,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:17:20,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 10:17:20,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-06 10:17:20,632 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:25,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:17:25,193 INFO L93 Difference]: Finished difference Result 139 states and 146 transitions. [2021-11-06 10:17:25,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 10:17:25,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-06 10:17:25,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:17:25,194 INFO L225 Difference]: With dead ends: 139 [2021-11-06 10:17:25,194 INFO L226 Difference]: Without dead ends: 78 [2021-11-06 10:17:25,194 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:17:25,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-11-06 10:17:25,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-11-06 10:17:25,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:25,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2021-11-06 10:17:25,198 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 41 [2021-11-06 10:17:25,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:17:25,198 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2021-11-06 10:17:25,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:25,198 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2021-11-06 10:17:25,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 10:17:25,198 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:17:25,198 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:17:25,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 10:17:25,199 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:17:25,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:17:25,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1999613423, now seen corresponding path program 1 times [2021-11-06 10:17:25,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:17:25,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188722313] [2021-11-06 10:17:25,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:17:25,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:17:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:17:25,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:17:25,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:17:25,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188722313] [2021-11-06 10:17:25,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188722313] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:17:25,581 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:17:25,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 10:17:25,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141743144] [2021-11-06 10:17:25,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 10:17:25,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:17:25,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 10:17:25,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-06 10:17:25,583 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:28,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:17:28,015 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2021-11-06 10:17:28,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 10:17:28,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-06 10:17:28,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:17:28,016 INFO L225 Difference]: With dead ends: 137 [2021-11-06 10:17:28,016 INFO L226 Difference]: Without dead ends: 78 [2021-11-06 10:17:28,017 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:17:28,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-11-06 10:17:28,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-11-06 10:17:28,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2021-11-06 10:17:28,020 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 42 [2021-11-06 10:17:28,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:17:28,020 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2021-11-06 10:17:28,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:28,021 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2021-11-06 10:17:28,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 10:17:28,021 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:17:28,021 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:17:28,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-06 10:17:28,022 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:17:28,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:17:28,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1865599917, now seen corresponding path program 1 times [2021-11-06 10:17:28,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:17:28,023 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12720579] [2021-11-06 10:17:28,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:17:28,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:17:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:17:28,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:17:28,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:17:28,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12720579] [2021-11-06 10:17:28,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12720579] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:17:28,729 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:17:28,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:17:28,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731191949] [2021-11-06 10:17:28,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:17:28,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:17:28,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:17:28,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:17:28,730 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:17:36,173 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2021-11-06 10:17:36,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-06 10:17:36,174 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-06 10:17:36,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:17:36,175 INFO L225 Difference]: With dead ends: 116 [2021-11-06 10:17:36,175 INFO L226 Difference]: Without dead ends: 76 [2021-11-06 10:17:36,175 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:17:36,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-11-06 10:17:36,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-11-06 10:17:36,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 75 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2021-11-06 10:17:36,179 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 42 [2021-11-06 10:17:36,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:17:36,179 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2021-11-06 10:17:36,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:36,179 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2021-11-06 10:17:36,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 10:17:36,180 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:17:36,180 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:17:36,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-06 10:17:36,180 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:17:36,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:17:36,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1320234431, now seen corresponding path program 1 times [2021-11-06 10:17:36,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:17:36,181 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526474100] [2021-11-06 10:17:36,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:17:36,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:17:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:17:38,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:17:38,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:17:38,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526474100] [2021-11-06 10:17:38,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526474100] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:17:38,658 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:17:38,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:17:38,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129265703] [2021-11-06 10:17:38,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:17:38,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:17:38,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:17:38,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:17:38,659 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:43,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:17:43,427 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2021-11-06 10:17:43,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:17:43,427 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-06 10:17:43,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:17:43,428 INFO L225 Difference]: With dead ends: 113 [2021-11-06 10:17:43,428 INFO L226 Difference]: Without dead ends: 71 [2021-11-06 10:17:43,429 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:17:43,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-06 10:17:43,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-11-06 10:17:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 70 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2021-11-06 10:17:43,432 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 42 [2021-11-06 10:17:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:17:43,433 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2021-11-06 10:17:43,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2021-11-06 10:17:43,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-06 10:17:43,433 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:17:43,433 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:17:43,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-06 10:17:43,433 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:17:43,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:17:43,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1283557245, now seen corresponding path program 1 times [2021-11-06 10:17:43,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:17:43,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782098340] [2021-11-06 10:17:43,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:17:43,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:17:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:17:49,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:17:49,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:17:49,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782098340] [2021-11-06 10:17:49,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782098340] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:17:49,385 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:17:49,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:17:49,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774659221] [2021-11-06 10:17:49,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:17:49,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:17:49,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:17:49,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:17:49,386 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:52,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:17:52,707 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2021-11-06 10:17:52,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-06 10:17:52,708 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-06 10:17:52,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:17:52,708 INFO L225 Difference]: With dead ends: 98 [2021-11-06 10:17:52,708 INFO L226 Difference]: Without dead ends: 71 [2021-11-06 10:17:52,709 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2021-11-06 10:17:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-06 10:17:52,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-11-06 10:17:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 70 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:52,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2021-11-06 10:17:52,713 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 42 [2021-11-06 10:17:52,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:17:52,713 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2021-11-06 10:17:52,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:17:52,713 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2021-11-06 10:17:52,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-06 10:17:52,713 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:17:52,713 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:17:52,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-06 10:17:52,714 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:17:52,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:17:52,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1150640246, now seen corresponding path program 1 times [2021-11-06 10:17:52,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:17:52,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60231151] [2021-11-06 10:17:52,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:17:52,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:17:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:17:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:17:56,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:17:56,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60231151] [2021-11-06 10:17:56,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60231151] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:17:56,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:17:56,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-06 10:17:56,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162971834] [2021-11-06 10:17:56,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-06 10:17:56,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:17:56,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-06 10:17:56,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2021-11-06 10:17:56,067 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:01,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:18:01,781 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2021-11-06 10:18:01,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-06 10:18:01,781 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-06 10:18:01,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:18:01,782 INFO L225 Difference]: With dead ends: 71 [2021-11-06 10:18:01,782 INFO L226 Difference]: Without dead ends: 69 [2021-11-06 10:18:01,782 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2021-11-06 10:18:01,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-11-06 10:18:01,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2021-11-06 10:18:01,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 60 states have (on average 1.05) internal successors, (63), 62 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2021-11-06 10:18:01,786 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 44 [2021-11-06 10:18:01,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:18:01,786 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2021-11-06 10:18:01,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:01,786 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2021-11-06 10:18:01,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 10:18:01,786 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:18:01,786 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:18:01,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-06 10:18:01,787 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:18:01,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:18:01,787 INFO L85 PathProgramCache]: Analyzing trace with hash 962797916, now seen corresponding path program 1 times [2021-11-06 10:18:01,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:18:01,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302017697] [2021-11-06 10:18:01,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:18:01,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:18:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:18:02,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:18:02,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:18:02,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302017697] [2021-11-06 10:18:02,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302017697] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:18:02,490 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:18:02,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-06 10:18:02,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204626734] [2021-11-06 10:18:02,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-06 10:18:02,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:18:02,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-06 10:18:02,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-06 10:18:02,491 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:05,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:18:05,492 INFO L93 Difference]: Finished difference Result 89 states and 88 transitions. [2021-11-06 10:18:05,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-06 10:18:05,493 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-06 10:18:05,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:18:05,493 INFO L225 Difference]: With dead ends: 89 [2021-11-06 10:18:05,493 INFO L226 Difference]: Without dead ends: 63 [2021-11-06 10:18:05,494 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2021-11-06 10:18:05,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-11-06 10:18:05,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-11-06 10:18:05,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 62 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:05,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 62 transitions. [2021-11-06 10:18:05,497 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 62 transitions. Word has length 48 [2021-11-06 10:18:05,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:18:05,498 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 62 transitions. [2021-11-06 10:18:05,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:05,498 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 62 transitions. [2021-11-06 10:18:05,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 10:18:05,498 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:18:05,498 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:18:05,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-06 10:18:05,499 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:18:05,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:18:05,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1220963354, now seen corresponding path program 1 times [2021-11-06 10:18:05,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:18:05,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95059348] [2021-11-06 10:18:05,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:18:05,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:18:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:18:07,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:18:07,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:18:07,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95059348] [2021-11-06 10:18:07,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95059348] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:18:07,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:18:07,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 10:18:07,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749579878] [2021-11-06 10:18:07,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 10:18:07,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:18:07,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 10:18:07,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:18:07,872 INFO L87 Difference]: Start difference. First operand 63 states and 62 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:12,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:18:12,887 INFO L93 Difference]: Finished difference Result 63 states and 62 transitions. [2021-11-06 10:18:12,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:18:12,888 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-06 10:18:12,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:18:12,888 INFO L225 Difference]: With dead ends: 63 [2021-11-06 10:18:12,888 INFO L226 Difference]: Without dead ends: 61 [2021-11-06 10:18:12,888 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:18:12,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-06 10:18:12,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-11-06 10:18:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 60 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 60 transitions. [2021-11-06 10:18:12,892 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 60 transitions. Word has length 48 [2021-11-06 10:18:12,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:18:12,892 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 60 transitions. [2021-11-06 10:18:12,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 60 transitions. [2021-11-06 10:18:12,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 10:18:12,893 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:18:12,893 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:18:12,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-06 10:18:12,893 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:18:12,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:18:12,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1599746443, now seen corresponding path program 1 times [2021-11-06 10:18:12,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:18:12,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788458727] [2021-11-06 10:18:12,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:18:12,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:18:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:18:13,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:18:13,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:18:13,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788458727] [2021-11-06 10:18:13,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788458727] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:18:13,450 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:18:13,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-06 10:18:13,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058202949] [2021-11-06 10:18:13,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-06 10:18:13,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:18:13,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-06 10:18:13,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-06 10:18:13,451 INFO L87 Difference]: Start difference. First operand 61 states and 60 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:18,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:18:18,180 INFO L93 Difference]: Finished difference Result 61 states and 60 transitions. [2021-11-06 10:18:18,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:18:18,181 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-06 10:18:18,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:18:18,181 INFO L225 Difference]: With dead ends: 61 [2021-11-06 10:18:18,181 INFO L226 Difference]: Without dead ends: 59 [2021-11-06 10:18:18,181 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-11-06 10:18:18,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-11-06 10:18:18,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-11-06 10:18:18,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.0) internal successors, (58), 58 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:18,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 58 transitions. [2021-11-06 10:18:18,185 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 58 transitions. Word has length 53 [2021-11-06 10:18:18,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:18:18,185 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 58 transitions. [2021-11-06 10:18:18,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:18,185 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 58 transitions. [2021-11-06 10:18:18,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-06 10:18:18,186 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 10:18:18,186 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:18:18,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-06 10:18:18,186 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2021-11-06 10:18:18,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 10:18:18,187 INFO L85 PathProgramCache]: Analyzing trace with hash 919461545, now seen corresponding path program 1 times [2021-11-06 10:18:18,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 10:18:18,187 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862973092] [2021-11-06 10:18:18,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 10:18:18,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 10:18:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 10:18:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 10:18:25,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 10:18:25,461 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862973092] [2021-11-06 10:18:25,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862973092] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 10:18:25,462 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 10:18:25,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-06 10:18:25,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478862502] [2021-11-06 10:18:25,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-06 10:18:25,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 10:18:25,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-06 10:18:25,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-06 10:18:25,463 INFO L87 Difference]: Start difference. First operand 59 states and 58 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:30,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 10:18:30,336 INFO L93 Difference]: Finished difference Result 59 states and 58 transitions. [2021-11-06 10:18:30,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 10:18:30,337 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-06 10:18:30,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 10:18:30,337 INFO L225 Difference]: With dead ends: 59 [2021-11-06 10:18:30,337 INFO L226 Difference]: Without dead ends: 0 [2021-11-06 10:18:30,338 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-11-06 10:18:30,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-06 10:18:30,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-06 10:18:30,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-06 10:18:30,338 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2021-11-06 10:18:30,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 10:18:30,339 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-06 10:18:30,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 10:18:30,339 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-06 10:18:30,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-06 10:18:30,342 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:18:30,342 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:18:30,342 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:18:30,342 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:18:30,342 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:18:30,343 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:18:30,343 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 10:18:30,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-06 10:18:30,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-06 10:18:30,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:18:30,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:18:30,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:18:30,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:18:30,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:18:30,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-06 10:18:34,050 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,050 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-06 10:18:34,050 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,050 INFO L857 garLoopResultBuilder]: For program point L8974-2(lines 8974 8976) no Hoare annotation was computed. [2021-11-06 10:18:34,050 INFO L857 garLoopResultBuilder]: For program point L8974(lines 8974 8976) no Hoare annotation was computed. [2021-11-06 10:18:34,051 INFO L853 garLoopResultBuilder]: At program point L8215(lines 8203 8216) the Hoare annotation is: (let ((.cse18 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse17 (select .cse18 (+ 16 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (.cse13 (select .cse18 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (let ((.cse0 (<= ULTIMATE.start_aws_byte_buf_from_array_~len (+ (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_from_array_~len 18446744073709551616)) 36028797018963967))) (.cse1 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse2 (<= .cse17 .cse13)) (.cse3 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse4 (<= ULTIMATE.start_bounded_malloc_~size (+ (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616)) 36028797018963967))) (.cse5 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 |ULTIMATE.start_aws_byte_buf_from_array_#res.capacity|)) (.cse6 (<= .cse13 .cse17)) (.cse7 (not (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.base 0))) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| 0)) (.cse9 (not (= 0 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|))) (.cse10 (= |ULTIMATE.start_aws_byte_buf_from_array_#res.buffer.offset| 0)) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_array_#res.allocator.offset| 0)) (.cse12 (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2)) (.cse14 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 ULTIMATE.start_aws_byte_buf_from_array_~len)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_from_array_#res.allocator.base| 0)) (.cse16 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 |ULTIMATE.start_aws_byte_buf_from_array_#res.len|))) (or (and .cse0 (= |ULTIMATE.start_aws_byte_buf_from_array_#res.buffer.base| 0) .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 18446744073709551616))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse13 (* 18446744073709551616 (div .cse13 18446744073709551616))) .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.offset 0) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) .cse3 .cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_#res.buffer.base| ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.base) (<= .cse17 (+ 36028797018963967 (* 18446744073709551616 (div (+ (* .cse13 (- 1)) (* (div (+ (- 1) .cse13) 18446744073709551616) 18446744073709551616) .cse17) 18446744073709551616)))) .cse5 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.offset 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.base ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.base) (<= |ULTIMATE.start_aws_byte_buf_from_array_#res.capacity| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_array_#res.capacity|) 18446744073709551616)))) .cse14 .cse15 .cse16))))) [2021-11-06 10:18:34,051 INFO L857 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-06 10:18:34,051 INFO L857 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-06 10:18:34,051 INFO L857 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-06 10:18:34,051 INFO L857 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-06 10:18:34,051 INFO L857 garLoopResultBuilder]: For program point L8959(lines 8959 8977) no Hoare annotation was computed. [2021-11-06 10:18:34,052 INFO L857 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-06 10:18:34,052 INFO L857 garLoopResultBuilder]: For program point L222-5(lines 7101 7111) no Hoare annotation was computed. [2021-11-06 10:18:34,052 INFO L857 garLoopResultBuilder]: For program point L222-6(lines 222 224) no Hoare annotation was computed. [2021-11-06 10:18:34,052 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-06 10:18:34,052 INFO L857 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,052 INFO L857 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,052 INFO L857 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,052 INFO L857 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,052 INFO L857 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,052 INFO L857 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,052 INFO L857 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,052 INFO L857 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,052 INFO L857 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,052 INFO L857 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,053 INFO L857 garLoopResultBuilder]: For program point L223-15(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,053 INFO L857 garLoopResultBuilder]: For program point L223-16(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,053 INFO L857 garLoopResultBuilder]: For program point L223-18(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,053 INFO L857 garLoopResultBuilder]: For program point L223-19(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,053 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,053 INFO L860 garLoopResultBuilder]: At program point L8978(line 8978) the Hoare annotation is: true [2021-11-06 10:18:34,053 INFO L857 garLoopResultBuilder]: For program point L7377-3(line 7377) no Hoare annotation was computed. [2021-11-06 10:18:34,053 INFO L857 garLoopResultBuilder]: For program point L7377-1(line 7377) no Hoare annotation was computed. [2021-11-06 10:18:34,053 INFO L857 garLoopResultBuilder]: For program point L7377(lines 7377 7380) no Hoare annotation was computed. [2021-11-06 10:18:34,053 INFO L857 garLoopResultBuilder]: For program point L7377-7(lines 7377 7380) no Hoare annotation was computed. [2021-11-06 10:18:34,053 INFO L857 garLoopResultBuilder]: For program point L7377-6(lines 7377 7378) no Hoare annotation was computed. [2021-11-06 10:18:34,053 INFO L857 garLoopResultBuilder]: For program point L7377-4(lines 7377 7378) no Hoare annotation was computed. [2021-11-06 10:18:34,053 INFO L857 garLoopResultBuilder]: For program point L7377-11(lines 7377 7380) no Hoare annotation was computed. [2021-11-06 10:18:34,053 INFO L857 garLoopResultBuilder]: For program point L7377-9(lines 7377 7380) no Hoare annotation was computed. [2021-11-06 10:18:34,053 INFO L857 garLoopResultBuilder]: For program point L7377-14(line 7377) no Hoare annotation was computed. [2021-11-06 10:18:34,053 INFO L857 garLoopResultBuilder]: For program point L7377-13(lines 7377 7380) no Hoare annotation was computed. [2021-11-06 10:18:34,054 INFO L853 garLoopResultBuilder]: At program point L7377-12(lines 7375 7381) the Hoare annotation is: (let ((.cse28 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse22 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1.base|)) (.cse26 (+ |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1.offset| 24)) (.cse25 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1.base|)) (.cse23 (+ |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1.offset| 8)) (.cse27 (select .cse28 (+ 16 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (.cse24 (select .cse28 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (let ((.cse0 (<= ULTIMATE.start_aws_byte_buf_from_array_~len (+ (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_from_array_~len 18446744073709551616)) 36028797018963967))) (.cse1 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse2 (<= .cse27 .cse24)) (.cse17 (select .cse25 .cse23)) (.cse3 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1.offset| 0)) (.cse5 (<= ULTIMATE.start_bounded_malloc_~size (+ (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616)) 36028797018963967))) (.cse6 (<= .cse24 .cse27)) (.cse7 (not (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.base 0))) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| 0)) (.cse9 (= (select .cse22 .cse26) 0)) (.cse10 (not (= 0 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|))) (.cse11 (= |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse12 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse13 (= (select .cse25 .cse26) 0)) (.cse14 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse15 (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2)) (.cse16 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 .cse24)) (.cse18 (= (select .cse22 .cse23) 0)) (.cse19 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 ULTIMATE.start_aws_byte_buf_from_array_~len)) (.cse20 (not (= |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1.base| 0)))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.offset 0) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) .cse3 .cse4 .cse5 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.offset 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.base ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.base) (= .cse17 ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.base) .cse18 .cse19 .cse20 (let ((.cse21 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1.base|) |ULTIMATE.start_aws_byte_buf_from_array_~#buf~1.offset|))) (<= .cse21 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse21) 18446744073709551616)))))) (and .cse0 .cse1 .cse2 (= .cse17 0) .cse3 .cse4 .cse5 (<= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 18446744073709551616))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20))))) [2021-11-06 10:18:34,054 INFO L857 garLoopResultBuilder]: For program point L7377-19(lines 7377 7378) no Hoare annotation was computed. [2021-11-06 10:18:34,054 INFO L857 garLoopResultBuilder]: For program point L7377-17(lines 7377 7378) no Hoare annotation was computed. [2021-11-06 10:18:34,054 INFO L857 garLoopResultBuilder]: For program point L7377-16(line 7377) no Hoare annotation was computed. [2021-11-06 10:18:34,054 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,054 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-06 10:18:34,054 INFO L857 garLoopResultBuilder]: For program point L7377-22(lines 7377 7380) no Hoare annotation was computed. [2021-11-06 10:18:34,054 INFO L857 garLoopResultBuilder]: For program point L7377-20(lines 7377 7380) no Hoare annotation was computed. [2021-11-06 10:18:34,054 INFO L853 garLoopResultBuilder]: At program point L7377-25(lines 7375 7381) the Hoare annotation is: (let ((.cse19 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 8)) (.cse21 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|)) (.cse23 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| 24)) (.cse25 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|)) (.cse22 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| 8)) (.cse24 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|))) (let ((.cse0 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse1 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 |ULTIMATE.start_aws_byte_buf_from_array_#res.capacity|)) (.cse2 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 (select .cse24 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| 16)))) (.cse4 (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| 0)) (.cse5 (not (= 0 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|))) (.cse6 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse7 (= (select .cse25 .cse22) 0)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_from_array_#res.buffer.offset| 0)) (.cse9 (= (select .cse25 .cse23) 0)) (.cse10 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse11 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 (select .cse24 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset|))) (.cse12 (= |ULTIMATE.start_aws_byte_buf_from_array_#res.allocator.offset| 0)) (.cse13 (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2)) (.cse14 (= (select .cse21 .cse23) 0)) (.cse15 (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) .cse19))) (.cse3 (select .cse21 .cse22)) (.cse16 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 ULTIMATE.start_aws_byte_buf_from_array_~len)) (.cse17 (= |ULTIMATE.start_aws_byte_buf_from_array_#res.allocator.base| 0)) (.cse18 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 |ULTIMATE.start_aws_byte_buf_from_array_#res.len|))) (or (and (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.offset 0) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) .cse0 (<= ULTIMATE.start_bounded_malloc_~size (+ (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616)) 36028797018963967)) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (= |ULTIMATE.start_aws_byte_buf_from_array_#res.buffer.base| ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.base) .cse1 .cse2 (= ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.offset 0) (= .cse3 ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.base) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not .cse15) (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.base ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.base) (<= |ULTIMATE.start_aws_byte_buf_from_array_#res.capacity| (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_array_#res.capacity|) 18446744073709551616)))) .cse16 .cse17 .cse18) (and (= |ULTIMATE.start_aws_byte_buf_from_array_#res.buffer.base| 0) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) .cse19) 0) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.base 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (let ((.cse20 (select (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (<= .cse20 (* 18446744073709551616 (div .cse20 18446744073709551616)))) (<= |ULTIMATE.start_aws_byte_buf_from_array_#res.len| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_buf_from_array_#res.len| 18446744073709551616))) (= .cse3 0) .cse16 .cse17 .cse18)))) [2021-11-06 10:18:34,054 INFO L857 garLoopResultBuilder]: For program point L7377-24(lines 7377 7380) no Hoare annotation was computed. [2021-11-06 10:18:34,054 INFO L857 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-06 10:18:34,055 INFO L857 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-06 10:18:34,055 INFO L857 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-06 10:18:34,055 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,055 INFO L857 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-06 10:18:34,055 INFO L857 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-06 10:18:34,055 INFO L857 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-06 10:18:34,055 INFO L857 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-11-06 10:18:34,055 INFO L857 garLoopResultBuilder]: For program point L7380-2(line 7380) no Hoare annotation was computed. [2021-11-06 10:18:34,055 INFO L857 garLoopResultBuilder]: For program point L7380(line 7380) no Hoare annotation was computed. [2021-11-06 10:18:34,055 INFO L857 garLoopResultBuilder]: For program point L8206(lines 8206 8207) no Hoare annotation was computed. [2021-11-06 10:18:34,055 INFO L857 garLoopResultBuilder]: For program point L7380-6(line 7380) no Hoare annotation was computed. [2021-11-06 10:18:34,055 INFO L857 garLoopResultBuilder]: For program point L7380-4(line 7380) no Hoare annotation was computed. [2021-11-06 10:18:34,055 INFO L857 garLoopResultBuilder]: For program point L7380-3(line 7380) no Hoare annotation was computed. [2021-11-06 10:18:34,055 INFO L857 garLoopResultBuilder]: For program point L7380-9(line 7380) no Hoare annotation was computed. [2021-11-06 10:18:34,055 INFO L857 garLoopResultBuilder]: For program point L8206-2(lines 8206 8207) no Hoare annotation was computed. [2021-11-06 10:18:34,055 INFO L857 garLoopResultBuilder]: For program point L7380-8(line 7380) no Hoare annotation was computed. [2021-11-06 10:18:34,055 INFO L857 garLoopResultBuilder]: For program point L7380-13(line 7380) no Hoare annotation was computed. [2021-11-06 10:18:34,056 INFO L857 garLoopResultBuilder]: For program point L7380-12(line 7380) no Hoare annotation was computed. [2021-11-06 10:18:34,056 INFO L857 garLoopResultBuilder]: For program point L7380-11(line 7380) no Hoare annotation was computed. [2021-11-06 10:18:34,056 INFO L857 garLoopResultBuilder]: For program point L7380-17(line 7380) no Hoare annotation was computed. [2021-11-06 10:18:34,056 INFO L857 garLoopResultBuilder]: For program point L7380-15(line 7380) no Hoare annotation was computed. [2021-11-06 10:18:34,056 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,056 INFO L853 garLoopResultBuilder]: At program point L6886(lines 6882 6887) the Hoare annotation is: (and (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (<= ULTIMATE.start_bounded_malloc_~size (+ (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616)) 36028797018963967)) (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2)) [2021-11-06 10:18:34,056 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-06 10:18:34,056 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-06 10:18:34,057 INFO L853 garLoopResultBuilder]: At program point L266(line 266) the Hoare annotation is: (let ((.cse2 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| 8)) (.cse3 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|)) (.cse0 (select |#memory_int| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|)) (.cse1 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|)) (.cse4 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| 24))) (and (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.offset 0) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.base |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (<= (div ULTIMATE.start___VERIFIER_assert_~cond 256) 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) (= |ULTIMATE.start_aws_byte_buf_from_array_#res.buffer.base| ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.base) (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 |ULTIMATE.start_aws_byte_buf_from_array_#res.capacity|) (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 (select .cse0 (+ |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| 16))) (= ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.offset 0) (<= |ULTIMATE.start_aws_byte_buf_from_array_#res.capacity| (+ 36028797018963967 (* 18446744073709551616 (div (+ (* |ULTIMATE.start_aws_byte_buf_from_array_#res.len| (- 1)) (* (div (+ (- 1) |ULTIMATE.start_aws_byte_buf_from_array_#res.len|) 18446744073709551616) 18446744073709551616) |ULTIMATE.start_aws_byte_buf_from_array_#res.capacity|) 18446744073709551616)))) (= (select .cse1 .cse2) ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.base) (= |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset| 0) (= ULTIMATE.start_assert_bytes_match_~a.offset 0) (not (= 0 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.base|)) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (= (select .cse3 .cse2) 0) (= |ULTIMATE.start_aws_byte_buf_from_array_#res.buffer.offset| 0) (= (select .cse3 .cse4) 0) (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 (select .cse0 |ULTIMATE.start_aws_byte_buf_from_array_harness_~#buf~3.offset|)) (= |ULTIMATE.start_aws_byte_buf_from_array_#res.allocator.offset| 0) (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2) (= (select .cse1 .cse4) 0) (= ULTIMATE.start_assert_bytes_match_~a.base ULTIMATE.start_assert_bytes_match_~b.base) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 8)))) (= ULTIMATE.start_aws_byte_buf_from_array_~bytes.base ULTIMATE.start_aws_byte_buf_from_array_harness_~array~0.base) (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 ULTIMATE.start_aws_byte_buf_from_array_~len) (= ULTIMATE.start_assert_bytes_match_~b.offset 0) (= |ULTIMATE.start_aws_byte_buf_from_array_#res.allocator.base| 0) (= ULTIMATE.start_aws_byte_buf_from_array_harness_~length~2 |ULTIMATE.start_aws_byte_buf_from_array_#res.len|))) [2021-11-06 10:18:34,059 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 10:18:34,060 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 10:18:34,066 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,067 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,067 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,067 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,067 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,067 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,067 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,067 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,068 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,073 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,073 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,073 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,074 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,074 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,074 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,075 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,077 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,077 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,078 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,078 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,078 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,079 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,079 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,079 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,081 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,081 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,082 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,082 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,082 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,083 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,083 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,083 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,086 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,086 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,086 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,087 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,087 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,087 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,087 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,087 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,088 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,088 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,088 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,088 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,089 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,089 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,089 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,089 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,089 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,090 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,090 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,092 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,092 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,092 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,092 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,093 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,093 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,093 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,093 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,093 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,094 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,094 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,094 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,094 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,095 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,095 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,095 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,095 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,095 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,096 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,098 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,099 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,099 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,099 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,099 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,101 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,101 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,101 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,102 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,102 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,102 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,102 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,103 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:18:34 BoogieIcfgContainer [2021-11-06 10:18:34,104 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 10:18:34,105 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 10:18:34,105 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 10:18:34,105 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 10:18:34,106 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:15:43" (3/4) ... [2021-11-06 10:18:34,108 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-06 10:18:34,143 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 121 nodes and edges [2021-11-06 10:18:34,145 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2021-11-06 10:18:34,146 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2021-11-06 10:18:34,147 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-06 10:18:34,148 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-06 10:18:34,149 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-06 10:18:34,150 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-06 10:18:34,151 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-06 10:18:34,185 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((cond == 1 && \result == 0) && !(\result == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && size == length [2021-11-06 10:18:34,186 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967 && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && bytes == 0) && \result == 0) && !(\result == 0)) && buf == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && array == 0) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && !(bytes == 0)) && buf == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && !(0 == buf)) && buf == buf) && \result <= 1) && #memory_$Pointer$[buf][buf + 24] == 0) && 1 <= \result) && size == length) && length == unknown-#memory_int-unknown[buf][buf]) && bytes == array) && #memory_$Pointer$[buf][buf + 8] == array) && #memory_$Pointer$[buf][buf + 8] == 0) && length == len) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][buf]) / 18446744073709551616)) || (((((((((((((((((((((len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967 && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && #memory_$Pointer$[buf][buf + 8] == 0) && !(\result == 0)) && buf == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && length <= 18446744073709551616 * (length / 18446744073709551616)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && !(bytes == 0)) && buf == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && !(0 == buf)) && buf == buf) && \result <= 1) && #memory_$Pointer$[buf][buf + 24] == 0) && 1 <= \result) && size == length) && length == unknown-#memory_int-unknown[buf][buf]) && #memory_$Pointer$[buf][buf + 8] == 0) && length == len) && !(buf == 0)) [2021-11-06 10:18:34,186 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967 && aws_byte_buf_from_array_#res.buffer == 0) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && !(\result == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && length <= 18446744073709551616 * (length / 18446744073709551616)) && length == unknown-#res!capacity-unknown) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && !(bytes == 0)) && buf == 0) && !(0 == buf)) && aws_byte_buf_from_array_#res.buffer == 0) && aws_byte_buf_from_array_#res.allocator == 0) && size == length) && unknown-#memory_int-unknown[buf][buf] <= 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) && length == len) && aws_byte_buf_from_array_#res.allocator == 0) && length == unknown-#res!len-unknown) || ((((((((((((((((((((((len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967 && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && bytes == 0) && \result == 0) && !(\result == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && aws_byte_buf_from_array_#res.buffer == array) && unknown-#memory_int-unknown[buf][16 + buf] <= 36028797018963967 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][buf] * -1 + (-1 + unknown-#memory_int-unknown[buf][buf]) / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616)) && length == unknown-#res!capacity-unknown) && array == 0) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && !(bytes == 0)) && buf == 0) && !(0 == buf)) && aws_byte_buf_from_array_#res.buffer == 0) && aws_byte_buf_from_array_#res.allocator == 0) && size == length) && bytes == array) && unknown-#res!capacity-unknown <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && length == len) && aws_byte_buf_from_array_#res.allocator == 0) && length == unknown-#res!len-unknown) [2021-11-06 10:18:34,186 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((bytes == 0 && buf == buf) && \result == 0) && !(\result == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && buf == buf) && aws_byte_buf_from_array_#res.buffer == array) && length == unknown-#res!capacity-unknown) && length == unknown-#memory_int-unknown[buf][buf + 16]) && array == 0) && #memory_$Pointer$[buf][buf + 8] == array) && buf == 0) && !(0 == buf)) && \result <= 1) && #memory_$Pointer$[buf][buf + 8] == 0) && aws_byte_buf_from_array_#res.buffer == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && 1 <= \result) && length == unknown-#memory_int-unknown[buf][buf]) && aws_byte_buf_from_array_#res.allocator == 0) && size == length) && #memory_$Pointer$[buf][buf + 24] == 0) && !(0 == #memory_$Pointer$[buf][buf + 8])) && bytes == array) && unknown-#res!capacity-unknown <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && length == len) && aws_byte_buf_from_array_#res.allocator == 0) && length == unknown-#res!len-unknown) || ((((((((((((((((((((((((aws_byte_buf_from_array_#res.buffer == 0 && buf == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && !(\result == 0)) && length == unknown-#res!capacity-unknown) && length == unknown-#memory_int-unknown[buf][buf + 16]) && !(bytes == 0)) && buf == 0) && !(0 == buf)) && \result <= 1) && #memory_$Pointer$[buf][buf + 8] == 0) && aws_byte_buf_from_array_#res.buffer == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && 1 <= \result) && length == unknown-#memory_int-unknown[buf][buf]) && aws_byte_buf_from_array_#res.allocator == 0) && size == length) && #memory_$Pointer$[buf][buf + 24] == 0) && 0 == #memory_$Pointer$[buf][buf + 8]) && unknown-#memory_int-unknown[buf][buf] <= 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) && unknown-#res!len-unknown <= 18446744073709551616 * (unknown-#res!len-unknown / 18446744073709551616)) && #memory_$Pointer$[buf][buf + 8] == 0) && length == len) && aws_byte_buf_from_array_#res.allocator == 0) && length == unknown-#res!len-unknown) [2021-11-06 10:18:34,187 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((bytes == 0 && buf == buf) && \result == 0) && cond / 256 <= 0) && !(\result == 0)) && 1 <= cond) && buf == buf) && aws_byte_buf_from_array_#res.buffer == array) && length == unknown-#res!capacity-unknown) && length == unknown-#memory_int-unknown[buf][buf + 16]) && array == 0) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((unknown-#res!len-unknown * -1 + (-1 + unknown-#res!len-unknown) / 18446744073709551616 * 18446744073709551616 + unknown-#res!capacity-unknown) / 18446744073709551616)) && #memory_$Pointer$[buf][buf + 8] == array) && buf == 0) && a == 0) && !(0 == buf)) && \result <= 1) && #memory_$Pointer$[buf][buf + 8] == 0) && aws_byte_buf_from_array_#res.buffer == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && 1 <= \result) && length == unknown-#memory_int-unknown[buf][buf]) && aws_byte_buf_from_array_#res.allocator == 0) && size == length) && #memory_$Pointer$[buf][buf + 24] == 0) && a == b) && !(0 == #memory_$Pointer$[buf][buf + 8])) && bytes == array) && length == len) && b == 0) && aws_byte_buf_from_array_#res.allocator == 0) && length == unknown-#res!len-unknown [2021-11-06 10:18:34,832 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-06 10:18:34,833 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 10:18:34,834 INFO L168 Benchmark]: Toolchain (without parser) took 181287.69 ms. Allocated memory was 125.8 MB in the beginning and 897.6 MB in the end (delta: 771.8 MB). Free memory was 85.9 MB in the beginning and 534.0 MB in the end (delta: -448.1 MB). Peak memory consumption was 586.9 MB. Max. memory is 16.1 GB. [2021-11-06 10:18:34,835 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 86.0 MB. Free memory is still 45.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 10:18:34,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1970.94 ms. Allocated memory was 125.8 MB in the beginning and 178.3 MB in the end (delta: 52.4 MB). Free memory was 85.6 MB in the beginning and 84.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 61.5 MB. Max. memory is 16.1 GB. [2021-11-06 10:18:34,835 INFO L168 Benchmark]: Boogie Procedure Inliner took 159.25 ms. Allocated memory is still 178.3 MB. Free memory was 84.4 MB in the beginning and 126.4 MB in the end (delta: -42.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 16.1 GB. [2021-11-06 10:18:34,836 INFO L168 Benchmark]: Boogie Preprocessor took 96.36 ms. Allocated memory is still 178.3 MB. Free memory was 126.4 MB in the beginning and 118.0 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-06 10:18:34,836 INFO L168 Benchmark]: RCFGBuilder took 7815.36 ms. Allocated memory was 178.3 MB in the beginning and 310.4 MB in the end (delta: 132.1 MB). Free memory was 118.0 MB in the beginning and 228.4 MB in the end (delta: -110.4 MB). Peak memory consumption was 153.9 MB. Max. memory is 16.1 GB. [2021-11-06 10:18:34,836 INFO L168 Benchmark]: TraceAbstraction took 170511.28 ms. Allocated memory was 310.4 MB in the beginning and 721.4 MB in the end (delta: 411.0 MB). Free memory was 227.4 MB in the beginning and 223.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 415.3 MB. Max. memory is 16.1 GB. [2021-11-06 10:18:34,837 INFO L168 Benchmark]: Witness Printer took 727.63 ms. Allocated memory was 721.4 MB in the beginning and 897.6 MB in the end (delta: 176.2 MB). Free memory was 223.2 MB in the beginning and 534.0 MB in the end (delta: -310.8 MB). Peak memory consumption was 129.6 MB. Max. memory is 16.1 GB. [2021-11-06 10:18:34,839 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.20 ms. Allocated memory is still 86.0 MB. Free memory is still 45.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1970.94 ms. Allocated memory was 125.8 MB in the beginning and 178.3 MB in the end (delta: 52.4 MB). Free memory was 85.6 MB in the beginning and 84.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 61.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 159.25 ms. Allocated memory is still 178.3 MB. Free memory was 84.4 MB in the beginning and 126.4 MB in the end (delta: -42.0 MB). Peak memory consumption was 21.8 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 96.36 ms. Allocated memory is still 178.3 MB. Free memory was 126.4 MB in the beginning and 118.0 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 7815.36 ms. Allocated memory was 178.3 MB in the beginning and 310.4 MB in the end (delta: 132.1 MB). Free memory was 118.0 MB in the beginning and 228.4 MB in the end (delta: -110.4 MB). Peak memory consumption was 153.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 170511.28 ms. Allocated memory was 310.4 MB in the beginning and 721.4 MB in the end (delta: 411.0 MB). Free memory was 227.4 MB in the beginning and 223.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 415.3 MB. Max. memory is 16.1 GB. * Witness Printer took 727.63 ms. Allocated memory was 721.4 MB in the beginning and 897.6 MB in the end (delta: 176.2 MB). Free memory was 223.2 MB in the beginning and 534.0 MB in the end (delta: -310.8 MB). Peak memory consumption was 129.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 170.4s, OverallIterations: 34, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 118.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2456 SDtfs, 6109 SDslu, 7924 SDs, 0 SdLazy, 3642 SolverSat, 389 SolverUnsat, 45 SolverUnknown, 0 SolverNotchecked, 102.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 493 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 398 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 17.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=18, InterpolantAutomatonStates: 318, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 860 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 1022 HoareAnnotationTreeSize, 6 FomulaSimplifications, 450397 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 27746 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 32.4s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 1122 NumberOfCodeBlocks, 1122 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1088 ConstructedInterpolants, 0 QuantifiedInterpolants, 10716 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 266]: Loop Invariant [2021-11-06 10:18:34,854 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,854 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,854 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,854 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,855 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,855 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,855 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,855 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,855 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,856 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,856 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,857 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,857 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,857 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,858 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,858 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled Derived loop invariant: ((((((((((((((((((((((((((((((bytes == 0 && buf == buf) && \result == 0) && cond / 256 <= 0) && !(\result == 0)) && 1 <= cond) && buf == buf) && aws_byte_buf_from_array_#res.buffer == array) && length == unknown-#res!capacity-unknown) && length == unknown-#memory_int-unknown[buf][buf + 16]) && array == 0) && unknown-#res!capacity-unknown <= 36028797018963967 + 18446744073709551616 * ((unknown-#res!len-unknown * -1 + (-1 + unknown-#res!len-unknown) / 18446744073709551616 * 18446744073709551616 + unknown-#res!capacity-unknown) / 18446744073709551616)) && #memory_$Pointer$[buf][buf + 8] == array) && buf == 0) && a == 0) && !(0 == buf)) && \result <= 1) && #memory_$Pointer$[buf][buf + 8] == 0) && aws_byte_buf_from_array_#res.buffer == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && 1 <= \result) && length == unknown-#memory_int-unknown[buf][buf]) && aws_byte_buf_from_array_#res.allocator == 0) && size == length) && #memory_$Pointer$[buf][buf + 24] == 0) && a == b) && !(0 == #memory_$Pointer$[buf][buf + 8])) && bytes == array) && length == len) && b == 0) && aws_byte_buf_from_array_#res.allocator == 0) && length == unknown-#res!len-unknown - InvariantResult [Line: 7375]: Loop Invariant [2021-11-06 10:18:34,859 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,859 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,859 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,859 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,859 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,860 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,860 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,860 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,861 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,861 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,861 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,861 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,861 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,862 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967 && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && bytes == 0) && \result == 0) && !(\result == 0)) && buf == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && array == 0) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && !(bytes == 0)) && buf == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && !(0 == buf)) && buf == buf) && \result <= 1) && #memory_$Pointer$[buf][buf + 24] == 0) && 1 <= \result) && size == length) && length == unknown-#memory_int-unknown[buf][buf]) && bytes == array) && #memory_$Pointer$[buf][buf + 8] == array) && #memory_$Pointer$[buf][buf + 8] == 0) && length == len) && !(buf == 0)) && unknown-#memory_int-unknown[buf][buf] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][buf]) / 18446744073709551616)) || (((((((((((((((((((((len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967 && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && #memory_$Pointer$[buf][buf + 8] == 0) && !(\result == 0)) && buf == 0) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && length <= 18446744073709551616 * (length / 18446744073709551616)) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && !(bytes == 0)) && buf == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && !(0 == buf)) && buf == buf) && \result <= 1) && #memory_$Pointer$[buf][buf + 24] == 0) && 1 <= \result) && size == length) && length == unknown-#memory_int-unknown[buf][buf]) && #memory_$Pointer$[buf][buf + 8] == 0) && length == len) && !(buf == 0)) - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: (((cond == 1 && \result == 0) && !(\result == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && size == length - InvariantResult [Line: 7375]: Loop Invariant [2021-11-06 10:18:34,863 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,864 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,864 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,864 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,865 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,865 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,865 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,866 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,866 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,866 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,867 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,867 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,867 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,868 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,868 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,868 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,868 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,868 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,869 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,869 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,869 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,870 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-06 10:18:34,870 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,870 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-06 10:18:34,871 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled Derived loop invariant: (((((((((((((((((((((((((((bytes == 0 && buf == buf) && \result == 0) && !(\result == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && buf == buf) && aws_byte_buf_from_array_#res.buffer == array) && length == unknown-#res!capacity-unknown) && length == unknown-#memory_int-unknown[buf][buf + 16]) && array == 0) && #memory_$Pointer$[buf][buf + 8] == array) && buf == 0) && !(0 == buf)) && \result <= 1) && #memory_$Pointer$[buf][buf + 8] == 0) && aws_byte_buf_from_array_#res.buffer == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && 1 <= \result) && length == unknown-#memory_int-unknown[buf][buf]) && aws_byte_buf_from_array_#res.allocator == 0) && size == length) && #memory_$Pointer$[buf][buf + 24] == 0) && !(0 == #memory_$Pointer$[buf][buf + 8])) && bytes == array) && unknown-#res!capacity-unknown <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && length == len) && aws_byte_buf_from_array_#res.allocator == 0) && length == unknown-#res!len-unknown) || ((((((((((((((((((((((((aws_byte_buf_from_array_#res.buffer == 0 && buf == 0) && #memory_$Pointer$[buf][buf + 8] == 0) && !(\result == 0)) && length == unknown-#res!capacity-unknown) && length == unknown-#memory_int-unknown[buf][buf + 16]) && !(bytes == 0)) && buf == 0) && !(0 == buf)) && \result <= 1) && #memory_$Pointer$[buf][buf + 8] == 0) && aws_byte_buf_from_array_#res.buffer == 0) && #memory_$Pointer$[buf][buf + 24] == 0) && 1 <= \result) && length == unknown-#memory_int-unknown[buf][buf]) && aws_byte_buf_from_array_#res.allocator == 0) && size == length) && #memory_$Pointer$[buf][buf + 24] == 0) && 0 == #memory_$Pointer$[buf][buf + 8]) && unknown-#memory_int-unknown[buf][buf] <= 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) && unknown-#res!len-unknown <= 18446744073709551616 * (unknown-#res!len-unknown / 18446744073709551616)) && #memory_$Pointer$[buf][buf + 8] == 0) && length == len) && aws_byte_buf_from_array_#res.allocator == 0) && length == unknown-#res!len-unknown) - InvariantResult [Line: 8978]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8203]: Loop Invariant [2021-11-06 10:18:34,872 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,872 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,872 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,872 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,872 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,873 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,873 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,873 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,874 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,874 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,874 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,874 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,874 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,874 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,875 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled [2021-11-06 10:18:34,875 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_buf_from_array_#res : { len : int, buffer : $Pointer$, capacity : int, allocator : $Pointer$ } not handled Derived loop invariant: ((((((((((((((((((len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967 && aws_byte_buf_from_array_#res.buffer == 0) && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && !(\result == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && length <= 18446744073709551616 * (length / 18446744073709551616)) && length == unknown-#res!capacity-unknown) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && !(bytes == 0)) && buf == 0) && !(0 == buf)) && aws_byte_buf_from_array_#res.buffer == 0) && aws_byte_buf_from_array_#res.allocator == 0) && size == length) && unknown-#memory_int-unknown[buf][buf] <= 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] / 18446744073709551616)) && length == len) && aws_byte_buf_from_array_#res.allocator == 0) && length == unknown-#res!len-unknown) || ((((((((((((((((((((((len <= 18446744073709551616 * (len / 18446744073709551616) + 36028797018963967 && buf == 0) && unknown-#memory_int-unknown[buf][16 + buf] <= unknown-#memory_int-unknown[buf][buf]) && bytes == 0) && \result == 0) && !(\result == 0)) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && aws_byte_buf_from_array_#res.buffer == array) && unknown-#memory_int-unknown[buf][16 + buf] <= 36028797018963967 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][buf] * -1 + (-1 + unknown-#memory_int-unknown[buf][buf]) / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616)) && length == unknown-#res!capacity-unknown) && array == 0) && unknown-#memory_int-unknown[buf][buf] <= unknown-#memory_int-unknown[buf][16 + buf]) && !(bytes == 0)) && buf == 0) && !(0 == buf)) && aws_byte_buf_from_array_#res.buffer == 0) && aws_byte_buf_from_array_#res.allocator == 0) && size == length) && bytes == array) && unknown-#res!capacity-unknown <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#res!capacity-unknown) / 18446744073709551616)) && length == len) && aws_byte_buf_from_array_#res.allocator == 0) && length == unknown-#res!len-unknown) RESULT: Ultimate proved your program to be correct! [2021-11-06 10:18:34,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE