./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 ae007674 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-dev-ae00767 [2021-12-28 03:16:34,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 03:16:34,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 03:16:34,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 03:16:34,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 03:16:34,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 03:16:34,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 03:16:34,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 03:16:34,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 03:16:34,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 03:16:34,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 03:16:34,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 03:16:34,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 03:16:34,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 03:16:34,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 03:16:34,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 03:16:34,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 03:16:34,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 03:16:34,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 03:16:34,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 03:16:34,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 03:16:34,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 03:16:34,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 03:16:34,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 03:16:34,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 03:16:34,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 03:16:34,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 03:16:34,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 03:16:34,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 03:16:34,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 03:16:34,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 03:16:34,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 03:16:34,312 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 03:16:34,313 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 03:16:34,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 03:16:34,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 03:16:34,314 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 03:16:34,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 03:16:34,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 03:16:34,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 03:16:34,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 03:16:34,319 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-28 03:16:34,356 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 03:16:34,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 03:16:34,357 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 03:16:34,357 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 03:16:34,358 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 03:16:34,358 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 03:16:34,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 03:16:34,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 03:16:34,359 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 03:16:34,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 03:16:34,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 03:16:34,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 03:16:34,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 03:16:34,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 03:16:34,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 03:16:34,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 03:16:34,361 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 03:16:34,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 03:16:34,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 03:16:34,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 03:16:34,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 03:16:34,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 03:16:34,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 03:16:34,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 03:16:34,362 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 03:16:34,362 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 03:16:34,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 03:16:34,363 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 03:16:34,363 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 03:16:34,363 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 03:16:34,363 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-28 03:16:34,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 03:16:34,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 03:16:34,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 03:16:34,662 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 03:16:34,663 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 03:16:34,664 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-28 03:16:34,723 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842a7e237/19d34b95fcf1459eb4b22c02e39c0f2d/FLAG24d2b558a [2021-12-28 03:16:35,263 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 03:16:35,263 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2021-12-28 03:16:35,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842a7e237/19d34b95fcf1459eb4b22c02e39c0f2d/FLAG24d2b558a [2021-12-28 03:16:35,452 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/842a7e237/19d34b95fcf1459eb4b22c02e39c0f2d [2021-12-28 03:16:35,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 03:16:35,456 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 03:16:35,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 03:16:35,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 03:16:35,460 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 03:16:35,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:16:35" (1/1) ... [2021-12-28 03:16:35,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6773025f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:16:35, skipping insertion in model container [2021-12-28 03:16:35,462 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:16:35" (1/1) ... [2021-12-28 03:16:35,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 03:16:35,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 03:16:35,789 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-28 03:16:35,796 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-28 03:16:36,404 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,405 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,405 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,405 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,406 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,418 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,418 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,419 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,420 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,640 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-28 03:16:36,641 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-28 03:16:36,641 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-28 03:16:36,642 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-28 03:16:36,643 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-28 03:16:36,644 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-28 03:16:36,644 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-28 03:16:36,645 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-28 03:16:36,645 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-28 03:16:36,645 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-28 03:16:36,727 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-28 03:16:36,780 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,780 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,817 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:16:36,842 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 03:16:36,851 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-28 03:16:36,852 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-28 03:16:36,887 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,887 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,888 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,888 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,888 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,892 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,893 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,893 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,894 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,913 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-28 03:16:36,914 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-28 03:16:36,915 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-28 03:16:36,915 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-28 03:16:36,916 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-28 03:16:36,916 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-28 03:16:36,916 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-28 03:16:36,917 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-28 03:16:36,917 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-28 03:16:36,917 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-28 03:16:36,937 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-28 03:16:36,994 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:36,995 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:16:37,019 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:16:37,225 INFO L208 MainTranslator]: Completed translation [2021-12-28 03:16:37,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:16:37 WrapperNode [2021-12-28 03:16:37,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 03:16:37,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 03:16:37,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 03:16:37,227 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 03:16:37,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:16:37" (1/1) ... [2021-12-28 03:16:37,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:16:37" (1/1) ... [2021-12-28 03:16:37,382 INFO L137 Inliner]: procedures = 690, calls = 2609, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 777 [2021-12-28 03:16:37,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 03:16:37,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 03:16:37,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 03:16:37,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 03:16:37,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:16:37" (1/1) ... [2021-12-28 03:16:37,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:16:37" (1/1) ... [2021-12-28 03:16:37,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:16:37" (1/1) ... [2021-12-28 03:16:37,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:16:37" (1/1) ... [2021-12-28 03:16:37,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:16:37" (1/1) ... [2021-12-28 03:16:37,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:16:37" (1/1) ... [2021-12-28 03:16:37,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:16:37" (1/1) ... [2021-12-28 03:16:37,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 03:16:37,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 03:16:37,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 03:16:37,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 03:16:37,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:16:37" (1/1) ... [2021-12-28 03:16:37,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 03:16:37,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:16:37,488 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-28 03:16:37,535 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-28 03:16:37,545 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2021-12-28 03:16:37,546 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2021-12-28 03:16:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 03:16:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 03:16:37,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-28 03:16:37,547 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-28 03:16:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 03:16:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 03:16:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 03:16:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 03:16:37,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 03:16:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-28 03:16:37,549 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-28 03:16:37,549 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-28 03:16:37,549 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-28 03:16:37,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 03:16:37,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 03:16:37,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 03:16:37,550 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-28 03:16:37,551 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-28 03:16:37,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 03:16:37,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 03:16:37,778 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 03:16:37,780 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 03:16:38,414 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 03:16:38,422 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 03:16:38,422 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-28 03:16:38,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:16:38 BoogieIcfgContainer [2021-12-28 03:16:38,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 03:16:38,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 03:16:38,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 03:16:38,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 03:16:38,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:16:35" (1/3) ... [2021-12-28 03:16:38,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b35fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:16:38, skipping insertion in model container [2021-12-28 03:16:38,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:16:37" (2/3) ... [2021-12-28 03:16:38,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b35fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:16:38, skipping insertion in model container [2021-12-28 03:16:38,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:16:38" (3/3) ... [2021-12-28 03:16:38,429 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_array_harness.i [2021-12-28 03:16:38,432 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 03:16:38,432 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-28 03:16:38,466 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 03:16:38,470 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-28 03:16:38,470 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-28 03:16:38,482 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-28 03:16:38,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-28 03:16:38,486 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:16:38,486 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-28 03:16:38,487 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:16:38,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:16:38,490 INFO L85 PathProgramCache]: Analyzing trace with hash -860547149, now seen corresponding path program 1 times [2021-12-28 03:16:38,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:16:38,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441792505] [2021-12-28 03:16:38,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:38,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:16:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:38,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:16:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:38,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:16:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:38,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:16:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:38,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 03:16:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:38,967 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-28 03:16:38,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:16:38,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441792505] [2021-12-28 03:16:38,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441792505] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:16:38,969 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:16:38,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 03:16:38,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889528521] [2021-12-28 03:16:38,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:16:38,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 03:16:38,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:16:39,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 03:16:39,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 03:16:39,008 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-28 03:16:39,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:16:39,161 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2021-12-28 03:16:39,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 03:16:39,163 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-28 03:16:39,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:16:39,168 INFO L225 Difference]: With dead ends: 117 [2021-12-28 03:16:39,168 INFO L226 Difference]: Without dead ends: 54 [2021-12-28 03:16:39,170 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-28 03:16:39,172 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-28 03:16:39,173 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-28 03:16:39,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-12-28 03:16:39,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-12-28 03:16:39,197 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-28 03:16:39,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2021-12-28 03:16:39,203 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 29 [2021-12-28 03:16:39,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:16:39,203 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2021-12-28 03:16:39,204 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-28 03:16:39,204 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2021-12-28 03:16:39,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-28 03:16:39,206 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:16:39,206 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-28 03:16:39,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 03:16:39,207 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:16:39,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:16:39,208 INFO L85 PathProgramCache]: Analyzing trace with hash 617864563, now seen corresponding path program 1 times [2021-12-28 03:16:39,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:16:39,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637241420] [2021-12-28 03:16:39,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:39,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:16:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:39,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:16:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:39,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:16:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:39,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:16:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:39,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 03:16:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:39,447 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-28 03:16:39,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:16:39,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637241420] [2021-12-28 03:16:39,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637241420] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:16:39,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:16:39,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 03:16:39,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936373087] [2021-12-28 03:16:39,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:16:39,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 03:16:39,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:16:39,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 03:16:39,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:16:39,452 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-28 03:16:39,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:16:39,612 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2021-12-28 03:16:39,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 03:16:39,613 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-28 03:16:39,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:16:39,615 INFO L225 Difference]: With dead ends: 99 [2021-12-28 03:16:39,615 INFO L226 Difference]: Without dead ends: 57 [2021-12-28 03:16:39,616 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-28 03:16:39,616 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 45 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:16:39,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 117 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 03:16:39,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-28 03:16:39,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-12-28 03:16:39,623 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-28 03:16:39,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2021-12-28 03:16:39,624 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 29 [2021-12-28 03:16:39,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:16:39,624 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2021-12-28 03:16:39,624 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-28 03:16:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2021-12-28 03:16:39,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-28 03:16:39,625 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:16:39,625 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-28 03:16:39,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 03:16:39,626 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:16:39,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:16:39,626 INFO L85 PathProgramCache]: Analyzing trace with hash 633470424, now seen corresponding path program 1 times [2021-12-28 03:16:39,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:16:39,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634001947] [2021-12-28 03:16:39,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:39,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:16:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:39,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:16:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:39,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:16:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:39,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:16:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:39,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 03:16:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:39,814 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-28 03:16:39,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:16:39,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634001947] [2021-12-28 03:16:39,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634001947] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:16:39,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:16:39,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 03:16:39,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640183629] [2021-12-28 03:16:39,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:16:39,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 03:16:39,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:16:39,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 03:16:39,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-28 03:16:39,817 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-28 03:16:40,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:16:40,050 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2021-12-28 03:16:40,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:16:40,050 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-28 03:16:40,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:16:40,051 INFO L225 Difference]: With dead ends: 69 [2021-12-28 03:16:40,051 INFO L226 Difference]: Without dead ends: 67 [2021-12-28 03:16:40,052 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-28 03:16:40,052 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 47 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:16:40,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 227 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:16:40,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-28 03:16:40,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2021-12-28 03:16:40,058 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-28 03:16:40,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2021-12-28 03:16:40,059 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 31 [2021-12-28 03:16:40,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:16:40,059 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2021-12-28 03:16:40,059 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-28 03:16:40,060 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2021-12-28 03:16:40,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-28 03:16:40,060 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:16:40,061 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-28 03:16:40,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 03:16:40,061 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:16:40,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:16:40,061 INFO L85 PathProgramCache]: Analyzing trace with hash -843890528, now seen corresponding path program 1 times [2021-12-28 03:16:40,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:16:40,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142881294] [2021-12-28 03:16:40,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:40,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:16:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:40,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:16:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:40,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:16:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:40,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:16:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:40,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 03:16:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:40,502 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-28 03:16:40,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:16:40,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142881294] [2021-12-28 03:16:40,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142881294] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:16:40,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:16:40,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-28 03:16:40,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829422846] [2021-12-28 03:16:40,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:16:40,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 03:16:40,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:16:40,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 03:16:40,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-28 03:16:40,506 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-28 03:16:40,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:16:40,854 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2021-12-28 03:16:40,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 03:16:40,854 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-28 03:16:40,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:16:40,855 INFO L225 Difference]: With dead ends: 127 [2021-12-28 03:16:40,855 INFO L226 Difference]: Without dead ends: 78 [2021-12-28 03:16:40,856 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-28 03:16:40,857 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 86 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:16:40,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 217 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:16:40,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-28 03:16:40,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2021-12-28 03:16:40,862 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-28 03:16:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2021-12-28 03:16:40,863 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 35 [2021-12-28 03:16:40,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:16:40,864 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2021-12-28 03:16:40,864 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-28 03:16:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2021-12-28 03:16:40,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-28 03:16:40,865 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:16:40,865 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-28 03:16:40,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 03:16:40,865 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:16:40,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:16:40,866 INFO L85 PathProgramCache]: Analyzing trace with hash -585725090, now seen corresponding path program 1 times [2021-12-28 03:16:40,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:16:40,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652998456] [2021-12-28 03:16:40,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:40,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:16:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:41,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:16:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:41,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:16:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:41,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:16:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:41,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 03:16:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:41,071 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-28 03:16:41,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:16:41,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652998456] [2021-12-28 03:16:41,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652998456] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:16:41,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:16:41,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 03:16:41,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863114837] [2021-12-28 03:16:41,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:16:41,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 03:16:41,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:16:41,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 03:16:41,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 03:16:41,074 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-28 03:16:41,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:16:41,218 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2021-12-28 03:16:41,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 03:16:41,218 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-28 03:16:41,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:16:41,222 INFO L225 Difference]: With dead ends: 121 [2021-12-28 03:16:41,222 INFO L226 Difference]: Without dead ends: 68 [2021-12-28 03:16:41,224 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-28 03:16:41,227 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 36 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:16:41,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 114 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 03:16:41,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-28 03:16:41,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-12-28 03:16:41,238 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-28 03:16:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2021-12-28 03:16:41,239 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 35 [2021-12-28 03:16:41,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:16:41,240 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2021-12-28 03:16:41,240 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-28 03:16:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2021-12-28 03:16:41,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-28 03:16:41,243 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:16:41,243 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-28 03:16:41,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 03:16:41,244 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:16:41,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:16:41,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1626961765, now seen corresponding path program 1 times [2021-12-28 03:16:41,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:16:41,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464338162] [2021-12-28 03:16:41,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:41,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:16:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:41,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:16:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:41,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:16:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:41,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:16:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:41,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 03:16:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:41,496 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-28 03:16:41,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:16:41,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464338162] [2021-12-28 03:16:41,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464338162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:16:41,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:16:41,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-28 03:16:41,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247442852] [2021-12-28 03:16:41,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:16:41,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 03:16:41,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:16:41,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 03:16:41,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-28 03:16:41,498 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-28 03:16:41,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:16:41,794 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2021-12-28 03:16:41,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 03:16:41,795 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-28 03:16:41,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:16:41,796 INFO L225 Difference]: With dead ends: 82 [2021-12-28 03:16:41,796 INFO L226 Difference]: Without dead ends: 80 [2021-12-28 03:16:41,796 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-28 03:16:41,797 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 49 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:16:41,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 279 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:16:41,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-28 03:16:41,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2021-12-28 03:16:41,801 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-28 03:16:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2021-12-28 03:16:41,801 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 37 [2021-12-28 03:16:41,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:16:41,802 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2021-12-28 03:16:41,802 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-28 03:16:41,802 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2021-12-28 03:16:41,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-28 03:16:41,802 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:16:41,802 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-28 03:16:41,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 03:16:41,803 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:16:41,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:16:41,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1966940953, now seen corresponding path program 1 times [2021-12-28 03:16:41,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:16:41,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429619728] [2021-12-28 03:16:41,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:41,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:16:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:41,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:16:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:41,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:16:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:41,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:16:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:41,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 03:16:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:42,032 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-28 03:16:42,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:16:42,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429619728] [2021-12-28 03:16:42,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429619728] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:16:42,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:16:42,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-28 03:16:42,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329634110] [2021-12-28 03:16:42,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:16:42,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 03:16:42,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:16:42,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 03:16:42,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-28 03:16:42,034 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-28 03:16:42,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:16:42,473 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2021-12-28 03:16:42,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 03:16:42,473 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-28 03:16:42,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:16:42,474 INFO L225 Difference]: With dead ends: 81 [2021-12-28 03:16:42,474 INFO L226 Difference]: Without dead ends: 79 [2021-12-28 03:16:42,474 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-28 03:16:42,475 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 66 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 03:16:42,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 320 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 03:16:42,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-28 03:16:42,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2021-12-28 03:16:42,479 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-28 03:16:42,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2021-12-28 03:16:42,479 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 37 [2021-12-28 03:16:42,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:16:42,479 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2021-12-28 03:16:42,479 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-28 03:16:42,480 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2021-12-28 03:16:42,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-28 03:16:42,480 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:16:42,481 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-28 03:16:42,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 03:16:42,481 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:16:42,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:16:42,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1038585084, now seen corresponding path program 1 times [2021-12-28 03:16:42,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:16:42,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583039096] [2021-12-28 03:16:42,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:42,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:16:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:42,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:16:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:42,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:16:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:42,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:16:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:42,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 03:16:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:42,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:16:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:42,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 03:16:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:42,627 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-28 03:16:42,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:16:42,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583039096] [2021-12-28 03:16:42,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583039096] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:16:42,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:16:42,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 03:16:42,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880157302] [2021-12-28 03:16:42,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:16:42,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 03:16:42,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:16:42,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 03:16:42,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:16:42,629 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-28 03:16:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:16:42,741 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2021-12-28 03:16:42,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 03:16:42,741 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-28 03:16:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:16:42,742 INFO L225 Difference]: With dead ends: 91 [2021-12-28 03:16:42,742 INFO L226 Difference]: Without dead ends: 63 [2021-12-28 03:16:42,743 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-28 03:16:42,743 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 49 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:16:42,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 99 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 03:16:42,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-28 03:16:42,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-12-28 03:16:42,746 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-28 03:16:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2021-12-28 03:16:42,747 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 44 [2021-12-28 03:16:42,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:16:42,747 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2021-12-28 03:16:42,747 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-28 03:16:42,748 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2021-12-28 03:16:42,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-28 03:16:42,748 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:16:42,748 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-28 03:16:42,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 03:16:42,749 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:16:42,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:16:42,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1442491607, now seen corresponding path program 1 times [2021-12-28 03:16:42,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:16:42,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881054051] [2021-12-28 03:16:42,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:42,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:16:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:42,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:16:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:42,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:16:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:42,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:16:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:42,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 03:16:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:42,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:16:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:42,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 03:16:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:42,903 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-28 03:16:42,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:16:42,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881054051] [2021-12-28 03:16:42,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881054051] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:16:42,903 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:16:42,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 03:16:42,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193668236] [2021-12-28 03:16:42,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:16:42,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 03:16:42,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:16:42,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 03:16:42,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-28 03:16:42,905 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-28 03:16:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:16:43,057 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2021-12-28 03:16:43,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:16:43,057 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-28 03:16:43,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:16:43,058 INFO L225 Difference]: With dead ends: 75 [2021-12-28 03:16:43,058 INFO L226 Difference]: Without dead ends: 73 [2021-12-28 03:16:43,058 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-28 03:16:43,059 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 42 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:16:43,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 225 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 03:16:43,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-28 03:16:43,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2021-12-28 03:16:43,062 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-28 03:16:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2021-12-28 03:16:43,062 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 46 [2021-12-28 03:16:43,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:16:43,062 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2021-12-28 03:16:43,062 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-28 03:16:43,062 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2021-12-28 03:16:43,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-28 03:16:43,063 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:16:43,063 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-28 03:16:43,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 03:16:43,063 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:16:43,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:16:43,063 INFO L85 PathProgramCache]: Analyzing trace with hash 979191153, now seen corresponding path program 1 times [2021-12-28 03:16:43,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:16:43,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590001191] [2021-12-28 03:16:43,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:43,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:16:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:43,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:16:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:43,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:16:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:43,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:16:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:43,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 03:16:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:43,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:16:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:43,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 03:16:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:43,402 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-28 03:16:43,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:16:43,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590001191] [2021-12-28 03:16:43,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590001191] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:16:43,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404158877] [2021-12-28 03:16:43,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:43,403 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:16:43,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:16:43,410 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-28 03:16:43,438 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-28 03:16:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:43,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 2424 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-28 03:16:43,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:16:43,880 INFO L387 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-28 03:16:44,640 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-28 03:16:44,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 03:16:44,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404158877] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:16:44,993 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 03:16:44,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2021-12-28 03:16:44,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363072452] [2021-12-28 03:16:44,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 03:16:44,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-28 03:16:44,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:16:44,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-28 03:16:44,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2021-12-28 03:16:44,995 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-28 03:16:45,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:16:45,713 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2021-12-28 03:16:45,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-28 03:16:45,714 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-28 03:16:45,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:16:45,715 INFO L225 Difference]: With dead ends: 141 [2021-12-28 03:16:45,715 INFO L226 Difference]: Without dead ends: 111 [2021-12-28 03:16:45,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=175, Invalid=1015, Unknown=0, NotChecked=0, Total=1190 [2021-12-28 03:16:45,716 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 92 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 337 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 03:16:45,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 415 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 456 Invalid, 0 Unknown, 337 Unchecked, 0.4s Time] [2021-12-28 03:16:45,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-28 03:16:45,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2021-12-28 03:16:45,722 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-28 03:16:45,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2021-12-28 03:16:45,723 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 50 [2021-12-28 03:16:45,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:16:45,723 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2021-12-28 03:16:45,723 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-28 03:16:45,723 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2021-12-28 03:16:45,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-28 03:16:45,724 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:16:45,724 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-28 03:16:45,747 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-28 03:16:45,937 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-28 03:16:45,937 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:16:45,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:16:45,937 INFO L85 PathProgramCache]: Analyzing trace with hash -472877729, now seen corresponding path program 1 times [2021-12-28 03:16:45,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:16:45,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413318054] [2021-12-28 03:16:45,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:45,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:16:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:46,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:16:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:46,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:16:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:46,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:16:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:46,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 03:16:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:46,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:16:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:46,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 03:16:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:46,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 03:16:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:46,220 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-28 03:16:46,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:16:46,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413318054] [2021-12-28 03:16:46,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413318054] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:16:46,221 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:16:46,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 03:16:46,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277396196] [2021-12-28 03:16:46,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:16:46,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 03:16:46,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:16:46,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 03:16:46,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-28 03:16:46,223 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-28 03:16:46,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:16:46,520 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2021-12-28 03:16:46,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 03:16:46,521 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-28 03:16:46,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:16:46,521 INFO L225 Difference]: With dead ends: 103 [2021-12-28 03:16:46,521 INFO L226 Difference]: Without dead ends: 101 [2021-12-28 03:16:46,522 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-28 03:16:46,522 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 49 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:16:46,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 158 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:16:46,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-28 03:16:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-12-28 03:16:46,528 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-28 03:16:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2021-12-28 03:16:46,528 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 52 [2021-12-28 03:16:46,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:16:46,529 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2021-12-28 03:16:46,529 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-28 03:16:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2021-12-28 03:16:46,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-28 03:16:46,530 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:16:46,530 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-28 03:16:46,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 03:16:46,530 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:16:46,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:16:46,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1896049654, now seen corresponding path program 1 times [2021-12-28 03:16:46,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:16:46,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953271931] [2021-12-28 03:16:46,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:46,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:16:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:46,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:16:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:46,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:16:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:46,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:16:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:46,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 03:16:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:46,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:16:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:46,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 03:16:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:46,781 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-28 03:16:46,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:16:46,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953271931] [2021-12-28 03:16:46,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953271931] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:16:46,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:16:46,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-28 03:16:46,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560823278] [2021-12-28 03:16:46,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:16:46,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 03:16:46,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:16:46,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 03:16:46,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-28 03:16:46,783 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-28 03:16:47,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:16:47,040 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2021-12-28 03:16:47,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 03:16:47,041 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-28 03:16:47,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:16:47,041 INFO L225 Difference]: With dead ends: 121 [2021-12-28 03:16:47,041 INFO L226 Difference]: Without dead ends: 119 [2021-12-28 03:16:47,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-12-28 03:16:47,042 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 46 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:16:47,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 278 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:16:47,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-28 03:16:47,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2021-12-28 03:16:47,047 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-28 03:16:47,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2021-12-28 03:16:47,048 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 52 [2021-12-28 03:16:47,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:16:47,048 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2021-12-28 03:16:47,048 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-28 03:16:47,048 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2021-12-28 03:16:47,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-28 03:16:47,049 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:16:47,049 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-28 03:16:47,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 03:16:47,049 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:16:47,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:16:47,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1697853064, now seen corresponding path program 1 times [2021-12-28 03:16:47,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:16:47,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340856407] [2021-12-28 03:16:47,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:47,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:16:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:47,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:16:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:47,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:16:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:47,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:16:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:47,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 03:16:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:47,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:16:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:47,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 03:16:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:47,298 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-28 03:16:47,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:16:47,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340856407] [2021-12-28 03:16:47,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340856407] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:16:47,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:16:47,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-28 03:16:47,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714337105] [2021-12-28 03:16:47,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:16:47,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 03:16:47,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:16:47,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 03:16:47,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-28 03:16:47,299 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-28 03:16:47,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:16:47,699 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2021-12-28 03:16:47,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 03:16:47,699 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-28 03:16:47,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:16:47,700 INFO L225 Difference]: With dead ends: 121 [2021-12-28 03:16:47,700 INFO L226 Difference]: Without dead ends: 119 [2021-12-28 03:16:47,701 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-28 03:16:47,701 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 63 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:16:47,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 320 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:16:47,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-28 03:16:47,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 97. [2021-12-28 03:16:47,706 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-28 03:16:47,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2021-12-28 03:16:47,707 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 52 [2021-12-28 03:16:47,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:16:47,707 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2021-12-28 03:16:47,707 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-28 03:16:47,707 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2021-12-28 03:16:47,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-28 03:16:47,708 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:16:47,708 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-28 03:16:47,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 03:16:47,708 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:16:47,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:16:47,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1077690052, now seen corresponding path program 1 times [2021-12-28 03:16:47,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:16:47,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481258202] [2021-12-28 03:16:47,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:47,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:16:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:47,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:16:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:47,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:16:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:47,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:16:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:47,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 03:16:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:47,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:16:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:47,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 03:16:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:47,859 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-28 03:16:47,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:16:47,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481258202] [2021-12-28 03:16:47,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481258202] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:16:47,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136521130] [2021-12-28 03:16:47,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:47,860 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:16:47,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:16:47,876 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-28 03:16:47,895 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-28 03:16:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:48,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 2441 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-28 03:16:48,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:16:48,375 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-28 03:16:48,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:16:48,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136521130] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:16:48,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:16:48,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2021-12-28 03:16:48,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380511513] [2021-12-28 03:16:48,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:16:48,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 03:16:48,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:16:48,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 03:16:48,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-28 03:16:48,377 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-28 03:16:48,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:16:48,496 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2021-12-28 03:16:48,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 03:16:48,497 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-28 03:16:48,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:16:48,498 INFO L225 Difference]: With dead ends: 169 [2021-12-28 03:16:48,498 INFO L226 Difference]: Without dead ends: 99 [2021-12-28 03:16:48,498 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-28 03:16:48,499 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-28 03:16:48,499 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-28 03:16:48,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-28 03:16:48,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2021-12-28 03:16:48,504 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-28 03:16:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2021-12-28 03:16:48,504 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 56 [2021-12-28 03:16:48,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:16:48,504 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2021-12-28 03:16:48,505 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-28 03:16:48,505 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2021-12-28 03:16:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-28 03:16:48,505 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:16:48,505 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-28 03:16:48,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-28 03:16:48,724 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-28 03:16:48,724 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:16:48,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:16:48,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1100322306, now seen corresponding path program 1 times [2021-12-28 03:16:48,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:16:48,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39593355] [2021-12-28 03:16:48,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:48,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:16:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:48,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:16:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:48,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:16:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:48,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:16:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:48,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 03:16:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:48,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:16:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:48,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 03:16:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:49,042 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-28 03:16:49,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:16:49,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39593355] [2021-12-28 03:16:49,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39593355] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:16:49,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:16:49,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 03:16:49,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563248996] [2021-12-28 03:16:49,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:16:49,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 03:16:49,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:16:49,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 03:16:49,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-28 03:16:49,045 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-28 03:16:49,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:16:49,350 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2021-12-28 03:16:49,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 03:16:49,351 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-28 03:16:49,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:16:49,351 INFO L225 Difference]: With dead ends: 127 [2021-12-28 03:16:49,351 INFO L226 Difference]: Without dead ends: 93 [2021-12-28 03:16:49,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-12-28 03:16:49,353 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 77 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:16:49,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 175 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:16:49,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-28 03:16:49,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2021-12-28 03:16:49,357 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-28 03:16:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2021-12-28 03:16:49,358 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 56 [2021-12-28 03:16:49,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:16:49,358 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2021-12-28 03:16:49,358 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-28 03:16:49,358 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2021-12-28 03:16:49,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-28 03:16:49,359 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:16:49,359 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-28 03:16:49,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 03:16:49,359 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:16:49,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:16:49,359 INFO L85 PathProgramCache]: Analyzing trace with hash 237359553, now seen corresponding path program 1 times [2021-12-28 03:16:49,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:16:49,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107471416] [2021-12-28 03:16:49,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:49,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:16:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:49,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:16:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:49,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:16:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:49,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:16:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:49,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 03:16:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:49,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:16:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:49,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 03:16:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:49,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 03:16:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:49,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 03:16:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:49,671 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-28 03:16:49,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:16:49,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107471416] [2021-12-28 03:16:49,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107471416] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:16:49,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:16:49,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-28 03:16:49,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118037952] [2021-12-28 03:16:49,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:16:49,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 03:16:49,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:16:49,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 03:16:49,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-12-28 03:16:49,673 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 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-28 03:16:49,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:16:49,964 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2021-12-28 03:16:49,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 03:16:49,965 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 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-28 03:16:49,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:16:49,966 INFO L225 Difference]: With dead ends: 97 [2021-12-28 03:16:49,966 INFO L226 Difference]: Without dead ends: 93 [2021-12-28 03:16:49,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-12-28 03:16:49,967 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 51 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:16:49,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 180 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:16:49,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-28 03:16:49,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-12-28 03:16:49,973 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-28 03:16:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2021-12-28 03:16:49,973 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 59 [2021-12-28 03:16:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:16:49,974 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2021-12-28 03:16:49,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 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-28 03:16:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2021-12-28 03:16:49,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-28 03:16:49,975 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:16:49,975 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-28 03:16:49,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 03:16:49,975 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:16:49,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:16:49,976 INFO L85 PathProgramCache]: Analyzing trace with hash 53156309, now seen corresponding path program 1 times [2021-12-28 03:16:49,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:16:49,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204996617] [2021-12-28 03:16:49,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:49,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:16:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:50,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:16:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:50,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:16:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:50,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:16:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:50,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 03:16:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:50,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-28 03:16:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:50,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 03:16:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:50,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 03:16:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:50,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 03:16:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:50,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 03:16:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:50,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 03:16:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:50,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 03:16:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:50,245 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-28 03:16:50,245 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:16:50,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204996617] [2021-12-28 03:16:50,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204996617] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:16:50,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519147999] [2021-12-28 03:16:50,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:50,246 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:16:50,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:16:50,247 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-28 03:16:50,248 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-28 03:16:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:50,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 2498 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-28 03:16:50,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:16:50,628 INFO L387 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-28 03:16:51,133 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-28 03:16:51,133 INFO L387 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-28 03:16:51,188 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-28 03:16:51,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 03:16:52,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519147999] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:16:52,425 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 03:16:52,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2021-12-28 03:16:52,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591887382] [2021-12-28 03:16:52,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 03:16:52,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-28 03:16:52,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:16:52,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-28 03:16:52,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=367, Unknown=1, NotChecked=0, Total=420 [2021-12-28 03:16:52,426 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-28 03:16:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:16:53,081 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2021-12-28 03:16:53,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-28 03:16:53,082 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-28 03:16:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:16:53,082 INFO L225 Difference]: With dead ends: 142 [2021-12-28 03:16:53,083 INFO L226 Difference]: Without dead ends: 68 [2021-12-28 03:16:53,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 130 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=149, Invalid=1182, Unknown=1, NotChecked=0, Total=1332 [2021-12-28 03:16:53,084 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 88 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 03:16:53,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 358 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 589 Invalid, 0 Unknown, 223 Unchecked, 0.4s Time] [2021-12-28 03:16:53,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-28 03:16:53,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-12-28 03:16:53,092 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-28 03:16:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2021-12-28 03:16:53,092 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 76 [2021-12-28 03:16:53,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:16:53,094 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2021-12-28 03:16:53,094 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-28 03:16:53,094 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2021-12-28 03:16:53,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-28 03:16:53,094 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:16:53,095 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-28 03:16:53,115 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-28 03:16:53,308 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-28 03:16:53,308 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:16:53,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:16:53,309 INFO L85 PathProgramCache]: Analyzing trace with hash 2101457013, now seen corresponding path program 1 times [2021-12-28 03:16:53,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:16:53,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884937034] [2021-12-28 03:16:53,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:16:53,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:16:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:54,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:16:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:54,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:16:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:54,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:16:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:54,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-28 03:16:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:54,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 03:16:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:54,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-28 03:16:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:54,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 03:16:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:54,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 03:16:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:54,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 03:16:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:54,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 03:16:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:54,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 03:16:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:16:54,177 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-28 03:16:54,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:16:54,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884937034] [2021-12-28 03:16:54,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884937034] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:16:54,178 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:16:54,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 03:16:54,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235836414] [2021-12-28 03:16:54,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:16:54,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 03:16:54,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:16:54,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 03:16:54,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-12-28 03:16:54,180 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-28 03:16:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:16:54,503 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2021-12-28 03:16:54,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 03:16:54,503 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-28 03:16:54,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:16:54,504 INFO L225 Difference]: With dead ends: 68 [2021-12-28 03:16:54,504 INFO L226 Difference]: Without dead ends: 0 [2021-12-28 03:16:54,504 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-28 03:16:54,504 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 46 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:16:54,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 195 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 03:16:54,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-28 03:16:54,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-28 03:16:54,505 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-28 03:16:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-28 03:16:54,505 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2021-12-28 03:16:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:16:54,505 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-28 03:16:54,505 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-28 03:16:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-28 03:16:54,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-28 03:16:54,507 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-28 03:16:54,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-28 03:16:54,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-28 03:16:55,630 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-12-28 03:16:55,631 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2021-12-28 03:16:55,631 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2021-12-28 03:16:55,631 INFO L858 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2021-12-28 03:16:55,631 INFO L854 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-12-28 03:16:55,631 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-28 03:16:55,631 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-28 03:16:55,631 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-28 03:16:55,631 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-28 03:16:55,631 INFO L858 garLoopResultBuilder]: For program point L7387(line 7387) no Hoare annotation was computed. [2021-12-28 03:16:55,631 INFO L858 garLoopResultBuilder]: For program point L7387-5(line 7387) no Hoare annotation was computed. [2021-12-28 03:16:55,631 INFO L858 garLoopResultBuilder]: For program point L7387-4(line 7387) no Hoare annotation was computed. [2021-12-28 03:16:55,631 INFO L858 garLoopResultBuilder]: For program point L7387-2(line 7387) no Hoare annotation was computed. [2021-12-28 03:16:55,631 INFO L861 garLoopResultBuilder]: At program point aws_byte_cursor_is_validENTRY(lines 7384 7388) the Hoare annotation is: true [2021-12-28 03:16:55,631 INFO L858 garLoopResultBuilder]: For program point L7387-8(line 7387) no Hoare annotation was computed. [2021-12-28 03:16:55,631 INFO L858 garLoopResultBuilder]: For program point L7387-6(line 7387) no Hoare annotation was computed. [2021-12-28 03:16:55,631 INFO L858 garLoopResultBuilder]: For program point L7387-11(line 7387) no Hoare annotation was computed. [2021-12-28 03:16:55,631 INFO L858 garLoopResultBuilder]: For program point L7387-10(line 7387) no Hoare annotation was computed. [2021-12-28 03:16:55,631 INFO L858 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7384 7388) no Hoare annotation was computed. [2021-12-28 03:16:55,631 INFO L858 garLoopResultBuilder]: For program point L7386(lines 7386 7387) no Hoare annotation was computed. [2021-12-28 03:16:55,632 INFO L858 garLoopResultBuilder]: For program point L7386-2(lines 7386 7387) no Hoare annotation was computed. [2021-12-28 03:16:55,632 INFO L858 garLoopResultBuilder]: For program point aws_byte_cursor_is_validFINAL(lines 7384 7388) no Hoare annotation was computed. [2021-12-28 03:16:55,632 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-12-28 03:16:55,632 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-12-28 03:16:55,632 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-12-28 03:16:55,632 INFO L858 garLoopResultBuilder]: For program point L8256-2(line 8256) no Hoare annotation was computed. [2021-12-28 03:16:55,632 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-28 03:16:55,632 INFO L854 garLoopResultBuilder]: At program point L8256-1(line 8256) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 8))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (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|))) (.cse1 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#t~ret1076#1| 1)) (.cse9 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse4)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 0)) (.cse5 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|))) (.cse6 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse7 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0))) (.cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse10 (<= 1 |ULTIMATE.start_aws_byte_cursor_from_array_#t~ret1076#1|))) (or (and .cse0 .cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse2 .cse3 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse4) 0) .cse5 .cse6 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse7 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| .cse9) .cse10) (and .cse0 .cse1 (not (= .cse9 0)) .cse2 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) .cse3 .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616))) .cse10)))) [2021-12-28 03:16:55,632 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))) (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| (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_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse0) 0) (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#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_~array~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base|) .cse0)))) [2021-12-28 03:16:55,632 INFO L858 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2021-12-28 03:16:55,632 INFO L858 garLoopResultBuilder]: For program point L8962-1(line 8962) no Hoare annotation was computed. [2021-12-28 03:16:55,632 INFO L858 garLoopResultBuilder]: For program point L8252-1(line 8252) no Hoare annotation was computed. [2021-12-28 03:16:55,632 INFO L858 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2021-12-28 03:16:55,632 INFO L854 garLoopResultBuilder]: At program point L8252(line 8252) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) [2021-12-28 03:16:55,632 INFO L854 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: (let ((.cse12 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8)) (.cse13 (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 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse4 (= |ULTIMATE.start_assert_bytes_match_~b#1.offset| 0)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse3 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|))) (.cse8 (<= .cse13 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse9 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse10 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse13)) (.cse11 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse12)) (.cse7 (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) (or (and .cse0 .cse1 (not (= .cse2 0)) .cse3 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) (let ((.cse5 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| 0)) (.cse6 (= |ULTIMATE.start_assert_bytes_match_~a#1.base| 0))) (or (and .cse4 .cse5 .cse6 .cse7) (and (or (not .cse4) (not .cse5)) (or (not .cse7) (not .cse6))))) .cse8 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (<= |ULTIMATE.start_assert_bytes_match_~len#1| (* 18446744073709551616 (div |ULTIMATE.start_assert_bytes_match_~len#1| 18446744073709551616))) .cse9 .cse10 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) .cse11) (and .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse4 .cse1 .cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse8 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse12) 0) .cse9 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse10 (= |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_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse11 (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#1.base|) (= .cse2 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse7)))) [2021-12-28 03:16:55,633 INFO L854 garLoopResultBuilder]: At program point L8969(line 8969) the Hoare annotation is: (let ((.cse7 (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| 18446744073709551616))) (.cse6 (+ (* 18446744073709551616 (div |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1211#1| 18446744073709551616)) |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse5 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (let ((.cse0 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse10 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse5)) (.cse2 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|))) (.cse3 (<= (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1211#1| .cse7) .cse6)) (.cse8 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse4 (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|)) (.cse9 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse11 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1211#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|))) (or (and .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse1 .cse2 .cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (<= .cse4 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse5) 0) (< .cse6 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~mem1211#1| .cse7 1)) .cse8 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse4) (= |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_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse9 (= .cse10 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse11) (and .cse0 .cse1 (not (= .cse10 0)) .cse2 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) .cse3 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|) (<= |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 ((.cse12 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9|) 0))) (and (= (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) (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse12) 18446744073709551616)) .cse12))))) .cse8 (= .cse4 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) .cse9 .cse11)))) [2021-12-28 03:16:55,633 INFO L858 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2021-12-28 03:16:55,633 INFO L858 garLoopResultBuilder]: For program point L8969-1(line 8969) no Hoare annotation was computed. [2021-12-28 03:16:55,633 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 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |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_assert_bytes_match_~b#1.offset| 0) (= |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) (<= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1) 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#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_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#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_harness_~array~0#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2021-12-28 03:16:55,633 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-28 03:16:55,633 INFO L854 garLoopResultBuilder]: At program point L8257(lines 8251 8258) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse1 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse3 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)))) (or (and .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse1 (exists ((|v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7| Int)) (let ((.cse2 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7|) 0))) (and (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse2) 18446744073709551616)) .cse2)) (= .cse2 |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)))) .cse3) (and (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) .cse3 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#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_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)))) [2021-12-28 03:16:55,633 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-28 03:16:55,633 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-28 03:16:55,633 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-12-28 03:16:55,633 INFO L858 garLoopResultBuilder]: For program point L8959(lines 8959 8973) no Hoare annotation was computed. [2021-12-28 03:16:55,633 INFO L858 garLoopResultBuilder]: For program point L8970(lines 8970 8972) no Hoare annotation was computed. [2021-12-28 03:16:55,633 INFO L861 garLoopResultBuilder]: At program point L8974(line 8974) the Hoare annotation is: true [2021-12-28 03:16:55,633 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 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |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_assert_bytes_match_~b#1.offset| 0) (= |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) (<= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1) 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= |ULTIMATE.start_assert_bytes_match_#t~mem589#1| |ULTIMATE.start_assert_bytes_match_#t~mem588#1|) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#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_harness_~array~0#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2021-12-28 03:16:55,633 INFO L861 garLoopResultBuilder]: At program point L8962(line 8962) the Hoare annotation is: true [2021-12-28 03:16:55,633 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 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |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_assert_bytes_match_~b#1.offset| 0) (= |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) (<= .cse0 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse1) 0) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse0) (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#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_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|) (= |ULTIMATE.start_assert_bytes_match_~b#1.base| |ULTIMATE.start_assert_bytes_match_~a#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_harness_~array~0#1.base|) (= |ULTIMATE.start_assert_bytes_match_~a#1.offset| 0))) [2021-12-28 03:16:55,634 INFO L854 garLoopResultBuilder]: At program point L8968(line 8968) the Hoare annotation is: (let ((.cse8 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8))) (let ((.cse0 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse5 (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 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0))) (.cse7 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse8))) (or (and .cse0 .cse1 (not (= .cse2 0)) (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|)) (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|) (<= |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 ((.cse3 (select (select |#memory_int| |v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_9|) 0))) (and (= (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|) .cse3) (<= 0 (+ (* 18446744073709551616 (div (* (- 1) .cse3) 18446744073709551616)) .cse3))))) .cse4 (= .cse5 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse6 .cse7) (and .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse1 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) (<= .cse5 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse8) 0) .cse4 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .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_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) (= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|) .cse7 (= .cse2 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|))))) [2021-12-28 03:16:55,634 INFO L858 garLoopResultBuilder]: For program point L8970-2(lines 8970 8972) no Hoare annotation was computed. [2021-12-28 03:16:55,634 INFO L854 garLoopResultBuilder]: At program point L8968-1(line 8968) the Hoare annotation is: (let ((.cse13 (+ |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 8)) (.cse4 (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 (<= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse1 (<= 1 |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~ret1210#1|)) (.cse2 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.offset| 0)) (.cse5 (not (= 0 |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|))) (.cse6 (<= .cse4 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse7 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_~len#1|)) (.cse8 (<= |ULTIMATE.start_aws_byte_cursor_from_array_~len#1| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1|)) (.cse9 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_#t~ret1210#1| 1)) (.cse10 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base| 0))) (.cse11 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| .cse4)) (.cse12 (<= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~length~2#1| |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.len|)) (.cse3 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse13))) (or (and .cse0 .cse1 .cse2 (not (= .cse3 0)) (<= .cse4 (* 18446744073709551616 (div .cse4 18446744073709551616))) .cse5 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.base| 0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base| 0)) .cse12) (and .cse0 (= |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.offset| 0) .cse1 .cse2 .cse5 (= |ULTIMATE.start_aws_byte_cursor_from_array_#res#1.ptr.offset| 0) .cse6 .cse7 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_cursor_from_array_harness_~#cur~3#1.base|) .cse13) 0) .cse8 .cse9 .cse10 (= |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.offset| 0) .cse11 (= |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_~array~0#1.base| |ULTIMATE.start_aws_byte_cursor_from_array_~bytes#1.base|) .cse12 (= .cse3 |ULTIMATE.start_aws_byte_cursor_from_array_harness_~array~0#1.base|))))) [2021-12-28 03:16:55,634 INFO L858 garLoopResultBuilder]: For program point L8968-2(line 8968) no Hoare annotation was computed. [2021-12-28 03:16:55,634 INFO L858 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2021-12-28 03:16:55,634 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-28 03:16:55,634 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-28 03:16:55,634 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-28 03:16:55,634 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-28 03:16:55,634 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-28 03:16:55,634 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-28 03:16:55,636 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-28 03:16:55,637 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 03:16:55,645 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-28 03:16:55,646 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_7,QUANTIFIED] [2021-12-28 03:16:55,646 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_7,QUANTIFIED] [2021-12-28 03:16:55,646 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_7,QUANTIFIED] [2021-12-28 03:16:55,646 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-28 03:16:55,647 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-28 03:16:55,649 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-28 03:16:55,649 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_7,QUANTIFIED] [2021-12-28 03:16:55,649 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_7,QUANTIFIED] [2021-12-28 03:16:55,649 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_7,QUANTIFIED] [2021-12-28 03:16:55,649 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-28 03:16:55,649 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-28 03:16:55,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:16:55 BoogieIcfgContainer [2021-12-28 03:16:55,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 03:16:55,651 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 03:16:55,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 03:16:55,651 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 03:16:55,651 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:16:38" (3/4) ... [2021-12-28 03:16:55,653 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-28 03:16:55,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-28 03:16:55,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2021-12-28 03:16:55,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-12-28 03:16:55,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-28 03:16:55,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-28 03:16:55,665 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 117 nodes and edges [2021-12-28 03:16:55,666 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2021-12-28 03:16:55,666 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-12-28 03:16:55,667 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-28 03:16:55,668 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-28 03:16:55,668 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-28 03:16:55,669 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-28 03:16:55,669 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-28 03:16:55,688 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((cur == 0 && length == unknown-#res!len-unknown) && !(0 == bytes)) && !(aws_byte_cursor_from_array_#res#1.ptr == 0)) && length <= len) && len <= length) && !(cur == 0)) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7 : int :: 0 <= 18446744073709551616 * (-1 * unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7][0] / 18446744073709551616) + unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7][0] && unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7][0] == unknown-#res!len-unknown)) && !(array == 0)) || ((((((((((unknown-#res!len-unknown <= length && array == 0) && cur == 0) && aws_byte_cursor_from_array_#res#1.ptr == 0) && !(cur == 0)) && bytes == 0) && aws_byte_cursor_from_array_#res#1.ptr == array) && !(array == 0)) && array == bytes) && len == length) && length <= unknown-#res!len-unknown) [2021-12-28 03:16:56,260 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 03:16:56,260 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 03:16:56,261 INFO L158 Benchmark]: Toolchain (without parser) took 20804.25ms. Allocated memory was 75.5MB in the beginning and 585.1MB in the end (delta: 509.6MB). Free memory was 47.7MB in the beginning and 425.1MB in the end (delta: -377.4MB). Peak memory consumption was 394.6MB. Max. memory is 16.1GB. [2021-12-28 03:16:56,261 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 75.5MB. Free memory was 55.8MB in the beginning and 55.8MB in the end (delta: 43.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 03:16:56,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1768.13ms. Allocated memory was 75.5MB in the beginning and 132.1MB in the end (delta: 56.6MB). Free memory was 47.5MB in the beginning and 71.5MB in the end (delta: -23.9MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2021-12-28 03:16:56,261 INFO L158 Benchmark]: Boogie Procedure Inliner took 156.34ms. Allocated memory is still 132.1MB. Free memory was 71.5MB in the beginning and 60.2MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-28 03:16:56,261 INFO L158 Benchmark]: Boogie Preprocessor took 72.07ms. Allocated memory is still 132.1MB. Free memory was 60.2MB in the beginning and 54.5MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-28 03:16:56,262 INFO L158 Benchmark]: RCFGBuilder took 967.21ms. Allocated memory is still 132.1MB. Free memory was 54.5MB in the beginning and 62.6MB in the end (delta: -8.1MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2021-12-28 03:16:56,262 INFO L158 Benchmark]: TraceAbstraction took 17226.01ms. Allocated memory was 132.1MB in the beginning and 486.5MB in the end (delta: 354.4MB). Free memory was 62.1MB in the beginning and 227.5MB in the end (delta: -165.4MB). Peak memory consumption was 190.1MB. Max. memory is 16.1GB. [2021-12-28 03:16:56,262 INFO L158 Benchmark]: Witness Printer took 609.27ms. Allocated memory was 486.5MB in the beginning and 585.1MB in the end (delta: 98.6MB). Free memory was 227.5MB in the beginning and 425.1MB in the end (delta: -197.6MB). Peak memory consumption was 163.1MB. Max. memory is 16.1GB. [2021-12-28 03:16:56,263 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.15ms. Allocated memory is still 75.5MB. Free memory was 55.8MB in the beginning and 55.8MB in the end (delta: 43.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1768.13ms. Allocated memory was 75.5MB in the beginning and 132.1MB in the end (delta: 56.6MB). Free memory was 47.5MB in the beginning and 71.5MB in the end (delta: -23.9MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 156.34ms. Allocated memory is still 132.1MB. Free memory was 71.5MB in the beginning and 60.2MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.07ms. Allocated memory is still 132.1MB. Free memory was 60.2MB in the beginning and 54.5MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 967.21ms. Allocated memory is still 132.1MB. Free memory was 54.5MB in the beginning and 62.6MB in the end (delta: -8.1MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17226.01ms. Allocated memory was 132.1MB in the beginning and 486.5MB in the end (delta: 354.4MB). Free memory was 62.1MB in the beginning and 227.5MB in the end (delta: -165.4MB). Peak memory consumption was 190.1MB. Max. memory is 16.1GB. * Witness Printer took 609.27ms. Allocated memory was 486.5MB in the beginning and 585.1MB in the end (delta: 98.6MB). Free memory was 227.5MB in the beginning and 425.1MB in the end (delta: -197.6MB). Peak memory consumption was 163.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList aws_byte_cursor_from_array_#res#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_7,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_7,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_7,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7,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_7,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_7,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 * 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: 17.2s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1026 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 973 mSDsluCounter, 3963 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 577 IncrementalHoareTripleChecker+Unchecked, 2913 mSDsCounter, 388 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5528 IncrementalHoareTripleChecker+Invalid, 6493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 388 mSolverCounterUnsat, 1050 mSDtfsCounter, 5528 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 762 GetRequests, 465 SyntacticMatches, 16 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=12, InterpolantAutomatonStates: 208, 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, 1228 HoareAnnotationTreeSize, 101 FomulaSimplifications, 186 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 2092 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 1046 NumberOfCodeBlocks, 1046 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1025 ConstructedInterpolants, 44 QuantifiedInterpolants, 4565 SizeOfPredicates, 37 NumberOfNonLiveVariables, 7363 ConjunctsInSsa, 91 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-28 03:16:56,269 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-28 03:16:56,269 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_7,QUANTIFIED] [2021-12-28 03:16:56,269 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_7,QUANTIFIED] [2021-12-28 03:16:56,269 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_7,QUANTIFIED] [2021-12-28 03:16:56,270 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-28 03:16:56,270 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-28 03:16:56,270 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-28 03:16:56,270 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_7,QUANTIFIED] [2021-12-28 03:16:56,271 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_7,QUANTIFIED] [2021-12-28 03:16:56,271 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_7,QUANTIFIED] [2021-12-28 03:16:56,271 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-28 03:16:56,271 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: ((((((((cur == 0 && length == unknown-#res!len-unknown) && !(0 == bytes)) && !(aws_byte_cursor_from_array_#res#1.ptr == 0)) && length <= len) && len <= length) && !(cur == 0)) && (\exists v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7 : int :: 0 <= 18446744073709551616 * (-1 * unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7][0] / 18446744073709551616) + unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7][0] && unknown-#memory_int-unknown[v_ULTIMATE.start_aws_byte_cursor_from_array_~#cur~2#1.base_7][0] == unknown-#res!len-unknown)) && !(array == 0)) || ((((((((((unknown-#res!len-unknown <= length && array == 0) && cur == 0) && aws_byte_cursor_from_array_#res#1.ptr == 0) && !(cur == 0)) && bytes == 0) && aws_byte_cursor_from_array_#res#1.ptr == array) && !(array == 0)) && array == bytes) && len == length) && length <= unknown-#res!len-unknown) RESULT: Ultimate proved your program to be correct! [2021-12-28 03:16:56,300 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