./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5b36d44f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_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 7d8c1ced61af2c61b36782af6d28a32546abe33f0c852d8f862ae04f74aae5e5 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5b36d44 [2021-11-07 08:45:44,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 08:45:44,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 08:45:44,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 08:45:44,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 08:45:44,574 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 08:45:44,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 08:45:44,579 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 08:45:44,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 08:45:44,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 08:45:44,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 08:45:44,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 08:45:44,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 08:45:44,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 08:45:44,618 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 08:45:44,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 08:45:44,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 08:45:44,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 08:45:44,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 08:45:44,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 08:45:44,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 08:45:44,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 08:45:44,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 08:45:44,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 08:45:44,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 08:45:44,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 08:45:44,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 08:45:44,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 08:45:44,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 08:45:44,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 08:45:44,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 08:45:44,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 08:45:44,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 08:45:44,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 08:45:44,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 08:45:44,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 08:45:44,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 08:45:44,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 08:45:44,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 08:45:44,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 08:45:44,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 08:45:44,653 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-07 08:45:44,673 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 08:45:44,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 08:45:44,674 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 08:45:44,674 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 08:45:44,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 08:45:44,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 08:45:44,676 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 08:45:44,676 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 08:45:44,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 08:45:44,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 08:45:44,677 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 08:45:44,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 08:45:44,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 08:45:44,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 08:45:44,678 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 08:45:44,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 08:45:44,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 08:45:44,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 08:45:44,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 08:45:44,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 08:45:44,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 08:45:44,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 08:45:44,679 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 08:45:44,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 08:45:44,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 08:45:44,679 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 08:45:44,679 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 08:45:44,680 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 08:45:44,680 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 08:45:44,680 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 -> 7d8c1ced61af2c61b36782af6d28a32546abe33f0c852d8f862ae04f74aae5e5 [2021-11-07 08:45:44,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 08:45:44,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 08:45:44,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 08:45:44,879 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 08:45:44,882 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 08:45:44,884 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2021-11-07 08:45:44,948 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8708f9ac/e58572390d8c461d8e948e9d2b2eb7ac/FLAG88fa39fe3 [2021-11-07 08:45:45,526 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 08:45:45,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i [2021-11-07 08:45:45,561 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8708f9ac/e58572390d8c461d8e948e9d2b2eb7ac/FLAG88fa39fe3 [2021-11-07 08:45:45,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8708f9ac/e58572390d8c461d8e948e9d2b2eb7ac [2021-11-07 08:45:45,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 08:45:45,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 08:45:45,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 08:45:45,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 08:45:45,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 08:45:45,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:45:45" (1/1) ... [2021-11-07 08:45:45,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee0702b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:45, skipping insertion in model container [2021-11-07 08:45:45,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:45:45" (1/1) ... [2021-11-07 08:45:45,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 08:45:45,980 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 08:45:46,238 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4491,4504] [2021-11-07 08:45:46,246 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4551,4564] [2021-11-07 08:45:46,257 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-07 08:45:46,262 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-07 08:45:46,635 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:46,639 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:46,640 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:46,641 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:46,644 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:46,655 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:46,658 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:46,666 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:46,667 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:46,841 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-07 08:45:46,842 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-07 08:45:46,842 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-07 08:45:46,843 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-07 08:45:46,844 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-07 08:45:46,844 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-07 08:45:46,845 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-07 08:45:46,845 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-07 08:45:46,846 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-07 08:45:46,846 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-07 08:45:46,921 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-07 08:45:46,966 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:46,972 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:47,006 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:45:47,045 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 08:45:47,079 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4491,4504] [2021-11-07 08:45:47,080 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_init_harness.i[4551,4564] [2021-11-07 08:45:47,082 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-07 08:45:47,082 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-07 08:45:47,110 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:47,111 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:47,111 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:47,113 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:47,114 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:47,119 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:47,119 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:47,120 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:47,120 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:47,155 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-07 08:45:47,155 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-07 08:45:47,156 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-07 08:45:47,156 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-07 08:45:47,157 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-07 08:45:47,157 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-07 08:45:47,159 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-07 08:45:47,159 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-07 08:45:47,160 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-07 08:45:47,160 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-07 08:45:47,179 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-07 08:45:47,219 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:47,220 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-07 08:45:47,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:45:47,385 INFO L208 MainTranslator]: Completed translation [2021-11-07 08:45:47,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:47 WrapperNode [2021-11-07 08:45:47,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 08:45:47,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 08:45:47,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 08:45:47,386 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 08:45:47,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:47" (1/1) ... [2021-11-07 08:45:47,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:47" (1/1) ... [2021-11-07 08:45:47,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 08:45:47,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 08:45:47,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 08:45:47,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 08:45:47,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:47" (1/1) ... [2021-11-07 08:45:47,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:47" (1/1) ... [2021-11-07 08:45:47,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:47" (1/1) ... [2021-11-07 08:45:47,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:47" (1/1) ... [2021-11-07 08:45:47,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:47" (1/1) ... [2021-11-07 08:45:47,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:47" (1/1) ... [2021-11-07 08:45:47,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:47" (1/1) ... [2021-11-07 08:45:47,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 08:45:47,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 08:45:47,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 08:45:47,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 08:45:47,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:47" (1/1) ... [2021-11-07 08:45:47,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 08:45:47,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 08:45:47,637 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 08:45:47,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 08:45:47,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 08:45:47,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 08:45:47,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 08:45:47,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 08:45:47,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 08:45:47,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 08:45:47,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 08:45:47,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 08:45:47,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-07 08:45:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 08:45:47,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 08:45:54,785 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 08:45:54,787 INFO L299 CfgBuilder]: Removed 50 assume(true) statements. [2021-11-07 08:45:54,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:45:54 BoogieIcfgContainer [2021-11-07 08:45:54,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 08:45:54,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 08:45:54,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 08:45:54,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 08:45:54,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:45:45" (1/3) ... [2021-11-07 08:45:54,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b3c773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:45:54, skipping insertion in model container [2021-11-07 08:45:54,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:45:47" (2/3) ... [2021-11-07 08:45:54,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b3c773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:45:54, skipping insertion in model container [2021-11-07 08:45:54,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:45:54" (3/3) ... [2021-11-07 08:45:54,798 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_init_harness.i [2021-11-07 08:45:54,805 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 08:45:54,806 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-07 08:45:54,846 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 08:45:54,856 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 08:45:54,857 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-07 08:45:54,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 84 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:45:54,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 08:45:54,881 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:45:54,881 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:45:54,882 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:45:54,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:45:54,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1714787328, now seen corresponding path program 1 times [2021-11-07 08:45:54,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:45:54,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840807552] [2021-11-07 08:45:54,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:45:54,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:45:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:45:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:45:55,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:45:55,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840807552] [2021-11-07 08:45:55,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840807552] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:45:55,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:45:55,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 08:45:55,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147963892] [2021-11-07 08:45:55,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:45:55,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-07 08:45:55,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:45:55,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-07 08:45:55,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 08:45:55,420 INFO L87 Difference]: Start difference. First operand has 85 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 84 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:45:55,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:45:55,438 INFO L93 Difference]: Finished difference Result 166 states and 223 transitions. [2021-11-07 08:45:55,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 08:45:55,439 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 08:45:55,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:45:55,445 INFO L225 Difference]: With dead ends: 166 [2021-11-07 08:45:55,445 INFO L226 Difference]: Without dead ends: 79 [2021-11-07 08:45:55,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.03ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 08:45:55,456 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.27ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-07 08:45:55,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 1.27ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-07 08:45:55,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-11-07 08:45:55,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-11-07 08:45:55,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 78 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:45:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2021-11-07 08:45:55,494 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 15 [2021-11-07 08:45:55,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:45:55,495 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2021-11-07 08:45:55,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:45:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2021-11-07 08:45:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 08:45:55,498 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:45:55,499 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:45:55,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 08:45:55,500 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:45:55,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:45:55,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1972952766, now seen corresponding path program 1 times [2021-11-07 08:45:55,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:45:55,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681637312] [2021-11-07 08:45:55,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:45:55,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:45:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:45:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:45:56,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:45:56,036 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681637312] [2021-11-07 08:45:56,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681637312] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:45:56,036 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:45:56,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:45:56,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958478445] [2021-11-07 08:45:56,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:45:56,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 08:45:56,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:45:56,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 08:45:56,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:45:56,038 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:45:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:45:56,269 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2021-11-07 08:45:56,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 08:45:56,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-07 08:45:56,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:45:56,271 INFO L225 Difference]: With dead ends: 117 [2021-11-07 08:45:56,271 INFO L226 Difference]: Without dead ends: 79 [2021-11-07 08:45:56,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 209.82ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 08:45:56,272 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 309 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 90.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.71ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 99.16ms IncrementalHoareTripleChecker+Time [2021-11-07 08:45:56,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 130 Invalid, 27 Unknown, 0 Unchecked, 3.71ms Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 99.16ms Time] [2021-11-07 08:45:56,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-11-07 08:45:56,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-11-07 08:45:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 78 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:45:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2021-11-07 08:45:56,277 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 15 [2021-11-07 08:45:56,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:45:56,277 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2021-11-07 08:45:56,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:45:56,277 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2021-11-07 08:45:56,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 08:45:56,278 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:45:56,278 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:45:56,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 08:45:56,279 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:45:56,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:45:56,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1369831661, now seen corresponding path program 1 times [2021-11-07 08:45:56,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:45:56,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375719073] [2021-11-07 08:45:56,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:45:56,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:45:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:45:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:45:56,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:45:56,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375719073] [2021-11-07 08:45:56,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375719073] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:45:56,727 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:45:56,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 08:45:56,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027320354] [2021-11-07 08:45:56,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:45:56,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 08:45:56,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:45:56,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 08:45:56,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:45:56,728 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:45:57,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:45:57,176 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2021-11-07 08:45:57,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 08:45:57,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 08:45:57,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:45:57,177 INFO L225 Difference]: With dead ends: 124 [2021-11-07 08:45:57,177 INFO L226 Difference]: Without dead ends: 120 [2021-11-07 08:45:57,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 270.05ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-07 08:45:57,178 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 76 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 248.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.33ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 276.85ms IncrementalHoareTripleChecker+Time [2021-11-07 08:45:57,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 431 Invalid, 90 Unknown, 0 Unchecked, 3.33ms Time], IncrementalHoareTripleChecker [11 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 276.85ms Time] [2021-11-07 08:45:57,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-11-07 08:45:57,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 87. [2021-11-07 08:45:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 86 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:45:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2021-11-07 08:45:57,190 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 21 [2021-11-07 08:45:57,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:45:57,190 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2021-11-07 08:45:57,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:45:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2021-11-07 08:45:57,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 08:45:57,192 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:45:57,193 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:45:57,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 08:45:57,193 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:45:57,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:45:57,194 INFO L85 PathProgramCache]: Analyzing trace with hash -692640299, now seen corresponding path program 1 times [2021-11-07 08:45:57,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:45:57,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011425984] [2021-11-07 08:45:57,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:45:57,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:45:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:45:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:45:57,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:45:57,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011425984] [2021-11-07 08:45:57,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011425984] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:45:57,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:45:57,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:45:57,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106927264] [2021-11-07 08:45:57,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:45:57,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 08:45:57,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:45:57,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:45:57,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:45:57,378 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:45:57,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:45:57,403 INFO L93 Difference]: Finished difference Result 124 states and 146 transitions. [2021-11-07 08:45:57,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:45:57,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 08:45:57,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:45:57,406 INFO L225 Difference]: With dead ends: 124 [2021-11-07 08:45:57,406 INFO L226 Difference]: Without dead ends: 88 [2021-11-07 08:45:57,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.63ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:45:57,407 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.38ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.23ms IncrementalHoareTripleChecker+Time [2021-11-07 08:45:57,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 6 Unknown, 0 Unchecked, 0.38ms Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 21.23ms Time] [2021-11-07 08:45:57,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-11-07 08:45:57,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-11-07 08:45:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 87 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:45:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2021-11-07 08:45:57,420 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 25 [2021-11-07 08:45:57,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:45:57,420 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2021-11-07 08:45:57,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:45:57,420 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2021-11-07 08:45:57,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 08:45:57,421 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:45:57,422 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:45:57,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 08:45:57,423 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:45:57,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:45:57,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1893417011, now seen corresponding path program 1 times [2021-11-07 08:45:57,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:45:57,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971899717] [2021-11-07 08:45:57,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:45:57,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:45:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:45:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:45:59,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:45:59,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971899717] [2021-11-07 08:45:59,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971899717] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:45:59,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:45:59,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 08:45:59,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580801775] [2021-11-07 08:45:59,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:45:59,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 08:45:59,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:45:59,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 08:45:59,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-07 08:45:59,415 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:01,497 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:46:03,590 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:46:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:46:04,492 INFO L93 Difference]: Finished difference Result 206 states and 244 transitions. [2021-11-07 08:46:04,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 08:46:04,492 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 08:46:04,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:46:04,493 INFO L225 Difference]: With dead ends: 206 [2021-11-07 08:46:04,493 INFO L226 Difference]: Without dead ends: 157 [2021-11-07 08:46:04,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 576.56ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-11-07 08:46:04,494 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 359 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4462.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.56ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4699.66ms IncrementalHoareTripleChecker+Time [2021-11-07 08:46:04,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 434 Invalid, 150 Unknown, 0 Unchecked, 4.56ms Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 2 Unknown, 0 Unchecked, 4699.66ms Time] [2021-11-07 08:46:04,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-11-07 08:46:04,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 98. [2021-11-07 08:46:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 97 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2021-11-07 08:46:04,504 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 25 [2021-11-07 08:46:04,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:46:04,504 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2021-11-07 08:46:04,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:04,504 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2021-11-07 08:46:04,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 08:46:04,505 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:46:04,505 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:46:04,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 08:46:04,505 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:46:04,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:46:04,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1635251573, now seen corresponding path program 1 times [2021-11-07 08:46:04,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:46:04,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170195687] [2021-11-07 08:46:04,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:46:04,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:46:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:46:04,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:46:04,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:46:04,768 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170195687] [2021-11-07 08:46:04,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170195687] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:46:04,768 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:46:04,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:46:04,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170210060] [2021-11-07 08:46:04,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:46:04,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 08:46:04,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:46:04,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 08:46:04,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:46:04,769 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:06,810 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:46:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:46:07,154 INFO L93 Difference]: Finished difference Result 173 states and 208 transitions. [2021-11-07 08:46:07,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:46:07,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 08:46:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:46:07,155 INFO L225 Difference]: With dead ends: 173 [2021-11-07 08:46:07,155 INFO L226 Difference]: Without dead ends: 118 [2021-11-07 08:46:07,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 86.52ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 08:46:07,157 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 44 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2212.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.71ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2326.97ms IncrementalHoareTripleChecker+Time [2021-11-07 08:46:07,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 315 Invalid, 67 Unknown, 0 Unchecked, 1.71ms Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 1 Unknown, 0 Unchecked, 2326.97ms Time] [2021-11-07 08:46:07,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-07 08:46:07,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2021-11-07 08:46:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.2577319587628866) internal successors, (122), 101 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2021-11-07 08:46:07,162 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 25 [2021-11-07 08:46:07,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:46:07,162 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2021-11-07 08:46:07,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:07,162 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2021-11-07 08:46:07,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 08:46:07,163 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:46:07,163 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:46:07,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 08:46:07,163 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:46:07,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:46:07,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1648598473, now seen corresponding path program 1 times [2021-11-07 08:46:07,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:46:07,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94337192] [2021-11-07 08:46:07,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:46:07,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:46:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:46:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:46:07,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:46:07,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94337192] [2021-11-07 08:46:07,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94337192] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:46:07,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:46:07,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:46:07,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164677431] [2021-11-07 08:46:07,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:46:07,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 08:46:07,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:46:07,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 08:46:07,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:46:07,549 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:09,594 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:46:11,733 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:46:12,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:46:12,195 INFO L93 Difference]: Finished difference Result 205 states and 240 transitions. [2021-11-07 08:46:12,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:46:12,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 08:46:12,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:46:12,196 INFO L225 Difference]: With dead ends: 205 [2021-11-07 08:46:12,196 INFO L226 Difference]: Without dead ends: 157 [2021-11-07 08:46:12,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 119.39ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:46:12,198 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 52 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4318.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.78ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4598.54ms IncrementalHoareTripleChecker+Time [2021-11-07 08:46:12,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 368 Invalid, 95 Unknown, 0 Unchecked, 2.78ms Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 2 Unknown, 0 Unchecked, 4598.54ms Time] [2021-11-07 08:46:12,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-11-07 08:46:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2021-11-07 08:46:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.2666666666666666) internal successors, (133), 109 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2021-11-07 08:46:12,209 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 25 [2021-11-07 08:46:12,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:46:12,210 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2021-11-07 08:46:12,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2021-11-07 08:46:12,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 08:46:12,211 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:46:12,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:46:12,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 08:46:12,211 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:46:12,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:46:12,212 INFO L85 PathProgramCache]: Analyzing trace with hash 968540103, now seen corresponding path program 1 times [2021-11-07 08:46:12,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:46:12,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131848788] [2021-11-07 08:46:12,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:46:12,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:46:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:46:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:46:12,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:46:12,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131848788] [2021-11-07 08:46:12,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131848788] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:46:12,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:46:12,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:46:12,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410169541] [2021-11-07 08:46:12,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:46:12,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 08:46:12,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:46:12,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 08:46:12,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:46:12,496 INFO L87 Difference]: Start difference. First operand 110 states and 133 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:14,544 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:46:14,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:46:14,948 INFO L93 Difference]: Finished difference Result 168 states and 200 transitions. [2021-11-07 08:46:14,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 08:46:14,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 08:46:14,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:46:14,949 INFO L225 Difference]: With dead ends: 168 [2021-11-07 08:46:14,950 INFO L226 Difference]: Without dead ends: 119 [2021-11-07 08:46:14,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 128.54ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:46:14,950 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 40 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2215.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.22ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2358.66ms IncrementalHoareTripleChecker+Time [2021-11-07 08:46:14,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 301 Invalid, 60 Unknown, 0 Unchecked, 1.22ms Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 1 Unknown, 0 Unchecked, 2358.66ms Time] [2021-11-07 08:46:14,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-11-07 08:46:14,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2021-11-07 08:46:14,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.2616822429906542) internal successors, (135), 111 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2021-11-07 08:46:14,973 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 25 [2021-11-07 08:46:14,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:46:14,973 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2021-11-07 08:46:14,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:14,973 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2021-11-07 08:46:14,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 08:46:14,974 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:46:14,974 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:46:14,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 08:46:14,974 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:46:14,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:46:14,975 INFO L85 PathProgramCache]: Analyzing trace with hash 895707603, now seen corresponding path program 1 times [2021-11-07 08:46:14,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:46:14,975 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342864928] [2021-11-07 08:46:14,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:46:14,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:46:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:46:15,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:46:15,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:46:15,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342864928] [2021-11-07 08:46:15,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342864928] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:46:15,127 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:46:15,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:46:15,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437875144] [2021-11-07 08:46:15,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:46:15,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:46:15,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:46:15,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:46:15,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:46:15,128 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:15,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:46:15,186 INFO L93 Difference]: Finished difference Result 153 states and 183 transitions. [2021-11-07 08:46:15,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:46:15,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 08:46:15,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:46:15,188 INFO L225 Difference]: With dead ends: 153 [2021-11-07 08:46:15,188 INFO L226 Difference]: Without dead ends: 112 [2021-11-07 08:46:15,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 59.46ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:46:15,188 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.43ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.73ms IncrementalHoareTripleChecker+Time [2021-11-07 08:46:15,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 277 Invalid, 7 Unknown, 0 Unchecked, 0.43ms Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 27.73ms Time] [2021-11-07 08:46:15,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-11-07 08:46:15,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2021-11-07 08:46:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.2476190476190476) internal successors, (131), 109 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:15,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2021-11-07 08:46:15,192 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 25 [2021-11-07 08:46:15,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:46:15,193 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2021-11-07 08:46:15,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:15,193 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2021-11-07 08:46:15,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 08:46:15,194 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:46:15,194 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:46:15,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 08:46:15,194 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:46:15,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:46:15,194 INFO L85 PathProgramCache]: Analyzing trace with hash -123775902, now seen corresponding path program 1 times [2021-11-07 08:46:15,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:46:15,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655964770] [2021-11-07 08:46:15,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:46:15,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:46:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:46:15,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:46:15,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:46:15,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655964770] [2021-11-07 08:46:15,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655964770] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:46:15,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:46:15,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 08:46:15,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216268078] [2021-11-07 08:46:15,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:46:15,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 08:46:15,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:46:15,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 08:46:15,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:46:15,657 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:16,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:46:16,467 INFO L93 Difference]: Finished difference Result 169 states and 197 transitions. [2021-11-07 08:46:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 08:46:16,467 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-07 08:46:16,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:46:16,468 INFO L225 Difference]: With dead ends: 169 [2021-11-07 08:46:16,468 INFO L226 Difference]: Without dead ends: 165 [2021-11-07 08:46:16,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 574.94ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-11-07 08:46:16,469 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 106 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 356.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.92ms SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 383.01ms IncrementalHoareTripleChecker+Time [2021-11-07 08:46:16,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 507 Invalid, 167 Unknown, 0 Unchecked, 3.92ms Time], IncrementalHoareTripleChecker [41 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 383.01ms Time] [2021-11-07 08:46:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-11-07 08:46:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 114. [2021-11-07 08:46:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.238532110091743) internal successors, (135), 113 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2021-11-07 08:46:16,473 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 27 [2021-11-07 08:46:16,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:46:16,473 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2021-11-07 08:46:16,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:16,473 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2021-11-07 08:46:16,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 08:46:16,473 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:46:16,473 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:46:16,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 08:46:16,473 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:46:16,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:46:16,474 INFO L85 PathProgramCache]: Analyzing trace with hash -933122528, now seen corresponding path program 1 times [2021-11-07 08:46:16,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:46:16,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573187676] [2021-11-07 08:46:16,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:46:16,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:46:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:46:16,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:46:16,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:46:16,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573187676] [2021-11-07 08:46:16,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573187676] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:46:16,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:46:16,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:46:16,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562030354] [2021-11-07 08:46:16,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:46:16,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:46:16,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:46:16,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:46:16,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:46:16,805 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:18,854 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:46:19,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:46:19,107 INFO L93 Difference]: Finished difference Result 169 states and 197 transitions. [2021-11-07 08:46:19,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:46:19,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-07 08:46:19,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:46:19,110 INFO L225 Difference]: With dead ends: 169 [2021-11-07 08:46:19,110 INFO L226 Difference]: Without dead ends: 117 [2021-11-07 08:46:19,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 55.06ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:46:19,111 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 25 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2143.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.97ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2271.88ms IncrementalHoareTripleChecker+Time [2021-11-07 08:46:19,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 223 Invalid, 37 Unknown, 0 Unchecked, 0.97ms Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 1 Unknown, 0 Unchecked, 2271.88ms Time] [2021-11-07 08:46:19,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-07 08:46:19,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2021-11-07 08:46:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 112 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2021-11-07 08:46:19,117 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 27 [2021-11-07 08:46:19,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:46:19,119 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2021-11-07 08:46:19,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:19,119 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2021-11-07 08:46:19,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 08:46:19,121 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:46:19,121 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:46:19,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 08:46:19,122 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:46:19,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:46:19,122 INFO L85 PathProgramCache]: Analyzing trace with hash 192748585, now seen corresponding path program 1 times [2021-11-07 08:46:19,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:46:19,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70839477] [2021-11-07 08:46:19,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:46:19,122 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:46:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:46:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:46:20,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:46:20,762 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70839477] [2021-11-07 08:46:20,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70839477] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:46:20,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:46:20,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 08:46:20,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363582621] [2021-11-07 08:46:20,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:46:20,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 08:46:20,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:46:20,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 08:46:20,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:46:20,763 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:22,806 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:46:23,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:46:23,205 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2021-11-07 08:46:23,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 08:46:23,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-07 08:46:23,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:46:23,208 INFO L225 Difference]: With dead ends: 113 [2021-11-07 08:46:23,208 INFO L226 Difference]: Without dead ends: 111 [2021-11-07 08:46:23,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 236.48ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:46:23,208 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 124 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2174.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.43ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2309.62ms IncrementalHoareTripleChecker+Time [2021-11-07 08:46:23,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 171 Invalid, 45 Unknown, 0 Unchecked, 1.43ms Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 1 Unknown, 0 Unchecked, 2309.62ms Time] [2021-11-07 08:46:23,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-11-07 08:46:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-11-07 08:46:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.2242990654205608) internal successors, (131), 110 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2021-11-07 08:46:23,212 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 36 [2021-11-07 08:46:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:46:23,213 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2021-11-07 08:46:23,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2021-11-07 08:46:23,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-07 08:46:23,213 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:46:23,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:46:23,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 08:46:23,213 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:46:23,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:46:23,214 INFO L85 PathProgramCache]: Analyzing trace with hash 547927563, now seen corresponding path program 1 times [2021-11-07 08:46:23,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:46:23,214 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885861404] [2021-11-07 08:46:23,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:46:23,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:46:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:46:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:46:23,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:46:23,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885861404] [2021-11-07 08:46:23,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885861404] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:46:23,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:46:23,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 08:46:23,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449249521] [2021-11-07 08:46:23,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:46:23,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 08:46:23,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:46:23,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 08:46:23,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:46:23,615 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:25,659 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:46:26,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:46:26,076 INFO L93 Difference]: Finished difference Result 111 states and 131 transitions. [2021-11-07 08:46:26,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:46:26,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-07 08:46:26,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:46:26,078 INFO L225 Difference]: With dead ends: 111 [2021-11-07 08:46:26,078 INFO L226 Difference]: Without dead ends: 109 [2021-11-07 08:46:26,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 211.05ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:46:26,078 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 165 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2224.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.04ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2344.88ms IncrementalHoareTripleChecker+Time [2021-11-07 08:46:26,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 155 Invalid, 60 Unknown, 0 Unchecked, 2.04ms Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 1 Unknown, 0 Unchecked, 2344.88ms Time] [2021-11-07 08:46:26,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-11-07 08:46:26,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-11-07 08:46:26,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 106 states have (on average 1.2169811320754718) internal successors, (129), 108 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:26,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2021-11-07 08:46:26,082 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 38 [2021-11-07 08:46:26,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:46:26,082 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2021-11-07 08:46:26,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:26,082 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2021-11-07 08:46:26,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-07 08:46:26,083 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:46:26,083 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:46:26,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 08:46:26,083 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:46:26,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:46:26,083 INFO L85 PathProgramCache]: Analyzing trace with hash 718836703, now seen corresponding path program 1 times [2021-11-07 08:46:26,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:46:26,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460463949] [2021-11-07 08:46:26,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:46:26,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:46:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:46:26,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:46:26,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:46:26,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460463949] [2021-11-07 08:46:26,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460463949] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:46:26,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:46:26,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 08:46:26,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644778487] [2021-11-07 08:46:26,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:46:26,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 08:46:26,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:46:26,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 08:46:26,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:46:26,590 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:28,678 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:46:30,787 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:46:31,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:46:31,337 INFO L93 Difference]: Finished difference Result 140 states and 161 transitions. [2021-11-07 08:46:31,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 08:46:31,337 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-07 08:46:31,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:46:31,338 INFO L225 Difference]: With dead ends: 140 [2021-11-07 08:46:31,338 INFO L226 Difference]: Without dead ends: 125 [2021-11-07 08:46:31,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 380.12ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-11-07 08:46:31,339 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 290 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4318.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.17ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4558.42ms IncrementalHoareTripleChecker+Time [2021-11-07 08:46:31,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 249 Invalid, 96 Unknown, 0 Unchecked, 2.17ms Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 2 Unknown, 0 Unchecked, 4558.42ms Time] [2021-11-07 08:46:31,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-11-07 08:46:31,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2021-11-07 08:46:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 108 states have (on average 1.212962962962963) internal successors, (131), 110 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2021-11-07 08:46:31,342 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 38 [2021-11-07 08:46:31,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:46:31,342 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2021-11-07 08:46:31,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2021-11-07 08:46:31,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-07 08:46:31,343 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:46:31,343 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:46:31,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 08:46:31,343 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:46:31,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:46:31,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1398895073, now seen corresponding path program 1 times [2021-11-07 08:46:31,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:46:31,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028285177] [2021-11-07 08:46:31,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:46:31,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:46:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:46:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:46:33,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:46:33,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028285177] [2021-11-07 08:46:33,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028285177] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:46:33,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:46:33,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 08:46:33,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572651519] [2021-11-07 08:46:33,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:46:33,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 08:46:33,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:46:33,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 08:46:33,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-11-07 08:46:33,290 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:35,336 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:46:37,436 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:46:39,551 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:46:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:46:40,847 INFO L93 Difference]: Finished difference Result 194 states and 225 transitions. [2021-11-07 08:46:40,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 08:46:40,847 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-07 08:46:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:46:40,848 INFO L225 Difference]: With dead ends: 194 [2021-11-07 08:46:40,848 INFO L226 Difference]: Without dead ends: 165 [2021-11-07 08:46:40,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1040.25ms TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2021-11-07 08:46:40,849 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 433 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 23 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6519.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.64ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6846.52ms IncrementalHoareTripleChecker+Time [2021-11-07 08:46:40,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [433 Valid, 366 Invalid, 189 Unknown, 0 Unchecked, 3.64ms Time], IncrementalHoareTripleChecker [23 Valid, 163 Invalid, 3 Unknown, 0 Unchecked, 6846.52ms Time] [2021-11-07 08:46:40,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-11-07 08:46:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 126. [2021-11-07 08:46:40,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 123 states have (on average 1.2113821138211383) internal successors, (149), 125 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2021-11-07 08:46:40,853 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 38 [2021-11-07 08:46:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:46:40,853 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2021-11-07 08:46:40,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2021-11-07 08:46:40,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-07 08:46:40,854 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:46:40,854 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:46:40,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 08:46:40,854 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:46:40,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:46:40,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1657060511, now seen corresponding path program 1 times [2021-11-07 08:46:40,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:46:40,854 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130790392] [2021-11-07 08:46:40,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:46:40,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:46:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:46:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:46:41,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:46:41,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130790392] [2021-11-07 08:46:41,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130790392] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:46:41,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:46:41,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-07 08:46:41,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077435103] [2021-11-07 08:46:41,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:46:41,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 08:46:41,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:46:41,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 08:46:41,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:46:41,220 INFO L87 Difference]: Start difference. First operand 126 states and 149 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:43,272 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:46:45,384 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:46:47,470 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:46:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:46:48,031 INFO L93 Difference]: Finished difference Result 180 states and 207 transitions. [2021-11-07 08:46:48,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 08:46:48,032 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-07 08:46:48,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:46:48,033 INFO L225 Difference]: With dead ends: 180 [2021-11-07 08:46:48,033 INFO L226 Difference]: Without dead ends: 150 [2021-11-07 08:46:48,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 291.70ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-07 08:46:48,033 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 186 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 12 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6323.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.93ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6653.69ms IncrementalHoareTripleChecker+Time [2021-11-07 08:46:48,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 284 Invalid, 114 Unknown, 0 Unchecked, 1.93ms Time], IncrementalHoareTripleChecker [12 Valid, 99 Invalid, 3 Unknown, 0 Unchecked, 6653.69ms Time] [2021-11-07 08:46:48,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-11-07 08:46:48,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 126. [2021-11-07 08:46:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 123 states have (on average 1.1951219512195121) internal successors, (147), 125 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 147 transitions. [2021-11-07 08:46:48,038 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 147 transitions. Word has length 38 [2021-11-07 08:46:48,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:46:48,038 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 147 transitions. [2021-11-07 08:46:48,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:48,038 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 147 transitions. [2021-11-07 08:46:48,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-07 08:46:48,039 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:46:48,039 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:46:48,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 08:46:48,039 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:46:48,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:46:48,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1490309383, now seen corresponding path program 1 times [2021-11-07 08:46:48,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:46:48,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359030801] [2021-11-07 08:46:48,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:46:48,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:46:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:46:48,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:46:48,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:46:48,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359030801] [2021-11-07 08:46:48,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359030801] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:46:48,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:46:48,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:46:48,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266028767] [2021-11-07 08:46:48,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:46:48,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 08:46:48,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:46:48,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 08:46:48,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:46:48,274 INFO L87 Difference]: Start difference. First operand 126 states and 147 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:48,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:46:48,382 INFO L93 Difference]: Finished difference Result 407 states and 474 transitions. [2021-11-07 08:46:48,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 08:46:48,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-07 08:46:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:46:48,383 INFO L225 Difference]: With dead ends: 407 [2021-11-07 08:46:48,383 INFO L226 Difference]: Without dead ends: 315 [2021-11-07 08:46:48,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 118.85ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 08:46:48,384 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 198 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.67ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.20ms IncrementalHoareTripleChecker+Time [2021-11-07 08:46:48,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 510 Invalid, 20 Unknown, 0 Unchecked, 0.67ms Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 57.20ms Time] [2021-11-07 08:46:48,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-11-07 08:46:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 129. [2021-11-07 08:46:48,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 128 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2021-11-07 08:46:48,390 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 38 [2021-11-07 08:46:48,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:46:48,391 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2021-11-07 08:46:48,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:48,392 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2021-11-07 08:46:48,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-07 08:46:48,392 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:46:48,392 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:46:48,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 08:46:48,393 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:46:48,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:46:48,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1722457971, now seen corresponding path program 1 times [2021-11-07 08:46:48,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:46:48,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471592046] [2021-11-07 08:46:48,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:46:48,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:46:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:46:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:46:50,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:46:50,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471592046] [2021-11-07 08:46:50,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471592046] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:46:50,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:46:50,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 08:46:50,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351578398] [2021-11-07 08:46:50,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:46:50,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 08:46:50,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:46:50,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 08:46:50,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-07 08:46:50,397 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:52,438 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:46:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:46:52,949 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2021-11-07 08:46:52,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 08:46:52,949 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-07 08:46:52,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:46:52,950 INFO L225 Difference]: With dead ends: 129 [2021-11-07 08:46:52,950 INFO L226 Difference]: Without dead ends: 111 [2021-11-07 08:46:52,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 424.31ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-07 08:46:52,950 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 223 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2217.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.16ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2332.99ms IncrementalHoareTripleChecker+Time [2021-11-07 08:46:52,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 168 Invalid, 73 Unknown, 0 Unchecked, 1.16ms Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 1 Unknown, 0 Unchecked, 2332.99ms Time] [2021-11-07 08:46:52,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-11-07 08:46:52,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-11-07 08:46:52,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 109 states have (on average 1.165137614678899) internal successors, (127), 110 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 127 transitions. [2021-11-07 08:46:52,954 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 127 transitions. Word has length 40 [2021-11-07 08:46:52,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:46:52,954 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 127 transitions. [2021-11-07 08:46:52,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:52,954 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2021-11-07 08:46:52,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-07 08:46:52,954 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:46:52,954 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:46:52,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 08:46:52,955 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:46:52,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:46:52,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1882862420, now seen corresponding path program 1 times [2021-11-07 08:46:52,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:46:52,955 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574932616] [2021-11-07 08:46:52,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:46:52,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:46:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:46:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:46:53,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:46:53,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574932616] [2021-11-07 08:46:53,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574932616] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:46:53,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:46:53,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 08:46:53,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652789497] [2021-11-07 08:46:53,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:46:53,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 08:46:53,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:46:53,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 08:46:53,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-07 08:46:53,254 INFO L87 Difference]: Start difference. First operand 111 states and 127 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:55,294 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:46:57,404 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:46:57,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:46:57,738 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2021-11-07 08:46:57,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 08:46:57,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-07 08:46:57,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:46:57,739 INFO L225 Difference]: With dead ends: 118 [2021-11-07 08:46:57,739 INFO L226 Difference]: Without dead ends: 87 [2021-11-07 08:46:57,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 189.96ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 08:46:57,740 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 187 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4162.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.84ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4389.82ms IncrementalHoareTripleChecker+Time [2021-11-07 08:46:57,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 173 Invalid, 50 Unknown, 0 Unchecked, 0.84ms Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 2 Unknown, 0 Unchecked, 4389.82ms Time] [2021-11-07 08:46:57,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-11-07 08:46:57,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-11-07 08:46:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 85 states have (on average 1.1176470588235294) internal successors, (95), 86 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-11-07 08:46:57,743 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 40 [2021-11-07 08:46:57,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:46:57,743 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-11-07 08:46:57,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-11-07 08:46:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-07 08:46:57,743 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:46:57,744 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:46:57,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 08:46:57,744 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:46:57,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:46:57,744 INFO L85 PathProgramCache]: Analyzing trace with hash -147813803, now seen corresponding path program 1 times [2021-11-07 08:46:57,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:46:57,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907867629] [2021-11-07 08:46:57,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:46:57,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:46:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:46:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:46:57,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:46:57,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907867629] [2021-11-07 08:46:57,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907867629] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:46:57,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:46:57,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:46:57,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104938609] [2021-11-07 08:46:57,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:46:57,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:46:57,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:46:57,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:46:57,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:46:57,950 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:58,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:46:58,033 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2021-11-07 08:46:58,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:46:58,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-07 08:46:58,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:46:58,036 INFO L225 Difference]: With dead ends: 168 [2021-11-07 08:46:58,036 INFO L226 Difference]: Without dead ends: 118 [2021-11-07 08:46:58,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 69.77ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:46:58,037 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 47 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.33ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.37ms IncrementalHoareTripleChecker+Time [2021-11-07 08:46:58,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 248 Invalid, 15 Unknown, 0 Unchecked, 0.33ms Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 54.37ms Time] [2021-11-07 08:46:58,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-07 08:46:58,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 87. [2021-11-07 08:46:58,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 86 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2021-11-07 08:46:58,041 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 40 [2021-11-07 08:46:58,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:46:58,041 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2021-11-07 08:46:58,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:46:58,041 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2021-11-07 08:46:58,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-07 08:46:58,041 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:46:58,041 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:46:58,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-07 08:46:58,041 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:46:58,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:46:58,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1440534099, now seen corresponding path program 1 times [2021-11-07 08:46:58,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:46:58,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201122502] [2021-11-07 08:46:58,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:46:58,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:46:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:46:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:46:58,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:46:58,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201122502] [2021-11-07 08:46:58,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201122502] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:46:58,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:46:58,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 08:46:58,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315051143] [2021-11-07 08:46:58,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:46:58,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 08:46:58,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:46:58,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 08:46:58,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-07 08:46:58,514 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:47:00,568 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:47:01,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:47:01,611 INFO L93 Difference]: Finished difference Result 184 states and 193 transitions. [2021-11-07 08:47:01,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 08:47:01,612 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-07 08:47:01,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:47:01,612 INFO L225 Difference]: With dead ends: 184 [2021-11-07 08:47:01,612 INFO L226 Difference]: Without dead ends: 113 [2021-11-07 08:47:01,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 837.90ms TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2021-11-07 08:47:01,613 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 53 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2359.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.34ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2507.96ms IncrementalHoareTripleChecker+Time [2021-11-07 08:47:01,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 491 Invalid, 98 Unknown, 0 Unchecked, 1.34ms Time], IncrementalHoareTripleChecker [8 Valid, 89 Invalid, 1 Unknown, 0 Unchecked, 2507.96ms Time] [2021-11-07 08:47:01,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-11-07 08:47:01,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 82. [2021-11-07 08:47:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 1.075) internal successors, (86), 81 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:47:01,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2021-11-07 08:47:01,621 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 40 [2021-11-07 08:47:01,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:47:01,621 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2021-11-07 08:47:01,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:47:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2021-11-07 08:47:01,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-07 08:47:01,622 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:47:01,622 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:47:01,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 08:47:01,623 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:47:01,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:47:01,623 INFO L85 PathProgramCache]: Analyzing trace with hash 2110548711, now seen corresponding path program 1 times [2021-11-07 08:47:01,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:47:01,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053080273] [2021-11-07 08:47:01,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:47:01,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:47:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:47:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:47:05,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:47:05,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053080273] [2021-11-07 08:47:05,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053080273] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:47:05,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:47:05,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 08:47:05,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409740338] [2021-11-07 08:47:05,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:47:05,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 08:47:05,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:47:05,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 08:47:05,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-11-07 08:47:05,155 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:47:07,195 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:47:09,297 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:47:11,427 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:47:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:47:12,994 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2021-11-07 08:47:12,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 08:47:12,995 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-07 08:47:12,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:47:12,995 INFO L225 Difference]: With dead ends: 141 [2021-11-07 08:47:12,995 INFO L226 Difference]: Without dead ends: 99 [2021-11-07 08:47:12,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1432.60ms TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2021-11-07 08:47:12,996 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 333 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6432.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.31ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6812.77ms IncrementalHoareTripleChecker+Time [2021-11-07 08:47:12,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 372 Invalid, 140 Unknown, 0 Unchecked, 2.31ms Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 3 Unknown, 0 Unchecked, 6812.77ms Time] [2021-11-07 08:47:12,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-11-07 08:47:12,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2021-11-07 08:47:12,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:47:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2021-11-07 08:47:12,999 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 41 [2021-11-07 08:47:12,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:47:12,999 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2021-11-07 08:47:12,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:47:12,999 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2021-11-07 08:47:13,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-07 08:47:13,000 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:47:13,000 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:47:13,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-07 08:47:13,000 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:47:13,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:47:13,000 INFO L85 PathProgramCache]: Analyzing trace with hash -976974734, now seen corresponding path program 1 times [2021-11-07 08:47:13,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:47:13,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109167019] [2021-11-07 08:47:13,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:47:13,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:47:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:47:15,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:47:15,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:47:15,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109167019] [2021-11-07 08:47:15,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109167019] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:47:15,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:47:15,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-07 08:47:15,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441762625] [2021-11-07 08:47:15,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:47:15,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 08:47:15,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:47:15,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 08:47:15,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-11-07 08:47:15,023 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:47:17,066 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:47:19,197 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:47:19,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:47:19,780 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2021-11-07 08:47:19,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 08:47:19,780 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-07 08:47:19,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:47:19,781 INFO L225 Difference]: With dead ends: 99 [2021-11-07 08:47:19,781 INFO L226 Difference]: Without dead ends: 61 [2021-11-07 08:47:19,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 482.23ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-11-07 08:47:19,781 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 163 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4337.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.57ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4561.80ms IncrementalHoareTripleChecker+Time [2021-11-07 08:47:19,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 333 Invalid, 110 Unknown, 0 Unchecked, 1.57ms Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 2 Unknown, 0 Unchecked, 4561.80ms Time] [2021-11-07 08:47:19,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-07 08:47:19,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-11-07 08:47:19,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:47:19,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2021-11-07 08:47:19,784 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 44 [2021-11-07 08:47:19,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:47:19,784 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2021-11-07 08:47:19,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:47:19,784 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2021-11-07 08:47:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-07 08:47:19,784 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:47:19,784 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:47:19,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-07 08:47:19,785 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:47:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:47:19,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1720530582, now seen corresponding path program 1 times [2021-11-07 08:47:19,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:47:19,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904288996] [2021-11-07 08:47:19,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:47:19,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:47:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:47:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:47:19,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:47:19,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904288996] [2021-11-07 08:47:19,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904288996] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:47:19,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:47:19,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:47:19,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685601982] [2021-11-07 08:47:19,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:47:19,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:47:19,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:47:19,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:47:19,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:47:19,910 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:47:19,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:47:19,983 INFO L93 Difference]: Finished difference Result 92 states and 91 transitions. [2021-11-07 08:47:19,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:47:19,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-07 08:47:19,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:47:19,984 INFO L225 Difference]: With dead ends: 92 [2021-11-07 08:47:19,984 INFO L226 Difference]: Without dead ends: 61 [2021-11-07 08:47:19,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.76ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:47:19,984 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 21 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.22ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.66ms IncrementalHoareTripleChecker+Time [2021-11-07 08:47:19,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 139 Invalid, 18 Unknown, 0 Unchecked, 0.22ms Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 50.66ms Time] [2021-11-07 08:47:19,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-07 08:47:19,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-11-07 08:47:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.0) internal successors, (60), 60 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:47:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 60 transitions. [2021-11-07 08:47:19,987 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 60 transitions. Word has length 60 [2021-11-07 08:47:19,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:47:19,987 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 60 transitions. [2021-11-07 08:47:19,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:47:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 60 transitions. [2021-11-07 08:47:19,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-07 08:47:19,987 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 08:47:19,987 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:47:19,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-07 08:47:19,987 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-07 08:47:19,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:47:19,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1872836840, now seen corresponding path program 1 times [2021-11-07 08:47:19,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:47:19,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241255252] [2021-11-07 08:47:19,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:47:19,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:47:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:47:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:47:23,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:47:23,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241255252] [2021-11-07 08:47:23,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241255252] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:47:23,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:47:23,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 08:47:23,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864579808] [2021-11-07 08:47:23,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 08:47:23,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 08:47:23,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:47:23,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 08:47:23,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-07 08:47:23,469 INFO L87 Difference]: Start difference. First operand 61 states and 60 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:47:25,512 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:47:27,636 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:47:29,747 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:47:31,854 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 08:47:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:47:32,367 INFO L93 Difference]: Finished difference Result 61 states and 60 transitions. [2021-11-07 08:47:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 08:47:32,368 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-07 08:47:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:47:32,368 INFO L225 Difference]: With dead ends: 61 [2021-11-07 08:47:32,368 INFO L226 Difference]: Without dead ends: 0 [2021-11-07 08:47:32,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 661.07ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-11-07 08:47:32,369 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 142 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8188.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.59ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8650.13ms IncrementalHoareTripleChecker+Time [2021-11-07 08:47:32,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 133 Invalid, 64 Unknown, 0 Unchecked, 0.59ms Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 4 Unknown, 0 Unchecked, 8650.13ms Time] [2021-11-07 08:47:32,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-07 08:47:32,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-07 08:47:32,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:47:32,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-07 08:47:32,370 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2021-11-07 08:47:32,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:47:32,370 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-07 08:47:32,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:47:32,370 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-07 08:47:32,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-07 08:47:32,372 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-11-07 08:47:32,372 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-11-07 08:47:32,372 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2021-11-07 08:47:32,372 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2021-11-07 08:47:32,372 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-11-07 08:47:32,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-07 08:47:32,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-07 08:47:37,612 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-07 08:47:37,612 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-07 08:47:37,612 INFO L861 garLoopResultBuilder]: At program point L8757(line 8757) the Hoare annotation is: true [2021-11-07 08:47:37,613 INFO L858 garLoopResultBuilder]: For program point L8741(lines 8741 8756) no Hoare annotation was computed. [2021-11-07 08:47:37,613 INFO L858 garLoopResultBuilder]: For program point L6894(lines 6894 6896) no Hoare annotation was computed. [2021-11-07 08:47:37,613 INFO L854 garLoopResultBuilder]: At program point L6894-3(lines 6893 6897) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) (.cse5 (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616))) (.cse6 (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|)) (.cse7 (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|)) (.cse8 (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset))) (or (and .cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1) .cse1 (<= ULTIMATE.start_bounded_malloc_~size (+ (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616)) 36028797018963967)) .cse2 (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_buf_init_~capacity) .cse3 .cse4 (< .cse5 ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_mem_acquire_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_can_fail_malloc_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |~#s_can_fail_allocator_static~0.offset|) .cse6 .cse7 .cse8) (and .cse0 .cse1 (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0) .cse2 .cse3 .cse4 (= |ULTIMATE.start_can_fail_malloc_#res.base| 0) (not (= .cse5 ULTIMATE.start_aws_byte_buf_init_~capacity)) .cse6 .cse7 .cse8 (<= |~#s_can_fail_allocator_static~0.offset| 0)))) [2021-11-07 08:47:37,613 INFO L858 garLoopResultBuilder]: For program point L6894-2(lines 6894 6896) no Hoare annotation was computed. [2021-11-07 08:47:37,613 INFO L858 garLoopResultBuilder]: For program point L222(lines 222 224) no Hoare annotation was computed. [2021-11-07 08:47:37,613 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-07 08:47:37,613 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-07 08:47:37,613 INFO L858 garLoopResultBuilder]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2021-11-07 08:47:37,613 INFO L858 garLoopResultBuilder]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2021-11-07 08:47:37,613 INFO L858 garLoopResultBuilder]: For program point L7159-1(line 7159) no Hoare annotation was computed. [2021-11-07 08:47:37,613 INFO L858 garLoopResultBuilder]: For program point L7159(lines 7159 7162) no Hoare annotation was computed. [2021-11-07 08:47:37,613 INFO L858 garLoopResultBuilder]: For program point L7159-4(lines 7159 7160) no Hoare annotation was computed. [2021-11-07 08:47:37,613 INFO L858 garLoopResultBuilder]: For program point L7159-3(line 7159) no Hoare annotation was computed. [2021-11-07 08:47:37,613 INFO L858 garLoopResultBuilder]: For program point L6928-2(lines 6928 6930) no Hoare annotation was computed. [2021-11-07 08:47:37,613 INFO L858 garLoopResultBuilder]: For program point L7159-9(lines 7159 7162) no Hoare annotation was computed. [2021-11-07 08:47:37,613 INFO L858 garLoopResultBuilder]: For program point L6928(lines 6928 6930) no Hoare annotation was computed. [2021-11-07 08:47:37,613 INFO L858 garLoopResultBuilder]: For program point L7159-7(lines 7159 7162) no Hoare annotation was computed. [2021-11-07 08:47:37,613 INFO L858 garLoopResultBuilder]: For program point L7159-6(lines 7159 7160) no Hoare annotation was computed. [2021-11-07 08:47:37,613 INFO L858 garLoopResultBuilder]: For program point L7159-13(lines 7159 7162) no Hoare annotation was computed. [2021-11-07 08:47:37,614 INFO L854 garLoopResultBuilder]: At program point L7159-12(lines 7157 7163) the Hoare annotation is: (let ((.cse18 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse10 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|)) (.cse16 (select .cse18 (+ 16 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (.cse17 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 24))) (let ((.cse0 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) .cse17))) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse2 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|)) (.cse3 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base)) (.cse4 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 .cse16)) (.cse5 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0)) (.cse7 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) (.cse8 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse9 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse11 (= (select .cse18 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0)) (.cse12 (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|)) (.cse13 (= (select .cse10 .cse17) ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) (.cse14 (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (select .cse10 8) 0) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 8))) .cse11 (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) .cse12 .cse13 .cse14 .cse15 (<= |~#s_can_fail_allocator_static~0.offset| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_aws_byte_buf_init_~buf.offset 0) .cse6 .cse7 .cse8 (<= .cse16 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse16) 18446744073709551616)))) .cse9 (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |~#s_can_fail_allocator_static~0.offset|) .cse11 .cse12 .cse13 .cse14 .cse15))))) [2021-11-07 08:47:37,614 INFO L858 garLoopResultBuilder]: For program point L7159-11(lines 7159 7162) no Hoare annotation was computed. [2021-11-07 08:47:37,614 INFO L858 garLoopResultBuilder]: For program point L7159-17(lines 7159 7160) no Hoare annotation was computed. [2021-11-07 08:47:37,614 INFO L858 garLoopResultBuilder]: For program point L7159-16(line 7159) no Hoare annotation was computed. [2021-11-07 08:47:37,614 INFO L858 garLoopResultBuilder]: For program point L7159-14(line 7159) no Hoare annotation was computed. [2021-11-07 08:47:37,614 INFO L858 garLoopResultBuilder]: For program point L7159-20(lines 7159 7162) no Hoare annotation was computed. [2021-11-07 08:47:37,616 INFO L858 garLoopResultBuilder]: For program point L7159-19(lines 7159 7160) no Hoare annotation was computed. [2021-11-07 08:47:37,616 INFO L854 garLoopResultBuilder]: At program point L7159-25(lines 7157 7163) the Hoare annotation is: (let ((.cse1 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse0 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 24))) (and (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) .cse0)) (<= 1 |#StackHeapBarrier|) (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 (select .cse1 (+ 16 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity) (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1) (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|) (= (select .cse1 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) .cse0) ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (<= |~#s_can_fail_allocator_static~0.offset| 0))) [2021-11-07 08:47:37,616 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-07 08:47:37,616 INFO L858 garLoopResultBuilder]: For program point L7159-24(lines 7159 7162) no Hoare annotation was computed. [2021-11-07 08:47:37,616 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-07 08:47:37,616 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-07 08:47:37,617 INFO L858 garLoopResultBuilder]: For program point L7159-22(lines 7159 7162) no Hoare annotation was computed. [2021-11-07 08:47:37,617 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-07 08:47:37,617 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-07 08:47:37,617 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-07 08:47:37,617 INFO L854 garLoopResultBuilder]: At program point L7127(lines 7110 7128) the Hoare annotation is: (let ((.cse18 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse16 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|)) (.cse10 (select .cse18 (+ 16 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset))) (.cse17 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 24))) (let ((.cse0 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) .cse17))) (.cse2 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|)) (.cse3 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base)) (.cse4 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 .cse10)) (.cse6 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base)) (.cse9 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) (.cse11 (= (select .cse18 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0)) (.cse13 (= (select .cse16 .cse17) ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) (.cse14 (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) (.cse15 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse1 (<= 1 |#StackHeapBarrier|)) (.cse5 (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0))) (.cse7 (= ULTIMATE.start_aws_byte_buf_init_~buf.offset 0)) (.cse8 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0)) (.cse12 (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse10 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse10) 18446744073709551616)))) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |~#s_can_fail_allocator_static~0.offset|) .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 (<= 0 |~#s_can_fail_allocator_static~0.offset|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (select .cse16 8) 0) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 8))) .cse11 .cse12 .cse13 .cse14 .cse15 (<= |~#s_can_fail_allocator_static~0.offset| 0)) (and .cse1 .cse5 (<= (+ |ULTIMATE.start_aws_byte_buf_init_#res| 1) 0) .cse7 .cse8 .cse12))))) [2021-11-07 08:47:37,617 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-07 08:47:37,617 INFO L858 garLoopResultBuilder]: For program point L223-9(line 223) no Hoare annotation was computed. [2021-11-07 08:47:37,617 INFO L858 garLoopResultBuilder]: For program point L223-10(line 223) no Hoare annotation was computed. [2021-11-07 08:47:37,617 INFO L858 garLoopResultBuilder]: For program point L223-12(line 223) no Hoare annotation was computed. [2021-11-07 08:47:37,617 INFO L858 garLoopResultBuilder]: For program point L223-13(line 223) no Hoare annotation was computed. [2021-11-07 08:47:37,617 INFO L854 garLoopResultBuilder]: At program point L6880(lines 6876 6881) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= ULTIMATE.start_assume_abort_if_not_~cond 1) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (<= ULTIMATE.start_bounded_malloc_~size (+ (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616)) 36028797018963967)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity) (< (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616)) ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_mem_acquire_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_can_fail_malloc_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |~#s_can_fail_allocator_static~0.offset|) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) [2021-11-07 08:47:37,617 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-07 08:47:37,617 INFO L858 garLoopResultBuilder]: For program point L7162(line 7162) no Hoare annotation was computed. [2021-11-07 08:47:37,617 INFO L858 garLoopResultBuilder]: For program point L7162-4(line 7162) no Hoare annotation was computed. [2021-11-07 08:47:37,617 INFO L858 garLoopResultBuilder]: For program point L7162-3(line 7162) no Hoare annotation was computed. [2021-11-07 08:47:37,617 INFO L858 garLoopResultBuilder]: For program point L7162-2(line 7162) no Hoare annotation was computed. [2021-11-07 08:47:37,617 INFO L858 garLoopResultBuilder]: For program point L7162-8(line 7162) no Hoare annotation was computed. [2021-11-07 08:47:37,617 INFO L854 garLoopResultBuilder]: At program point L6931(lines 6922 6932) the Hoare annotation is: (let ((.cse0 (<= 1 |#StackHeapBarrier|)) (.cse1 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0)) (.cse4 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) (.cse5 (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616))) (.cse6 (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|)) (.cse7 (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|)) (.cse8 (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset))) (or (and .cse0 (= ULTIMATE.start_assume_abort_if_not_~cond 1) .cse1 (<= ULTIMATE.start_bounded_malloc_~size (+ (* 18446744073709551616 (div ULTIMATE.start_bounded_malloc_~size 18446744073709551616)) 36028797018963967)) .cse2 (= ULTIMATE.start_bounded_malloc_~size ULTIMATE.start_aws_byte_buf_init_~capacity) .cse3 .cse4 (< .cse5 ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_mem_acquire_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_can_fail_malloc_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |~#s_can_fail_allocator_static~0.offset|) .cse6 .cse7 .cse8) (and .cse0 .cse1 (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= ULTIMATE.start_aws_mem_acquire_~mem~0.offset 0) .cse2 .cse3 .cse4 (= |ULTIMATE.start_aws_mem_acquire_#res.base| 0) (not (= .cse5 ULTIMATE.start_aws_byte_buf_init_~capacity)) .cse6 (= ULTIMATE.start_aws_mem_acquire_~mem~0.base 0) .cse7 (= |ULTIMATE.start_aws_mem_acquire_#res.offset| 0) .cse8 (<= |~#s_can_fail_allocator_static~0.offset| 0)))) [2021-11-07 08:47:37,617 INFO L858 garLoopResultBuilder]: For program point L7162-6(line 7162) no Hoare annotation was computed. [2021-11-07 08:47:37,617 INFO L858 garLoopResultBuilder]: For program point L7162-12(line 7162) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point L7162-11(line 7162) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point L7162-9(line 7162) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point L7162-15(line 7162) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point L7162-13(line 7162) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point L7162-17(line 7162) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 7114 7116) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point L8749(lines 8749 8755) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point L8749-2(lines 8749 8755) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point L7114-1(lines 7114 7116) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L858 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-11-07 08:47:37,618 INFO L854 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity) (< (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616)) ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_mem_acquire_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_can_fail_malloc_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |~#s_can_fail_allocator_static~0.offset|) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) [2021-11-07 08:47:37,618 INFO L854 garLoopResultBuilder]: At program point L6884-1(lines 6883 6885) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity) (< (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616)) ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_mem_acquire_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |~#s_can_fail_allocator_static~0.offset|) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) [2021-11-07 08:47:37,619 INFO L854 garLoopResultBuilder]: At program point L6884(lines 6883 6885) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= |~#s_can_fail_allocator_static~0.offset| 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0) (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|)) [2021-11-07 08:47:37,619 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7101) no Hoare annotation was computed. [2021-11-07 08:47:37,619 INFO L858 garLoopResultBuilder]: For program point L7117-2(lines 7117 7121) no Hoare annotation was computed. [2021-11-07 08:47:37,619 INFO L858 garLoopResultBuilder]: For program point L7117(lines 7117 7118) no Hoare annotation was computed. [2021-11-07 08:47:37,619 INFO L854 garLoopResultBuilder]: At program point L6919(lines 6917 6920) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity) (< (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616)) ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_mem_acquire_~size ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |~#s_can_fail_allocator_static~0.offset|) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) [2021-11-07 08:47:37,619 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-07 08:47:37,619 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-07 08:47:37,619 INFO L854 garLoopResultBuilder]: At program point L1998(lines 1988 1999) the Hoare annotation is: (and (<= 1 |#StackHeapBarrier|) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (<= 0 |~#s_can_fail_allocator_static~0.offset|) (= ULTIMATE.start_aws_mem_acquire_~mem~0.offset 0) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity) (not (= (* 18446744073709551616 (div ULTIMATE.start_aws_byte_buf_init_~capacity 18446744073709551616)) ULTIMATE.start_aws_byte_buf_init_~capacity)) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (= ULTIMATE.start_aws_mem_acquire_~mem~0.base 0) (<= 2 |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset) (<= |~#s_can_fail_allocator_static~0.offset| 0)) [2021-11-07 08:47:37,621 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:47:37,622 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 08:47:37,633 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:37,634 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:37,634 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:37,634 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:37,635 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:37,635 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:37,636 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:37,636 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:37,637 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:37,637 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:37,637 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:37,637 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:37,643 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:37,643 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:37,643 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:37,643 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:37,644 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:37,644 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:37,645 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:37,645 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:37,645 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:37,645 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:37,645 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:37,646 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:37,647 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:37,647 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:37,647 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:37,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:37,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:47:37 BoogieIcfgContainer [2021-11-07 08:47:37,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 08:47:37,649 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 08:47:37,649 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 08:47:37,650 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 08:47:37,650 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:45:54" (3/4) ... [2021-11-07 08:47:37,652 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-07 08:47:37,667 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 125 nodes and edges [2021-11-07 08:47:37,668 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2021-11-07 08:47:37,669 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2021-11-07 08:47:37,670 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-07 08:47:37,671 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-07 08:47:37,671 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-07 08:47:37,672 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-07 08:47:37,673 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-07 08:47:37,691 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((allocator == #memory_$Pointer$[buf][buf + 24] && 1 <= unknown-#StackHeapBarrier-unknown) && buf == buf) && allocator == allocator) && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && !(buf == 0)) && buf == buf) && buf == 0) && buf == 0) && capacity == capacity) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616)) && buf == s_can_fail_allocator_static) && unknown-#memory_int-unknown[buf][buf] == 0) && 2 <= buf) && #memory_$Pointer$[buf][buf + 24] == allocator) && allocator == allocator) && buf == buf) || ((((((((((((((((((allocator == #memory_$Pointer$[buf][buf + 24] && 1 <= unknown-#StackHeapBarrier-unknown) && buf == buf) && allocator == allocator) && 0 <= s_can_fail_allocator_static) && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && !(buf == 0)) && buf == buf) && buf == 0) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][8] == 0) && 0 == #memory_$Pointer$[buf][buf + 8]) && unknown-#memory_int-unknown[buf][buf] == 0) && 2 <= buf) && #memory_$Pointer$[buf][buf + 24] == allocator) && allocator == allocator) && buf == buf) && s_can_fail_allocator_static <= 0)) || (((((1 <= unknown-#StackHeapBarrier-unknown && !(buf == 0)) && \result + 1 <= 0) && buf == 0) && buf == 0) && 2 <= buf) [2021-11-07 08:47:37,692 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((allocator == #memory_$Pointer$[buf][buf + 24] && 1 <= unknown-#StackHeapBarrier-unknown) && buf == buf) && allocator == allocator) && 0 <= s_can_fail_allocator_static) && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && buf == buf) && buf == 0) && capacity == capacity) && \result <= 1) && 1 <= \result) && #memory_$Pointer$[buf][8] == 0) && 0 == #memory_$Pointer$[buf][buf + 8]) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && 2 <= buf) && #memory_$Pointer$[buf][buf + 24] == allocator) && allocator == allocator) && buf == buf) && s_can_fail_allocator_static <= 0) || (((((((((((((((((allocator == #memory_$Pointer$[buf][buf + 24] && 1 <= unknown-#StackHeapBarrier-unknown) && buf == buf) && allocator == allocator) && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && buf == buf) && buf == 0) && buf == 0) && capacity == capacity) && \result <= 1) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616)) && 1 <= \result) && buf == s_can_fail_allocator_static) && unknown-#memory_int-unknown[buf][buf] == 0) && 2 <= buf) && #memory_$Pointer$[buf][buf + 24] == allocator) && allocator == allocator) && buf == buf) [2021-11-07 08:47:37,692 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((1 <= unknown-#StackHeapBarrier-unknown && cond == 1) && allocator == allocator) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && buf == buf) && size == capacity) && buf == 0) && capacity == capacity) && 18446744073709551616 * (capacity / 18446744073709551616) < capacity) && size == capacity) && size == capacity) && buf == s_can_fail_allocator_static) && buf == buf) && 2 <= buf) && allocator == allocator) || ((((((((((((1 <= unknown-#StackHeapBarrier-unknown && allocator == allocator) && 0 <= s_can_fail_allocator_static) && \result == 0) && buf == buf) && buf == 0) && capacity == capacity) && \result == 0) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && buf == buf) && 2 <= buf) && allocator == allocator) && s_can_fail_allocator_static <= 0) [2021-11-07 08:47:37,692 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((allocator == #memory_$Pointer$[buf][buf + 24] && 1 <= unknown-#StackHeapBarrier-unknown) && buf == buf) && allocator == allocator) && 0 <= s_can_fail_allocator_static) && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && buf == buf) && buf == 0) && capacity == capacity) && \result <= 1) && 1 <= \result) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && 2 <= buf) && #memory_$Pointer$[buf][buf + 24] == allocator) && allocator == allocator) && buf == buf) && s_can_fail_allocator_static <= 0 [2021-11-07 08:47:37,692 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((1 <= unknown-#StackHeapBarrier-unknown && cond == 1) && allocator == allocator) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && buf == buf) && size == capacity) && buf == 0) && capacity == capacity) && 18446744073709551616 * (capacity / 18446744073709551616) < capacity) && size == capacity) && size == capacity) && buf == s_can_fail_allocator_static) && buf == buf) && 2 <= buf) && allocator == allocator) || ((((((((((((((1 <= unknown-#StackHeapBarrier-unknown && allocator == allocator) && 0 <= s_can_fail_allocator_static) && mem == 0) && buf == buf) && buf == 0) && capacity == capacity) && \result == 0) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && buf == buf) && mem == 0) && 2 <= buf) && \result == 0) && allocator == allocator) && s_can_fail_allocator_static <= 0) [2021-11-07 08:47:38,201 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-07 08:47:38,201 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 08:47:38,201 INFO L158 Benchmark]: Toolchain (without parser) took 112283.35ms. Allocated memory was 127.9MB in the beginning and 612.4MB in the end (delta: 484.4MB). Free memory was 96.2MB in the beginning and 393.2MB in the end (delta: -297.1MB). Peak memory consumption was 413.7MB. Max. memory is 16.1GB. [2021-11-07 08:47:38,202 INFO L158 Benchmark]: CDTParser took 5.53ms. Allocated memory is still 127.9MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-07 08:47:38,202 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1466.63ms. Allocated memory was 127.9MB in the beginning and 192.9MB in the end (delta: 65.0MB). Free memory was 95.7MB in the beginning and 118.8MB in the end (delta: -23.1MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. [2021-11-07 08:47:38,202 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.33ms. Allocated memory is still 192.9MB. Free memory was 118.8MB in the beginning and 107.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-07 08:47:38,202 INFO L158 Benchmark]: Boogie Preprocessor took 47.53ms. Allocated memory is still 192.9MB. Free memory was 107.3MB in the beginning and 99.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-07 08:47:38,202 INFO L158 Benchmark]: RCFGBuilder took 7243.98ms. Allocated memory was 192.9MB in the beginning and 352.3MB in the end (delta: 159.4MB). Free memory was 99.9MB in the beginning and 293.2MB in the end (delta: -193.3MB). Peak memory consumption was 182.0MB. Max. memory is 16.1GB. [2021-11-07 08:47:38,203 INFO L158 Benchmark]: TraceAbstraction took 102857.92ms. Allocated memory was 352.3MB in the beginning and 612.4MB in the end (delta: 260.0MB). Free memory was 292.5MB in the beginning and 396.6MB in the end (delta: -104.0MB). Peak memory consumption was 374.8MB. Max. memory is 16.1GB. [2021-11-07 08:47:38,203 INFO L158 Benchmark]: Witness Printer took 551.64ms. Allocated memory is still 612.4MB. Free memory was 396.6MB in the beginning and 393.2MB in the end (delta: 3.3MB). Peak memory consumption was 229.8MB. Max. memory is 16.1GB. [2021-11-07 08:47:38,204 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 5.53ms. Allocated memory is still 127.9MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1466.63ms. Allocated memory was 127.9MB in the beginning and 192.9MB in the end (delta: 65.0MB). Free memory was 95.7MB in the beginning and 118.8MB in the end (delta: -23.1MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.33ms. Allocated memory is still 192.9MB. Free memory was 118.8MB in the beginning and 107.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.53ms. Allocated memory is still 192.9MB. Free memory was 107.3MB in the beginning and 99.9MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 7243.98ms. Allocated memory was 192.9MB in the beginning and 352.3MB in the end (delta: 159.4MB). Free memory was 99.9MB in the beginning and 293.2MB in the end (delta: -193.3MB). Peak memory consumption was 182.0MB. Max. memory is 16.1GB. * TraceAbstraction took 102857.92ms. Allocated memory was 352.3MB in the beginning and 612.4MB in the end (delta: 260.0MB). Free memory was 292.5MB in the beginning and 396.6MB in the end (delta: -104.0MB). Peak memory consumption was 374.8MB. Max. memory is 16.1GB. * Witness Printer took 551.64ms. Allocated memory is still 612.4MB. Free memory was 396.6MB in the beginning and 393.2MB in the end (delta: 3.3MB). Peak memory consumption was 229.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 102777.32ms, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 28.66ms, AutomataDifference: 74483.87ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 5238.98ms, InitialAbstractionConstructionTime: 8.67ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 30 mSolverCounterUnknown, 3577 SdHoareTripleChecker+Valid, 69194.50ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3577 mSDsluCounter, 7065 SdHoareTripleChecker+Invalid, 65503.87ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5024 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1605 IncrementalHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 2041 mSDtfsCounter, 1605 mSolverCounterSat, 44.50ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 8518.07ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=17, InterpolantAutomatonStates: 179, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 158.28ms AutomataMinimizationTime, 25 MinimizatonAttempts, 575 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 32 NumberOfFragments, 919 HoareAnnotationTreeSize, 12 FomulaSimplifications, 90 FormulaSimplificationTreeSizeReduction, 719.11ms HoareSimplificationTime, 12 FomulaSimplificationsInter, 203155 FormulaSimplificationTreeSizeReductionInter, 4510.66ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 275.20ms SsaConstructionTime, 14490.96ms SatisfiabilityAnalysisTime, 7703.66ms InterpolantComputationTime, 846 NumberOfCodeBlocks, 846 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 821 ConstructedInterpolants, 0 QuantifiedInterpolants, 5333 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 6883]: Loop Invariant Derived loop invariant: (((((((((1 <= unknown-#StackHeapBarrier-unknown && allocator == allocator) && buf == buf) && buf == 0) && capacity == capacity) && 18446744073709551616 * (capacity / 18446744073709551616) < capacity) && size == capacity) && buf == s_can_fail_allocator_static) && buf == buf) && 2 <= buf) && allocator == allocator - InvariantResult [Line: 6876]: Loop Invariant Derived loop invariant: (((((((((((((1 <= unknown-#StackHeapBarrier-unknown && cond == 1) && allocator == allocator) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && buf == buf) && size == capacity) && buf == 0) && capacity == capacity) && 18446744073709551616 * (capacity / 18446744073709551616) < capacity) && size == capacity) && size == capacity) && buf == s_can_fail_allocator_static) && buf == buf) && 2 <= buf) && allocator == allocator - InvariantResult [Line: 7157]: Loop Invariant [2021-11-07 08:47:38,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:38,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:38,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:38,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:38,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:38,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:38,224 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:38,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:38,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:38,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:38,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:38,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((allocator == #memory_$Pointer$[buf][buf + 24] && 1 <= unknown-#StackHeapBarrier-unknown) && buf == buf) && allocator == allocator) && 0 <= s_can_fail_allocator_static) && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && buf == buf) && buf == 0) && capacity == capacity) && \result <= 1) && 1 <= \result) && #memory_$Pointer$[buf][8] == 0) && 0 == #memory_$Pointer$[buf][buf + 8]) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && 2 <= buf) && #memory_$Pointer$[buf][buf + 24] == allocator) && allocator == allocator) && buf == buf) && s_can_fail_allocator_static <= 0) || (((((((((((((((((allocator == #memory_$Pointer$[buf][buf + 24] && 1 <= unknown-#StackHeapBarrier-unknown) && buf == buf) && allocator == allocator) && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && buf == buf) && buf == 0) && buf == 0) && capacity == capacity) && \result <= 1) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616)) && 1 <= \result) && buf == s_can_fail_allocator_static) && unknown-#memory_int-unknown[buf][buf] == 0) && 2 <= buf) && #memory_$Pointer$[buf][buf + 24] == allocator) && allocator == allocator) && buf == buf) - InvariantResult [Line: 6893]: Loop Invariant Derived loop invariant: ((((((((((((((1 <= unknown-#StackHeapBarrier-unknown && cond == 1) && allocator == allocator) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && buf == buf) && size == capacity) && buf == 0) && capacity == capacity) && 18446744073709551616 * (capacity / 18446744073709551616) < capacity) && size == capacity) && size == capacity) && buf == s_can_fail_allocator_static) && buf == buf) && 2 <= buf) && allocator == allocator) || ((((((((((((1 <= unknown-#StackHeapBarrier-unknown && allocator == allocator) && 0 <= s_can_fail_allocator_static) && \result == 0) && buf == buf) && buf == 0) && capacity == capacity) && \result == 0) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && buf == buf) && 2 <= buf) && allocator == allocator) && s_can_fail_allocator_static <= 0) - InvariantResult [Line: 6883]: Loop Invariant Derived loop invariant: ((1 <= unknown-#StackHeapBarrier-unknown && s_can_fail_allocator_static == 0) && buf == 0) && 2 <= buf - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: (((((((((((1 <= unknown-#StackHeapBarrier-unknown && allocator == allocator) && 0 <= s_can_fail_allocator_static) && mem == 0) && buf == buf) && buf == 0) && capacity == capacity) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && buf == buf) && mem == 0) && 2 <= buf) && allocator == allocator) && s_can_fail_allocator_static <= 0 - InvariantResult [Line: 6922]: Loop Invariant Derived loop invariant: ((((((((((((((1 <= unknown-#StackHeapBarrier-unknown && cond == 1) && allocator == allocator) && size <= 18446744073709551616 * (size / 18446744073709551616) + 36028797018963967) && buf == buf) && size == capacity) && buf == 0) && capacity == capacity) && 18446744073709551616 * (capacity / 18446744073709551616) < capacity) && size == capacity) && size == capacity) && buf == s_can_fail_allocator_static) && buf == buf) && 2 <= buf) && allocator == allocator) || ((((((((((((((1 <= unknown-#StackHeapBarrier-unknown && allocator == allocator) && 0 <= s_can_fail_allocator_static) && mem == 0) && buf == buf) && buf == 0) && capacity == capacity) && \result == 0) && !(18446744073709551616 * (capacity / 18446744073709551616) == capacity)) && buf == buf) && mem == 0) && 2 <= buf) && \result == 0) && allocator == allocator) && s_can_fail_allocator_static <= 0) - InvariantResult [Line: 6917]: Loop Invariant Derived loop invariant: (((((((((1 <= unknown-#StackHeapBarrier-unknown && allocator == allocator) && buf == buf) && buf == 0) && capacity == capacity) && 18446744073709551616 * (capacity / 18446744073709551616) < capacity) && size == capacity) && buf == s_can_fail_allocator_static) && buf == buf) && 2 <= buf) && allocator == allocator - InvariantResult [Line: 7110]: Loop Invariant [2021-11-07 08:47:38,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:38,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:38,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:38,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:38,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:38,231 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:38,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:38,232 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:38,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:38,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:38,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:38,233 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((allocator == #memory_$Pointer$[buf][buf + 24] && 1 <= unknown-#StackHeapBarrier-unknown) && buf == buf) && allocator == allocator) && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && !(buf == 0)) && buf == buf) && buf == 0) && buf == 0) && capacity == capacity) && unknown-#memory_int-unknown[buf][16 + buf] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16 + buf]) / 18446744073709551616)) && buf == s_can_fail_allocator_static) && unknown-#memory_int-unknown[buf][buf] == 0) && 2 <= buf) && #memory_$Pointer$[buf][buf + 24] == allocator) && allocator == allocator) && buf == buf) || ((((((((((((((((((allocator == #memory_$Pointer$[buf][buf + 24] && 1 <= unknown-#StackHeapBarrier-unknown) && buf == buf) && allocator == allocator) && 0 <= s_can_fail_allocator_static) && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && !(buf == 0)) && buf == buf) && buf == 0) && buf == 0) && capacity == capacity) && #memory_$Pointer$[buf][8] == 0) && 0 == #memory_$Pointer$[buf][buf + 8]) && unknown-#memory_int-unknown[buf][buf] == 0) && 2 <= buf) && #memory_$Pointer$[buf][buf + 24] == allocator) && allocator == allocator) && buf == buf) && s_can_fail_allocator_static <= 0)) || (((((1 <= unknown-#StackHeapBarrier-unknown && !(buf == 0)) && \result + 1 <= 0) && buf == 0) && buf == 0) && 2 <= buf) - InvariantResult [Line: 7157]: Loop Invariant [2021-11-07 08:47:38,234 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:38,234 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-07 08:47:38,234 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-07 08:47:38,234 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((allocator == #memory_$Pointer$[buf][buf + 24] && 1 <= unknown-#StackHeapBarrier-unknown) && buf == buf) && allocator == allocator) && 0 <= s_can_fail_allocator_static) && capacity == unknown-#memory_int-unknown[buf][16 + buf]) && buf == buf) && buf == 0) && capacity == capacity) && \result <= 1) && 1 <= \result) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && 2 <= buf) && #memory_$Pointer$[buf][buf + 24] == allocator) && allocator == allocator) && buf == buf) && s_can_fail_allocator_static <= 0 - InvariantResult [Line: 8757]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((((((((1 <= unknown-#StackHeapBarrier-unknown && allocator == allocator) && buf == buf) && buf == 0) && capacity == capacity) && 18446744073709551616 * (capacity / 18446744073709551616) < capacity) && size == capacity) && size == capacity) && buf == s_can_fail_allocator_static) && buf == buf) && 2 <= buf) && allocator == allocator RESULT: Ultimate proved your program to be correct! [2021-11-07 08:47:38,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE