./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/unreach-call.prp --file /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_cursor_from_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678b828e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_cursor_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 575d24db9b60b0c8b630d9378ac6f5bef587ff9f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-678b828 [2020-12-07 16:28:16,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-07 16:28:16,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-07 16:28:16,688 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-07 16:28:16,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-07 16:28:16,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-07 16:28:16,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-07 16:28:16,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-07 16:28:16,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-07 16:28:16,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-07 16:28:16,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-07 16:28:16,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-07 16:28:16,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-07 16:28:16,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-07 16:28:16,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-07 16:28:16,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-07 16:28:16,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-07 16:28:16,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-07 16:28:16,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-07 16:28:16,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-07 16:28:16,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-07 16:28:16,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-07 16:28:16,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-07 16:28:16,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-07 16:28:16,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-07 16:28:16,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-07 16:28:16,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-07 16:28:16,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-07 16:28:16,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-07 16:28:16,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-07 16:28:16,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-07 16:28:16,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-07 16:28:16,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-07 16:28:16,780 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-07 16:28:16,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-07 16:28:16,781 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-07 16:28:16,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-07 16:28:16,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-07 16:28:16,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-07 16:28:16,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-07 16:28:16,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-07 16:28:16,788 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-07 16:28:16,836 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-07 16:28:16,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-07 16:28:16,848 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-07 16:28:16,848 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-07 16:28:16,849 INFO L138 SettingsManager]: * Use SBE=true [2020-12-07 16:28:16,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-07 16:28:16,849 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-07 16:28:16,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-07 16:28:16,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-07 16:28:16,850 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-07 16:28:16,850 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-07 16:28:16,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-07 16:28:16,855 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-07 16:28:16,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-07 16:28:16,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-07 16:28:16,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-07 16:28:16,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-07 16:28:16,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-07 16:28:16,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-07 16:28:16,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-07 16:28:16,858 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-07 16:28:16,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-07 16:28:16,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-07 16:28:16,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-07 16:28:16,859 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-07 16:28:16,860 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 -> 575d24db9b60b0c8b630d9378ac6f5bef587ff9f [2020-12-07 16:28:17,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-07 16:28:17,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-07 16:28:17,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-07 16:28:17,354 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-07 16:28:17,355 INFO L275 PluginConnector]: CDTParser initialized [2020-12-07 16:28:17,357 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_cursor_from_array_harness.i [2020-12-07 16:28:17,445 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6feb5734a/1f45a54dc58743c692d62914ab207315/FLAG7951148ea [2020-12-07 16:28:18,676 INFO L306 CDTParser]: Found 1 translation units. [2020-12-07 16:28:18,677 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_cursor_from_array_harness.i [2020-12-07 16:28:18,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6feb5734a/1f45a54dc58743c692d62914ab207315/FLAG7951148ea [2020-12-07 16:28:18,905 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6feb5734a/1f45a54dc58743c692d62914ab207315 [2020-12-07 16:28:18,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-07 16:28:18,914 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-07 16:28:18,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-07 16:28:18,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-07 16:28:18,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-07 16:28:18,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:28:18" (1/1) ... [2020-12-07 16:28:18,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745bd8f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:18, skipping insertion in model container [2020-12-07 16:28:18,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:28:18" (1/1) ... [2020-12-07 16:28:18,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-07 16:28:19,124 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-07 16:28:19,431 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_cursor_from_array_harness.i[4500,4513] [2020-12-07 16:28:19,440 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_cursor_from_array_harness.i[4560,4573] [2020-12-07 16:28:19,470 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-07 16:28:19,477 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2020-12-07 16:28:20,692 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:20,694 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:20,695 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:20,696 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:20,698 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:20,715 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:20,717 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:20,719 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:20,720 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:21,248 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-07 16:28:21,250 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-07 16:28:21,251 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-07 16:28:21,253 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-07 16:28:21,255 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-07 16:28:21,256 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-07 16:28:21,257 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-07 16:28:21,258 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-07 16:28:21,258 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-07 16:28:21,262 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2020-12-07 16:28:21,612 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2020-12-07 16:28:21,715 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:21,716 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:21,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-07 16:28:21,890 INFO L203 MainTranslator]: Completed pre-run [2020-12-07 16:28:21,908 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_cursor_from_array_harness.i[4500,4513] [2020-12-07 16:28:21,909 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_cursor_from_array_harness.i[4560,4573] [2020-12-07 16:28:21,912 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-07 16:28:21,913 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2020-12-07 16:28:21,965 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:21,967 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:21,967 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:21,968 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:21,971 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:21,987 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:21,988 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:21,994 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:21,997 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:22,062 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-07 16:28:22,063 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-07 16:28:22,064 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-07 16:28:22,065 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-07 16:28:22,066 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-07 16:28:22,067 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-07 16:28:22,068 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-07 16:28:22,073 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-07 16:28:22,074 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-07 16:28:22,075 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2020-12-07 16:28:22,127 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2020-12-07 16:28:22,187 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:22,187 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 16:28:22,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-07 16:28:23,310 INFO L208 MainTranslator]: Completed translation [2020-12-07 16:28:23,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:23 WrapperNode [2020-12-07 16:28:23,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-07 16:28:23,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-07 16:28:23,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-07 16:28:23,313 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-07 16:28:23,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:23" (1/1) ... [2020-12-07 16:28:23,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:23" (1/1) ... [2020-12-07 16:28:23,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-07 16:28:23,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-07 16:28:23,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-07 16:28:23,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-07 16:28:23,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:23" (1/1) ... [2020-12-07 16:28:23,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:23" (1/1) ... [2020-12-07 16:28:23,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:23" (1/1) ... [2020-12-07 16:28:23,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:23" (1/1) ... [2020-12-07 16:28:23,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:23" (1/1) ... [2020-12-07 16:28:23,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:23" (1/1) ... [2020-12-07 16:28:23,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:23" (1/1) ... [2020-12-07 16:28:23,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-07 16:28:23,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-07 16:28:23,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-07 16:28:23,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-07 16:28:23,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-07 16:28:23,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-07 16:28:23,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-07 16:28:23,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-07 16:28:23,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-07 16:28:23,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-07 16:28:23,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-07 16:28:23,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-07 16:28:23,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-07 16:28:23,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-07 16:28:23,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-07 16:28:23,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-07 16:28:33,419 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-07 16:28:33,420 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2020-12-07 16:28:33,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:28:33 BoogieIcfgContainer [2020-12-07 16:28:33,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-07 16:28:33,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-07 16:28:33,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-07 16:28:33,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-07 16:28:33,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:28:18" (1/3) ... [2020-12-07 16:28:33,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695d8b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:28:33, skipping insertion in model container [2020-12-07 16:28:33,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:23" (2/3) ... [2020-12-07 16:28:33,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695d8b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:28:33, skipping insertion in model container [2020-12-07 16:28:33,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:28:33" (3/3) ... [2020-12-07 16:28:33,432 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_array_harness.i [2020-12-07 16:28:33,449 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-07 16:28:33,454 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-12-07 16:28:33,467 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-07 16:28:33,495 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-07 16:28:33,495 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-07 16:28:33,496 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-07 16:28:33,496 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-07 16:28:33,496 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-07 16:28:33,496 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-07 16:28:33,497 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-07 16:28:33,497 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-07 16:28:33,514 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2020-12-07 16:28:33,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-07 16:28:33,521 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:28:33,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:28:33,523 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:28:33,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:28:33,529 INFO L82 PathProgramCache]: Analyzing trace with hash -86834800, now seen corresponding path program 1 times [2020-12-07 16:28:33,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:28:33,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600827064] [2020-12-07 16:28:33,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:28:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:28:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:28:34,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600827064] [2020-12-07 16:28:34,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:28:34,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-07 16:28:34,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913431837] [2020-12-07 16:28:34,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-07 16:28:34,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:28:34,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-07 16:28:34,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-07 16:28:34,400 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2020-12-07 16:28:34,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:28:34,440 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2020-12-07 16:28:34,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-07 16:28:34,442 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-12-07 16:28:34,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:28:34,453 INFO L225 Difference]: With dead ends: 117 [2020-12-07 16:28:34,455 INFO L226 Difference]: Without dead ends: 53 [2020-12-07 16:28:34,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-07 16:28:34,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-12-07 16:28:34,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-12-07 16:28:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-07 16:28:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2020-12-07 16:28:34,504 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 12 [2020-12-07 16:28:34,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:28:34,504 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2020-12-07 16:28:34,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-07 16:28:34,505 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2020-12-07 16:28:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-07 16:28:34,505 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:28:34,506 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:28:34,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-07 16:28:34,506 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:28:34,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:28:34,508 INFO L82 PathProgramCache]: Analyzing trace with hash -479861810, now seen corresponding path program 1 times [2020-12-07 16:28:34,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:28:34,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812904606] [2020-12-07 16:28:34,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:28:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:28:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:28:34,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812904606] [2020-12-07 16:28:34,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:28:34,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-07 16:28:34,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320745132] [2020-12-07 16:28:34,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-07 16:28:34,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:28:34,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-07 16:28:34,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-07 16:28:34,948 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 3 states. [2020-12-07 16:28:35,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:28:35,011 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2020-12-07 16:28:35,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-07 16:28:35,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-12-07 16:28:35,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:28:35,015 INFO L225 Difference]: With dead ends: 90 [2020-12-07 16:28:35,015 INFO L226 Difference]: Without dead ends: 53 [2020-12-07 16:28:35,016 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-07 16:28:35,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-12-07 16:28:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-12-07 16:28:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-07 16:28:35,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2020-12-07 16:28:35,025 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 12 [2020-12-07 16:28:35,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:28:35,025 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2020-12-07 16:28:35,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-07 16:28:35,026 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2020-12-07 16:28:35,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-07 16:28:35,026 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:28:35,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:28:35,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-07 16:28:35,027 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:28:35,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:28:35,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1018024457, now seen corresponding path program 1 times [2020-12-07 16:28:35,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:28:35,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570821018] [2020-12-07 16:28:35,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:28:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:28:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:28:35,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570821018] [2020-12-07 16:28:35,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:28:35,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-07 16:28:35,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213752984] [2020-12-07 16:28:35,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-07 16:28:35,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:28:35,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-07 16:28:35,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-07 16:28:35,788 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 6 states. [2020-12-07 16:28:36,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:28:36,250 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2020-12-07 16:28:36,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-07 16:28:36,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-07 16:28:36,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:28:36,253 INFO L225 Difference]: With dead ends: 97 [2020-12-07 16:28:36,253 INFO L226 Difference]: Without dead ends: 93 [2020-12-07 16:28:36,254 INFO L677 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 [2020-12-07 16:28:36,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-12-07 16:28:36,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 61. [2020-12-07 16:28:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-07 16:28:36,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2020-12-07 16:28:36,264 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 14 [2020-12-07 16:28:36,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:28:36,265 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2020-12-07 16:28:36,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-07 16:28:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2020-12-07 16:28:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-07 16:28:36,266 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:28:36,266 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:28:36,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-07 16:28:36,267 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:28:36,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:28:36,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1084310207, now seen corresponding path program 1 times [2020-12-07 16:28:36,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:28:36,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538413993] [2020-12-07 16:28:36,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:28:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:28:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:28:40,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538413993] [2020-12-07 16:28:40,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:28:40,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-07 16:28:40,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711265830] [2020-12-07 16:28:40,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-07 16:28:40,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:28:40,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-07 16:28:40,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-07 16:28:40,904 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 7 states. [2020-12-07 16:28:43,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:28:43,539 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2020-12-07 16:28:43,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-07 16:28:43,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-12-07 16:28:43,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:28:43,544 INFO L225 Difference]: With dead ends: 111 [2020-12-07 16:28:43,545 INFO L226 Difference]: Without dead ends: 68 [2020-12-07 16:28:43,546 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2020-12-07 16:28:43,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-12-07 16:28:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2020-12-07 16:28:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-07 16:28:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2020-12-07 16:28:43,555 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 18 [2020-12-07 16:28:43,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:28:43,555 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2020-12-07 16:28:43,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-07 16:28:43,556 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2020-12-07 16:28:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-07 16:28:43,557 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:28:43,557 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:28:43,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-07 16:28:43,558 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:28:43,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:28:43,558 INFO L82 PathProgramCache]: Analyzing trace with hash -404251837, now seen corresponding path program 1 times [2020-12-07 16:28:43,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:28:43,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385431734] [2020-12-07 16:28:43,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:28:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:28:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:28:44,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385431734] [2020-12-07 16:28:44,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:28:44,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-07 16:28:44,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358934345] [2020-12-07 16:28:44,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-07 16:28:44,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:28:44,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-07 16:28:44,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-07 16:28:44,189 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 4 states. [2020-12-07 16:28:46,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:28:46,571 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2020-12-07 16:28:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-07 16:28:46,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-12-07 16:28:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:28:46,574 INFO L225 Difference]: With dead ends: 108 [2020-12-07 16:28:46,575 INFO L226 Difference]: Without dead ends: 61 [2020-12-07 16:28:46,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-07 16:28:46,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-12-07 16:28:46,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-12-07 16:28:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-07 16:28:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2020-12-07 16:28:46,583 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 18 [2020-12-07 16:28:46,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:28:46,583 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2020-12-07 16:28:46,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-07 16:28:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2020-12-07 16:28:46,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-07 16:28:46,585 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:28:46,585 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:28:46,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-07 16:28:46,586 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:28:46,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:28:46,586 INFO L82 PathProgramCache]: Analyzing trace with hash 501656654, now seen corresponding path program 1 times [2020-12-07 16:28:46,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:28:46,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889062534] [2020-12-07 16:28:46,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:28:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:28:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:28:46,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889062534] [2020-12-07 16:28:46,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:28:46,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-07 16:28:46,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657174219] [2020-12-07 16:28:46,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-07 16:28:46,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:28:46,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-07 16:28:46,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-07 16:28:46,890 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 4 states. [2020-12-07 16:28:46,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:28:46,958 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2020-12-07 16:28:46,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-07 16:28:46,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-12-07 16:28:46,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:28:46,960 INFO L225 Difference]: With dead ends: 82 [2020-12-07 16:28:46,961 INFO L226 Difference]: Without dead ends: 61 [2020-12-07 16:28:46,961 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-07 16:28:46,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-12-07 16:28:46,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-12-07 16:28:46,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-07 16:28:46,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2020-12-07 16:28:46,969 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 20 [2020-12-07 16:28:46,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:28:46,969 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2020-12-07 16:28:46,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-07 16:28:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2020-12-07 16:28:46,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-07 16:28:46,971 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:28:46,971 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:28:46,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-07 16:28:46,971 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:28:46,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:28:46,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1522937572, now seen corresponding path program 1 times [2020-12-07 16:28:46,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:28:46,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486101775] [2020-12-07 16:28:46,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:28:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:28:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:28:47,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486101775] [2020-12-07 16:28:47,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:28:47,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-07 16:28:47,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961735262] [2020-12-07 16:28:47,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-07 16:28:47,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:28:47,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-07 16:28:47,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-07 16:28:47,559 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 8 states. [2020-12-07 16:28:48,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:28:48,287 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2020-12-07 16:28:48,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-07 16:28:48,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-07 16:28:48,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:28:48,290 INFO L225 Difference]: With dead ends: 114 [2020-12-07 16:28:48,290 INFO L226 Difference]: Without dead ends: 110 [2020-12-07 16:28:48,291 INFO L677 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 [2020-12-07 16:28:48,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-12-07 16:28:48,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 65. [2020-12-07 16:28:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-07 16:28:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2020-12-07 16:28:48,299 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 20 [2020-12-07 16:28:48,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:28:48,300 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2020-12-07 16:28:48,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-07 16:28:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-12-07 16:28:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-07 16:28:48,304 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:28:48,304 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:28:48,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-07 16:28:48,305 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:28:48,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:28:48,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1962683098, now seen corresponding path program 1 times [2020-12-07 16:28:48,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:28:48,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194426947] [2020-12-07 16:28:48,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:28:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:28:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:28:49,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194426947] [2020-12-07 16:28:49,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:28:49,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-07 16:28:49,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525388040] [2020-12-07 16:28:49,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-07 16:28:49,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:28:49,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-07 16:28:49,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-12-07 16:28:49,084 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 11 states. [2020-12-07 16:28:54,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:28:54,650 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2020-12-07 16:28:54,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-07 16:28:54,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-07 16:28:54,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:28:54,657 INFO L225 Difference]: With dead ends: 114 [2020-12-07 16:28:54,658 INFO L226 Difference]: Without dead ends: 110 [2020-12-07 16:28:54,661 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=179, Invalid=577, Unknown=0, NotChecked=0, Total=756 [2020-12-07 16:28:54,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-12-07 16:28:54,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 56. [2020-12-07 16:28:54,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-07 16:28:54,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2020-12-07 16:28:54,668 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 20 [2020-12-07 16:28:54,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:28:54,669 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2020-12-07 16:28:54,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-07 16:28:54,669 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2020-12-07 16:28:54,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-07 16:28:54,670 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:28:54,670 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:28:54,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-07 16:28:54,671 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:28:54,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:28:54,672 INFO L82 PathProgramCache]: Analyzing trace with hash -863865621, now seen corresponding path program 1 times [2020-12-07 16:28:54,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:28:54,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221513920] [2020-12-07 16:28:54,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:28:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:28:59,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:28:59,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221513920] [2020-12-07 16:28:59,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:28:59,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-07 16:28:59,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842516597] [2020-12-07 16:28:59,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-07 16:28:59,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:28:59,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-07 16:28:59,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-12-07 16:28:59,528 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 10 states. [2020-12-07 16:29:06,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:29:06,366 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2020-12-07 16:29:06,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-07 16:29:06,368 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-12-07 16:29:06,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:29:06,369 INFO L225 Difference]: With dead ends: 97 [2020-12-07 16:29:06,369 INFO L226 Difference]: Without dead ends: 95 [2020-12-07 16:29:06,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2020-12-07 16:29:06,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-12-07 16:29:06,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 81. [2020-12-07 16:29:06,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-12-07 16:29:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2020-12-07 16:29:06,379 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 24 [2020-12-07 16:29:06,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:29:06,380 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2020-12-07 16:29:06,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-07 16:29:06,380 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-12-07 16:29:06,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-07 16:29:06,383 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:29:06,383 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:29:06,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-07 16:29:06,383 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:29:06,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:29:06,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1075136575, now seen corresponding path program 1 times [2020-12-07 16:29:06,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:29:06,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714377255] [2020-12-07 16:29:06,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:29:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:29:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:29:07,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714377255] [2020-12-07 16:29:07,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:29:07,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-07 16:29:07,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848847593] [2020-12-07 16:29:07,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-07 16:29:07,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:29:07,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-07 16:29:07,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-07 16:29:07,309 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 9 states. [2020-12-07 16:29:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:29:12,203 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2020-12-07 16:29:12,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-07 16:29:12,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-12-07 16:29:12,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:29:12,205 INFO L225 Difference]: With dead ends: 115 [2020-12-07 16:29:12,205 INFO L226 Difference]: Without dead ends: 84 [2020-12-07 16:29:12,206 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2020-12-07 16:29:12,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-12-07 16:29:12,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2020-12-07 16:29:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-12-07 16:29:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2020-12-07 16:29:12,212 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 26 [2020-12-07 16:29:12,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:29:12,213 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2020-12-07 16:29:12,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-07 16:29:12,213 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2020-12-07 16:29:12,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-07 16:29:12,214 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:29:12,214 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:29:12,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-07 16:29:12,214 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:29:12,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:29:12,215 INFO L82 PathProgramCache]: Analyzing trace with hash 27288689, now seen corresponding path program 1 times [2020-12-07 16:29:12,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:29:12,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23009126] [2020-12-07 16:29:12,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:29:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:29:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:29:12,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23009126] [2020-12-07 16:29:12,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:29:12,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-07 16:29:12,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024458118] [2020-12-07 16:29:12,798 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-07 16:29:12,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:29:12,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-07 16:29:12,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-07 16:29:12,801 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 8 states. [2020-12-07 16:29:17,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:29:17,368 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2020-12-07 16:29:17,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-07 16:29:17,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-12-07 16:29:17,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:29:17,370 INFO L225 Difference]: With dead ends: 70 [2020-12-07 16:29:17,370 INFO L226 Difference]: Without dead ends: 68 [2020-12-07 16:29:17,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-12-07 16:29:17,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-12-07 16:29:17,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-12-07 16:29:17,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-07 16:29:17,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2020-12-07 16:29:17,377 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 27 [2020-12-07 16:29:17,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:29:17,377 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2020-12-07 16:29:17,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-07 16:29:17,378 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-12-07 16:29:17,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-07 16:29:17,378 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:29:17,379 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:29:17,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-07 16:29:17,379 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:29:17,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:29:17,379 INFO L82 PathProgramCache]: Analyzing trace with hash 508885054, now seen corresponding path program 1 times [2020-12-07 16:29:17,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:29:17,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434600004] [2020-12-07 16:29:17,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:29:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:29:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:29:17,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434600004] [2020-12-07 16:29:17,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:29:17,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-07 16:29:17,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732732652] [2020-12-07 16:29:17,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-07 16:29:17,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:29:17,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-07 16:29:17,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-07 16:29:17,897 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2020-12-07 16:29:20,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:29:20,246 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2020-12-07 16:29:20,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-07 16:29:20,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-12-07 16:29:20,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:29:20,248 INFO L225 Difference]: With dead ends: 127 [2020-12-07 16:29:20,248 INFO L226 Difference]: Without dead ends: 86 [2020-12-07 16:29:20,249 INFO L677 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 [2020-12-07 16:29:20,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-12-07 16:29:20,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2020-12-07 16:29:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-07 16:29:20,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2020-12-07 16:29:20,256 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 30 [2020-12-07 16:29:20,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:29:20,256 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2020-12-07 16:29:20,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-07 16:29:20,256 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2020-12-07 16:29:20,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-07 16:29:20,257 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:29:20,258 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:29:20,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-07 16:29:20,258 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:29:20,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:29:20,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1485259652, now seen corresponding path program 1 times [2020-12-07 16:29:20,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:29:20,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081306287] [2020-12-07 16:29:20,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:29:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:29:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:29:21,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081306287] [2020-12-07 16:29:21,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:29:21,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-07 16:29:21,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072121422] [2020-12-07 16:29:21,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-07 16:29:21,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:29:21,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-07 16:29:21,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-07 16:29:21,176 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 8 states. [2020-12-07 16:29:25,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:29:25,751 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2020-12-07 16:29:25,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-07 16:29:25,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2020-12-07 16:29:25,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:29:25,754 INFO L225 Difference]: With dead ends: 68 [2020-12-07 16:29:25,754 INFO L226 Difference]: Without dead ends: 66 [2020-12-07 16:29:25,754 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-12-07 16:29:25,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-12-07 16:29:25,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2020-12-07 16:29:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-12-07 16:29:25,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2020-12-07 16:29:25,761 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 30 [2020-12-07 16:29:25,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:29:25,761 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2020-12-07 16:29:25,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-07 16:29:25,762 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2020-12-07 16:29:25,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-07 16:29:25,763 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:29:25,763 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:29:25,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-07 16:29:25,764 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:29:25,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:29:25,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1328145208, now seen corresponding path program 1 times [2020-12-07 16:29:25,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:29:25,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162846265] [2020-12-07 16:29:25,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:29:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:29:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:29:26,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162846265] [2020-12-07 16:29:26,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:29:26,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-07 16:29:26,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978178105] [2020-12-07 16:29:26,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-07 16:29:26,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:29:26,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-07 16:29:26,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-12-07 16:29:26,846 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 12 states. [2020-12-07 16:29:34,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:29:34,087 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-12-07 16:29:34,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-07 16:29:34,089 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2020-12-07 16:29:34,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:29:34,090 INFO L225 Difference]: With dead ends: 76 [2020-12-07 16:29:34,090 INFO L226 Difference]: Without dead ends: 52 [2020-12-07 16:29:34,091 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2020-12-07 16:29:34,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-12-07 16:29:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-12-07 16:29:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-12-07 16:29:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-12-07 16:29:34,097 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 32 [2020-12-07 16:29:34,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:29:34,097 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-12-07 16:29:34,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-07 16:29:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-12-07 16:29:34,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-07 16:29:34,099 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:29:34,099 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:29:34,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-07 16:29:34,099 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:29:34,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:29:34,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1234346222, now seen corresponding path program 1 times [2020-12-07 16:29:34,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:29:34,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439794932] [2020-12-07 16:29:34,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:29:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:29:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:29:37,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439794932] [2020-12-07 16:29:37,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:29:37,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-07 16:29:37,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670946598] [2020-12-07 16:29:37,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-07 16:29:37,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:29:37,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-07 16:29:37,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-07 16:29:37,407 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 9 states. [2020-12-07 16:29:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:29:42,195 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2020-12-07 16:29:42,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-07 16:29:42,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2020-12-07 16:29:42,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:29:42,198 INFO L225 Difference]: With dead ends: 66 [2020-12-07 16:29:42,198 INFO L226 Difference]: Without dead ends: 47 [2020-12-07 16:29:42,199 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2020-12-07 16:29:42,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-12-07 16:29:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-12-07 16:29:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-12-07 16:29:42,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2020-12-07 16:29:42,203 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 32 [2020-12-07 16:29:42,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:29:42,203 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2020-12-07 16:29:42,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-07 16:29:42,204 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2020-12-07 16:29:42,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-07 16:29:42,205 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:29:42,205 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:29:42,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-07 16:29:42,205 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:29:42,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:29:42,206 INFO L82 PathProgramCache]: Analyzing trace with hash -911472183, now seen corresponding path program 1 times [2020-12-07 16:29:42,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:29:42,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684836430] [2020-12-07 16:29:42,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:29:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:29:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:29:43,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684836430] [2020-12-07 16:29:43,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:29:43,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-07 16:29:43,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429694102] [2020-12-07 16:29:43,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-07 16:29:43,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:29:43,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-07 16:29:43,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-12-07 16:29:43,458 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 10 states. [2020-12-07 16:29:50,155 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-12-07 16:29:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:29:50,822 INFO L93 Difference]: Finished difference Result 61 states and 60 transitions. [2020-12-07 16:29:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-07 16:29:50,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2020-12-07 16:29:50,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:29:50,826 INFO L225 Difference]: With dead ends: 61 [2020-12-07 16:29:50,826 INFO L226 Difference]: Without dead ends: 45 [2020-12-07 16:29:50,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2020-12-07 16:29:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-12-07 16:29:50,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-12-07 16:29:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-12-07 16:29:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 44 transitions. [2020-12-07 16:29:50,833 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 44 transitions. Word has length 38 [2020-12-07 16:29:50,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:29:50,834 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 44 transitions. [2020-12-07 16:29:50,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-07 16:29:50,835 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 44 transitions. [2020-12-07 16:29:50,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-07 16:29:50,836 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 16:29:50,837 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 16:29:50,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-07 16:29:50,837 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 16:29:50,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 16:29:50,838 INFO L82 PathProgramCache]: Analyzing trace with hash 52794010, now seen corresponding path program 1 times [2020-12-07 16:29:50,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 16:29:50,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060644297] [2020-12-07 16:29:50,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 16:29:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 16:29:57,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 16:29:57,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060644297] [2020-12-07 16:29:57,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 16:29:57,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-07 16:29:57,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378994265] [2020-12-07 16:29:57,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-07 16:29:57,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 16:29:57,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-07 16:29:57,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-07 16:29:57,666 INFO L87 Difference]: Start difference. First operand 45 states and 44 transitions. Second operand 9 states. [2020-12-07 16:30:02,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 16:30:02,385 INFO L93 Difference]: Finished difference Result 45 states and 44 transitions. [2020-12-07 16:30:02,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-07 16:30:02,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2020-12-07 16:30:02,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 16:30:02,388 INFO L225 Difference]: With dead ends: 45 [2020-12-07 16:30:02,388 INFO L226 Difference]: Without dead ends: 0 [2020-12-07 16:30:02,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-12-07 16:30:02,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-07 16:30:02,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-07 16:30:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-07 16:30:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-07 16:30:02,390 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2020-12-07 16:30:02,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 16:30:02,390 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-07 16:30:02,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-07 16:30:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-07 16:30:02,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-07 16:30:02,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-07 16:30:02,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-07 16:30:02,931 WARN L197 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 71 [2020-12-07 16:30:03,625 WARN L197 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2020-12-07 16:30:04,333 WARN L197 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2020-12-07 16:30:05,037 WARN L197 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-07 16:30:05,045 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-07 16:30:05,046 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-07 16:30:05,049 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-07 16:30:05,050 INFO L262 CegarLoopResult]: For program point L7386(lines 7386 7387) no Hoare annotation was computed. [2020-12-07 16:30:05,050 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-07 16:30:05,051 INFO L262 CegarLoopResult]: For program point L7386-4(lines 7386 7387) no Hoare annotation was computed. [2020-12-07 16:30:05,054 INFO L258 CegarLoopResult]: At program point L7386-3(lines 7384 7388) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse1 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse2 (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0)) (.cse3 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base| 0))) (.cse4 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base|) |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset|))) (.cse6 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse7 (not (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base 0))) (.cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (.cse9 (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2)) (.cse10 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse11 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 ULTIMATE.start_aws_byte_cursor_from_array_~len))) (or (let ((.cse5 (+ |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset| 8))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset| 0) .cse0 .cse1 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) .cse2 .cse3 .cse4 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base|) .cse5) ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base) .cse6 (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.offset 0) (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.offset 0) .cse7 .cse8 .cse9 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base) .cse10 .cse11 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base|) .cse5) 0))) (and .cse0 .cse1 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (+ ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 8)) 0)) .cse2 (not (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base 0)) .cse3 .cse4 .cse6 .cse7 .cse8 (<= ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 (* 18446744073709551616 (div ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 18446744073709551616))) .cse9 .cse10 .cse11))) [2020-12-07 16:30:05,054 INFO L262 CegarLoopResult]: For program point L7386-2(lines 7386 7387) no Hoare annotation was computed. [2020-12-07 16:30:05,055 INFO L258 CegarLoopResult]: At program point L7386-7(lines 7384 7388) the Hoare annotation is: (let ((.cse6 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset| 8))) (let ((.cse0 (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset|) ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2)) (.cse1 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse2 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.len| ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2)) (.cse4 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base| 0))) (.cse5 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse11 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|) .cse6)) (.cse7 (<= (div ULTIMATE.start___VERIFIER_assert_~cond 256) 0)) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse9 (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2)) (.cse10 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 ULTIMATE.start_aws_byte_cursor_from_array_~len)) (.cse12 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.base| 0)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset) (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0) .cse2 .cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.offset| 0) .cse4 .cse5 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|) .cse6) 0) (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.offset 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.offset 0) .cse7 .cse8 .cse9 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base) .cse10 (= .cse11 ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.base| ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base) .cse12) (and .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base 0)) .cse4 .cse5 (not (= .cse11 0)) (not (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base 0)) .cse7 (<= ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 (* 18446744073709551616 (div ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 18446744073709551616))) .cse8 .cse9 .cse10 .cse12)))) [2020-12-07 16:30:05,055 INFO L262 CegarLoopResult]: For program point L7386-6(lines 7386 7387) no Hoare annotation was computed. [2020-12-07 16:30:05,057 INFO L262 CegarLoopResult]: For program point L210(lines 210 212) no Hoare annotation was computed. [2020-12-07 16:30:05,057 INFO L262 CegarLoopResult]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2020-12-07 16:30:05,057 INFO L262 CegarLoopResult]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2020-12-07 16:30:05,058 INFO L262 CegarLoopResult]: For program point L7387(line 7387) no Hoare annotation was computed. [2020-12-07 16:30:05,058 INFO L262 CegarLoopResult]: For program point L7387-5(line 7387) no Hoare annotation was computed. [2020-12-07 16:30:05,058 INFO L262 CegarLoopResult]: For program point L7387-4(line 7387) no Hoare annotation was computed. [2020-12-07 16:30:05,058 INFO L262 CegarLoopResult]: For program point L7387-2(line 7387) no Hoare annotation was computed. [2020-12-07 16:30:05,058 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-07 16:30:05,058 INFO L262 CegarLoopResult]: For program point L7387-8(line 7387) no Hoare annotation was computed. [2020-12-07 16:30:05,059 INFO L262 CegarLoopResult]: For program point L211(line 211) no Hoare annotation was computed. [2020-12-07 16:30:05,059 INFO L262 CegarLoopResult]: For program point L7387-6(line 7387) no Hoare annotation was computed. [2020-12-07 16:30:05,059 INFO L262 CegarLoopResult]: For program point L211-2(line 211) no Hoare annotation was computed. [2020-12-07 16:30:05,059 INFO L262 CegarLoopResult]: For program point L7387-12(line 7387) no Hoare annotation was computed. [2020-12-07 16:30:05,059 INFO L262 CegarLoopResult]: For program point L7387-11(line 7387) no Hoare annotation was computed. [2020-12-07 16:30:05,059 INFO L262 CegarLoopResult]: For program point L211-4(line 211) no Hoare annotation was computed. [2020-12-07 16:30:05,060 INFO L262 CegarLoopResult]: For program point L7387-10(line 7387) no Hoare annotation was computed. [2020-12-07 16:30:05,060 INFO L262 CegarLoopResult]: For program point L7387-17(line 7387) no Hoare annotation was computed. [2020-12-07 16:30:05,060 INFO L262 CegarLoopResult]: For program point L7387-16(line 7387) no Hoare annotation was computed. [2020-12-07 16:30:05,060 INFO L262 CegarLoopResult]: For program point L7387-14(line 7387) no Hoare annotation was computed. [2020-12-07 16:30:05,060 INFO L262 CegarLoopResult]: For program point L7387-20(line 7387) no Hoare annotation was computed. [2020-12-07 16:30:05,060 INFO L262 CegarLoopResult]: For program point L7387-18(line 7387) no Hoare annotation was computed. [2020-12-07 16:30:05,060 INFO L262 CegarLoopResult]: For program point L7387-23(line 7387) no Hoare annotation was computed. [2020-12-07 16:30:05,060 INFO L262 CegarLoopResult]: For program point L7387-22(line 7387) no Hoare annotation was computed. [2020-12-07 16:30:05,060 INFO L262 CegarLoopResult]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2020-12-07 16:30:05,061 INFO L265 CegarLoopResult]: At program point L8974(line 8974) the Hoare annotation is: true [2020-12-07 16:30:05,061 INFO L258 CegarLoopResult]: At program point L6886(lines 6882 6887) the Hoare annotation is: (and (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) [2020-12-07 16:30:05,061 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-07 16:30:05,061 INFO L262 CegarLoopResult]: For program point L222(lines 222 224) no Hoare annotation was computed. [2020-12-07 16:30:05,061 INFO L258 CegarLoopResult]: At program point L8257(lines 8251 8258) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse1 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (+ ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 8)) 0))) (.cse2 (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0)) (.cse3 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.len| ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2)) (.cse5 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base| 0))) (.cse6 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse8 (<= (div ULTIMATE.start___VERIFIER_assert_~cond 256) 0)) (.cse10 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse9 (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2)) (.cse11 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 ULTIMATE.start_aws_byte_cursor_from_array_~len)) (.cse7 (select (select |#memory_int| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (.cse12 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.base| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base 0)) .cse5 .cse6 (<= .cse7 (* 18446744073709551616 (div .cse7 18446744073709551616))) (not (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base 0)) (<= ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 (* 18446744073709551616 (div ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 18446744073709551616))) .cse8 .cse9 .cse10 .cse11 .cse12) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset| 0) (<= ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 (+ (* 18446744073709551616 (div (+ ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 (- 1)) 18446744073709551616)) 18446744073709551615)) .cse0 .cse1 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) .cse2 .cse3 .cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.offset| 0) .cse5 .cse6 (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.offset 0) (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.offset 0) .cse8 .cse10 .cse9 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base) .cse11 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.base| ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base) (<= .cse7 (+ (* 18446744073709551616 (div (+ .cse7 (- 1)) 18446744073709551616)) 18446744073709551615)) .cse12))) [2020-12-07 16:30:05,061 INFO L262 CegarLoopResult]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2020-12-07 16:30:05,061 INFO L262 CegarLoopResult]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2020-12-07 16:30:05,062 INFO L262 CegarLoopResult]: For program point L222-3(lines 7101 7111) no Hoare annotation was computed. [2020-12-07 16:30:05,062 INFO L262 CegarLoopResult]: For program point L8959(lines 8959 8973) no Hoare annotation was computed. [2020-12-07 16:30:05,062 INFO L262 CegarLoopResult]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2020-12-07 16:30:05,062 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-07 16:30:05,062 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-07 16:30:05,062 INFO L262 CegarLoopResult]: For program point L223(line 223) no Hoare annotation was computed. [2020-12-07 16:30:05,062 INFO L262 CegarLoopResult]: For program point L223-1(line 223) no Hoare annotation was computed. [2020-12-07 16:30:05,062 INFO L262 CegarLoopResult]: For program point L223-3(line 223) no Hoare annotation was computed. [2020-12-07 16:30:05,062 INFO L262 CegarLoopResult]: For program point L223-4(line 223) no Hoare annotation was computed. [2020-12-07 16:30:05,062 INFO L262 CegarLoopResult]: For program point L223-6(line 223) no Hoare annotation was computed. [2020-12-07 16:30:05,062 INFO L262 CegarLoopResult]: For program point L223-7(line 223) no Hoare annotation was computed. [2020-12-07 16:30:05,062 INFO L262 CegarLoopResult]: For program point L223-9(line 223) no Hoare annotation was computed. [2020-12-07 16:30:05,063 INFO L262 CegarLoopResult]: For program point L223-10(line 223) no Hoare annotation was computed. [2020-12-07 16:30:05,063 INFO L262 CegarLoopResult]: For program point L223-12(line 223) no Hoare annotation was computed. [2020-12-07 16:30:05,063 INFO L262 CegarLoopResult]: For program point L223-13(line 223) no Hoare annotation was computed. [2020-12-07 16:30:05,063 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-07 16:30:05,063 INFO L262 CegarLoopResult]: For program point L8970(lines 8970 8972) no Hoare annotation was computed. [2020-12-07 16:30:05,063 INFO L258 CegarLoopResult]: At program point L266(line 266) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset| 8))) (and (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset|) ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2) (<= ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 (+ (* 18446744073709551616 (div (+ ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 (- 1)) 18446744073709551616)) 18446744073709551615)) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset) (= ULTIMATE.start_assert_bytes_match_~b.offset 0) (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.len| ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.offset| 0) (= ULTIMATE.start_assert_bytes_match_~a.offset 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|) .cse0) 0) (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.offset 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (= ULTIMATE.start_assert_bytes_match_~a.base ULTIMATE.start_assert_bytes_match_~b.base) (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.offset 0) (<= (div ULTIMATE.start___VERIFIER_assert_~cond 256) 0) (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2) (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 ULTIMATE.start_aws_byte_cursor_from_array_~len) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|) .cse0) ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.base| ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.base| 0)))) [2020-12-07 16:30:05,063 INFO L262 CegarLoopResult]: For program point L8970-2(lines 8970 8972) no Hoare annotation was computed. [2020-12-07 16:30:05,076 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,081 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:30:05,082 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:05,082 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,083 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,093 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,094 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:30:05,095 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:05,095 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,095 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,098 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:05,099 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,100 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:05,100 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,100 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,101 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,103 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:05,104 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,104 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:05,104 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,105 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,105 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,108 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,109 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:30:05,109 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:05,110 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,110 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,110 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:05,111 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,112 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,113 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:30:05,113 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:05,114 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,114 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,114 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:05,115 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:05,117 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:05,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:30:05,118 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:05,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:05,121 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:30:05,121 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:05,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:30:05 BoogieIcfgContainer [2020-12-07 16:30:05,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-07 16:30:05,127 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-07 16:30:05,127 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-07 16:30:05,128 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-07 16:30:05,130 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:28:33" (3/4) ... [2020-12-07 16:30:05,135 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-07 16:30:05,165 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2020-12-07 16:30:05,170 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2020-12-07 16:30:05,175 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2020-12-07 16:30:05,178 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2020-12-07 16:30:05,179 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2020-12-07 16:30:05,181 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-12-07 16:30:05,183 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-07 16:30:05,185 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-07 16:30:05,243 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == 0 && size == length) && !(\result == 0) [2020-12-07 16:30:05,244 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((cur == 0 && cur == cursor) && \result <= 1) && \result == 0) && cursor == 0) && !(cur == 0)) && length == unknown-#memory_int-unknown[cur][cur]) && #memory_$Pointer$[cur][cur + 8] == array) && 1 <= \result) && bytes == 0) && array == 0) && !(array == 0)) && cur == cursor) && size == length) && array == bytes) && !(\result == 0)) && length == len) && #memory_$Pointer$[cur][cur + 8] == 0) || (((((((((((((cur == cursor && \result <= 1) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && cursor == 0) && !(bytes == 0)) && !(cur == 0)) && length == unknown-#memory_int-unknown[cur][cur]) && 1 <= \result) && !(array == 0)) && cur == cursor) && length <= 18446744073709551616 * (length / 18446744073709551616)) && size == length) && !(\result == 0)) && length == len) [2020-12-07 16:30:05,244 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\result <= 1 && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && cursor == 0) && 1 <= cond) && unknown-#res!len-unknown == length) && !(bytes == 0)) && !(cur == 0)) && 1 <= \result) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && !(array == 0)) && length <= 18446744073709551616 * (length / 18446744073709551616)) && cond / 256 <= 0) && size == length) && !(\result == 0)) && length == len) && !(aws_byte_cursor_from_array_#res.ptr == 0)) || ((((((((((((((((((((cur == 0 && length <= 18446744073709551616 * ((length + -1) / 18446744073709551616) + 18446744073709551615) && \result <= 1) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && \result == 0) && cursor == 0) && 1 <= cond) && unknown-#res!len-unknown == length) && aws_byte_cursor_from_array_#res.ptr == 0) && !(cur == 0)) && 1 <= \result) && bytes == 0) && array == 0) && cond / 256 <= 0) && !(\result == 0)) && size == length) && array == bytes) && length == len) && aws_byte_cursor_from_array_#res.ptr == array) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * ((unknown-#memory_int-unknown[cursor][cursor] + -1) / 18446744073709551616) + 18446744073709551615) && !(aws_byte_cursor_from_array_#res.ptr == 0)) [2020-12-07 16:30:05,245 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((unknown-#memory_int-unknown[cur][cur] == length && \result <= 1) && \result == 0) && cur == cursor) && cursor == 0) && 1 <= cond) && unknown-#res!len-unknown == length) && aws_byte_cursor_from_array_#res.ptr == 0) && !(cur == 0)) && 1 <= \result) && #memory_$Pointer$[cur][cur + 8] == 0) && bytes == 0) && cur == cursor) && array == 0) && cond / 256 <= 0) && !(\result == 0)) && size == length) && array == bytes) && length == len) && #memory_$Pointer$[cur][cur + 8] == array) && aws_byte_cursor_from_array_#res.ptr == array) && !(aws_byte_cursor_from_array_#res.ptr == 0)) || ((((((((((((((unknown-#memory_int-unknown[cur][cur] == length && \result <= 1) && 1 <= cond) && unknown-#res!len-unknown == length) && !(bytes == 0)) && !(cur == 0)) && 1 <= \result) && !(#memory_$Pointer$[cur][cur + 8] == 0)) && !(array == 0)) && cond / 256 <= 0) && length <= 18446744073709551616 * (length / 18446744073709551616)) && !(\result == 0)) && size == length) && length == len) && !(aws_byte_cursor_from_array_#res.ptr == 0)) [2020-12-07 16:30:05,245 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((unknown-#memory_int-unknown[cur][cur] == length && length <= 18446744073709551616 * ((length + -1) / 18446744073709551616) + 18446744073709551615) && \result == 0) && cur == cursor) && b == 0) && cursor == 0) && 1 <= cond) && unknown-#res!len-unknown == length) && aws_byte_cursor_from_array_#res.ptr == 0) && a == 0) && !(cur == 0)) && #memory_$Pointer$[cur][cur + 8] == 0) && bytes == 0) && cur == cursor) && a == b) && array == 0) && cond / 256 <= 0) && size == length) && array == bytes) && !(\result == 0)) && length == len) && #memory_$Pointer$[cur][cur + 8] == array) && aws_byte_cursor_from_array_#res.ptr == array) && !(aws_byte_cursor_from_array_#res.ptr == 0) [2020-12-07 16:30:06,510 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-07 16:30:06,511 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-07 16:30:06,513 INFO L168 Benchmark]: Toolchain (without parser) took 107599.16 ms. Allocated memory was 48.2 MB in the beginning and 755.0 MB in the end (delta: 706.7 MB). Free memory was 27.5 MB in the beginning and 594.5 MB in the end (delta: -567.1 MB). Peak memory consumption was 507.1 MB. Max. memory is 16.1 GB. [2020-12-07 16:30:06,514 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 48.2 MB. Free memory was 31.4 MB in the beginning and 31.3 MB in the end (delta: 39.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-07 16:30:06,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 4392.34 ms. Allocated memory was 48.2 MB in the beginning and 165.7 MB in the end (delta: 117.4 MB). Free memory was 27.4 MB in the beginning and 113.0 MB in the end (delta: -85.7 MB). Peak memory consumption was 62.6 MB. Max. memory is 16.1 GB. [2020-12-07 16:30:06,515 INFO L168 Benchmark]: Boogie Procedure Inliner took 407.56 ms. Allocated memory is still 165.7 MB. Free memory was 113.0 MB in the beginning and 101.6 MB in the end (delta: 11.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-07 16:30:06,515 INFO L168 Benchmark]: Boogie Preprocessor took 127.01 ms. Allocated memory is still 165.7 MB. Free memory was 101.6 MB in the beginning and 94.3 MB in the end (delta: 7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-07 16:30:06,516 INFO L168 Benchmark]: RCFGBuilder took 9572.62 ms. Allocated memory was 165.7 MB in the beginning and 478.2 MB in the end (delta: 312.5 MB). Free memory was 94.3 MB in the beginning and 192.7 MB in the end (delta: -98.5 MB). Peak memory consumption was 267.6 MB. Max. memory is 16.1 GB. [2020-12-07 16:30:06,516 INFO L168 Benchmark]: TraceAbstraction took 91702.11 ms. Allocated memory was 478.2 MB in the beginning and 755.0 MB in the end (delta: 276.8 MB). Free memory was 191.7 MB in the beginning and 523.6 MB in the end (delta: -331.9 MB). Peak memory consumption was 220.7 MB. Max. memory is 16.1 GB. [2020-12-07 16:30:06,517 INFO L168 Benchmark]: Witness Printer took 1383.96 ms. Allocated memory is still 755.0 MB. Free memory was 523.6 MB in the beginning and 594.5 MB in the end (delta: -70.9 MB). Peak memory consumption was 295.2 MB. Max. memory is 16.1 GB. [2020-12-07 16:30:06,519 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.32 ms. Allocated memory is still 48.2 MB. Free memory was 31.4 MB in the beginning and 31.3 MB in the end (delta: 39.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 4392.34 ms. Allocated memory was 48.2 MB in the beginning and 165.7 MB in the end (delta: 117.4 MB). Free memory was 27.4 MB in the beginning and 113.0 MB in the end (delta: -85.7 MB). Peak memory consumption was 62.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 407.56 ms. Allocated memory is still 165.7 MB. Free memory was 113.0 MB in the beginning and 101.6 MB in the end (delta: 11.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 127.01 ms. Allocated memory is still 165.7 MB. Free memory was 101.6 MB in the beginning and 94.3 MB in the end (delta: 7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 9572.62 ms. Allocated memory was 165.7 MB in the beginning and 478.2 MB in the end (delta: 312.5 MB). Free memory was 94.3 MB in the beginning and 192.7 MB in the end (delta: -98.5 MB). Peak memory consumption was 267.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 91702.11 ms. Allocated memory was 478.2 MB in the beginning and 755.0 MB in the end (delta: 276.8 MB). Free memory was 191.7 MB in the beginning and 523.6 MB in the end (delta: -331.9 MB). Peak memory consumption was 220.7 MB. Max. memory is 16.1 GB. * Witness Printer took 1383.96 ms. Allocated memory is still 755.0 MB. Free memory was 523.6 MB in the beginning and 594.5 MB in the end (delta: -70.9 MB). Peak memory consumption was 295.2 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_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 266]: Loop Invariant [2020-12-07 16:30:06,533 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:06,534 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:30:06,534 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:06,534 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:06,535 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:06,536 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:06,536 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:30:06,537 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:06,537 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:06,537 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled Derived loop invariant: ((((((((((((((((((((((unknown-#memory_int-unknown[cur][cur] == length && length <= 18446744073709551616 * ((length + -1) / 18446744073709551616) + 18446744073709551615) && \result == 0) && cur == cursor) && b == 0) && cursor == 0) && 1 <= cond) && unknown-#res!len-unknown == length) && aws_byte_cursor_from_array_#res.ptr == 0) && a == 0) && !(cur == 0)) && #memory_$Pointer$[cur][cur + 8] == 0) && bytes == 0) && cur == cursor) && a == b) && array == 0) && cond / 256 <= 0) && size == length) && array == bytes) && !(\result == 0)) && length == len) && #memory_$Pointer$[cur][cur + 8] == array) && aws_byte_cursor_from_array_#res.ptr == array) && !(aws_byte_cursor_from_array_#res.ptr == 0) - InvariantResult [Line: 8251]: Loop Invariant [2020-12-07 16:30:06,539 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:06,539 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:06,540 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:06,540 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:06,540 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:06,541 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:06,542 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:06,543 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:06,543 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:06,543 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:06,544 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:06,544 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled Derived loop invariant: (((((((((((((((\result <= 1 && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && cursor == 0) && 1 <= cond) && unknown-#res!len-unknown == length) && !(bytes == 0)) && !(cur == 0)) && 1 <= \result) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && !(array == 0)) && length <= 18446744073709551616 * (length / 18446744073709551616)) && cond / 256 <= 0) && size == length) && !(\result == 0)) && length == len) && !(aws_byte_cursor_from_array_#res.ptr == 0)) || ((((((((((((((((((((cur == 0 && length <= 18446744073709551616 * ((length + -1) / 18446744073709551616) + 18446744073709551615) && \result <= 1) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && \result == 0) && cursor == 0) && 1 <= cond) && unknown-#res!len-unknown == length) && aws_byte_cursor_from_array_#res.ptr == 0) && !(cur == 0)) && 1 <= \result) && bytes == 0) && array == 0) && cond / 256 <= 0) && !(\result == 0)) && size == length) && array == bytes) && length == len) && aws_byte_cursor_from_array_#res.ptr == array) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * ((unknown-#memory_int-unknown[cursor][cursor] + -1) / 18446744073709551616) + 18446744073709551615) && !(aws_byte_cursor_from_array_#res.ptr == 0)) - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: (\result == 0 && size == length) && !(\result == 0) - InvariantResult [Line: 7384]: Loop Invariant [2020-12-07 16:30:06,546 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:06,547 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:30:06,547 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:06,547 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:06,548 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:06,548 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:06,548 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:06,549 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:06,550 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:30:06,550 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:06,550 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:06,551 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled [2020-12-07 16:30:06,551 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:06,551 WARN L417 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res : { len : int, ptr : $Pointer$ } not handled Derived loop invariant: (((((((((((((((((((((unknown-#memory_int-unknown[cur][cur] == length && \result <= 1) && \result == 0) && cur == cursor) && cursor == 0) && 1 <= cond) && unknown-#res!len-unknown == length) && aws_byte_cursor_from_array_#res.ptr == 0) && !(cur == 0)) && 1 <= \result) && #memory_$Pointer$[cur][cur + 8] == 0) && bytes == 0) && cur == cursor) && array == 0) && cond / 256 <= 0) && !(\result == 0)) && size == length) && array == bytes) && length == len) && #memory_$Pointer$[cur][cur + 8] == array) && aws_byte_cursor_from_array_#res.ptr == array) && !(aws_byte_cursor_from_array_#res.ptr == 0)) || ((((((((((((((unknown-#memory_int-unknown[cur][cur] == length && \result <= 1) && 1 <= cond) && unknown-#res!len-unknown == length) && !(bytes == 0)) && !(cur == 0)) && 1 <= \result) && !(#memory_$Pointer$[cur][cur + 8] == 0)) && !(array == 0)) && cond / 256 <= 0) && length <= 18446744073709551616 * (length / 18446744073709551616)) && !(\result == 0)) && size == length) && length == len) && !(aws_byte_cursor_from_array_#res.ptr == 0)) - InvariantResult [Line: 7384]: Loop Invariant [2020-12-07 16:30:06,553 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:06,553 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:30:06,554 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:06,555 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 16:30:06,555 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 16:30:06,555 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((cur == 0 && cur == cursor) && \result <= 1) && \result == 0) && cursor == 0) && !(cur == 0)) && length == unknown-#memory_int-unknown[cur][cur]) && #memory_$Pointer$[cur][cur + 8] == array) && 1 <= \result) && bytes == 0) && array == 0) && !(array == 0)) && cur == cursor) && size == length) && array == bytes) && !(\result == 0)) && length == len) && #memory_$Pointer$[cur][cur + 8] == 0) || (((((((((((((cur == cursor && \result <= 1) && !(#memory_$Pointer$[cursor][cursor + 8] == 0)) && cursor == 0) && !(bytes == 0)) && !(cur == 0)) && length == unknown-#memory_int-unknown[cur][cur]) && 1 <= \result) && !(array == 0)) && cur == cursor) && length <= 18446744073709551616 * (length / 18446744073709551616)) && size == length) && !(\result == 0)) && length == len) - InvariantResult [Line: 8974]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 88.8s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 59.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 769 SDtfs, 1911 SDslu, 1936 SDs, 0 SdLazy, 1334 SolverSat, 180 SolverUnsat, 24 SolverUnknown, 0 SolverNotchecked, 52.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 36 SyntacticMatches, 7 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=9, 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, 17 MinimizatonAttempts, 190 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 588 HoareAnnotationTreeSize, 6 FomulaSimplifications, 4311 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 378 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 21.4s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 417 NumberOfCodeBlocks, 417 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 93355 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...