./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 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_cursor_from_array_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 704abadf4a8c9a8af61418181b8ae91b3e3da2fe96f0fde7751e748b781a863c --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 00:22:45,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 00:22:45,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 00:22:45,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 00:22:45,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 00:22:45,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 00:22:45,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 00:22:45,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 00:22:45,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 00:22:45,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 00:22:45,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 00:22:45,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 00:22:45,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 00:22:45,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 00:22:45,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 00:22:45,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 00:22:45,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 00:22:45,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 00:22:45,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 00:22:45,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 00:22:45,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 00:22:45,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 00:22:45,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 00:22:45,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 00:22:45,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 00:22:45,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 00:22:45,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 00:22:45,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 00:22:45,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 00:22:45,225 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 00:22:45,225 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 00:22:45,226 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 00:22:45,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 00:22:45,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 00:22:45,227 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 00:22:45,228 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 00:22:45,228 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 00:22:45,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 00:22:45,229 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 00:22:45,229 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 00:22:45,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 00:22:45,230 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-18 00:22:45,244 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 00:22:45,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 00:22:45,244 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 00:22:45,244 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 00:22:45,245 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 00:22:45,245 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 00:22:45,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 00:22:45,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 00:22:45,246 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 00:22:45,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 00:22:45,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 00:22:45,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 00:22:45,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 00:22:45,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 00:22:45,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 00:22:45,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 00:22:45,247 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 00:22:45,248 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 00:22:45,248 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 00:22:45,248 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 00:22:45,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 00:22:45,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 00:22:45,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 00:22:45,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 00:22:45,249 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 00:22:45,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 00:22:45,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 00:22:45,249 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 00:22:45,250 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 00:22:45,250 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 00:22:45,250 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 00:22:45,250 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 -> 704abadf4a8c9a8af61418181b8ae91b3e3da2fe96f0fde7751e748b781a863c [2021-12-18 00:22:45,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 00:22:45,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 00:22:45,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 00:22:45,458 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 00:22:45,459 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 00:22:45,463 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2021-12-18 00:22:45,532 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8343178bd/8b14d591bcca4395b51a975192e3c2a6/FLAG50a7eaddf [2021-12-18 00:22:46,043 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 00:22:46,043 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2021-12-18 00:22:46,070 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8343178bd/8b14d591bcca4395b51a975192e3c2a6/FLAG50a7eaddf [2021-12-18 00:22:46,306 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8343178bd/8b14d591bcca4395b51a975192e3c2a6 [2021-12-18 00:22:46,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 00:22:46,309 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 00:22:46,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 00:22:46,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 00:22:46,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 00:22:46,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:22:46" (1/1) ... [2021-12-18 00:22:46,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@265f95e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:46, skipping insertion in model container [2021-12-18 00:22:46,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:22:46" (1/1) ... [2021-12-18 00:22:46,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 00:22:46,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 00:22:46,608 WARN L230 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_cursor_from_array_harness.i[4500,4513] [2021-12-18 00:22:46,613 WARN L230 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_cursor_from_array_harness.i[4560,4573] [2021-12-18 00:22:47,215 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:47,223 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:47,224 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:47,224 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:47,225 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:47,233 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:47,241 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:47,249 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:47,251 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:47,570 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-18 00:22:47,571 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-18 00:22:47,575 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-18 00:22:47,577 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-18 00:22:47,578 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-18 00:22:47,578 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-18 00:22:47,579 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-18 00:22:47,580 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-18 00:22:47,582 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-18 00:22:47,583 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-18 00:22:47,726 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-18 00:22:47,871 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:47,871 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:47,946 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 00:22:47,983 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 00:22:48,000 WARN L230 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_cursor_from_array_harness.i[4500,4513] [2021-12-18 00:22:48,002 WARN L230 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_cursor_from_array_harness.i[4560,4573] [2021-12-18 00:22:48,046 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:48,046 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:48,047 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:48,047 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:48,048 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:48,055 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:48,056 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:48,057 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:48,057 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:48,081 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-18 00:22:48,082 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-18 00:22:48,082 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-18 00:22:48,083 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-18 00:22:48,083 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-18 00:22:48,084 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-18 00:22:48,084 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-18 00:22:48,086 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-18 00:22:48,086 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-18 00:22:48,086 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-18 00:22:48,101 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-18 00:22:48,148 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:48,148 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-18 00:22:48,167 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 00:22:48,327 INFO L208 MainTranslator]: Completed translation [2021-12-18 00:22:48,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:48 WrapperNode [2021-12-18 00:22:48,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 00:22:48,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 00:22:48,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 00:22:48,328 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 00:22:48,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:48" (1/1) ... [2021-12-18 00:22:48,415 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:48" (1/1) ... [2021-12-18 00:22:48,470 INFO L137 Inliner]: procedures = 690, calls = 2609, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 777 [2021-12-18 00:22:48,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 00:22:48,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 00:22:48,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 00:22:48,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 00:22:48,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:48" (1/1) ... [2021-12-18 00:22:48,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:48" (1/1) ... [2021-12-18 00:22:48,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:48" (1/1) ... [2021-12-18 00:22:48,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:48" (1/1) ... [2021-12-18 00:22:48,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:48" (1/1) ... [2021-12-18 00:22:48,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:48" (1/1) ... [2021-12-18 00:22:48,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:48" (1/1) ... [2021-12-18 00:22:48,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 00:22:48,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 00:22:48,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 00:22:48,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 00:22:48,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:48" (1/1) ... [2021-12-18 00:22:48,562 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 00:22:48,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:22:48,592 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-12-18 00:22:48,600 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-12-18 00:22:48,619 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2021-12-18 00:22:48,619 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2021-12-18 00:22:48,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 00:22:48,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 00:22:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-18 00:22:48,620 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-18 00:22:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 00:22:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 00:22:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 00:22:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 00:22:48,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 00:22:48,621 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-18 00:22:48,622 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-18 00:22:48,622 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-18 00:22:48,622 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-18 00:22:48,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 00:22:48,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 00:22:48,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 00:22:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-18 00:22:48,623 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-18 00:22:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 00:22:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 00:22:48,817 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 00:22:48,818 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 00:22:49,171 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 00:22:49,175 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 00:22:49,175 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-18 00:22:49,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:22:49 BoogieIcfgContainer [2021-12-18 00:22:49,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 00:22:49,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 00:22:49,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 00:22:49,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 00:22:49,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:22:46" (1/3) ... [2021-12-18 00:22:49,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2d14e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:22:49, skipping insertion in model container [2021-12-18 00:22:49,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:22:48" (2/3) ... [2021-12-18 00:22:49,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2d14e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:22:49, skipping insertion in model container [2021-12-18 00:22:49,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:22:49" (3/3) ... [2021-12-18 00:22:49,182 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_array_harness.i [2021-12-18 00:22:49,185 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 00:22:49,185 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-18 00:22:49,210 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 00:22:49,213 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-12-18 00:22:49,214 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-18 00:22:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-12-18 00:22:49,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-18 00:22:49,226 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:22:49,226 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:22:49,226 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:22:49,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:22:49,229 INFO L85 PathProgramCache]: Analyzing trace with hash -860547149, now seen corresponding path program 1 times [2021-12-18 00:22:49,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:22:49,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072581227] [2021-12-18 00:22:49,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:22:49,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:22:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:49,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:22:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:49,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:22:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:49,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 00:22:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:49,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 00:22:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 00:22:49,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:22:49,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072581227] [2021-12-18 00:22:49,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072581227] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:22:49,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:22:49,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 00:22:49,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002836167] [2021-12-18 00:22:49,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:22:49,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 00:22:49,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:22:49,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 00:22:49,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 00:22:49,580 INFO L87 Difference]: Start difference. First operand has 61 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 43 states have internal predecessors, (52), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 00:22:49,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:22:49,664 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2021-12-18 00:22:49,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 00:22:49,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2021-12-18 00:22:49,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:22:49,673 INFO L225 Difference]: With dead ends: 117 [2021-12-18 00:22:49,677 INFO L226 Difference]: Without dead ends: 54 [2021-12-18 00:22:49,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 00:22:49,686 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:22:49,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 89 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:22:49,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-12-18 00:22:49,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-12-18 00:22:49,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-18 00:22:49,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2021-12-18 00:22:49,731 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 29 [2021-12-18 00:22:49,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:22:49,731 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2021-12-18 00:22:49,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 00:22:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2021-12-18 00:22:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-18 00:22:49,734 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:22:49,734 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:22:49,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 00:22:49,734 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:22:49,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:22:49,738 INFO L85 PathProgramCache]: Analyzing trace with hash 617864563, now seen corresponding path program 1 times [2021-12-18 00:22:49,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:22:49,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919551725] [2021-12-18 00:22:49,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:22:49,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:22:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:49,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:22:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:49,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:22:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:49,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 00:22:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:49,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 00:22:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 00:22:49,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:22:49,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919551725] [2021-12-18 00:22:49,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919551725] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:22:49,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:22:49,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 00:22:49,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597835041] [2021-12-18 00:22:49,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:22:49,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 00:22:49,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:22:49,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 00:22:49,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-18 00:22:49,973 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 00:22:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:22:50,104 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2021-12-18 00:22:50,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 00:22:50,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2021-12-18 00:22:50,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:22:50,106 INFO L225 Difference]: With dead ends: 99 [2021-12-18 00:22:50,106 INFO L226 Difference]: Without dead ends: 57 [2021-12-18 00:22:50,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-18 00:22:50,107 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 45 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:22:50,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 131 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:22:50,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-18 00:22:50,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-12-18 00:22:50,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2021-12-18 00:22:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2021-12-18 00:22:50,114 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 29 [2021-12-18 00:22:50,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:22:50,115 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2021-12-18 00:22:50,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-18 00:22:50,115 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2021-12-18 00:22:50,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-18 00:22:50,115 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:22:50,116 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 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-12-18 00:22:50,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 00:22:50,116 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:22:50,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:22:50,116 INFO L85 PathProgramCache]: Analyzing trace with hash 633470424, now seen corresponding path program 1 times [2021-12-18 00:22:50,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:22:50,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944936783] [2021-12-18 00:22:50,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:22:50,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:22:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:50,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:22:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:50,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:22:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:50,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 00:22:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:50,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 00:22:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 00:22:50,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:22:50,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944936783] [2021-12-18 00:22:50,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944936783] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:22:50,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:22:50,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 00:22:50,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291656959] [2021-12-18 00:22:50,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:22:50,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 00:22:50,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:22:50,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 00:22:50,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 00:22:50,329 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-18 00:22:50,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:22:50,519 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2021-12-18 00:22:50,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 00:22:50,520 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2021-12-18 00:22:50,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:22:50,521 INFO L225 Difference]: With dead ends: 69 [2021-12-18 00:22:50,521 INFO L226 Difference]: Without dead ends: 67 [2021-12-18 00:22:50,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-18 00:22:50,522 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 47 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:22:50,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 287 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:22:50,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-18 00:22:50,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2021-12-18 00:22:50,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 47 states have internal predecessors, (50), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-12-18 00:22:50,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2021-12-18 00:22:50,529 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 31 [2021-12-18 00:22:50,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:22:50,529 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2021-12-18 00:22:50,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-18 00:22:50,530 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2021-12-18 00:22:50,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-18 00:22:50,530 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:22:50,530 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 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-12-18 00:22:50,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 00:22:50,531 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:22:50,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:22:50,531 INFO L85 PathProgramCache]: Analyzing trace with hash -843890528, now seen corresponding path program 1 times [2021-12-18 00:22:50,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:22:50,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913313308] [2021-12-18 00:22:50,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:22:50,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:22:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:50,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:22:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:50,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:22:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:50,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 00:22:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:50,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 00:22:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:50,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 00:22:50,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:22:50,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913313308] [2021-12-18 00:22:50,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913313308] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:22:50,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:22:50,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 00:22:50,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491349491] [2021-12-18 00:22:50,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:22:50,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 00:22:50,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:22:50,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 00:22:50,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-18 00:22:50,845 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-18 00:22:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:22:51,112 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2021-12-18 00:22:51,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 00:22:51,113 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2021-12-18 00:22:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:22:51,114 INFO L225 Difference]: With dead ends: 127 [2021-12-18 00:22:51,114 INFO L226 Difference]: Without dead ends: 78 [2021-12-18 00:22:51,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-12-18 00:22:51,116 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 86 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:22:51,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 262 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:22:51,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-18 00:22:51,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2021-12-18 00:22:51,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 51 states have internal predecessors, (55), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-12-18 00:22:51,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2021-12-18 00:22:51,122 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 35 [2021-12-18 00:22:51,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:22:51,122 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2021-12-18 00:22:51,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-18 00:22:51,122 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2021-12-18 00:22:51,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-18 00:22:51,123 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:22:51,123 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 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-12-18 00:22:51,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 00:22:51,123 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:22:51,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:22:51,125 INFO L85 PathProgramCache]: Analyzing trace with hash -585725090, now seen corresponding path program 1 times [2021-12-18 00:22:51,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:22:51,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723086502] [2021-12-18 00:22:51,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:22:51,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:22:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:51,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:22:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:51,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:22:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:51,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 00:22:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:51,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 00:22:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:51,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 00:22:51,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:22:51,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723086502] [2021-12-18 00:22:51,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723086502] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:22:51,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:22:51,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 00:22:51,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095303553] [2021-12-18 00:22:51,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:22:51,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 00:22:51,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:22:51,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 00:22:51,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 00:22:51,318 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-18 00:22:51,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:22:51,429 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2021-12-18 00:22:51,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 00:22:51,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2021-12-18 00:22:51,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:22:51,431 INFO L225 Difference]: With dead ends: 121 [2021-12-18 00:22:51,431 INFO L226 Difference]: Without dead ends: 68 [2021-12-18 00:22:51,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-18 00:22:51,432 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 36 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:22:51,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 132 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:22:51,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-18 00:22:51,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-12-18 00:22:51,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.108695652173913) internal successors, (51), 49 states have internal predecessors, (51), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-12-18 00:22:51,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2021-12-18 00:22:51,437 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 35 [2021-12-18 00:22:51,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:22:51,437 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2021-12-18 00:22:51,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-18 00:22:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2021-12-18 00:22:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-18 00:22:51,438 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:22:51,438 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-12-18 00:22:51,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 00:22:51,438 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:22:51,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:22:51,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1626961765, now seen corresponding path program 1 times [2021-12-18 00:22:51,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:22:51,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198687493] [2021-12-18 00:22:51,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:22:51,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:22:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:51,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:22:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:51,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:22:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:51,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 00:22:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:51,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 00:22:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 00:22:51,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:22:51,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198687493] [2021-12-18 00:22:51,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198687493] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:22:51,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:22:51,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 00:22:51,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144811784] [2021-12-18 00:22:51,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:22:51,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 00:22:51,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:22:51,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 00:22:51,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-18 00:22:51,613 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-18 00:22:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:22:51,869 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2021-12-18 00:22:51,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 00:22:51,870 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2021-12-18 00:22:51,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:22:51,871 INFO L225 Difference]: With dead ends: 82 [2021-12-18 00:22:51,871 INFO L226 Difference]: Without dead ends: 80 [2021-12-18 00:22:51,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-12-18 00:22:51,872 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 49 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:22:51,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 359 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:22:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-18 00:22:51,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2021-12-18 00:22:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 51 states have internal predecessors, (53), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-12-18 00:22:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2021-12-18 00:22:51,877 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 37 [2021-12-18 00:22:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:22:51,877 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2021-12-18 00:22:51,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-18 00:22:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2021-12-18 00:22:51,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-18 00:22:51,878 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:22:51,878 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-12-18 00:22:51,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 00:22:51,878 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:22:51,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:22:51,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1966940953, now seen corresponding path program 1 times [2021-12-18 00:22:51,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:22:51,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059736786] [2021-12-18 00:22:51,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:22:51,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:22:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:51,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:22:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:51,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:22:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:51,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 00:22:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:52,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 00:22:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:52,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 00:22:52,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:22:52,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059736786] [2021-12-18 00:22:52,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059736786] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:22:52,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:22:52,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-18 00:22:52,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369462451] [2021-12-18 00:22:52,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:22:52,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 00:22:52,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:22:52,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 00:22:52,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-18 00:22:52,137 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-18 00:22:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:22:52,514 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2021-12-18 00:22:52,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 00:22:52,514 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2021-12-18 00:22:52,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:22:52,515 INFO L225 Difference]: With dead ends: 81 [2021-12-18 00:22:52,515 INFO L226 Difference]: Without dead ends: 79 [2021-12-18 00:22:52,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2021-12-18 00:22:52,516 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 66 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:22:52,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 424 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:22:52,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-18 00:22:52,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2021-12-18 00:22:52,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 45 states have internal predecessors, (48), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2021-12-18 00:22:52,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2021-12-18 00:22:52,521 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 37 [2021-12-18 00:22:52,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:22:52,522 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2021-12-18 00:22:52,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-18 00:22:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2021-12-18 00:22:52,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-18 00:22:52,523 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:22:52,523 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-12-18 00:22:52,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 00:22:52,523 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:22:52,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:22:52,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1038585084, now seen corresponding path program 1 times [2021-12-18 00:22:52,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:22:52,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995768539] [2021-12-18 00:22:52,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:22:52,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:22:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:52,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:22:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:52,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:22:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:52,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 00:22:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:52,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 00:22:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:52,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-18 00:22:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:52,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:22:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:52,672 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-18 00:22:52,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:22:52,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995768539] [2021-12-18 00:22:52,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995768539] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:22:52,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:22:52,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 00:22:52,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473060237] [2021-12-18 00:22:52,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:22:52,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 00:22:52,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:22:52,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 00:22:52,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-18 00:22:52,675 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-18 00:22:52,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:22:52,794 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2021-12-18 00:22:52,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 00:22:52,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2021-12-18 00:22:52,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:22:52,796 INFO L225 Difference]: With dead ends: 91 [2021-12-18 00:22:52,796 INFO L226 Difference]: Without dead ends: 63 [2021-12-18 00:22:52,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-18 00:22:52,797 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 49 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:22:52,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 108 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:22:52,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-18 00:22:52,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-12-18 00:22:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 45 states have internal predecessors, (47), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2021-12-18 00:22:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2021-12-18 00:22:52,802 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 44 [2021-12-18 00:22:52,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:22:52,802 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2021-12-18 00:22:52,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-18 00:22:52,802 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2021-12-18 00:22:52,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-18 00:22:52,803 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:22:52,803 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-12-18 00:22:52,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 00:22:52,803 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:22:52,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:22:52,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1442491607, now seen corresponding path program 1 times [2021-12-18 00:22:52,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:22:52,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326478025] [2021-12-18 00:22:52,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:22:52,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:22:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:52,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:22:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:52,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:22:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:52,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 00:22:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:52,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 00:22:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:52,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-18 00:22:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:52,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:22:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 00:22:53,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:22:53,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326478025] [2021-12-18 00:22:53,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326478025] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:22:53,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:22:53,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 00:22:53,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992541088] [2021-12-18 00:22:53,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:22:53,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 00:22:53,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:22:53,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 00:22:53,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 00:22:53,005 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-18 00:22:53,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:22:53,131 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2021-12-18 00:22:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 00:22:53,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2021-12-18 00:22:53,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:22:53,132 INFO L225 Difference]: With dead ends: 75 [2021-12-18 00:22:53,132 INFO L226 Difference]: Without dead ends: 73 [2021-12-18 00:22:53,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-18 00:22:53,133 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 42 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:22:53,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 279 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 00:22:53,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-18 00:22:53,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2021-12-18 00:22:53,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 52 states have internal predecessors, (53), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2021-12-18 00:22:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2021-12-18 00:22:53,137 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 46 [2021-12-18 00:22:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:22:53,137 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2021-12-18 00:22:53,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-18 00:22:53,137 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2021-12-18 00:22:53,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-18 00:22:53,138 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:22:53,138 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-18 00:22:53,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 00:22:53,138 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:22:53,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:22:53,138 INFO L85 PathProgramCache]: Analyzing trace with hash 979191153, now seen corresponding path program 1 times [2021-12-18 00:22:53,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:22:53,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994564477] [2021-12-18 00:22:53,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:22:53,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:22:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:53,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:22:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:53,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:22:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:53,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 00:22:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:53,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 00:22:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:53,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-18 00:22:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:53,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:22:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:53,514 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-18 00:22:53,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:22:53,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994564477] [2021-12-18 00:22:53,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994564477] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:22:53,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381033884] [2021-12-18 00:22:53,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:22:53,515 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:22:53,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:22:53,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 00:22:53,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-18 00:22:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:53,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 2424 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-18 00:22:53,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:22:53,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 00:22:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 00:22:54,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:22:54,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381033884] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:22:54,859 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 00:22:54,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2021-12-18 00:22:54,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420786899] [2021-12-18 00:22:54,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 00:22:54,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-18 00:22:54,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:22:54,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-18 00:22:54,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2021-12-18 00:22:54,861 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 22 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2021-12-18 00:22:55,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:22:55,334 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2021-12-18 00:22:55,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-18 00:22:55,334 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 50 [2021-12-18 00:22:55,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:22:55,335 INFO L225 Difference]: With dead ends: 141 [2021-12-18 00:22:55,335 INFO L226 Difference]: Without dead ends: 111 [2021-12-18 00:22:55,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=1015, Unknown=0, NotChecked=0, Total=1190 [2021-12-18 00:22:55,336 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 92 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 311 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 00:22:55,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 502 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 395 Invalid, 0 Unknown, 311 Unchecked, 0.3s Time] [2021-12-18 00:22:55,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-18 00:22:55,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2021-12-18 00:22:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 15 states have call successors, (15), 9 states have call predecessors, (15), 12 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2021-12-18 00:22:55,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2021-12-18 00:22:55,342 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 50 [2021-12-18 00:22:55,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:22:55,343 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2021-12-18 00:22:55,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2021-12-18 00:22:55,343 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2021-12-18 00:22:55,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-18 00:22:55,344 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:22:55,344 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-12-18 00:22:55,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-18 00:22:55,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-18 00:22:55,564 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:22:55,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:22:55,564 INFO L85 PathProgramCache]: Analyzing trace with hash -472877729, now seen corresponding path program 1 times [2021-12-18 00:22:55,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:22:55,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202986414] [2021-12-18 00:22:55,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:22:55,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:22:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:55,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:22:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:55,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:22:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:55,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 00:22:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:55,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 00:22:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:55,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-18 00:22:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:55,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:22:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:55,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-18 00:22:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-18 00:22:55,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:22:55,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202986414] [2021-12-18 00:22:55,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202986414] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:22:55,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:22:55,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 00:22:55,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351509190] [2021-12-18 00:22:55,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:22:55,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 00:22:55,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:22:55,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 00:22:55,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-18 00:22:55,806 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-18 00:22:56,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:22:56,072 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2021-12-18 00:22:56,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 00:22:56,072 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 52 [2021-12-18 00:22:56,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:22:56,073 INFO L225 Difference]: With dead ends: 103 [2021-12-18 00:22:56,073 INFO L226 Difference]: Without dead ends: 101 [2021-12-18 00:22:56,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-12-18 00:22:56,074 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 49 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:22:56,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 174 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:22:56,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-18 00:22:56,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-12-18 00:22:56,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 15 states have call successors, (15), 10 states have call predecessors, (15), 13 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2021-12-18 00:22:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2021-12-18 00:22:56,079 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 52 [2021-12-18 00:22:56,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:22:56,079 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2021-12-18 00:22:56,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-18 00:22:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2021-12-18 00:22:56,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-18 00:22:56,080 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:22:56,080 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-18 00:22:56,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-18 00:22:56,081 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:22:56,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:22:56,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1896049654, now seen corresponding path program 1 times [2021-12-18 00:22:56,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:22:56,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258369619] [2021-12-18 00:22:56,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:22:56,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:22:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:56,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:22:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:56,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:22:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:56,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 00:22:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:56,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 00:22:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:56,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-18 00:22:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:56,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:22:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 00:22:56,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:22:56,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258369619] [2021-12-18 00:22:56,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258369619] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:22:56,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:22:56,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 00:22:56,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388924744] [2021-12-18 00:22:56,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:22:56,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 00:22:56,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:22:56,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 00:22:56,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-18 00:22:56,250 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-18 00:22:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:22:56,484 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2021-12-18 00:22:56,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 00:22:56,485 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2021-12-18 00:22:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:22:56,485 INFO L225 Difference]: With dead ends: 121 [2021-12-18 00:22:56,485 INFO L226 Difference]: Without dead ends: 119 [2021-12-18 00:22:56,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-12-18 00:22:56,486 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 46 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:22:56,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 350 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:22:56,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-18 00:22:56,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2021-12-18 00:22:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.0759493670886076) internal successors, (85), 84 states have internal predecessors, (85), 15 states have call successors, (15), 10 states have call predecessors, (15), 14 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2021-12-18 00:22:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2021-12-18 00:22:56,491 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 52 [2021-12-18 00:22:56,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:22:56,491 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2021-12-18 00:22:56,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-18 00:22:56,491 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2021-12-18 00:22:56,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-18 00:22:56,491 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:22:56,492 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-18 00:22:56,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-18 00:22:56,492 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:22:56,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:22:56,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1697853064, now seen corresponding path program 1 times [2021-12-18 00:22:56,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:22:56,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414573966] [2021-12-18 00:22:56,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:22:56,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:22:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:56,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:22:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:56,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:22:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:56,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 00:22:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:56,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 00:22:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:56,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-18 00:22:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:56,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:22:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:56,729 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-18 00:22:56,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:22:56,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414573966] [2021-12-18 00:22:56,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414573966] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:22:56,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:22:56,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-18 00:22:56,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306525418] [2021-12-18 00:22:56,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:22:56,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 00:22:56,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:22:56,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 00:22:56,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-18 00:22:56,731 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-18 00:22:57,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:22:57,087 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2021-12-18 00:22:57,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 00:22:57,088 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2021-12-18 00:22:57,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:22:57,089 INFO L225 Difference]: With dead ends: 121 [2021-12-18 00:22:57,089 INFO L226 Difference]: Without dead ends: 119 [2021-12-18 00:22:57,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2021-12-18 00:22:57,089 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 63 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:22:57,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 425 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:22:57,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-18 00:22:57,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 97. [2021-12-18 00:22:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 72 states have internal predecessors, (75), 15 states have call successors, (15), 10 states have call predecessors, (15), 12 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2021-12-18 00:22:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2021-12-18 00:22:57,093 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 52 [2021-12-18 00:22:57,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:22:57,094 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2021-12-18 00:22:57,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-12-18 00:22:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2021-12-18 00:22:57,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-18 00:22:57,094 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:22:57,094 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-12-18 00:22:57,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-18 00:22:57,094 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:22:57,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:22:57,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1077690052, now seen corresponding path program 1 times [2021-12-18 00:22:57,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:22:57,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30833709] [2021-12-18 00:22:57,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:22:57,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:22:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:57,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:22:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:57,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:22:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:57,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 00:22:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:57,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 00:22:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:57,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-18 00:22:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:57,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 00:22:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-18 00:22:57,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:22:57,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30833709] [2021-12-18 00:22:57,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30833709] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:22:57,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290258641] [2021-12-18 00:22:57,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:22:57,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:22:57,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:22:57,281 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 00:22:57,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-18 00:22:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:57,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 2441 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 00:22:57,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:22:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-18 00:22:57,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 00:22:57,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290258641] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:22:57,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 00:22:57,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2021-12-18 00:22:57,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371363438] [2021-12-18 00:22:57,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:22:57,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 00:22:57,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:22:57,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 00:22:57,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 00:22:57,729 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-18 00:22:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:22:57,826 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2021-12-18 00:22:57,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 00:22:57,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2021-12-18 00:22:57,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:22:57,827 INFO L225 Difference]: With dead ends: 169 [2021-12-18 00:22:57,827 INFO L226 Difference]: Without dead ends: 99 [2021-12-18 00:22:57,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-12-18 00:22:57,828 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 13 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 00:22:57,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 197 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 17 Unchecked, 0.1s Time] [2021-12-18 00:22:57,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-18 00:22:57,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2021-12-18 00:22:57,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 72 states have internal predecessors, (73), 15 states have call successors, (15), 10 states have call predecessors, (15), 12 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2021-12-18 00:22:57,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2021-12-18 00:22:57,832 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 56 [2021-12-18 00:22:57,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:22:57,832 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2021-12-18 00:22:57,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-12-18 00:22:57,832 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2021-12-18 00:22:57,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-18 00:22:57,832 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:22:57,833 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-12-18 00:22:57,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-18 00:22:58,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-18 00:22:58,048 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:22:58,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:22:58,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1100322306, now seen corresponding path program 1 times [2021-12-18 00:22:58,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:22:58,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571054885] [2021-12-18 00:22:58,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:22:58,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:22:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:58,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:22:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:58,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:22:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:58,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 00:22:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:58,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 00:22:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:58,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-18 00:22:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:58,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 00:22:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-18 00:22:58,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:22:58,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571054885] [2021-12-18 00:22:58,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571054885] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:22:58,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:22:58,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-18 00:22:58,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89250192] [2021-12-18 00:22:58,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:22:58,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 00:22:58,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:22:58,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 00:22:58,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-18 00:22:58,433 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-18 00:22:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:22:58,723 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2021-12-18 00:22:58,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 00:22:58,725 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2021-12-18 00:22:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:22:58,725 INFO L225 Difference]: With dead ends: 127 [2021-12-18 00:22:58,725 INFO L226 Difference]: Without dead ends: 93 [2021-12-18 00:22:58,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-12-18 00:22:58,726 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 77 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:22:58,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 198 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:22:58,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-18 00:22:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2021-12-18 00:22:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 67 states have internal predecessors, (68), 14 states have call successors, (14), 10 states have call predecessors, (14), 11 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2021-12-18 00:22:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2021-12-18 00:22:58,730 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 56 [2021-12-18 00:22:58,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:22:58,730 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2021-12-18 00:22:58,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-18 00:22:58,731 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2021-12-18 00:22:58,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-18 00:22:58,731 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:22:58,731 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-12-18 00:22:58,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-18 00:22:58,731 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:22:58,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:22:58,732 INFO L85 PathProgramCache]: Analyzing trace with hash 237359553, now seen corresponding path program 1 times [2021-12-18 00:22:58,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:22:58,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091358465] [2021-12-18 00:22:58,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:22:58,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:22:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:58,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:22:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:58,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:22:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:58,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 00:22:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:58,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 00:22:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:58,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-18 00:22:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:59,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:22:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:59,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-18 00:22:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:59,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-18 00:22:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:59,022 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-18 00:22:59,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:22:59,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091358465] [2021-12-18 00:22:59,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091358465] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:22:59,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:22:59,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-18 00:22:59,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750529962] [2021-12-18 00:22:59,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:22:59,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 00:22:59,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:22:59,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 00:22:59,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-12-18 00:22:59,024 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-18 00:22:59,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:22:59,390 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2021-12-18 00:22:59,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 00:22:59,390 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 59 [2021-12-18 00:22:59,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:22:59,391 INFO L225 Difference]: With dead ends: 97 [2021-12-18 00:22:59,391 INFO L226 Difference]: Without dead ends: 93 [2021-12-18 00:22:59,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-12-18 00:22:59,392 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 49 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 00:22:59,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 225 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 00:22:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-18 00:22:59,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-12-18 00:22:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2021-12-18 00:22:59,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2021-12-18 00:22:59,396 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 59 [2021-12-18 00:22:59,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:22:59,396 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2021-12-18 00:22:59,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-18 00:22:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2021-12-18 00:22:59,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-18 00:22:59,397 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:22:59,397 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-18 00:22:59,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-18 00:22:59,397 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:22:59,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:22:59,398 INFO L85 PathProgramCache]: Analyzing trace with hash 53156309, now seen corresponding path program 1 times [2021-12-18 00:22:59,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:22:59,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339757801] [2021-12-18 00:22:59,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:22:59,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:22:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:59,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:22:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:59,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:22:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:59,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 00:22:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:59,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 00:22:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:59,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-18 00:22:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:59,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-18 00:22:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:59,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-18 00:22:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:59,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-18 00:22:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:59,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-18 00:22:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:59,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-18 00:22:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:59,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-18 00:22:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:22:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-18 00:22:59,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:22:59,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339757801] [2021-12-18 00:22:59,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339757801] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:22:59,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849515708] [2021-12-18 00:22:59,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:22:59,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:22:59,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 00:22:59,703 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 00:22:59,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-18 00:23:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:23:00,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 2498 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-18 00:23:00,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 00:23:00,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 00:23:00,630 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-18 00:23:00,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 18 [2021-12-18 00:23:00,677 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-18 00:23:00,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 00:23:01,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849515708] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 00:23:01,867 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 00:23:01,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2021-12-18 00:23:01,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940799520] [2021-12-18 00:23:01,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 00:23:01,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-18 00:23:01,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:23:01,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-18 00:23:01,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=367, Unknown=1, NotChecked=0, Total=420 [2021-12-18 00:23:01,868 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 states have internal predecessors, (62), 10 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (19), 9 states have call predecessors, (19), 10 states have call successors, (19) [2021-12-18 00:23:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:23:02,567 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2021-12-18 00:23:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-18 00:23:02,567 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 states have internal predecessors, (62), 10 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (19), 9 states have call predecessors, (19), 10 states have call successors, (19) Word has length 76 [2021-12-18 00:23:02,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:23:02,568 INFO L225 Difference]: With dead ends: 142 [2021-12-18 00:23:02,568 INFO L226 Difference]: Without dead ends: 68 [2021-12-18 00:23:02,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 128 SyntacticMatches, 11 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=149, Invalid=1182, Unknown=1, NotChecked=0, Total=1332 [2021-12-18 00:23:02,569 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 79 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 262 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 00:23:02,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 490 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 556 Invalid, 0 Unknown, 262 Unchecked, 0.4s Time] [2021-12-18 00:23:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-18 00:23:02,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-12-18 00:23:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.0) internal successors, (47), 47 states have internal predecessors, (47), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2021-12-18 00:23:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2021-12-18 00:23:02,572 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 76 [2021-12-18 00:23:02,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:23:02,572 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2021-12-18 00:23:02,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 16 states have internal predecessors, (62), 10 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (19), 9 states have call predecessors, (19), 10 states have call successors, (19) [2021-12-18 00:23:02,573 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2021-12-18 00:23:02,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-18 00:23:02,573 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 00:23:02,573 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-18 00:23:02,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-18 00:23:02,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 00:23:02,783 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 00:23:02,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 00:23:02,784 INFO L85 PathProgramCache]: Analyzing trace with hash 2101457013, now seen corresponding path program 1 times [2021-12-18 00:23:02,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 00:23:02,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776293541] [2021-12-18 00:23:02,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 00:23:02,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 00:23:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:23:03,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 00:23:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:23:03,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-18 00:23:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:23:03,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-18 00:23:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:23:03,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-18 00:23:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:23:03,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-18 00:23:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:23:03,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-18 00:23:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:23:03,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 00:23:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:23:03,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 00:23:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:23:03,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-18 00:23:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:23:03,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-18 00:23:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:23:03,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-18 00:23:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 00:23:03,462 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-18 00:23:03,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 00:23:03,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776293541] [2021-12-18 00:23:03,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776293541] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 00:23:03,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 00:23:03,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-18 00:23:03,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031379838] [2021-12-18 00:23:03,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 00:23:03,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 00:23:03,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 00:23:03,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 00:23:03,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-12-18 00:23:03,465 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-18 00:23:03,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 00:23:03,747 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2021-12-18 00:23:03,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 00:23:03,748 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 88 [2021-12-18 00:23:03,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 00:23:03,748 INFO L225 Difference]: With dead ends: 68 [2021-12-18 00:23:03,748 INFO L226 Difference]: Without dead ends: 0 [2021-12-18 00:23:03,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-12-18 00:23:03,749 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 46 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 00:23:03,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 241 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 00:23:03,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-18 00:23:03,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-18 00:23:03,749 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-12-18 00:23:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-18 00:23:03,749 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2021-12-18 00:23:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 00:23:03,749 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-18 00:23:03,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-18 00:23:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-18 00:23:03,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-18 00:23:03,751 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-18 00:23:03,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-18 00:23:03,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-18 00:23:04,973 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)) [2021-12-18 00:23:04,973 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2021-12-18 00:23:04,973 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2021-12-18 00:23:04,974 INFO L858 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2021-12-18 00:23:04,974 INFO L854 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#length| |old(#length)|)) [2021-12-18 00:23:04,974 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-18 00:23:04,974 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-18 00:23:04,974 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-18 00:23:04,974 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-18 00:23:04,974 INFO L858 garLoopResultBuilder]: For program point L7387(line 7387) no Hoare annotation was computed. [2021-12-18 00:23:04,974 INFO L858 garLoopResultBuilder]: For program point L7387-5(line 7387) no Hoare annotation was computed. [2021-12-18 00:23:04,974 INFO L858 garLoopResultBuilder]: For program point L7387-4(line 7387) no Hoare annotation was computed. [2021-12-18 00:23:04,974 INFO L858 garLoopResultBuilder]: For program point L7387-2(line 7387) no Hoare annotation was computed. [2021-12-18 00:23:04,974 INFO L861 garLoopResultBuilder]: At program point aws_byte_cursor_is_validENTRY(lines 7384 7388) the Hoare annotation is: true [2021-12-18 00:23:04,974 INFO L858 garLoopResultBuilder]: For program point L7387-8(line 7387) no Hoare annotation was computed. [2021-12-18 00:23:04,974 INFO L858 garLoopResultBuilder]: For program point L7387-6(line 7387) no Hoare annotation was computed. [2021-12-18 00:23:04,974 INFO L858 garLoopResultBuilder]: For program point L7387-11(line 7387) no Hoare annotation was computed. [2021-12-18 00:23:04,974 INFO L858 garLoopResultBuilder]: For program point L7387-10(line 7387) no Hoare annotation was computed. [2021-12-18 00:23:04,974 INFO L858 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7384 7388) no Hoare annotation was computed. [2021-12-18 00:23:04,974 INFO L858 garLoopResultBuilder]: For program point L7386(lines 7386 7387) no Hoare annotation was computed. [2021-12-18 00:23:04,974 INFO L858 garLoopResultBuilder]: For program point L7386-2(lines 7386 7387) no Hoare annotation was computed. [2021-12-18 00:23:04,974 INFO L858 garLoopResultBuilder]: For program point aws_byte_cursor_is_validFINAL(lines 7384 7388) no Hoare annotation was computed. [2021-12-18 00:23:04,975 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-12-18 00:23:04,975 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-12-18 00:23:04,975 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-12-18 00:23:04,975 INFO L858 garLoopResultBuilder]: For program point L8256-2(line 8256) no Hoare annotation was computed. [2021-12-18 00:23:04,975 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-18 00:23:04,975 INFO L854 garLoopResultBuilder]: At program point L8256-1(line 8256) the Hoare annotation is: (let ((.cse15 (+ |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 8))) (let ((.cse13 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset|)) (.cse14 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse15))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse1 (<= 1 |ULTIMATE.start_aws_byte_cursor_from_array_#t~ret1076#1|)) (.cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse15) 0)) (.cse3 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base| 0))) (.cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 0)) (.cse5 (= .cse14 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse7 (= .cse13 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0)) (.cse9 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse10 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse11 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#t~ret1076#1| 1)) (.cse12 (not (= .cse14 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 (+ (* 18446744073709551616 (div (* .cse13 (- 1)) 18446744073709551616)) .cse13)) .cse8 .cse9 .cse10 .cse11 .cse12))))) [2021-12-18 00:23:04,975 INFO L854 garLoopResultBuilder]: At program point L8256(line 8256) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 8))) (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse0))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse0) 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 0) (= .cse1 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (not (= .cse1 0))))) [2021-12-18 00:23:04,975 INFO L858 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2021-12-18 00:23:04,976 INFO L858 garLoopResultBuilder]: For program point L8962-1(line 8962) no Hoare annotation was computed. [2021-12-18 00:23:04,976 INFO L858 garLoopResultBuilder]: For program point L8252-1(line 8252) no Hoare annotation was computed. [2021-12-18 00:23:04,976 INFO L858 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2021-12-18 00:23:04,976 INFO L854 garLoopResultBuilder]: At program point L8252(line 8252) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base| 0))) [2021-12-18 00:23:04,976 INFO L854 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse17 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8)) (.cse18 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|))) (let ((.cse0 (<= .cse18 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse1 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse3 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse17) 0)) (.cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse6 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse18)) (.cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0)) (.cse9 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse2 (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0)) (.cse12 (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0)) (.cse10 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0)) (.cse11 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse17)) (.cse14 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base| 0))) (.cse13 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|))) (or (and .cse0 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) .cse1 .cse2 .cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| .cse8) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse15 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| 0)) (.cse16 (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0))) (and .cse0 .cse1 (<= |ULTIMATE.start_assert_bytes_match_~len#1| (* 18446744073709551616 (div |ULTIMATE.start_assert_bytes_match_~len#1| 18446744073709551616))) .cse3 .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|) .cse9 (or (not .cse12) (and .cse15 .cse2) (not .cse16)) (or (not .cse15) (not .cse2) (and .cse12 .cse16)) .cse10 .cse11 (= .cse8 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse14 .cse13))))) [2021-12-18 00:23:04,976 INFO L854 garLoopResultBuilder]: At program point L8969(line 8969) the Hoare annotation is: (let ((.cse14 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (let ((.cse1 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse2 (= (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1211#1|) (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1211#1| 18446744073709551616))))) (.cse3 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse14) 0)) (.cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|)) (.cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0)) (.cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse9 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0)) (.cse10 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse7 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse14)) (.cse11 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse12 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base| 0)))) (or (and (<= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse1 .cse2 .cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse4 .cse5 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse0) .cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| .cse7) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9| Int)) (let ((.cse13 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9|) 0))) (and (<= 0 (+ .cse13 (* 18446744073709551616 (div (* .cse13 (- 1)) 18446744073709551616)))) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|) .cse13)))) .cse2 .cse3 .cse4 .cse5 (= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse6 (<= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|) .cse8 .cse9 .cse10 (= .cse7 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse11 .cse12)))) [2021-12-18 00:23:04,976 INFO L858 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2021-12-18 00:23:04,976 INFO L858 garLoopResultBuilder]: For program point L8969-1(line 8969) no Hoare annotation was computed. [2021-12-18 00:23:04,976 INFO L854 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|)) (.cse1 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (and (<= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1) 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse0) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base| 0)))) [2021-12-18 00:23:04,976 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-18 00:23:04,976 INFO L854 garLoopResultBuilder]: At program point L8257(lines 8251 8258) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0)) (.cse1 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0)) (.cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse7 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base| 0)))) (or (and .cse0 .cse1 (<= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9| Int)) (let ((.cse2 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9|) 0))) (and (<= 0 (+ .cse2 (* 18446744073709551616 (div (* .cse2 (- 1)) 18446744073709551616)))) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| .cse2)))) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (and .cse0 .cse1 .cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse5 .cse6 .cse7 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)))) [2021-12-18 00:23:04,976 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-18 00:23:04,976 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-18 00:23:04,976 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-12-18 00:23:04,976 INFO L858 garLoopResultBuilder]: For program point L8959(lines 8959 8973) no Hoare annotation was computed. [2021-12-18 00:23:04,977 INFO L858 garLoopResultBuilder]: For program point L8970(lines 8970 8972) no Hoare annotation was computed. [2021-12-18 00:23:04,977 INFO L861 garLoopResultBuilder]: At program point L8974(line 8974) the Hoare annotation is: true [2021-12-18 00:23:04,977 INFO L854 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|)) (.cse1 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (and (<= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1) 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse0) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (= |ULTIMATE.start_assert_bytes_match_#t~mem588#1| |ULTIMATE.start_assert_bytes_match_#t~mem589#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base| 0)))) [2021-12-18 00:23:04,977 INFO L861 garLoopResultBuilder]: At program point L8962(line 8962) the Hoare annotation is: true [2021-12-18 00:23:04,977 INFO L854 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|)) (.cse1 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (and (<= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1) 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse0) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base| 0)))) [2021-12-18 00:23:04,977 INFO L854 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse13 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse2 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse13) 0)) (.cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse1 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|)) (.cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0)) (.cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0)) (.cse9 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse6 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse13)) (.cse10 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse11 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base| 0)))) (or (and .cse0 (<= .cse1 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse3 .cse4 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse1) .cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| .cse6) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 (= .cse1 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse5 (<= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|) .cse7 .cse8 .cse9 (= .cse6 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse10 .cse11 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7| Int)) (let ((.cse12 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7|) 0))) (and (<= 0 (+ (* 18446744073709551616 (div (* .cse12 (- 1)) 18446744073709551616)) .cse12)) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|) .cse12)))))))) [2021-12-18 00:23:04,977 INFO L858 garLoopResultBuilder]: For program point L8970-2(lines 8970 8972) no Hoare annotation was computed. [2021-12-18 00:23:04,977 INFO L854 garLoopResultBuilder]: At program point L8968-1(line 8968) the Hoare annotation is: (let ((.cse18 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8)) (.cse19 (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|))) (let ((.cse0 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse1 (<= .cse19 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse3 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse18) 0)) (.cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|)) (.cse6 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse19)) (.cse7 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~ret1210#1| 1)) (.cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0)) (.cse9 (<= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse10 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|)) (.cse15 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse18)) (.cse11 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse12 (<= 1 |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~ret1210#1|)) (.cse13 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0)) (.cse14 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse16 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse17 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base| 0)))) (or (and .cse0 .cse1 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9| Int)) (let ((.cse2 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9|) 0))) (and (<= 0 (+ .cse2 (* 18446744073709551616 (div (* .cse2 (- 1)) 18446744073709551616)))) (= (select (select |#memory_int| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset|) .cse2)))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= .cse15 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse16 .cse17) (and .cse0 .cse1 .cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| .cse15) .cse11 .cse12 .cse13 .cse14 .cse16 .cse17)))) [2021-12-18 00:23:04,977 INFO L858 garLoopResultBuilder]: For program point L8968-2(line 8968) no Hoare annotation was computed. [2021-12-18 00:23:04,977 INFO L858 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2021-12-18 00:23:04,977 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-18 00:23:04,977 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-18 00:23:04,977 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-18 00:23:04,977 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-18 00:23:04,977 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-18 00:23:04,977 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-18 00:23:04,980 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 00:23:04,981 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 00:23:05,001 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-18 00:23:05,002 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-18 00:23:05,002 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-18 00:23:05,003 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-18 00:23:05,003 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-18 00:23:05,003 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-18 00:23:05,003 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-18 00:23:05,011 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-18 00:23:05,012 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-18 00:23:05,012 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-18 00:23:05,012 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-18 00:23:05,012 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-18 00:23:05,012 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-18 00:23:05,013 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-18 00:23:05,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:23:05 BoogieIcfgContainer [2021-12-18 00:23:05,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 00:23:05,015 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 00:23:05,015 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 00:23:05,015 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 00:23:05,016 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:22:49" (3/4) ... [2021-12-18 00:23:05,019 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-18 00:23:05,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-18 00:23:05,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2021-12-18 00:23:05,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-12-18 00:23:05,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-18 00:23:05,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-18 00:23:05,037 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 117 nodes and edges [2021-12-18 00:23:05,038 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2021-12-18 00:23:05,039 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-12-18 00:23:05,040 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-18 00:23:05,040 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-18 00:23:05,041 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-18 00:23:05,042 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-18 00:23:05,042 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-18 00:23:05,065 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((bytes == 0 && !(cur == 0)) && len <= length) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9 : int :: 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] + 18446744073709551616 * (unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] * -1 / 18446744073709551616) && unknown-#res!len-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0])) && length <= len) && cur == 0) && aws_byte_cursor_from_array_#res#1.ptr == 0) && bytes == array) && aws_byte_cursor_from_array_#res#1.ptr == array) && !(bytes == 0)) && unknown-#res!len-unknown == length) || ((((((((((bytes == 0 && !(cur == 0)) && cur == 0) && len == length) && aws_byte_cursor_from_array_#res#1.ptr == 0) && array == 0) && unknown-#res!len-unknown <= length) && bytes == array) && aws_byte_cursor_from_array_#res#1.ptr == array) && !(bytes == 0)) && length <= unknown-#res!len-unknown) [2021-12-18 00:23:05,578 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-18 00:23:05,578 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 00:23:05,579 INFO L158 Benchmark]: Toolchain (without parser) took 19270.16ms. Allocated memory was 104.9MB in the beginning and 444.6MB in the end (delta: 339.7MB). Free memory was 72.1MB in the beginning and 175.5MB in the end (delta: -103.5MB). Peak memory consumption was 314.5MB. Max. memory is 16.1GB. [2021-12-18 00:23:05,579 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory was 66.0MB in the beginning and 66.0MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 00:23:05,579 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2018.02ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 71.7MB in the beginning and 57.1MB in the end (delta: 14.5MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2021-12-18 00:23:05,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 142.41ms. Allocated memory is still 125.8MB. Free memory was 57.1MB in the beginning and 46.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-18 00:23:05,580 INFO L158 Benchmark]: Boogie Preprocessor took 80.51ms. Allocated memory was 125.8MB in the beginning and 180.4MB in the end (delta: 54.5MB). Free memory was 46.6MB in the beginning and 126.7MB in the end (delta: -80.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-18 00:23:05,580 INFO L158 Benchmark]: RCFGBuilder took 624.40ms. Allocated memory is still 180.4MB. Free memory was 126.7MB in the beginning and 121.8MB in the end (delta: 4.9MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2021-12-18 00:23:05,580 INFO L158 Benchmark]: TraceAbstraction took 15837.20ms. Allocated memory was 180.4MB in the beginning and 444.6MB in the end (delta: 264.2MB). Free memory was 121.8MB in the beginning and 212.9MB in the end (delta: -91.1MB). Peak memory consumption was 171.1MB. Max. memory is 16.1GB. [2021-12-18 00:23:05,580 INFO L158 Benchmark]: Witness Printer took 563.43ms. Allocated memory is still 444.6MB. Free memory was 212.9MB in the beginning and 175.5MB in the end (delta: 37.4MB). Peak memory consumption was 117.1MB. Max. memory is 16.1GB. [2021-12-18 00:23:05,581 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory was 66.0MB in the beginning and 66.0MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2018.02ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 71.7MB in the beginning and 57.1MB in the end (delta: 14.5MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 142.41ms. Allocated memory is still 125.8MB. Free memory was 57.1MB in the beginning and 46.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.51ms. Allocated memory was 125.8MB in the beginning and 180.4MB in the end (delta: 54.5MB). Free memory was 46.6MB in the beginning and 126.7MB in the end (delta: -80.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 624.40ms. Allocated memory is still 180.4MB. Free memory was 126.7MB in the beginning and 121.8MB in the end (delta: 4.9MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15837.20ms. Allocated memory was 180.4MB in the beginning and 444.6MB in the end (delta: 264.2MB). Free memory was 121.8MB in the beginning and 212.9MB in the end (delta: -91.1MB). Peak memory consumption was 171.1MB. Max. memory is 16.1GB. * Witness Printer took 563.43ms. Allocated memory is still 444.6MB. Free memory was 212.9MB in the beginning and 175.5MB in the end (delta: 37.4MB). Peak memory consumption was 117.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.8s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1015 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 962 mSDsluCounter, 4873 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 590 IncrementalHoareTripleChecker+Unchecked, 3823 mSDsCounter, 392 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4806 IncrementalHoareTripleChecker+Invalid, 5788 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 392 mSolverCounterUnsat, 1050 mSDtfsCounter, 4806 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 763 GetRequests, 462 SyntacticMatches, 18 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=12, InterpolantAutomatonStates: 209, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 86 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 101 PreInvPairs, 125 NumberOfFragments, 1314 HoareAnnotationTreeSize, 101 FomulaSimplifications, 382 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 2171 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1046 NumberOfCodeBlocks, 1046 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1025 ConstructedInterpolants, 44 QuantifiedInterpolants, 4593 SizeOfPredicates, 38 NumberOfNonLiveVariables, 7363 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 320/362 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 1 specifications checked. All of them hold - InvariantResult [Line: 8974]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8251]: Loop Invariant [2021-12-18 00:23:05,588 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-18 00:23:05,588 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-18 00:23:05,589 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-18 00:23:05,589 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-18 00:23:05,589 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-18 00:23:05,589 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-18 00:23:05,589 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-18 00:23:05,590 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-18 00:23:05,590 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-18 00:23:05,590 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9,QUANTIFIED] [2021-12-18 00:23:05,590 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-18 00:23:05,590 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-18 00:23:05,591 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled [2021-12-18 00:23:05,591 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#1 : { len : int, ptr : $Pointer$ } not handled Derived loop invariant: ((((((((((bytes == 0 && !(cur == 0)) && len <= length) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9 : int :: 0 <= unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] + 18446744073709551616 * (unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0] * -1 / 18446744073709551616) && unknown-#res!len-unknown == unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9][0])) && length <= len) && cur == 0) && aws_byte_cursor_from_array_#res#1.ptr == 0) && bytes == array) && aws_byte_cursor_from_array_#res#1.ptr == array) && !(bytes == 0)) && unknown-#res!len-unknown == length) || ((((((((((bytes == 0 && !(cur == 0)) && cur == 0) && len == length) && aws_byte_cursor_from_array_#res#1.ptr == 0) && array == 0) && unknown-#res!len-unknown <= length) && bytes == array) && aws_byte_cursor_from_array_#res#1.ptr == array) && !(bytes == 0)) && length <= unknown-#res!len-unknown) RESULT: Ultimate proved your program to be correct! [2021-12-18 00:23:05,615 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