./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 87fd6ee1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_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-87fd6ee [2020-12-04 18:36:18,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-04 18:36:18,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-04 18:36:18,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-04 18:36:18,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-04 18:36:18,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-04 18:36:18,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-04 18:36:18,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-04 18:36:18,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-04 18:36:18,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-04 18:36:18,960 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-04 18:36:18,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-04 18:36:18,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-04 18:36:18,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-04 18:36:18,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-04 18:36:18,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-04 18:36:18,974 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-04 18:36:18,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-04 18:36:18,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-04 18:36:18,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-04 18:36:18,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-04 18:36:18,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-04 18:36:18,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-04 18:36:18,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-04 18:36:19,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-04 18:36:19,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-04 18:36:19,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-04 18:36:19,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-04 18:36:19,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-04 18:36:19,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-04 18:36:19,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-04 18:36:19,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-04 18:36:19,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-04 18:36:19,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-04 18:36:19,019 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-04 18:36:19,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-04 18:36:19,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-04 18:36:19,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-04 18:36:19,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-04 18:36:19,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-04 18:36:19,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-04 18:36:19,029 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-04 18:36:19,103 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-04 18:36:19,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-04 18:36:19,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-04 18:36:19,107 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-04 18:36:19,108 INFO L138 SettingsManager]: * Use SBE=true [2020-12-04 18:36:19,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-04 18:36:19,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-04 18:36:19,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-04 18:36:19,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-04 18:36:19,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-04 18:36:19,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-04 18:36:19,110 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-04 18:36:19,111 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-04 18:36:19,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-04 18:36:19,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-04 18:36:19,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-04 18:36:19,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-04 18:36:19,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-04 18:36:19,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-04 18:36:19,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-04 18:36:19,114 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-04 18:36:19,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-04 18:36:19,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-04 18:36:19,115 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-04 18:36:19,115 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-04 18:36:19,115 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-04 18:36:19,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-04 18:36:19,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-04 18:36:19,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-04 18:36:19,593 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-04 18:36:19,594 INFO L275 PluginConnector]: CDTParser initialized [2020-12-04 18:36:19,598 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-04 18:36:19,690 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faa4d1705/9f9da29f579a43e28e2cdb68a7a0804d/FLAG0506d4213 [2020-12-04 18:36:20,912 INFO L306 CDTParser]: Found 1 translation units. [2020-12-04 18:36:20,916 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_cursor_from_array_harness.i [2020-12-04 18:36:20,965 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faa4d1705/9f9da29f579a43e28e2cdb68a7a0804d/FLAG0506d4213 [2020-12-04 18:36:21,288 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faa4d1705/9f9da29f579a43e28e2cdb68a7a0804d [2020-12-04 18:36:21,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-04 18:36:21,293 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-04 18:36:21,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-04 18:36:21,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-04 18:36:21,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-04 18:36:21,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.12 06:36:21" (1/1) ... [2020-12-04 18:36:21,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15864cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:36:21, skipping insertion in model container [2020-12-04 18:36:21,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.12 06:36:21" (1/1) ... [2020-12-04 18:36:21,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-04 18:36:21,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-04 18:36:21,726 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-04 18:36:21,735 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-04 18:36:21,760 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-04 18:36:21,767 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2020-12-04 18:36:22,564 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:22,565 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:22,566 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:22,567 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:22,568 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:22,583 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:22,584 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:22,586 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:22,587 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:22,998 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-04 18:36:23,002 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-04 18:36:23,006 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-04 18:36:23,007 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-04 18:36:23,012 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-04 18:36:23,015 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-04 18:36:23,015 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-04 18:36:23,016 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-04 18:36:23,018 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-04 18:36:23,018 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2020-12-04 18:36:23,149 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2020-12-04 18:36:23,327 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:23,328 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:23,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-04 18:36:23,475 INFO L203 MainTranslator]: Completed pre-run [2020-12-04 18:36:23,492 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-04 18:36:23,494 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-04 18:36:23,496 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-04 18:36:23,497 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2020-12-04 18:36:23,548 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:23,549 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:23,549 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:23,550 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:23,551 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:23,557 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:23,558 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:23,559 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:23,560 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:23,595 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-04 18:36:23,596 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-04 18:36:23,597 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-04 18:36:23,598 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-04 18:36:23,599 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-04 18:36:23,600 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-04 18:36:23,601 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-04 18:36:23,601 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-04 18:36:23,602 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-04 18:36:23,602 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2020-12-04 18:36:23,646 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2020-12-04 18:36:23,778 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:23,779 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:36:23,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-04 18:36:24,941 INFO L208 MainTranslator]: Completed translation [2020-12-04 18:36:24,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:36:24 WrapperNode [2020-12-04 18:36:24,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-04 18:36:24,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-04 18:36:24,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-04 18:36:24,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-04 18:36:24,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:36:24" (1/1) ... [2020-12-04 18:36:25,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:36:24" (1/1) ... [2020-12-04 18:36:25,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-04 18:36:25,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-04 18:36:25,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-04 18:36:25,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-04 18:36:25,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:36:24" (1/1) ... [2020-12-04 18:36:25,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:36:24" (1/1) ... [2020-12-04 18:36:25,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:36:24" (1/1) ... [2020-12-04 18:36:25,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:36:24" (1/1) ... [2020-12-04 18:36:25,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:36:24" (1/1) ... [2020-12-04 18:36:25,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:36:24" (1/1) ... [2020-12-04 18:36:25,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:36:24" (1/1) ... [2020-12-04 18:36:25,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-04 18:36:25,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-04 18:36:25,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-04 18:36:25,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-04 18:36:25,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:36:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-04 18:36:25,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-04 18:36:25,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-04 18:36:25,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-04 18:36:25,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-04 18:36:25,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-04 18:36:25,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-04 18:36:25,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-04 18:36:25,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-04 18:36:25,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-04 18:36:25,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-04 18:36:25,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-04 18:36:35,778 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-04 18:36:35,778 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2020-12-04 18:36:35,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 06:36:35 BoogieIcfgContainer [2020-12-04 18:36:35,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-04 18:36:35,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-04 18:36:35,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-04 18:36:35,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-04 18:36:35,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.12 06:36:21" (1/3) ... [2020-12-04 18:36:35,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73bbc096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 06:36:35, skipping insertion in model container [2020-12-04 18:36:35,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:36:24" (2/3) ... [2020-12-04 18:36:35,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73bbc096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 06:36:35, skipping insertion in model container [2020-12-04 18:36:35,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 06:36:35" (3/3) ... [2020-12-04 18:36:35,792 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_array_harness.i [2020-12-04 18:36:35,809 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-04 18:36:35,814 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-12-04 18:36:35,830 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-04 18:36:35,860 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-04 18:36:35,861 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-04 18:36:35,861 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-04 18:36:35,862 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-04 18:36:35,862 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-04 18:36:35,862 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-04 18:36:35,862 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-04 18:36:35,863 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-04 18:36:35,881 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2020-12-04 18:36:35,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-04 18:36:35,889 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:36:35,890 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:36:35,891 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-04 18:36:35,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:36:35,898 INFO L82 PathProgramCache]: Analyzing trace with hash -86834800, now seen corresponding path program 1 times [2020-12-04 18:36:35,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:36:35,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448359744] [2020-12-04 18:36:35,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:36:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:36:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:36:36,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448359744] [2020-12-04 18:36:36,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:36:36,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-04 18:36:36,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250111060] [2020-12-04 18:36:36,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-04 18:36:36,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:36:36,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-04 18:36:36,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-04 18:36:36,913 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2020-12-04 18:36:36,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:36:36,954 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2020-12-04 18:36:36,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-04 18:36:36,956 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-12-04 18:36:36,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:36:36,965 INFO L225 Difference]: With dead ends: 117 [2020-12-04 18:36:36,966 INFO L226 Difference]: Without dead ends: 53 [2020-12-04 18:36:36,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-04 18:36:36,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-12-04 18:36:37,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-12-04 18:36:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-04 18:36:37,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2020-12-04 18:36:37,029 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 12 [2020-12-04 18:36:37,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:36:37,031 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2020-12-04 18:36:37,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-04 18:36:37,031 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2020-12-04 18:36:37,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-04 18:36:37,032 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:36:37,033 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:36:37,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-04 18:36:37,038 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-04 18:36:37,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:36:37,040 INFO L82 PathProgramCache]: Analyzing trace with hash -479861810, now seen corresponding path program 1 times [2020-12-04 18:36:37,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:36:37,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673229458] [2020-12-04 18:36:37,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:36:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:36:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:36:37,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673229458] [2020-12-04 18:36:37,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:36:37,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-04 18:36:37,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841747061] [2020-12-04 18:36:37,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-04 18:36:37,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:36:37,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-04 18:36:37,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-04 18:36:37,513 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 3 states. [2020-12-04 18:36:37,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:36:37,580 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2020-12-04 18:36:37,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-04 18:36:37,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-12-04 18:36:37,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:36:37,585 INFO L225 Difference]: With dead ends: 90 [2020-12-04 18:36:37,585 INFO L226 Difference]: Without dead ends: 53 [2020-12-04 18:36:37,588 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-04 18:36:37,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-12-04 18:36:37,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-12-04 18:36:37,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-04 18:36:37,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2020-12-04 18:36:37,607 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 12 [2020-12-04 18:36:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:36:37,607 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2020-12-04 18:36:37,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-04 18:36:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2020-12-04 18:36:37,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-04 18:36:37,609 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:36:37,610 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:36:37,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-04 18:36:37,611 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-04 18:36:37,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:36:37,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1018024457, now seen corresponding path program 1 times [2020-12-04 18:36:37,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:36:37,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749565350] [2020-12-04 18:36:37,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:36:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:36:38,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:36:38,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749565350] [2020-12-04 18:36:38,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:36:38,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-04 18:36:38,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704260253] [2020-12-04 18:36:38,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-04 18:36:38,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:36:38,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-04 18:36:38,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-04 18:36:38,467 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 6 states. [2020-12-04 18:36:38,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:36:38,804 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2020-12-04 18:36:38,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-04 18:36:38,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-04 18:36:38,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:36:38,807 INFO L225 Difference]: With dead ends: 97 [2020-12-04 18:36:38,807 INFO L226 Difference]: Without dead ends: 93 [2020-12-04 18:36:38,808 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-04 18:36:38,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-12-04 18:36:38,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 61. [2020-12-04 18:36:38,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-04 18:36:38,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2020-12-04 18:36:38,817 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 14 [2020-12-04 18:36:38,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:36:38,817 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2020-12-04 18:36:38,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-04 18:36:38,818 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2020-12-04 18:36:38,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-04 18:36:38,819 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:36:38,819 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-04 18:36:38,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-04 18:36:38,820 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-04 18:36:38,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:36:38,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1084310207, now seen corresponding path program 1 times [2020-12-04 18:36:38,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:36:38,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575147842] [2020-12-04 18:36:38,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:36:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:36:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:36:42,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575147842] [2020-12-04 18:36:42,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:36:42,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-04 18:36:42,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636291533] [2020-12-04 18:36:42,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-04 18:36:42,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:36:42,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-04 18:36:42,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-04 18:36:42,772 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 7 states. [2020-12-04 18:36:45,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:36:45,436 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2020-12-04 18:36:45,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-04 18:36:45,437 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-12-04 18:36:45,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:36:45,438 INFO L225 Difference]: With dead ends: 111 [2020-12-04 18:36:45,438 INFO L226 Difference]: Without dead ends: 68 [2020-12-04 18:36:45,440 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-04 18:36:45,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-12-04 18:36:45,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2020-12-04 18:36:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-12-04 18:36:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2020-12-04 18:36:45,448 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 18 [2020-12-04 18:36:45,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:36:45,448 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2020-12-04 18:36:45,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-04 18:36:45,449 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2020-12-04 18:36:45,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-04 18:36:45,450 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:36:45,450 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-04 18:36:45,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-04 18:36:45,451 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-04 18:36:45,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:36:45,452 INFO L82 PathProgramCache]: Analyzing trace with hash -404251837, now seen corresponding path program 1 times [2020-12-04 18:36:45,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:36:45,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595340459] [2020-12-04 18:36:45,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:36:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:36:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:36:46,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595340459] [2020-12-04 18:36:46,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:36:46,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-04 18:36:46,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853631772] [2020-12-04 18:36:46,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-04 18:36:46,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:36:46,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-04 18:36:46,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-04 18:36:46,270 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 4 states. [2020-12-04 18:36:48,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:36:48,793 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2020-12-04 18:36:48,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-04 18:36:48,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-12-04 18:36:48,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:36:48,796 INFO L225 Difference]: With dead ends: 108 [2020-12-04 18:36:48,796 INFO L226 Difference]: Without dead ends: 61 [2020-12-04 18:36:48,797 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-04 18:36:48,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-12-04 18:36:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-12-04 18:36:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-04 18:36:48,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2020-12-04 18:36:48,806 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 18 [2020-12-04 18:36:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:36:48,807 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2020-12-04 18:36:48,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-04 18:36:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2020-12-04 18:36:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-04 18:36:48,808 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:36:48,809 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-04 18:36:48,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-04 18:36:48,809 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-04 18:36:48,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:36:48,811 INFO L82 PathProgramCache]: Analyzing trace with hash 501656654, now seen corresponding path program 1 times [2020-12-04 18:36:48,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:36:48,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554644450] [2020-12-04 18:36:48,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:36:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:36:49,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:36:49,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554644450] [2020-12-04 18:36:49,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:36:49,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-04 18:36:49,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738687522] [2020-12-04 18:36:49,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-04 18:36:49,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:36:49,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-04 18:36:49,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-04 18:36:49,247 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 4 states. [2020-12-04 18:36:49,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:36:49,356 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2020-12-04 18:36:49,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-04 18:36:49,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-12-04 18:36:49,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:36:49,360 INFO L225 Difference]: With dead ends: 82 [2020-12-04 18:36:49,360 INFO L226 Difference]: Without dead ends: 61 [2020-12-04 18:36:49,362 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-04 18:36:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-12-04 18:36:49,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-12-04 18:36:49,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-04 18:36:49,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2020-12-04 18:36:49,369 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 20 [2020-12-04 18:36:49,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:36:49,370 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2020-12-04 18:36:49,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-04 18:36:49,370 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2020-12-04 18:36:49,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-04 18:36:49,372 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:36:49,372 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-04 18:36:49,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-04 18:36:49,373 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-04 18:36:49,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:36:49,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1522937572, now seen corresponding path program 1 times [2020-12-04 18:36:49,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:36:49,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072789315] [2020-12-04 18:36:49,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:36:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:36:50,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:36:50,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072789315] [2020-12-04 18:36:50,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:36:50,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-04 18:36:50,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81826226] [2020-12-04 18:36:50,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-04 18:36:50,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:36:50,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-04 18:36:50,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-04 18:36:50,244 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 8 states. [2020-12-04 18:36:51,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:36:51,474 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2020-12-04 18:36:51,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-04 18:36:51,476 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-12-04 18:36:51,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:36:51,479 INFO L225 Difference]: With dead ends: 114 [2020-12-04 18:36:51,479 INFO L226 Difference]: Without dead ends: 110 [2020-12-04 18:36:51,481 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2020-12-04 18:36:51,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-12-04 18:36:51,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 65. [2020-12-04 18:36:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-12-04 18:36:51,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2020-12-04 18:36:51,507 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 20 [2020-12-04 18:36:51,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:36:51,507 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2020-12-04 18:36:51,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-04 18:36:51,508 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-12-04 18:36:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-04 18:36:51,511 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:36:51,511 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-04 18:36:51,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-04 18:36:51,512 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-04 18:36:51,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:36:51,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1962683098, now seen corresponding path program 1 times [2020-12-04 18:36:51,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:36:51,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24436932] [2020-12-04 18:36:51,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:36:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:36:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:36:52,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24436932] [2020-12-04 18:36:52,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:36:52,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-04 18:36:52,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347770396] [2020-12-04 18:36:52,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-04 18:36:52,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:36:52,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-04 18:36:52,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-12-04 18:36:52,508 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 11 states. [2020-12-04 18:36:58,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:36:58,939 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2020-12-04 18:36:58,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-04 18:36:58,942 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-12-04 18:36:58,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:36:58,944 INFO L225 Difference]: With dead ends: 114 [2020-12-04 18:36:58,944 INFO L226 Difference]: Without dead ends: 110 [2020-12-04 18:36:58,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=179, Invalid=577, Unknown=0, NotChecked=0, Total=756 [2020-12-04 18:36:58,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-12-04 18:36:58,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 56. [2020-12-04 18:36:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-04 18:36:58,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2020-12-04 18:36:58,964 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 20 [2020-12-04 18:36:58,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:36:58,965 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2020-12-04 18:36:58,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-04 18:36:58,965 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2020-12-04 18:36:58,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-04 18:36:58,967 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:36:58,968 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-04 18:36:58,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-04 18:36:58,968 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-04 18:36:58,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:36:58,969 INFO L82 PathProgramCache]: Analyzing trace with hash -863865621, now seen corresponding path program 1 times [2020-12-04 18:36:58,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:36:58,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656555089] [2020-12-04 18:36:58,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:37:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:37:03,798 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2020-12-04 18:37:04,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:37:04,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656555089] [2020-12-04 18:37:04,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:37:04,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:37:04,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402146312] [2020-12-04 18:37:04,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:37:04,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:37:04,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:37:04,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:37:04,172 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2020-12-04 18:37:11,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:37:11,188 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2020-12-04 18:37:11,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-04 18:37:11,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-12-04 18:37:11,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:37:11,192 INFO L225 Difference]: With dead ends: 97 [2020-12-04 18:37:11,192 INFO L226 Difference]: Without dead ends: 95 [2020-12-04 18:37:11,196 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2020-12-04 18:37:11,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-12-04 18:37:11,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 81. [2020-12-04 18:37:11,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-12-04 18:37:11,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2020-12-04 18:37:11,213 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 24 [2020-12-04 18:37:11,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:37:11,215 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2020-12-04 18:37:11,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:37:11,215 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-12-04 18:37:11,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-04 18:37:11,217 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:37:11,220 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-04 18:37:11,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-04 18:37:11,221 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-04 18:37:11,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:37:11,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1075136575, now seen corresponding path program 1 times [2020-12-04 18:37:11,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:37:11,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436669968] [2020-12-04 18:37:11,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:37:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:37:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:37:12,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436669968] [2020-12-04 18:37:12,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:37:12,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-04 18:37:12,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781963950] [2020-12-04 18:37:12,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-04 18:37:12,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:37:12,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-04 18:37:12,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-04 18:37:12,199 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 8 states. [2020-12-04 18:37:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:37:18,962 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2020-12-04 18:37:18,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-04 18:37:18,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-12-04 18:37:18,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:37:18,964 INFO L225 Difference]: With dead ends: 115 [2020-12-04 18:37:18,964 INFO L226 Difference]: Without dead ends: 84 [2020-12-04 18:37:18,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-12-04 18:37:18,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-12-04 18:37:18,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 70. [2020-12-04 18:37:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-12-04 18:37:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2020-12-04 18:37:18,973 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 26 [2020-12-04 18:37:18,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:37:18,973 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2020-12-04 18:37:18,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-04 18:37:18,973 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2020-12-04 18:37:18,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-04 18:37:18,974 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:37:18,975 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-04 18:37:18,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-04 18:37:18,975 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-04 18:37:18,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:37:18,976 INFO L82 PathProgramCache]: Analyzing trace with hash 27288689, now seen corresponding path program 1 times [2020-12-04 18:37:18,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:37:18,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046754216] [2020-12-04 18:37:18,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:37:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:37:19,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:37:19,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046754216] [2020-12-04 18:37:19,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:37:19,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-04 18:37:19,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064847541] [2020-12-04 18:37:19,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-04 18:37:19,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:37:19,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-04 18:37:19,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-04 18:37:19,606 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 8 states. [2020-12-04 18:37:24,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:37:24,432 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2020-12-04 18:37:24,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-04 18:37:24,435 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-12-04 18:37:24,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:37:24,436 INFO L225 Difference]: With dead ends: 70 [2020-12-04 18:37:24,436 INFO L226 Difference]: Without dead ends: 68 [2020-12-04 18:37:24,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-12-04 18:37:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-12-04 18:37:24,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-12-04 18:37:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-04 18:37:24,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2020-12-04 18:37:24,446 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 27 [2020-12-04 18:37:24,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:37:24,447 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2020-12-04 18:37:24,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-04 18:37:24,447 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-12-04 18:37:24,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-04 18:37:24,449 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:37:24,449 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-04 18:37:24,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-04 18:37:24,450 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-04 18:37:24,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:37:24,451 INFO L82 PathProgramCache]: Analyzing trace with hash 508885054, now seen corresponding path program 1 times [2020-12-04 18:37:24,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:37:24,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498408009] [2020-12-04 18:37:24,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:37:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:37:25,422 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2020-12-04 18:37:25,788 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 21 [2020-12-04 18:37:25,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:37:25,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498408009] [2020-12-04 18:37:25,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:37:25,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:37:25,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697804699] [2020-12-04 18:37:25,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:37:25,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:37:25,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:37:25,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:37:25,866 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 9 states. [2020-12-04 18:37:32,599 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2020-12-04 18:37:33,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:37:33,396 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2020-12-04 18:37:33,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-04 18:37:33,398 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-12-04 18:37:33,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:37:33,399 INFO L225 Difference]: With dead ends: 96 [2020-12-04 18:37:33,400 INFO L226 Difference]: Without dead ends: 78 [2020-12-04 18:37:33,400 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2020-12-04 18:37:33,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-12-04 18:37:33,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2020-12-04 18:37:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-04 18:37:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2020-12-04 18:37:33,407 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 30 [2020-12-04 18:37:33,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:37:33,408 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2020-12-04 18:37:33,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:37:33,408 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2020-12-04 18:37:33,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-04 18:37:33,419 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:37:33,419 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-04 18:37:33,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-04 18:37:33,420 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-04 18:37:33,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:37:33,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1328145208, now seen corresponding path program 1 times [2020-12-04 18:37:33,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:37:33,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542465443] [2020-12-04 18:37:33,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:37:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:37:34,213 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2020-12-04 18:37:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:37:34,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542465443] [2020-12-04 18:37:34,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:37:34,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-04 18:37:34,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685157513] [2020-12-04 18:37:34,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-04 18:37:34,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:37:34,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-04 18:37:34,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-12-04 18:37:34,629 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 10 states. [2020-12-04 18:37:42,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:37:42,077 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2020-12-04 18:37:42,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-04 18:37:42,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2020-12-04 18:37:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:37:42,085 INFO L225 Difference]: With dead ends: 78 [2020-12-04 18:37:42,085 INFO L226 Difference]: Without dead ends: 54 [2020-12-04 18:37:42,086 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2020-12-04 18:37:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-12-04 18:37:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-12-04 18:37:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-12-04 18:37:42,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2020-12-04 18:37:42,094 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 32 [2020-12-04 18:37:42,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:37:42,095 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2020-12-04 18:37:42,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-04 18:37:42,095 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2020-12-04 18:37:42,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-04 18:37:42,097 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:37:42,097 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-04 18:37:42,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-04 18:37:42,097 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-04 18:37:42,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:37:42,098 INFO L82 PathProgramCache]: Analyzing trace with hash -416697772, now seen corresponding path program 1 times [2020-12-04 18:37:42,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:37:42,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118785921] [2020-12-04 18:37:42,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:37:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:37:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:37:42,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118785921] [2020-12-04 18:37:42,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:37:42,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-04 18:37:42,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407628654] [2020-12-04 18:37:42,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-04 18:37:42,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:37:42,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-04 18:37:42,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-04 18:37:42,783 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 5 states. [2020-12-04 18:37:45,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:37:45,291 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2020-12-04 18:37:45,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-04 18:37:45,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2020-12-04 18:37:45,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:37:45,295 INFO L225 Difference]: With dead ends: 95 [2020-12-04 18:37:45,296 INFO L226 Difference]: Without dead ends: 54 [2020-12-04 18:37:45,298 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-04 18:37:45,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-12-04 18:37:45,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-12-04 18:37:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-12-04 18:37:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2020-12-04 18:37:45,306 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 32 [2020-12-04 18:37:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:37:45,307 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2020-12-04 18:37:45,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-04 18:37:45,307 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2020-12-04 18:37:45,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-04 18:37:45,308 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:37:45,309 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-04 18:37:45,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-04 18:37:45,310 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-04 18:37:45,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:37:45,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1234346222, now seen corresponding path program 1 times [2020-12-04 18:37:45,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:37:45,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185719367] [2020-12-04 18:37:45,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:37:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:37:48,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:37:48,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185719367] [2020-12-04 18:37:48,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:37:48,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:37:48,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932881453] [2020-12-04 18:37:48,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:37:48,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:37:48,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:37:48,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:37:48,164 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 9 states. [2020-12-04 18:37:53,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:37:53,228 INFO L93 Difference]: Finished difference Result 68 states and 67 transitions. [2020-12-04 18:37:53,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-04 18:37:53,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2020-12-04 18:37:53,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:37:53,233 INFO L225 Difference]: With dead ends: 68 [2020-12-04 18:37:53,234 INFO L226 Difference]: Without dead ends: 47 [2020-12-04 18:37:53,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2020-12-04 18:37:53,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-12-04 18:37:53,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-12-04 18:37:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-12-04 18:37:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 46 transitions. [2020-12-04 18:37:53,245 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 46 transitions. Word has length 32 [2020-12-04 18:37:53,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:37:53,246 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 46 transitions. [2020-12-04 18:37:53,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:37:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 46 transitions. [2020-12-04 18:37:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-04 18:37:53,249 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:37:53,249 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] [2020-12-04 18:37:53,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-04 18:37:53,250 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-04 18:37:53,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:37:53,252 INFO L82 PathProgramCache]: Analyzing trace with hash -821254579, now seen corresponding path program 1 times [2020-12-04 18:37:53,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:37:53,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976056002] [2020-12-04 18:37:53,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:37:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:37:57,516 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2020-12-04 18:37:57,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:37:57,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976056002] [2020-12-04 18:37:57,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:37:57,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-04 18:37:57,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587322217] [2020-12-04 18:37:57,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-04 18:37:57,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:37:57,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-04 18:37:57,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-04 18:37:57,534 INFO L87 Difference]: Start difference. First operand 47 states and 46 transitions. Second operand 7 states. [2020-12-04 18:38:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:38:02,413 INFO L93 Difference]: Finished difference Result 47 states and 46 transitions. [2020-12-04 18:38:02,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-04 18:38:02,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-12-04 18:38:02,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:38:02,417 INFO L225 Difference]: With dead ends: 47 [2020-12-04 18:38:02,417 INFO L226 Difference]: Without dead ends: 45 [2020-12-04 18:38:02,418 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-04 18:38:02,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-12-04 18:38:02,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-12-04 18:38:02,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-12-04 18:38:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 44 transitions. [2020-12-04 18:38:02,424 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 44 transitions. Word has length 36 [2020-12-04 18:38:02,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:38:02,425 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 44 transitions. [2020-12-04 18:38:02,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-04 18:38:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 44 transitions. [2020-12-04 18:38:02,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-04 18:38:02,425 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:38:02,425 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-04 18:38:02,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-04 18:38:02,426 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-04 18:38:02,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:38:02,427 INFO L82 PathProgramCache]: Analyzing trace with hash 52794010, now seen corresponding path program 1 times [2020-12-04 18:38:02,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:38:02,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129239129] [2020-12-04 18:38:02,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:38:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:38:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:38:10,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129239129] [2020-12-04 18:38:10,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:38:10,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:38:10,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254048763] [2020-12-04 18:38:10,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:38:10,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:38:10,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:38:10,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:38:10,758 INFO L87 Difference]: Start difference. First operand 45 states and 44 transitions. Second operand 9 states. [2020-12-04 18:38:15,721 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-12-04 18:38:15,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:38:15,762 INFO L93 Difference]: Finished difference Result 45 states and 44 transitions. [2020-12-04 18:38:15,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-04 18:38:15,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2020-12-04 18:38:15,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:38:15,765 INFO L225 Difference]: With dead ends: 45 [2020-12-04 18:38:15,765 INFO L226 Difference]: Without dead ends: 0 [2020-12-04 18:38:15,768 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-12-04 18:38:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-04 18:38:15,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-04 18:38:15,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-04 18:38:15,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-04 18:38:15,769 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2020-12-04 18:38:15,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:38:15,769 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-04 18:38:15,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:38:15,770 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-04 18:38:15,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-04 18:38:15,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-04 18:38:15,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-04 18:38:16,528 WARN L197 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 75 [2020-12-04 18:38:17,806 WARN L197 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2020-12-04 18:38:19,144 WARN L197 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2020-12-04 18:38:20,179 WARN L197 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2020-12-04 18:38:20,197 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 18:38:20,198 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 18:38:20,198 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-04 18:38:20,199 INFO L262 CegarLoopResult]: For program point L7386(lines 7386 7387) no Hoare annotation was computed. [2020-12-04 18:38:20,199 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-04 18:38:20,199 INFO L262 CegarLoopResult]: For program point L7386-4(lines 7386 7387) no Hoare annotation was computed. [2020-12-04 18:38:20,201 INFO L258 CegarLoopResult]: At program point L7386-3(lines 7384 7388) the Hoare annotation is: (let ((.cse10 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base|) |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset|))) (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 .cse10)) (.cse5 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse6 (not (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base 0))) (.cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset)) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse9 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 ULTIMATE.start_aws_byte_cursor_from_array_~len))) (or (and .cse0 .cse1 .cse2 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (+ ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 4)) 0)) (not (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse10 (* 4294967296 (div .cse10 4294967296)))) (let ((.cse11 (+ |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.offset| 4))) (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|) .cse11) ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base) .cse5 (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.offset 0) (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.offset 0) .cse6 .cse7 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base) .cse8 .cse9 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2.base|) .cse11) 0)))))) [2020-12-04 18:38:20,201 INFO L262 CegarLoopResult]: For program point L7386-2(lines 7386 7387) no Hoare annotation was computed. [2020-12-04 18:38:20,203 INFO L258 CegarLoopResult]: At program point L7386-7(lines 7384 7388) the Hoare annotation is: (let ((.cse10 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset| 4))) (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 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|) .cse10)) (.cse5 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base| 0))) (.cse6 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse7 (<= (div ULTIMATE.start___VERIFIER_assert_~cond 256) 0)) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse9 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 ULTIMATE.start_aws_byte_cursor_from_array_~len)) (.cse11 (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 ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base) .cse5 .cse6 (= 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 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base) .cse8 .cse9 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.base| ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|) .cse10) 0) .cse11) (and .cse0 .cse1 .cse2 (let ((.cse12 (select (select |#memory_int| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset))) (<= .cse12 (* 4294967296 (div .cse12 4294967296)))) .cse3 (not (= .cse4 0)) (not (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base 0)) .cse5 .cse6 (not (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base 0)) .cse7 .cse8 .cse9 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res.len| (* 4294967296 (div |ULTIMATE.start_aws_byte_cursor_from_array_#res.len| 4294967296))) .cse11)))) [2020-12-04 18:38:20,203 INFO L262 CegarLoopResult]: For program point L7386-6(lines 7386 7387) no Hoare annotation was computed. [2020-12-04 18:38:20,204 INFO L262 CegarLoopResult]: For program point L210(lines 210 212) no Hoare annotation was computed. [2020-12-04 18:38:20,204 INFO L262 CegarLoopResult]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2020-12-04 18:38:20,204 INFO L262 CegarLoopResult]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2020-12-04 18:38:20,204 INFO L262 CegarLoopResult]: For program point L7387(line 7387) no Hoare annotation was computed. [2020-12-04 18:38:20,204 INFO L262 CegarLoopResult]: For program point L7387-5(line 7387) no Hoare annotation was computed. [2020-12-04 18:38:20,205 INFO L262 CegarLoopResult]: For program point L7387-4(line 7387) no Hoare annotation was computed. [2020-12-04 18:38:20,205 INFO L262 CegarLoopResult]: For program point L7387-2(line 7387) no Hoare annotation was computed. [2020-12-04 18:38:20,205 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 18:38:20,205 INFO L262 CegarLoopResult]: For program point L7387-8(line 7387) no Hoare annotation was computed. [2020-12-04 18:38:20,205 INFO L262 CegarLoopResult]: For program point L211(line 211) no Hoare annotation was computed. [2020-12-04 18:38:20,205 INFO L262 CegarLoopResult]: For program point L7387-6(line 7387) no Hoare annotation was computed. [2020-12-04 18:38:20,206 INFO L262 CegarLoopResult]: For program point L211-2(line 211) no Hoare annotation was computed. [2020-12-04 18:38:20,206 INFO L262 CegarLoopResult]: For program point L7387-12(line 7387) no Hoare annotation was computed. [2020-12-04 18:38:20,206 INFO L262 CegarLoopResult]: For program point L7387-11(line 7387) no Hoare annotation was computed. [2020-12-04 18:38:20,206 INFO L262 CegarLoopResult]: For program point L211-4(line 211) no Hoare annotation was computed. [2020-12-04 18:38:20,207 INFO L262 CegarLoopResult]: For program point L7387-10(line 7387) no Hoare annotation was computed. [2020-12-04 18:38:20,208 INFO L262 CegarLoopResult]: For program point L7387-17(line 7387) no Hoare annotation was computed. [2020-12-04 18:38:20,208 INFO L262 CegarLoopResult]: For program point L7387-16(line 7387) no Hoare annotation was computed. [2020-12-04 18:38:20,208 INFO L262 CegarLoopResult]: For program point L7387-14(line 7387) no Hoare annotation was computed. [2020-12-04 18:38:20,209 INFO L262 CegarLoopResult]: For program point L7387-20(line 7387) no Hoare annotation was computed. [2020-12-04 18:38:20,209 INFO L262 CegarLoopResult]: For program point L7387-18(line 7387) no Hoare annotation was computed. [2020-12-04 18:38:20,209 INFO L262 CegarLoopResult]: For program point L7387-23(line 7387) no Hoare annotation was computed. [2020-12-04 18:38:20,209 INFO L262 CegarLoopResult]: For program point L7387-22(line 7387) no Hoare annotation was computed. [2020-12-04 18:38:20,209 INFO L262 CegarLoopResult]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2020-12-04 18:38:20,212 INFO L265 CegarLoopResult]: At program point L8974(line 8974) the Hoare annotation is: true [2020-12-04 18:38:20,212 INFO L258 CegarLoopResult]: At program point L6886(lines 6882 6887) the Hoare annotation is: (and (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) [2020-12-04 18:38:20,213 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-04 18:38:20,213 INFO L262 CegarLoopResult]: For program point L222(lines 222 224) no Hoare annotation was computed. [2020-12-04 18:38:20,213 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 (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0)) (.cse2 (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (+ ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 4)) 0))) (.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|)) (.cse7 (<= (div ULTIMATE.start___VERIFIER_assert_~cond 256) 0)) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse9 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2 ULTIMATE.start_aws_byte_cursor_from_array_~len)) (.cse11 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.base| 0)))) (or (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.offset| 0) .cse0 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) .cse1 .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) .cse7 .cse8 (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base) .cse9 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.base| ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base) (let ((.cse10 (select (select |#memory_int| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset))) (<= .cse10 (+ (* 4294967296 (div (+ .cse10 (- 1)) 4294967296)) 4294967295))) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.base 0)) .cse5 .cse6 (not (= ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base 0)) .cse7 .cse8 .cse9 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res.len| (* 4294967296 (div |ULTIMATE.start_aws_byte_cursor_from_array_#res.len| 4294967296))) .cse11))) [2020-12-04 18:38:20,214 INFO L262 CegarLoopResult]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2020-12-04 18:38:20,214 INFO L262 CegarLoopResult]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2020-12-04 18:38:20,214 INFO L262 CegarLoopResult]: For program point L222-3(lines 7101 7111) no Hoare annotation was computed. [2020-12-04 18:38:20,214 INFO L262 CegarLoopResult]: For program point L8959(lines 8959 8973) no Hoare annotation was computed. [2020-12-04 18:38:20,214 INFO L262 CegarLoopResult]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2020-12-04 18:38:20,214 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 18:38:20,215 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-04 18:38:20,215 INFO L262 CegarLoopResult]: For program point L223(line 223) no Hoare annotation was computed. [2020-12-04 18:38:20,215 INFO L262 CegarLoopResult]: For program point L223-1(line 223) no Hoare annotation was computed. [2020-12-04 18:38:20,215 INFO L262 CegarLoopResult]: For program point L223-3(line 223) no Hoare annotation was computed. [2020-12-04 18:38:20,215 INFO L262 CegarLoopResult]: For program point L223-4(line 223) no Hoare annotation was computed. [2020-12-04 18:38:20,216 INFO L262 CegarLoopResult]: For program point L223-6(line 223) no Hoare annotation was computed. [2020-12-04 18:38:20,216 INFO L262 CegarLoopResult]: For program point L223-7(line 223) no Hoare annotation was computed. [2020-12-04 18:38:20,216 INFO L262 CegarLoopResult]: For program point L223-9(line 223) no Hoare annotation was computed. [2020-12-04 18:38:20,216 INFO L262 CegarLoopResult]: For program point L223-10(line 223) no Hoare annotation was computed. [2020-12-04 18:38:20,216 INFO L262 CegarLoopResult]: For program point L223-12(line 223) no Hoare annotation was computed. [2020-12-04 18:38:20,216 INFO L262 CegarLoopResult]: For program point L223-13(line 223) no Hoare annotation was computed. [2020-12-04 18:38:20,217 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 18:38:20,217 INFO L262 CegarLoopResult]: For program point L8970(lines 8970 8972) no Hoare annotation was computed. [2020-12-04 18:38:20,218 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| 4))) (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_~#cur~3.offset| 0) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= ULTIMATE.start_assert_bytes_match_~b.offset 0) (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (+ ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 4)) 0)) (= |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) (= (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) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base| 0)) (= ULTIMATE.start_aws_byte_cursor_from_array_~bytes.offset 0) (= 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_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) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.base| ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0.base) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3.base|) .cse0) 0) (let ((.cse1 (select (select |#memory_int| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset))) (<= .cse1 (+ (* 4294967296 (div (+ .cse1 (- 1)) 4294967296)) 4294967295))) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res.ptr.base| 0)))) [2020-12-04 18:38:20,218 INFO L262 CegarLoopResult]: For program point L8970-2(lines 8970 8972) no Hoare annotation was computed. [2020-12-04 18:38:20,264 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:20,266 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-04 18:38:20,267 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:20,268 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-04 18:38:20,269 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:38:20,269 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-04 18:38:20,279 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:20,280 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-04 18:38:20,281 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:20,282 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-04 18:38:20,282 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:38:20,283 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-04 18:38:20,287 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:20,289 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-04 18:38:20,290 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-04 18:38:20,290 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-04 18:38:20,290 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:20,291 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-04 18:38:20,294 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:20,296 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-04 18:38:20,296 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-04 18:38:20,297 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-04 18:38:20,297 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:20,298 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-04 18:38:20,304 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-04 18:38:20,305 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:20,305 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-04 18:38:20,306 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:38:20,306 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-04 18:38:20,309 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:20,311 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-04 18:38:20,314 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-04 18:38:20,314 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:20,315 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-04 18:38:20,316 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:38:20,319 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-04 18:38:20,321 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:20,322 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-04 18:38:20,327 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:20,331 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:20,332 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:38:20,337 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:20,340 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:20,343 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:38:20,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.12 06:38:20 BoogieIcfgContainer [2020-12-04 18:38:20,361 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-04 18:38:20,362 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-04 18:38:20,362 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-04 18:38:20,363 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-04 18:38:20,364 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 06:36:35" (3/4) ... [2020-12-04 18:38:20,387 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-04 18:38:20,427 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2020-12-04 18:38:20,430 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2020-12-04 18:38:20,431 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2020-12-04 18:38:20,433 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2020-12-04 18:38:20,435 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2020-12-04 18:38:20,439 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-12-04 18:38:20,442 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-04 18:38:20,445 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-04 18:38:20,502 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == 0 && !(\result == 0) [2020-12-04 18:38:20,504 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((cur == cursor && \result <= 1) && cursor == 0) && !(#memory_$Pointer$[cursor][cursor + 4] == 0)) && !(bytes == 0)) && !(cur == 0)) && length == unknown-#memory_int-unknown[cur][cur]) && 1 <= \result) && !(array == 0)) && cur == cursor) && !(\result == 0)) && length == len) && unknown-#memory_int-unknown[cur][cur] <= 4294967296 * (unknown-#memory_int-unknown[cur][cur] / 4294967296)) || ((((((((((((((((cur == 0 && cur == cursor) && \result <= 1) && \result == 0) && cursor == 0) && !(cur == 0)) && length == unknown-#memory_int-unknown[cur][cur]) && #memory_$Pointer$[cur][cur + 4] == array) && 1 <= \result) && bytes == 0) && array == 0) && !(array == 0)) && cur == cursor) && array == bytes) && !(\result == 0)) && length == len) && #memory_$Pointer$[cur][cur + 4] == 0) [2020-12-04 18:38:20,505 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((cur == 0 && \result <= 1) && \result == 0) && cursor == 0) && 1 <= cond) && !(#memory_$Pointer$[cursor][cursor + 4] == 0)) && 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)) && array == bytes) && length == len) && aws_byte_cursor_from_array_#res.ptr == array) && unknown-#memory_int-unknown[cursor][cursor] <= 4294967296 * ((unknown-#memory_int-unknown[cursor][cursor] + -1) / 4294967296) + 4294967295) && !(aws_byte_cursor_from_array_#res.ptr == 0)) || (((((((((((((\result <= 1 && cursor == 0) && 1 <= cond) && !(#memory_$Pointer$[cursor][cursor + 4] == 0)) && unknown-#res!len-unknown == length) && !(bytes == 0)) && !(cur == 0)) && 1 <= \result) && !(array == 0)) && cond / 256 <= 0) && !(\result == 0)) && length == len) && unknown-#res!len-unknown <= 4294967296 * (unknown-#res!len-unknown / 4294967296)) && !(aws_byte_cursor_from_array_#res.ptr == 0)) [2020-12-04 18:38:20,506 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) && #memory_$Pointer$[cur][cur + 4] == array) && !(cur == 0)) && 1 <= \result) && bytes == 0) && cur == cursor) && array == 0) && cond / 256 <= 0) && array == bytes) && !(\result == 0)) && length == len) && aws_byte_cursor_from_array_#res.ptr == array) && #memory_$Pointer$[cur][cur + 4] == 0) && !(aws_byte_cursor_from_array_#res.ptr == 0)) || ((((((((((((((unknown-#memory_int-unknown[cur][cur] == length && \result <= 1) && 1 <= cond) && unknown-#memory_int-unknown[cursor][cursor] <= 4294967296 * (unknown-#memory_int-unknown[cursor][cursor] / 4294967296)) && unknown-#res!len-unknown == length) && !(#memory_$Pointer$[cur][cur + 4] == 0)) && !(bytes == 0)) && !(cur == 0)) && 1 <= \result) && !(array == 0)) && cond / 256 <= 0) && !(\result == 0)) && length == len) && unknown-#res!len-unknown <= 4294967296 * (unknown-#res!len-unknown / 4294967296)) && !(aws_byte_cursor_from_array_#res.ptr == 0)) [2020-12-04 18:38:20,507 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((unknown-#memory_int-unknown[cur][cur] == length && cur == 0) && \result == 0) && b == 0) && cursor == 0) && 1 <= cond) && !(#memory_$Pointer$[cursor][cursor + 4] == 0)) && unknown-#res!len-unknown == length) && aws_byte_cursor_from_array_#res.ptr == 0) && a == 0) && #memory_$Pointer$[cur][cur + 4] == array) && !(cur == 0)) && bytes == 0) && a == b) && array == 0) && cond / 256 <= 0) && array == bytes) && !(\result == 0)) && length == len) && aws_byte_cursor_from_array_#res.ptr == array) && #memory_$Pointer$[cur][cur + 4] == 0) && unknown-#memory_int-unknown[cursor][cursor] <= 4294967296 * ((unknown-#memory_int-unknown[cursor][cursor] + -1) / 4294967296) + 4294967295) && !(aws_byte_cursor_from_array_#res.ptr == 0) [2020-12-04 18:38:21,823 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-04 18:38:21,823 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-04 18:38:21,825 INFO L168 Benchmark]: Toolchain (without parser) took 120531.42 ms. Allocated memory was 39.8 MB in the beginning and 906.0 MB in the end (delta: 866.1 MB). Free memory was 16.6 MB in the beginning and 563.2 MB in the end (delta: -546.6 MB). Peak memory consumption was 513.4 MB. Max. memory is 16.1 GB. [2020-12-04 18:38:21,825 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 39.8 MB. Free memory is still 24.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-04 18:38:21,826 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3648.36 ms. Allocated memory was 39.8 MB in the beginning and 109.1 MB in the end (delta: 69.2 MB). Free memory was 16.5 MB in the beginning and 39.1 MB in the end (delta: -22.6 MB). Peak memory consumption was 70.1 MB. Max. memory is 16.1 GB. [2020-12-04 18:38:21,826 INFO L168 Benchmark]: Boogie Procedure Inliner took 245.16 ms. Allocated memory is still 109.1 MB. Free memory was 39.1 MB in the beginning and 27.4 MB in the end (delta: 11.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-04 18:38:21,826 INFO L168 Benchmark]: Boogie Preprocessor took 97.63 ms. Allocated memory is still 109.1 MB. Free memory was 27.4 MB in the beginning and 20.2 MB in the end (delta: 7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-04 18:38:21,827 INFO L168 Benchmark]: RCFGBuilder took 10492.52 ms. Allocated memory was 109.1 MB in the beginning and 419.4 MB in the end (delta: 310.4 MB). Free memory was 20.2 MB in the beginning and 250.4 MB in the end (delta: -230.3 MB). Peak memory consumption was 218.4 MB. Max. memory is 16.1 GB. [2020-12-04 18:38:21,827 INFO L168 Benchmark]: TraceAbstraction took 104578.98 ms. Allocated memory was 419.4 MB in the beginning and 755.0 MB in the end (delta: 335.5 MB). Free memory was 249.4 MB in the beginning and 348.9 MB in the end (delta: -99.5 MB). Peak memory consumption was 236.0 MB. Max. memory is 16.1 GB. [2020-12-04 18:38:21,827 INFO L168 Benchmark]: Witness Printer took 1461.32 ms. Allocated memory was 755.0 MB in the beginning and 906.0 MB in the end (delta: 151.0 MB). Free memory was 348.9 MB in the beginning and 563.2 MB in the end (delta: -214.3 MB). Peak memory consumption was 127.5 MB. Max. memory is 16.1 GB. [2020-12-04 18:38:21,830 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.41 ms. Allocated memory is still 39.8 MB. Free memory is still 24.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 3648.36 ms. Allocated memory was 39.8 MB in the beginning and 109.1 MB in the end (delta: 69.2 MB). Free memory was 16.5 MB in the beginning and 39.1 MB in the end (delta: -22.6 MB). Peak memory consumption was 70.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 245.16 ms. Allocated memory is still 109.1 MB. Free memory was 39.1 MB in the beginning and 27.4 MB in the end (delta: 11.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 97.63 ms. Allocated memory is still 109.1 MB. Free memory was 27.4 MB in the beginning and 20.2 MB in the end (delta: 7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 10492.52 ms. Allocated memory was 109.1 MB in the beginning and 419.4 MB in the end (delta: 310.4 MB). Free memory was 20.2 MB in the beginning and 250.4 MB in the end (delta: -230.3 MB). Peak memory consumption was 218.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 104578.98 ms. Allocated memory was 419.4 MB in the beginning and 755.0 MB in the end (delta: 335.5 MB). Free memory was 249.4 MB in the beginning and 348.9 MB in the end (delta: -99.5 MB). Peak memory consumption was 236.0 MB. Max. memory is 16.1 GB. * Witness Printer took 1461.32 ms. Allocated memory was 755.0 MB in the beginning and 906.0 MB in the end (delta: 151.0 MB). Free memory was 348.9 MB in the beginning and 563.2 MB in the end (delta: -214.3 MB). Peak memory consumption was 127.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: 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$.offset - 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: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_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: 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$.offset - 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$.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$.offset - 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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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-04 18:38:21,840 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:21,841 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-04 18:38:21,841 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:21,841 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-04 18:38:21,842 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:38:21,842 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-04 18:38:21,844 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:21,844 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-04 18:38:21,844 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:21,845 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-04 18:38:21,845 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:38:21,845 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 && cur == 0) && \result == 0) && b == 0) && cursor == 0) && 1 <= cond) && !(#memory_$Pointer$[cursor][cursor + 4] == 0)) && unknown-#res!len-unknown == length) && aws_byte_cursor_from_array_#res.ptr == 0) && a == 0) && #memory_$Pointer$[cur][cur + 4] == array) && !(cur == 0)) && bytes == 0) && a == b) && array == 0) && cond / 256 <= 0) && array == bytes) && !(\result == 0)) && length == len) && aws_byte_cursor_from_array_#res.ptr == array) && #memory_$Pointer$[cur][cur + 4] == 0) && unknown-#memory_int-unknown[cursor][cursor] <= 4294967296 * ((unknown-#memory_int-unknown[cursor][cursor] + -1) / 4294967296) + 4294967295) && !(aws_byte_cursor_from_array_#res.ptr == 0) - InvariantResult [Line: 8251]: Loop Invariant [2020-12-04 18:38:21,846 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:21,847 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-04 18:38:21,847 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-04 18:38:21,847 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-04 18:38:21,848 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:21,848 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-04 18:38:21,849 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:21,850 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-04 18:38:21,850 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-04 18:38:21,850 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-04 18:38:21,850 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:21,851 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: ((((((((((((((((((cur == 0 && \result <= 1) && \result == 0) && cursor == 0) && 1 <= cond) && !(#memory_$Pointer$[cursor][cursor + 4] == 0)) && 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)) && array == bytes) && length == len) && aws_byte_cursor_from_array_#res.ptr == array) && unknown-#memory_int-unknown[cursor][cursor] <= 4294967296 * ((unknown-#memory_int-unknown[cursor][cursor] + -1) / 4294967296) + 4294967295) && !(aws_byte_cursor_from_array_#res.ptr == 0)) || (((((((((((((\result <= 1 && cursor == 0) && 1 <= cond) && !(#memory_$Pointer$[cursor][cursor + 4] == 0)) && unknown-#res!len-unknown == length) && !(bytes == 0)) && !(cur == 0)) && 1 <= \result) && !(array == 0)) && cond / 256 <= 0) && !(\result == 0)) && length == len) && unknown-#res!len-unknown <= 4294967296 * (unknown-#res!len-unknown / 4294967296)) && !(aws_byte_cursor_from_array_#res.ptr == 0)) - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: \result == 0 && !(\result == 0) - InvariantResult [Line: 7384]: Loop Invariant [2020-12-04 18:38:21,853 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-04 18:38:21,853 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:21,853 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-04 18:38:21,854 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:38:21,854 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-04 18:38:21,854 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:21,854 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-04 18:38:21,856 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-04 18:38:21,856 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:21,856 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-04 18:38:21,857 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:38:21,857 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-04 18:38:21,857 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:21,857 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) && #memory_$Pointer$[cur][cur + 4] == array) && !(cur == 0)) && 1 <= \result) && bytes == 0) && cur == cursor) && array == 0) && cond / 256 <= 0) && array == bytes) && !(\result == 0)) && length == len) && aws_byte_cursor_from_array_#res.ptr == array) && #memory_$Pointer$[cur][cur + 4] == 0) && !(aws_byte_cursor_from_array_#res.ptr == 0)) || ((((((((((((((unknown-#memory_int-unknown[cur][cur] == length && \result <= 1) && 1 <= cond) && unknown-#memory_int-unknown[cursor][cursor] <= 4294967296 * (unknown-#memory_int-unknown[cursor][cursor] / 4294967296)) && unknown-#res!len-unknown == length) && !(#memory_$Pointer$[cur][cur + 4] == 0)) && !(bytes == 0)) && !(cur == 0)) && 1 <= \result) && !(array == 0)) && cond / 256 <= 0) && !(\result == 0)) && length == len) && unknown-#res!len-unknown <= 4294967296 * (unknown-#res!len-unknown / 4294967296)) && !(aws_byte_cursor_from_array_#res.ptr == 0)) - InvariantResult [Line: 7384]: Loop Invariant [2020-12-04 18:38:21,859 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:21,859 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:21,860 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:38:21,861 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:21,861 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:38:21,861 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((cur == cursor && \result <= 1) && cursor == 0) && !(#memory_$Pointer$[cursor][cursor + 4] == 0)) && !(bytes == 0)) && !(cur == 0)) && length == unknown-#memory_int-unknown[cur][cur]) && 1 <= \result) && !(array == 0)) && cur == cursor) && !(\result == 0)) && length == len) && unknown-#memory_int-unknown[cur][cur] <= 4294967296 * (unknown-#memory_int-unknown[cur][cur] / 4294967296)) || ((((((((((((((((cur == 0 && cur == cursor) && \result <= 1) && \result == 0) && cursor == 0) && !(cur == 0)) && length == unknown-#memory_int-unknown[cur][cur]) && #memory_$Pointer$[cur][cur + 4] == array) && 1 <= \result) && bytes == 0) && array == 0) && !(array == 0)) && cur == cursor) && array == bytes) && !(\result == 0)) && length == len) && #memory_$Pointer$[cur][cur + 4] == 0) - 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: 99.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 64.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 780 SDtfs, 1621 SDslu, 1994 SDs, 0 SdLazy, 1296 SolverSat, 167 SolverUnsat, 25 SolverUnknown, 0 SolverNotchecked, 55.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 10.0s 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.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 174 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 576 HoareAnnotationTreeSize, 6 FomulaSimplifications, 2468 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 394 FormulaSimplificationTreeSizeReductionInter, 4.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 24.9s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 417 NumberOfCodeBlocks, 417 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 92525 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...